• 한국산업융합학회 논문집
• /
• 제24권6_2호
• /
• pp.891-897
• /
• 2021

In this paper, we propose a destination optimal route algorithm for providing route finding service for the transportation handicapped by using the multi-criteria decision-making technique and the modified A-STAR optimal route search algorithm. This is a method to set the route to the destination centering on safety by replacing the distance cost of the existing A-STAR optimal route search algorithm with the safety cost calculated through AHP/TOPSIS analysis. To this end, 10 factors such as road damage, curb, and road hole were first classified as poor road factors that hinder road driving, and then pairwise comparison of AHP was analyzed and then defined as the weight of TOPSIS. Afterwards, the degree of driving safety was quantified for a certain road section in Busan through TOPSIS analysis, and the development of an optimal route search algorithm for the transportation handicapped that replaces the distance cost with safety in the finally modified A-STAR optimal route algorithm was completed.

• Journal of Korean Neurosurgical Society
• /
• 제59권4호
• /
• pp.327-333
• /
• 2016

Adult spinal deformity (ASD) is one of the most challenging spinal disorders associated with broad range of clinical and radiological presentation. Correct selection of fusion levels in surgical planning for the management of adult spinal deformity is a complex task. Several classification systems and algorithms exist to assist surgeons in determining the appropriate levels to be instrumented. In this study, we describe our new simple decision making algorithm and selection of fusion level for ASD surgery in terms of adult idiopathic idiopathic scoliosis vs. degenerative scoliosis.

• Journal of the Korean Data and Information Science Society
• /
• 제28권6호
• /
• pp.1481-1500
• /
• 2017

본 연구는 우리나라 주식시장을 대상으로 회계 정보 기반 포트폴리오 투자전략의 안정성과 우수성을 확인하였다. 포트폴리오를 구성 하는 과정에서 재무비율의 다양한 조합을 활용하여 기대수익률이 높고, 투자 위험이 낮은 종목군을 선정하고 그 성과를 측정하였다. 또한 회계 정보 기반 유전자 알고리즘 최적화 아이디어를 제시하여 투자성과를 높이고자 했다. 본 연구의 결과로 회계 정보를 활용한 포트폴리오 구성 전략이 투자 의사결정에 유효하며, 이를 통하여 높은 투자성과를 얻을 수 있음을 확인했다. 또한 유전자 알고리즘을 활용한 포트폴리오 투자전략이 실무적으로 투자 의사결정에 유용하게 활용될 수 있음을 검증하였다.

• 산업경영시스템학회지
• /
• 제20권43호
• /
• pp.321-331
• /
• 1997

Measurement of attributes is often highly subjective and imprecise, yet most MADM methods lack provisions for handling imprecise data. Frequently, decision makers must establish a ranking within a finite set of alternatives with respect to multiple attributes which have varying degrees of importance. The problem is more complex if the evaluations of alternatives according to each attribute are not expressed in precise numbers, but rather in fuzzy numbers. Analysis must allow for lack of precision and partial truth. The advantages of a fuzzy approach for MADM are that a decision maker can obtain efficient solutions all at once without trial and error, and that this approach provides better support for judging the interactive improvement of solutions in comparison with o decision making method. The algorithm used in this study is based on the concepts of vague set theory. Linguistic variables and vague values are used to facilitate a decision maker's subjective assessment about attribute weightings and the appropriateness of alternative versus selection attributes in order to obtain final scores which are called vague appropriateness indices. A numerical example is presented to show the practical applicability of this approach.

• 한국지능정보시스템학회:학술대회논문집
• /
• 한국지능정보시스템학회 2000년도 추계정기학술대회:지능형기술과 CRM
• /
• pp.375-383
• /
• 2000

