• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제5권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.

• 설비공학논문집
• /
• 제29권11호
• /
• pp.592-604
• /
• 2017

A chiller, having a thermal storage system, can contribute to load-leveling and can reduce the cost of electricity by using electricity at night. In this study, the control experiments and simulations are conducted using both conventional and advanced methods for the building cooling system. Advanced approaches, such as the "region control method", divide the control region into five zones according to the size of the building load, and determines the cooling capacities of the chiller and thermal storage. On the other hand, the "dynamic programming method" obtains the optimal cooling capacities of the chiller and thermal storage by selecting the minimum-cost path by carrying out repetitive calculations. The "thermal storage priority method" shows an inferior chiller performance owing to the low-part load operation, whereas the chiller priority method leads to a high electric cost owing to the low utilization of thermal storage and electricity at night. It has been proven that the advanced control methods have advantages over the conventional methods in terms of electricity consumption, as well as cost-effectiveness. According to the simulation results during the winter season, the electric cost when using the dynamic programming method was 6.5% and 8.9% lower than that of the chiller priority and the thermal storage priority methods, respectively. It is therefore concluded that the cost of electricity utilizing the region control method is comparable to that of the dynamic programming method.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.2617-2622
• /
• 2003

The pH neutralization process has long been taken as a representative benchmark problem of nonlinear chemical process control due to its nonlinearity and time-varying nature. For general nonlinear processes, it is difficult to control with a linear model-based control method so nonlinear controls must be considered. Among the numerous approaches suggested, the most rigorous approach is the dynamic optimization. However, as the size of the problem grows, the dynamic programming approach is suffered from the curse of dimensionality. In order to avoid this problem, the Neuro-Dynamic Programming (NDP) approach was proposed by Bertsekas and Tsitsiklis (1996). The NDP approach is to utilize all the data collected to generate an approximation of optimal cost-to-go function which was used to find the optimal input movement in real time control. The approximation could be any type of function such as polynomials, neural networks and etc. In this study, an algorithm using NDP approach was applied to a pH neutralization process to investigate the feasibility of the NDP algorithm and to deepen the understanding of the basic characteristics of this algorithm. As the global approximator, the neural network which requires training and k-nearest neighbor method which requires querying instead of training are investigated. The global approximator requires optimal control strategy. If the optimal control strategy is not available, suboptimal control strategy can be used even though the laborious Bellman iterations are necessary. For pH neutralization process it is rather easy to devise an optimal control strategy. Thus, we used an optimal control strategy and did not perform the Bellman iteration. Also, the effects of constraints on control moves are studied. From the simulations, the NDP method outperforms the conventional PID control.

• 전자공학회논문지S
• /
• 제34S권6호
• /
• pp.11-20
• /
• 1997

This paper proposes a modified dynamic programming for finding the correspondence between right and left images. A dynamic programming is based on the intensity of images for stereo matching. But htis method is intended to mismatch at uniformed intensity region. To reduce thd mismatching, the stereo images are segmented to various regions with respective uniform intensity, and the different cost function has applied to the segmented region during the dynamci programming. Cost function costains jump cost. And jump cost included two parameter .alpha. and .beta. which have influence on minimum cost path. Experimental results show that the 3D shape of some stereo pairs cna be finely obtained by this proposed algorithm.

• 한국공간구조학회논문집
• /
• 제12권2호
• /
• pp.89-98
• /
• 2012

본 연구는 공간 트러스의 전체 좌굴을 고려한 최적 구조설계에 대해 연구를 하였으며, 구조물의 최소중량을 구하는 것이 목적이다. 응력제약에 의한 부재 최적화를 위해서 수리 계획법이 사용되었으며, 뜀-좌굴을 고려하기 위해 동적 계획법을 적용하였다. 트러스 부재의 최적설계를 위한 수리 모형은 전체중량 목적함수와 인장 또는 압축 허용응력 및 세장비 제약식으로 구성하였다. 평형경로상의 임계점 즉 좌굴하중을 구하기 위해서 접선 강성행렬의 행렬식 변화를 조사하였으며, 설계하중에 대한 좌굴하중 비율이 동적계획법의 반복계산과정에서 공간 트러스의 강성을 조절하기위해 반영되었다. 제안된 최적설계 프로세서의 검증을 위해서 스타 돔 구조물 예제를 통해 조사하였으며, 수치 결과는 잘 수렴하고 모든 제약을 만족하였다. 제시된 최적설계 프로세스는 전체좌굴을 고려한 최적설계를 수행하기 위한 비교적 간단 방법이고, 실무 구조설계를 반영하는데 가능하다.

• 충청수학회지
• /
• 제29권2호
• /
• pp.375-383
• /
• 2016

This paper investigates an optimal consumption, portfolio, and life insurance strategies of a family when there is a borrowing constraint and risk aversion change at the time of death of the breadwinner. A CRRA utility is employed and by using the dynamic programming method, we obtain analytic expressions for the optimal strategies.

• 산업공학
• /
• 제12권3호
• /
• pp.362-373
• /
• 1999

Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.

• 한국시뮬레이션학회논문지
• /
• 제16권1호
• /
• pp.21-29
• /
• 2007

본 연구에서는 경동맥 B-모드 초음파영상에서 내막-중막 두께(IMT : Intima-Media Thickness)의 자동측정을 위해 다이나믹 프로그래밍(dynamic programming)을 이용하여 내막과 중막의 경계선을 자동 추출하는 알고리즘을 제안하고 실험결과를 보여준다. 혈관 인터페이스의 픽셀 값과 기울기 등의 영상특징과 연속성의 기하학적 특징을 고려한 평가항(cost term)들을 포함하는 평가함수(cost function)를 계산하여 그 값이 최소가 되는 최적의 위치를 결정하기 위해 다이나믹 프로그래밍 방법을 적용하였다. 또한 스페클(speckle), 드랍아웃(dropout)과 같은 잡음과 약한 에지로 인한 거친 추출 결과에 대해 B-spline을 적용하여 더욱 부드러운 경계선을 유지하도록 함으로써 경계선의 연속성을 향상시켰다. 제안한 방법은 다중영상특징(multiple image features)을 고려함으로써 일반적인 에지 알고리즘보다 더욱 정확하고 재생산 가능한 경계선을 추출하였고 수동측정 시 발생하는 측정자 내, 측정자 간의 추출결과 변이성과 비효율성의 문제점을 해결하여 편리한 자동측정이 가능하게 한다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권9호
• /
• pp.540-546
• /
• 2003

A fast pattern classification algorithm with Cellular Nonlinear Network-based dynamic programming is proposed. The Cellular Nonlinear Networks is an analog parallel processing architecture and the dynamic programing is an efficient computation algorithm for optimization problem. Combining merits of these two technologies, fast pattern classification with optimization is formed. On such CNN-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 algorithm is similar to the conventional neural network-based method in the use of the exemplar patterns but quite different in the use of the most likely path finding of the dynamic programming. The pattern classification is performed well regardless of degree of the nonlinearity in class borders.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2007년도 제38회 하계학술대회
• /
• pp.451-452
• /
• 2007

In this paper, we simulate power system transient stability using object-oriented programming(OOP). OOP is a more flexible method than procedual programming. There are several advantages in dynamic system simulation using OOP. We also calculate critical fault clearing time using energy functions for detailed models.