• Journal of Navigation and Port Research
• /
• v.30 no.9
• /
• pp.773-777
• /
• 2006

Significant increase of container flows in the marine terminals requires more efficient port equipments such as logistic and transfer systems. This paper presents collision avoidance and routing approach based on dynamic programming (DP) algorithm for a linear motor based shuttle car which is considered as a new transfer system in the port terminals. Most of routing problems are focused on automatic guided vehicle (AGV) systems, but its solutions are hardly utilized for LM based shuttle cars since both are mechanically different. Our proposed DP is implemented for real-time searching of an optimal path for each shuttle car in the Agile port terminal located at California in USA.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.184-186
• /
• 2006

We propose a new method for shortest path planning of mobile robots. The topological information of the graph is obtained by thinning method to generate the collision-free path of robot. And the travelling path is determined through hierarchical planning stages. The first stage generates an initial path by use of Dijkstra's algorithm. The second stage then generates the final path by use of dynamic programming (DP). The DP adjusts the intial path to reduce the total travelling distance of robot. Simulation results are presented to verify the performance of the proposed method.

• Journal of the military operations research society of Korea
• /
• v.31 no.1
• /
• pp.107-121
• /
• 2005

In this study, a new fictitious play (FP) procedure is presented to solve two-person zero-sum (TPZS) Blotto games. The FP solution procedure solves TPZS games by assuming that the two players take turns selecting optimal responses to the opponent's strategy observed so far. It is known that FP converges to an optimal solution, and it may be the only realistic approach to solve large games. The algorithm uses dynamic programming (DP) to solve FP subproblems. Efficiency is obtained by limiting the growth of the DP state space. Blotto games are frequently used to solve simple missile defense problems. While it may be unlikely that the models presented in this paper can be used directly to solve realistic offense and defense problems, it is hoped that they will provide insight into the basic structure of optimal and near-optimal solutions to these important, large games, and provide a foundation for solution of more realistic, and more complex, problem

• Proceedings of the KSME Conference
• /
• 2000.04b
• /
• pp.586-592
• /
• 2000

터보머신 태부에 존재하는 정익 - 동익의 상호작용 유동현상을 수치모사 하는 코드를 병렬화 하였다 정익 - 동익의 상호작용을 해석하는 데에 편리하도륵 Multi-Block Grid System을 도입하여 계산영역을 형성하였고, 동익의 움직임으로 인해 발생하는 Sliding Interface부분은 Patched 알고리즘을 적용하여 해석하였다. 정익과 동익의 수를 1대 1로 단순화시켜 수치모사한 결과와 정익과 동익의 수를 실제 조건과 더 비슷하게 설정한 3대 4의 비율로 맞추어 수치모사한 결과를 비교하였다. 또한, 병렬컴퓨팅으로 인해 단축된 계산시간을 다른 연구에서의 계산시간들과 서로 비교하였다. 2차원 비정상 압축성 Navier-Stokes 방정식이 이용되었고, 난류모델링에는 K-w SST 모델링이 적응되었다. Roe의 FDS 기법을 사용하여 플럭스를 계산하였고, MUSCL 기법을 적용하여 3차의 공간정확도를 갖도록 하였다. 시간적분에는 이보성의 DP-SGS를 사용하였다. 해석결과의 분석에는 Time-averaged pressure distribution과 Pressure amplitude distribution 데이터를 사용했다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2008.04a
• /
• pp.13-16
• /
• 2008

Dynamic Programming (DP)을 이용한 서열 비교 알고리즘은 DNA, RNA, 단백질 서열의 비교와 프로그래밍 소스 코드 유사도를 측정하는 곳 등에 널리 사용되어 왔다. 이 알고리즘은 DP를 이용하여 행렬을 구성한 후, 행렬의 가장 마지막 생성 값을 이용해 두 서열의 유사도를 측정하는 방법이다. 그러나 이 알고리즘에서 사용하는 마지막 생성 값은 비교 서열이 길이에 따라 크게 좌우되기 때문에 다양한 서열들의 유사도를 알아내기에는 부적합하다. 본 논문에서는 서열의 길이에 무관한 유사도 측정 (S2) 알고리즘을 제안한다. 제안된 알고리즘을 이용하면 비교 서열의 길이에 영향을 받지 않고 정당한 서열 비교를 할 수 있다. 제안된 알고리즘의 검증을 위해 본 논문에서는 프로그램 소스 코드의 유사도 측정을 수행한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.311-311
• /
• 2000

We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

• Journal of international Conference on Electrical Machines and Systems
• /
• v.1 no.1
• /
• pp.114-120
• /
• 2012

Eco-driving technique for electric vehicles (EVs) is investigated in this paper. Many findings on EVs have been reported; however, they did not deal with eco-driving from the viewpoint of theoretical study. The authors have developed an energy-saving driving technique - the so-called "eco-driving" technique based on dynamic programming (DP). Optimal speed profile of an EV, which minimizes the amount of total energy consumption, was determined under fixed origin and destination, running time, and track conditions. DP algorithm can deal with such complicated conditions and can also derive the optimal solution. Using the proposed method, simulations were run for some cases. In particular, the author ran simulations for the case of a gradient road with a traffic signal. The optimization model was solved with MATLAB.

• Journal of Korean Institute of Industrial Engineers
• /
• v.25 no.4
• /
• pp.466-475
• /
• 1999

A backward Dynamic Programming(DP) model for the optimal facility replacement decision problem during a finite planning horizon is presented. Multiple alternative challengers to a current defender are considered. All facilities are assumed to have finite service lives. The objective of the DP model is to maximize the profit over a finite planning horizon. As for the cost elements, purchasing cost, maintenance costs and repair costs as well as salvage value are considered. The time to failure is assumed to follow a weibull distribution and the maximum likelihood estimation of Weibull parameters is used to evaluate the expected cost of repair. To evaluate the revenue, the rate of operation during a specified period is employed. The cash flow component of each challenger can vary independently according to the time of occurrence and the item can be extended easily. The effects of inflation and the time value of money are considered. The algorithm is illustrated with a numerical example. A MATLAB implementation of the model is used to identify the optimal sequence and timing of the replacement.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.4726-4731
• /
• 2011

This paper proposed the algorithm to select optimal grinding condition for plunge grinding in the batch production unit. In order to apply to the proposed algorithm, the state variable for plunge grinding process was defined and the optimal grinding condition for each cycle in batch production was decided by genetic algorithm. Based on the optimized grinding condition in each cycle, the optimal grinding condition for whole batch production was selected by dynamic programming. The proposed algorithm was evaluated by computer simulation.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2000.04a
• /
• pp.126-132
• /
• 2000

This paper presents a facial expression recognition based on Gabor wavelets that uses a fuzzy C-means(FCM) clustering algorithm and neural network. Features of facial expressions are extracted to two steps. In the first step, Gabor wavelet representation can provide edges extraction of major face components using the average value of the image's 2-D Gabor wavelet coefficient histogram. In the next step, we extract sparse features of facial expressions from the extracted edge information using FCM clustering algorithm. The result of facial expression recognition is compared with dimensional values of internal stated derived from semantic ratings of words related to emotion. The dimensional model can recognize not only six facial expressions related to Ekman's basic emotions, but also expressions of various internal states.