This research suggests an interactive methodology fur multiple objective linear programming problems to help the group select a compromising solution in the World Wide Web environment. Our methodology lessens the burden of group decision makers, which is one of necessary conditions of the web environment. Only the partial weak order of variables and objectives from the group decision makers are enough for searching the best compromising solution. For such a purpose, we expand the Dror and Gass algorithm to the group decision context. And we suggest the system architecture of a web-based GDSS fur the implementation of our methodology.

• International journal of advanced smart convergence
• /
• 제6권3호
• /
• pp.22-28
• /
• 2017

With the recent development of technologies to manage vast amounts of data, data mining technology has had a major impact on all industries.. Data mining is the process of discovering useful correlations hidden in data, extracting executable information for the future, and using it for decision making. In other words, it is a core process of Knowledge Discovery in data base(KDD) that transforms input data and derives useful information. It extracts information that we did not know until now from a large data base. In the decision tree, c4.5 algorithm was used. In addition, the C4.5 algorithm was used in the decision tree to analyze the difference between frequency and mortality in the region. In this paper, the frequency and mortality of percutaneous coronary intervention for patients with heart disease were divided into regions.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
• /
• pp.530-532
• /
• 2006

In this paper, we propose stable walking algorithm using ZMP for the biped robot in the slope-way. At first, we define discrete state variables that classified stable area and unstable area by center of mass from ZMP during slope-way walking. For the stable walking gait, the discrete state controller for determining the high-level and low-level decision making are designed. The high-level decision making is composed of the discrete state variables; left foot support phase, right foot support phase, flat-way, and slope-way. Then the continuous state controller is implemented for the low-level decision making using ZMP.

• 전기학회논문지
• /
• 제67권12호
• /
• pp.1657-1664
• /
• 2018

This paper proposes a decision making scheme for choosing the best move at each state of game in order to implement an artificial intelligence othello game player. The proposed decision making scheme predicts the various possible states of the game when the game has progressed from the current state, evaluates the degree of possibility of winning or losing the game at the states, and searches the best move based on the evaluation. In this paper, we generate learning data by decomposing the records of professional players' real game into states, matching and accumulating winning points to the states, and using the Artificial Neural Network that learned them, we evaluated the value of each predicted state and applied the Minimax search to determine the best move. We implemented an artificial intelligence player of the Othello game by applying the proposed scheme and evaluated the performance of the game player through games with three different artificial intelligence players.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.380-383
• /
• 2003

In this paper, we propose a fuzzy group decision making method for multiple decision maker-multiple objective programming problems to obtain the agreeable solution. In the proposed method, considering the vague nature of human subjective judgement it is assumed that each of multiple decision makers has a fuzzy goal for each of his/her own objective functions. After eliciting the membership functions from the decision makers for their fuzzy goals, total M-Pareto optimal solution concept is defined in membership spaces in order to deal with multiple decision maker-multiple objective programming problems. For generating a candidate of the agreeable solution which is total M-Pareto optimal, the extended weighted minimax problem is formulated and solved for some weighting vector which is specified by the decision makers in their subjective manner, Given the total M-Pareto optimal solution, each of the derision makers must either be satisfied with the current values of the membership functions, or update his/her weighting vector, However, in general, it seems to be very difficult to find the agreeable solution with which all of the decision makers are satisfied perfectly because of the conflicts between their membership functions. In the proposed method, each of the decision makers is requested to estimate the degree of satisfaction for the candidate of the agreeable solution. Using the estimated values or satisfaction of each of the decision makers, the core concept is desnfied, which is a set of undominated candidates. The interactive algorithm is developed to obtain the agreeable solution which satisfies core conditions.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제25권4호
• /
• pp.149-161
• /
• 2021

This study proposes a methodology for mission/path planning of an unmanned aerial vehicle (UAV) using an artificial potential field with the Markov Decision Process (MDP). The planning problem is formulated as an MDP. A low-resolution solution of the MDP is obtained and used to define an artificial potential field, which provides a continuous UAV mission plan. A numerical case study is conducted to demonstrate the validity of the proposed technique.