• 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 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 Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.106-106
• /
• 2021

라오스 남능강 유역에는 현재 11개의 수력 발전 댐이 운영되고 있으며 최근에 설치된 댐을 제외하고는 오래전에 개발된 운영규정 곡선에 근거하여 운영하고 있다. 즉 댐의 증설에 따른 하천 유량의 변동과 발전소의 설비용량증설 등의 발전환경이 충분히 반영되지 못한 상태로 운영하고 있으며, 이로 인해 통합수자원 관리의 최적화 차원의 일환으로 최대 전력생산을 위한 새로운 저수지 운영규정 곡선 개발이 필요하게 되었다. 저수지 운영규정 곡선(reservoir operation rule curve)은 일반적으로 주어진 저수지의 규모와 저수지로의 유입량 그리고 발전소의 설비용량 등의 발전환경을 종합적으로 고려하여 연간 발전량을 최대로 생산할 수 있도록 최적화 기법 등을 활용하여 개발한다. 본 고에서는 이를 위해 범용적인 동적 계획법(Dynamic Programming:DP)프로그램인 CSUDP를 활용하여 최초의 최적 저수지 운영규정 곡선을 제시하고 이에 의한 발전량을 모의하기 위해 HEC-ResSim package를 활용하였으며, 최종적으로는 기존의 운영규정 곡선, 운영실적, 그리고 현장 운영자의 의견 등을 종합적으로 고려하여 댐 운영 시나리오(단독, 연결, 댐별 상업 발전 시기 등)별로 운영규정 곡선을 개발하고 라오스 정부(EdL)에 제시하였다.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.6 no.2 s.21
• /
• pp.51-60
• /
• 2006

The objective of this research is to develop a least cost system design method for branched storm sewer systems while satisfying all the design constraints using heuristic techniques such as genetic algorithm and harmony search. Two sewer system models have been developed in this study. The SEWERGA and SEWERHS both determine the optimal discrete pipe installation depths as decision variables. Two models also determine the optimal diameter of sewer pipes using the discrete installation depths of the pipes while satisfying the discharge and velocity requirement constraints at each pipe. Two models are applied to the example that was originally solved by Mays and Yen (1975) using their dynamic programming(DP). The optimal costs obtained from SEWERGA and SEWERHS are about 4% lower than that of the DP approach.

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

Urban Storm Sewer Optimal Design Model(USSOD) was developed to 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. After testing the model, it is also applied to Ulsan drainage basin which was developed by Korea Land Cooperation(KOLAND). Comparing the design results of USSOD with those of KOLAND, discharge capacity 0.35 $m^3/sec$, the crown elevation is 0.77m higher and return cost is $9\%$ less than design results of KOLAND, which verify the improvement of USSOD. Layout design model using GIS and optimization including detention or retention effect are needed in the future study.

• 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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.431-446
• /
• 1998

In this paper, we consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, we first propose a dynamic programming(DP) algorithm for sequencing jobs processed on a single machine. The algorithm is then extended to handle jobs on parallel-identical machines. Finally, we developed an improved version of the algorithm which generates optimal solutions using much smaller amount of memory space and computing time. Computational results are provided to illustrate the performance of the DP algorithms.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.42 no.6
• /
• pp.803-814
• /
• 2022

The Lao government is continuously developing hydro-power dams in addition to the existing eight power plants in the Nam Ngum River basin and is expanding the power capacity of the existing power plants to meet the expected increase in electricity demand. Accordingly, the Lao government has requested an update on the existing reservoir operating rule curve in order to run the power plants efficiently. To this end, this study reviewed the current independent operating system as well as the joint operating system in order to maximize the annual power generation produced by a power plant by using CSUDP, general-purpose dynamic programming (DP) software. The appropriate operating regulation curve forms (URC/LRC, MRC) were extracted from the DP results, and the annual power generations were simulated by inputting them as the basic operating data of the reservoir operation set of the HEC-ResSim program. By synthesizing the amount of the annual power generation simulated, the existing operation regulation curve, the operational performance, and the opinion of the field operator, the optimal reservoir operation regulation curves that maximize the annual power generation of the target power plant were developed. Results revealed that a system operating in conjunction with the reservoir produces about 2.5 % more power generation than an independent reservoir due to the synergistic effect of the connection.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.7 no.2
• /
• pp.16-28
• /
• 2004

A seam-line determination algorithm is proposed to determine image border-line in mosaicing using the transformation of gray value differences and dynamic programming. Since visually good border-line is the one along which pixel differences are as small as possible, it can be determined in association with an optimal path finding algorithm. A well-known effective optimal path finding algorithm is the Dynamic Programming (DP). Direct application of the dynamic programming to the seam-line determination causes the distance effect, in which seam-line is affected by its length as well as the gray value difference. In this paper, an adaptive cost transform algorithm with which the distance effect is suppressed is proposed in order to utilize the dynamic programming on the transformed pixel difference space. Also, a figure of merit which is the summation of fixed number of the biggest pixel difference on the seam-line (SFBPD) is suggested as an evaluation measure of seamlines. The performance of the proposed algorithm has been tested in both quantitively and visually on various kinds of images.

• 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.