• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.312-313
• /
• 2007

본 논문은 자율주행로봇의 경로계획문제를 효율적으로 해결하기 위한 방법을 제안한다. 제안된 방법은 초기경로 생성과정과 초기경로를 개선하는 두 단계의 과정으로 구성된다. 효율적인 경로를 생성하기 위해서 최적화 문제를 해결하는 방법으로 잘 알려진 Dijkstra 알고리즘과 동적계획법(Dynamic Plogramming)을 적용한다. 그리고 제안된 방법의 효율성은 기존에 사용되는 경로계획 방법들과의 비교 시뮬레이션을 통해서 확인한다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.11 no.4
• /
• pp.91-102
• /
• 1991

Traditionally, a dynamic programming(DP) technique has been used to the multireservoir control system. The algorithm has inherent problem to increase computational requirements exponentially due to discretization of variables and expanding the dimension of the system. To solve this problem, this paper describes transforming the optimal control system into a quadratic programming(QP), using Laguerre polynomials(LP) and its properties. The objective function of the proposed QP is independent of time variable. The solution of the QP is obtained by nonlinear programming(NLP) using augmented Lagrangian multiplier method. The numerical experiment shows that the water level of reservoirs is higher than Lee's and the evaluated benefit value is about the same as other researcher's.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.18
• /
• pp.7-15
• /
• 1988

This study is concerned with selecting mutually dependent quality improvement alternatives with resource constraints. These qualify improvement alternatives art different fro the tradition at alternatives which are independent from each other. In other words, selection of any improvement alternative requires other related specific improvement. Also the overall product quality in a multi stage manufacturing process is characterized by a complex multiplication method rather than a simple addition method which dose not allow to solve a linear knapsack problem despite its popularity in the traditional study. This study suggests a non-linear integer programming model for selecting mutually dependent quality improvement alternatives in multi-stage manufacturing process. In order to apply the model to selecting alternatives. This study also suggests a heuristic mode1 based on a dynamic programming model which is more practical than the non-linear integer programming model. The logic of the heuristic model enables 1) to estimate improvement effectiveness values on all improvement alternatives specifically defined for this study. 2) to arrange the effectiveness values in a descending order, and 3) to select the best one among the alternatives based on their forward and backward linkage relationships. This process repeats to selects other best alternatives within the resource constraints. This process is presented in a Computer programming in Appendix A. Alsc a numerical example of model application is presented in Chapter 4.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.6
• /
• pp.677-682
• /
• 2006

Multi-domain design is difficult because such systems tend to be complex and include a mixtures of electrical, mechanical, hydraulic, and thermal components. To design an optimal system, unified and automated procedure with efficient search technique is required. This paper introduces design method for multi-domain system to obtain design solutions automatically, combining bond graph which is domain independent modeling tool and genetic programming which is well recognized as a powerful tool for open-ended search. The suggested design methodology has been applied for design of electric fitter, electric printer drive, and and pump system as a proof of concept for this approach.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.4
• /
• pp.287-295
• /
• 2022

As low altitude long-range artillery threat has been strengthened, the development of anti-artillery interception system to protect assets against its attacks will be kicked off. We view the defense of long-range artillery attacks as a typical dynamic weapon target assignment (DWTA) problem. DWTA is a sequential decision process in which decision making under future uncertain attacks affects the subsequent decision processes and its results. These are typical characteristics of Markov decision process (MDP) model. We formulate the problem as a MDP model to examine the assignment policy for the defender. The proximity of the capital of South Korea to North Korea border limits the computation time for its solution to a few second. Within the allowed time interval, it is impossible to compute the exact optimal solution. We apply approximate dynamic programming (ADP) approach to check if ADP approach solve the MDP model within processing time limit. We employ Shoot-Shoot-Look policy as a baseline strategy and compare it with ADP approach for three scenarios. Simulation results show that ADP approach provide better solution than the baseline strategy.

• Journal of the Chungcheong Mathematical Society
• /
• v.27 no.2
• /
• pp.219-225
• /
• 2014

I use the dynamic programming approach to study the optimal consumption and investment problem with regime-switching and constant labor income. I derive the optimal solutions in closed-form with constant absolute risk aversion (CARA) utility and constant disutility.

• Proceedings of the Korea Water Resources Association Conference
• /
• 1994.02a
• /
• pp.331-336
• /
• 1994

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.473-476
• /
• 1996

In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.377-378
• /
• 2008

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1987.11a
• /
• pp.82-85
• /
• 1987

Preliminary results of using the LPC parameter for text-independent speaker identification problem are presented. The idetification process includes log likelihood ratio for distance measure and dynamic programming for time normalization. To generate the data base for experiments, ten times. Experimental results show 99.4% of identification accuracy, incorrect identification were made when the speaker uses a dialect.