• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04c
• /
• pp.368-370
• /
• 2003

단백질들의 복수서열정렬은 단백질 서열간의 관계를 유추할 수 있는 유용한 도구이다. 최적화된 복수서열정렬을 얻기 위해 사용되는 가장 유용한 방법은 dynamic programming이다. 그러나 dynamic programming은 특정한 비용함수를 사용할 수 없기 때운에 특별한 경우 최적의 복수서열정렬을 제공하지 못하는 문제점이 있다. 우리는 이러한 문제점을 해결하기 위하여 부분정렬개선기법을 사용한 알고리즘을 제안하였으며, 이 알고리즘이 dynamic programming의 문제점을 효과적으로 해결함을 보였다.

• Korean Management Science Review
• /
• v.29 no.1
• /
• pp.1-14
• /
• 2012

The goal of the multi-reservoir operation planning is to provide an optimal release plan that maximize the reservoir storage and hydropower generation while minimizing the spillages. However, the reservoir operation is difficult due to the uncertainty associated with inflows. In order to consider the uncertain inflows in the reservoir operating problem, we present a Stochastic Dynamic Programming (SDP) model based on the markov decision process (MDP). The objective of the model is to maximize the expected value of the system performance that is the weighted sum of all expected objective values. With the SDP model, multi-reservoir operating rule can be derived, and it also generates the steady state probabilities of reservoir storage and inflow as output. We applied the model to the Geum-river basin in Korea and could generate a multi-reservoir monthly operating plan that can consider the uncertainty of inflow.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.551-553
• /
• 2006

An autonomous navigation technology for the mobile robot is investigated in this paper. The proposed robot path planning algorithm employs the dynamic programming to find the optimal path. The algorithm finds the global optimal path through the local computation on the environmental map. Since the robot computes the new path at every point, it can avoid the obstacle successfully during the navigation. The experimental results of the robot navigation are included in this paper.

• 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로 유지된다.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.98.3-98
• /
• 2002

Vision-based systems for finding road lanes have to operate robustly under a wide variety of environ-mental conditions including large amount of scene clutters. This paper presents a method for finding the lane boundaries by combining a local line extraction method and dynamic programming as a search tool. The line extractor obtains an initial position estimation of road lane boundaries from the noisy edge fragments. Dynamic programming then improves the initial approximation to an accurate configuration of lane boundaries. Input image frame is divided into a few sub-regions along the vertical direction. The local line extractor then performs to extract candidate lines of road lanes in the...

• Journal of Advanced Marine Engineering and Technology
• /
• v.23 no.6
• /
• pp.785-793
• /
• 1999

There are two kinds of method in ship maintenance. One is the corrective maintenance and the other is the preventive maintenance. For these maintenances recently the stochastic techniques are widely used to keep the maximum availibility and the optimal maintenance period minimizing a given cost function. Thus this paper suggest a method to decide the optimal policy of ship's maintenances by using dynamic programming and the effectiveness of the method is verified through several examples in which failure rates and maintenance data of ship's machineries and parts are given.

• Journal of Advanced Marine Engineering and Technology
• /
• v.24 no.3
• /
• pp.106-112
• /
• 2000

Since the oil crisis, we have been concerned about the energy saving techniques of electric generating systems. As a part of the effort to save energy, automatic electric load sharing device was developed. Usually, ship's electric generating system consists of two or three sets of generator. And, electric generating system is operated as single or parallel operation mode according to the demanded electric power. Therefore, it is important to investigate generators operating mode for the supply of required electric power in the ship in order to decrease the operating cost. So, this paper suggests the method to solve the optimal electric load distribution problem by dynamic programming. And, this thesis indicates that the proposed method is superior to the lagrange multiplier's method in obtaining optimal load distribution solution in the ship's electric generating system.

• Journal of Korean Society of Transportation
• /
• v.5 no.1
• /
• pp.47-58
• /
• 1987

A commodity distribution problem with intertemporal storage facilities and dynamic transportation networks is proposed. mathematical integer programming methods and multiobjective programming techniques are used in the model formulation. Dynamic characteristics of commodity distribution problems are taken into account in the model formulation. storage facility location problems and transportation link addition problems are incorporated into the intertemporal multicommodity distribution problem. The model is capable of generating the most efficient and rational commodity distribution system. Therefore it can be utilized to provided the most effective investment plan for the transportation infrastructure development as well as to evaluate the existing commodity distribution system. The model determines simultaneously the most efficient locations, sizes, and activity levels of storage facilities as well as new highway links. It is extended to multiobjective planning situations for the purpose of generating alternative investment plans in accordance to planning situations. sine the investment in transportation network improvement yields w\several external benefits for a regional economy, the induced benefit maximization objective is incorporated into the cost minimization objective. The multiobjective model generates explicitly the trade-off between cost savings and induced benefits of the investment in transportation network improvement.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2367-2370
• /
• 2003

A fast pattern classification algorithm with Cellular Parallel Processing Network-based dynamic programming is proposed. The Cellular Parallel Processing Networks is an analog parallel processing architecture and the dynamic programming is an efficient computation algorithm for optimization problem. Combining merits of these two technologies, fast Pattern classification with optimization is formed. On such CPPN-based dynamic programming, if exemplars and test patterns are presented as the goals and the start positions, respectively, the optimal paths from test patterns to their closest exemplars are found. Such paths are utilized as aggregating keys for the classification. The pattern classification is performed well regardless of degree of the nonlinearity in class borders.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.3
• /
• pp.573-585
• /
• 2008

A few sufficient conditions for the existence and uniqueness of fixed point and common fixed point for certain contractive type mappings in complete metric spaces are provided. Several existence and uniqueness results of solution and common solution for some functional equations and system of functional equations in dynamic programming are discussed by using the fixed point and common fixed point theorems presented in this paper.