• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.626-631
• /
• 2005

This paper presents the target object search algorithm under dynamic programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved if the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using a real robot.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2007.12a
• /
• pp.226-227
• /
• 2007

Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using random access sequence dynamic programming (RAS DP). The proposed RAS DP is accomplished online for determining optimal paths for each shuttle car.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.8C
• /
• pp.680-688
• /
• 2010

In this paper, we present a dynamic programming(DP)-based stereo matching method using image segmentation algorithm. DP has been a classical and popular optimization method for various computer vision problems including stereo matching. However, the performance of conventional DP has not been satisfactory when it is applied to the stereo matching since the vertical correlation between scanned lines has not been properly considered. In the proposed algorithm, accurate edge information is first obtained from segmented image information then we considers the discontinuity of disparity and occlusions region based on the obtained edge information. The experimental results applied to the Middlebury stereo images demonstrate that the proposed algorithm has better performances in stereo matching than the previous DP based algorithms.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.5 no.4
• /
• pp.333-338
• /
• 2005

This paper presents the target object search algorithm under Dynamic Programming (DP) in the Tree-type maze. We organized an experimental environment with the concatenation of Y-shape diverged way, small mobile robot, and a target object. By the principle of optimality, the backbone of DP, an agent recognizes that a given whole problem can be solved whether the values of the best solution of certain ancillary problem can be determined according to the principle of optimality. In experiment, we used two different control algorithms: a left-handed method and DP. Finally we verified the efficiency of DP in the practical application using our real robot.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.3
• /
• pp.263-278
• /
• 2004

This paper reviews dynamic programming (DP), surveys approximate solution methods for it, and considers their applicability to process control problems. Reinforcement Learning (RL) and Neuro-Dynamic Programming (NDP), which can be viewed as approximate DP techniques, are already established techniques for solving difficult multi-stage decision problems in the fields of operations research, computer science, and robotics. Owing to the significant disparity of problem formulations and objective, however, the algorithms and techniques available from these fields are not directly applicable to process control problems, and reformulations based on accurate understanding of these techniques are needed. We categorize the currently available approximate solution techniques fur dynamic programming and identify those most suitable for process control problems. Several open issues are also identified and discussed.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.315-324
• /
• 2000

This paper presents an efficient dynamic programming(DP) method, so called EDPAS (Efficient Dynamic Programming Algorithm for Signal), for optimally controlling traffic signal in real-time mode at a single intersection. The objective of EDPAS is to minimize total vehicle delay. It applies reaching method to solve forward DP functional equation, which does not need any priori knowledge on the states of DP network. Two acceleration techniques within reaching method are the main feature of EDPAS. They are devised to eliminate inferior DP states by comparing between states and maintaining incumbent value, resulting in a great amount of computational efficiency. An example is shown to verify the advantage of EDPAS.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• v.1
• /
• pp.393-397
• /
• 2006

Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using dynamic programming (DP). The proposed DP is accomplished online for determining optimal paths for each shuttle car. We apply our algorithm to Agile port terminal in USA.

• Proceedings of the KIEE Conference
• /
• 2007.07a
• /
• pp.1736-1737
• /
• 2007

Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using random access sequence dynamic programming (RAS DP). The proposed RAS DP is accomplished online for determining optimal paths for each shuttle car.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.121-127
• /
• 2004

This paper presents a new vertex selection scheme for shape approximation. In the proposed method, final vertex points are determined by "two-step procedure". In the first step, initial vertices are simply selected on the contour, which constitute a subset of the original contour, using conventional methods such as an iterated refinement method (IRM) or a progressive vertex selection (PVS) method In the second step, a vertex adjustment Process is incorporated to generate final vertices which are no more confined to the contour and optimal in the view of the given distortion measure. For the optimality of the final vertices, the dynamic programming (DP)-based solution for the adjustment of vertices is proposed. There are two main contributions of this work First, we show that DP can be successfully applied to vertex adjustment. Second, by using DP, the global optimality in the vertex selection can be achieved without iterative processes. Experimental results are presented to show the superiority of our method over the traditional methods.

• Proceedings of the Korea Water Resources Association Conference
• /
• 1986.07a
• /
• pp.147-158
• /
• 1986

본 논문에서는 북한강 수계의 소양강댐 및 최근에 건설된 남한강 수계의 충주댐의 홍수조절 모형을 개발하였으며, 그 방법으로는 mini-max Dynamic Programming(DP)에 의한 Optimization기법을 사용하였다. 즉 각댐의 유입량을 이용하여 소양강댐 및 충주댐에서의 최대 방류량을 최소화시키는 목적 함수를 사용하였으며, 각 댐 및 하도의 특성에 따른 제약 조건을 고려하였다. DP에 의한 소양강댐 및 충주댐의 최적 운영 결과를 조절율과 이용율을 사용하여 Simulation방법중 Technical ROM, Rigid ROM, Linear Decision Rule(LDR)과 비교한 결과 모든 빈도에 대해서 DP에 의한 방법이 더 좋은 것으로 나타났다. 소양강댐의 각 빈도별 유입량에 대한 방류 형태중, 5년 빈도의 경우에는 방류를 전혀 하지 않아도 저수위가 홍수위 198m를 넘지 않으므로 사실상 5년 빈도의 홍수에 대해서는 저수지 조작이 필요없다. 충주댐의 각 빈도별 유입량에 대한 방류 형태는 초반부와 후반부에서는 방유량-유입량으로 방출하고 중반부에서는 일정한 양을 방류한다. 이에 따라 저수위도 초반부와 후반부에서는 각각 제한수위 138m와 홍수위 145m로 유지된다.