• 한국정보과학회논문지:시스템및이론
• /
• 제32권11_12호
• /
• pp.578-586
• /
• 2005

본 논문에서 다루는 문제는 품질 정보를 가지는 서열을 배치(alignment)하는 알고리즘이다. 시퀀싱(sequencing) 작업의 일부인 염기 결정 프로그램(base-calling program)에 의해서 생성되는 DNA 서열은 각 염기가 어느 정도 신뢰할 수 있는 가를 나타내는 품질 정보를 가진다. 그러나 지금까지 개발된 서열 배치 알고리즘들은 이러한 품질 정보를 고려하지 않았다. 본 논문에서는 품질 정보를 가지는 두 서열의 배치를 평가하는 기준을 제시한다. 이 평가 기준에 의한 최적의 서열 배치는 동적 프로그래밍(dynamic programming) 기법에 의해서 찾을 수 있다.

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

• 제어로봇시스템학회논문지
• /
• 제11권5호
• /
• pp.418-422
• /
• 2005

In this paper, a novel algorithm capable of detecting generic obstacles on a flat surface is proposed. The algorithm fundamentally exploits a distortion phenomena taken place in remapping process of original stereo images to a virtual top-view. Based on the distortion phenomena, we construct stereo polar histograms of edge maps, detect peaks on them, and search for matched peaks on both histograms using a Dynamic Programming (DP). Eventually, the searched corresponding peaks lead to estimate obstacles' positions. The advantages of the proposed algorithm are that it is not largely affected by an intensity difference between a pair of stereo images and does not depend on the typical stereo matching methodologies. Furthermore, the algorithm identifies the obstacles' positions quite robustly.

• International Journal of Control, Automation, and Systems
• /
• 제6권2호
• /
• pp.278-281
• /
• 2008

Linear motor (LM) based shuttle cars will play an important role in the future transportation systems of marine terminals to cope with increasing container flows. These systems are known as agile port terminals because of their significant advantages. However, routing for multiple shuttle cars is still an open issue. We present a network model of a container yard and propose constrained dynamic programming (DP) for its routing strategy with collision avoidance. The algorithm is a modified version of typical DP which is used to find an optimal path for a single traveler. We evaluate the new algorithm through simulation results for three shuttle cars in a mesh-type container yard.

• Journal of international Conference on Electrical Machines and Systems
• /
• 제1권1호
• /
• pp.114-120
• /
• 2012

Eco-driving technique for electric vehicles (EVs) is investigated in this paper. Many findings on EVs have been reported; however, they did not deal with eco-driving from the viewpoint of theoretical study. The authors have developed an energy-saving driving technique - the so-called "eco-driving" technique based on dynamic programming (DP). Optimal speed profile of an EV, which minimizes the amount of total energy consumption, was determined under fixed origin and destination, running time, and track conditions. DP algorithm can deal with such complicated conditions and can also derive the optimal solution. Using the proposed method, simulations were run for some cases. In particular, the author ran simulations for the case of a gradient road with a traffic signal. The optimization model was solved with MATLAB.

• Journal of Electrical Engineering and Technology
• /
• 제12권3호
• /
• pp.1064-1072
• /
• 2017

The power of controlled generators in microgrids randomly fluctuate because of the stochastic volatility of the outputs of photovoltaic systems and wind turbines as well as the load demands. To address and dispatch these stochastic factors for daily operations, a dynamic economic dispatch model with the goal of minimizing the generation cost is established via chance-constrained programming. A Monte Carlo simulation combined with particle swarm optimization algorithm is employed to optimize the model. The simulation results show that both the objective function and constraint condition have been tightened and that the operation costs have increased. A higher stability of the system corresponds to the higher operation costs of controlled generators. These operation costs also increase along with the confidence levels for the objective function and constraints.

• 대한산업공학회지
• /
• 제26권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.

• 정보처리학회논문지B
• /
• 제10B권1호
• /
• pp.73-80
• /
• 2003

본 논문에서는 기준영상과 탐색영상 사이의 대응되는 특징 점을 정합 하는 알고리즘을 제안한다. 두 영상에서 특징 점을 찾기 위하여 Harris의 코너 점 검출기를 사용하였다. 기준영상의 각 특징 점에 대해, 정규상관계수가 임계치 이상인 탐색영상의 특징 점들로 후보 정합 점을 구한다. 최종적으로 동적 프로그래밍을 사용하여 후보 정합 점들 중에서 대응되는 특징 점을 구한다. 실험으로 인위적인 영상과 실제 영상에서 특징 점을 정합 하는 결과를 보였다.

• 한국산학기술학회논문지
• /
• 제12권11호
• /
• pp.4726-4731
• /
• 2011

본 논문에서는 배치 단위로 이루어지는 플런지연삭의 최적 연삭 조건 선정을 위한 알고리즘을 제안하였다. 제안된 알고리즘은 연삭공정을 나타내는 상태변수를 선정하고 선정된 상태 변수를 바탕으로 각 사이클에서 이루어지는 최적의 연삭 조건을 GA(Genetic Algorithm)를 이용하여 선정하였다. 이를 바탕으로 전체 배치 단위의 최적 연삭조건은 DP(Dynamic Programming)를 이용하여 구하였다. 제안된 알고리즘을 시뮬레이션을 통해 그 가능성을 검증하였다.

• 반도체디스플레이기술학회지
• /
• 제9권3호
• /
• pp.65-69
• /
• 2010

The stereoscopic vision system is the algorithm to obtain the depth of target object of stereo vision image. This paper presents an efficient disparity matching method using nagao filter, octree color quantization and dynamic programming algorithm. we describe methods for performing color quantization on full color RGB images, using an octree data structure. This method has the advantage of saving a lot of data. We propose a preprocessing stereo matching method based on Nagao-filter algorithm using color information. using the nagao filter, we could obtain effective depth map and using the octree color quantization, we could reduce the time of computation.