• 전기의세계
• /
• v.25 no.1
• /
• pp.57-60
• /
• 1976

필자는 동적계획법의 장점을 취하고 단점을 보완하기 위하여 새로이 다중동적계획법을 개발하여 그 이론적 장점을 증명하고 이 기법을 한강계 수자원의 최적 다목적 이용 문제에 적용한 결과 그 효용성이 입증되었으므로 아래에 이 다중동적계획법의 원리에 대하여 소개코자 한다. 그런데 다중동적계획법을 종전의 동적계획법의 원리에 바탕을 두고 있으며 또 다중동적계획의 제1과정은 동적계획법과 완전히 일치하므로 우선 동적계획법이 기본원리에 대하여 약술한 다음 다중동적계획법에 대하여 기술하기로 한다.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.4
• /
• pp.1-8
• /
• 2009

In this paper, we deal an implementation of the software that produces sub-optimal solution of cutting-ironbar planning problem using dynamic programming. Generally, it is required to design an optimization algorithm to accept the practical requirements of cutting ironbar manufacturing. But, this problem is a multiple-sized 1-dimensional cutting stock problem and Linear Programming approaches to get the optimal solution is difficult to be applied due to the problem of explosive computation and memory limitation. In order to overcome this problem, we reform the problem for applying Dynamic Programming and propose a cutting-ironbar planning algorithm searching the sub-optimal solution in the space of fixed amount of combinated columns by using heuristics. Then, we design a graphic user interfaces and screen displays to be operated conveniently in the industry workplace and implement the software using open-source GUI library toolkit, GTK+.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.805-807
• /
• 2005

본 논문에서는 동적 계획법(dynamic programming)과 이미지 세그먼트(segment)를 이용한 새로운 스테레오 정합(stereo matching)기법을 제안한다. 일반적으로 동적 계획법(dynamic programming)은 빠르면서도 비교적 정확하고, 조밀(dense)한 disparity map을 얻을 수 있다. 그러나 경계(boundary)근처의 폐색지역(occlusion region)이나, 텍스쳐가 적은 모호한 영역에서는 잘못된 결과를 유도할 수 있다. 본 논문에서는 이러한 문제점들을 해결하기 위해 먼저 이미지를 아주 작은 영역으로 분할(over-segmentation)하고, 이런 작은 영역들이 비슷한 disparity를 가질 것이라고 가정한다. 다음으로 동적 계획법(dynamic programming)을 통해 정합을 수행한다. 여기서 계산비용(cost)은 기존의 정합윈도우 안에서 세그먼트 영역을 적용한 새로운 비용함수를 사용하며, 이 새로운 비용함수를 통해 정확도를 높인다. 마지막으로 동적 계획법을 통하여 얻어진 조밀한 disparity map을 세그먼트 영역들의 시각특성(visibility)과 유사도(similarity)를 이용하여 에러를 찾아내고, 세그먼트 정합을 통해 수정함으로 정확한 disparity map을 찾아낸다.

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

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

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.713-716
• /
• 2001

This paper describes Direct load control(DLC) method including unit commitment. To consider the unit commitment on DLC, 3-Dimensional dynamic programming as a new unit commitment method is developed. And, this method is applied to DLC. As result, optimization of operating schedule with DLC is possible. This method is applied to the test system, and usefulness of the method is verified.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.29-43
• /
• 2021

In this paper, a new approach to solve the constrained dynamic programming is proposed by using the constraint programming. While the conventional dynamic programming scheme has the state space augmented with states on constraints, this approach, without state augmentation, represents states of constraints as domains in a contraining programming solver. It has a hybrid computational mechanism in its computation by combining solving the Bellman equation in the dynamic programming framework and exploiting the propagation and inference methods of the constraint programming. In order to portray the differences of the two approaches, this paper solves a simple version of the long-term car rental financing problem. In the conventional scheme, data structures for state on constraints are designed, and a simple inference borrowed from the constraint programming is used to the reduction of violation of constraints because no inference risks failure of a solution. In the hybrid approach, the architecture of interface of the dynamic programming solution method and the constraint programming solution method is shown. It finally discusses the advantages of the proposed method with the conventional method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.737-742
• /
• 2011

Navigation problems include the task of determining the control input under various constraints for systems such as mobile robots subject to uncertain disturbance. Such tasks can be modeled as constrained stochastic control problems. In order to solve these control problems, one may try to utilize the dynamic programming(DP) methods which rely on the concept of optimal value function. However, in most real-world problems, this trial would give us many difficulties; for examples, the exact system model may not be known; the computation of the optimal control policy may be impossible; and/or a huge amount of computing resource may be in need. As a strategy to overcome the difficulties of DP, one can utilize ADP(approximate dynamic programming) methods, which find suboptimal control policies resorting to approximate value functions. In this paper, we apply recently proposed ADP methods to a class of navigation problems having complex constraints, and observe the resultant performance characteristics.

• Journal of Internet Computing and Services
• /
• v.9 no.3
• /
• pp.69-77
• /
• 2008

An algorithm for tracking the trace of structured light is proposed to obtain depth information accurately. The technique is based on the fact that the pixel location of light in an image has a unique association with the object depth. However, sometimes the projected light is dim or invisible due to the absorption and reflection on the surface of the object. A dynamic programming approach is proposed to solve such a problem. In this paper, necessary mathematics for implementing the algorithm is presented and the projected laser light is tracked utilizing a dynamic programming technique. Advantage is that the trace remains integrity while many parts of the laser beam are dim or invisible. Experimental results as well as the 3-D restoration are reported.

• Journal of Korea Water Resources Association
• /
• v.38 no.12 s.161
• /
• pp.1021-1028
• /
• 2005

This study purpose to develop simulation model of optimal design condition of urban storm sewer system considering risk. Urban Storm Sewer Optimal Design Model(USSOD) can compute pipe capacity, pipe slope, crown elevation, excavation depth, risk and return cost in the condition of design discharge. Rational formula is adopted for design discharge and Manning's formula is used for pipe capacity. Discrete differential dynamic programming(DDDP) technique which is a kind of dynamic programming(DP) is used for optimization and first order second moment approximation method and uncertainty analysis is also for developing model. USSOD is applied to hypothetical drainage basin to test and verify, which resulted economical and efficient design in urban drainage sewer system.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2008.06a
• /
• pp.211-216
• /
• 2008

이 논문은 철근 가공 산업 현장에서 스프레드쉬트에 의해 수작업으로 행하던 절단 작업의 계획 수립을 자동화된 시스템에 의해 최적의 절단 계획을 생성하도록 하는 소프트웨어의 개발을 다룬다. 이를 위하여, 먼저 시스템의 데이터 표현과 최적 문제 풀이를 위한 자동 계획 알고리듬의 설계가 요구된다. 이것은 다중 규격의 1차원 자재 절단 문제를 푸는 것으로, 동적계획법에 근거하여 자재 절단 문제를 재구성하고, 유한 범위의 조합 열에서도 근사 최적의 해를 찾을 수 있는 탐색 기법을 사용한 자재 절단 계획 알고리듬을 사용하였다. 그리고, 자동화된 철근 가공 산업용 소프트웨어는 작업 환경에 맞게 사용이 편리한 그래픽 화면과 사용자 인터페이스가 요구되는데, 공개 소프트웨어를 활용한 GUI 라이브러리 툴킷인 GTK+를 활용하여 이를 구현하였다.