• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.578-586
• /
• 2005

In this Paper we consider the problem of sequence alignment with quality scores. DNA sequences produced by a base-calling program (as part of sequencing) have quality scores which represent the confidence level for individual bases. However, previous sequence alignment algorithms do not consider such quality scores. To solve sequence alignment with quality scores, we propose a measure of an alignment of two sequences with orality scores. We show that an optimal alignment in this measure can be found by dynamic programming.

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

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.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
• /
• v.6 no.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
• /
• v.1 no.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
• /
• v.12 no.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.

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

• The KIPS Transactions:PartB
• /
• v.10B no.1
• /
• pp.73-80
• /
• 2003

In this paper we propose an algorithm which matches the corresponding feature points between the reference image and the search image. We use Harris's corner detector to find the feature points in both image. For each feature point in the reference image, we can extract the candidate matching points as feature points in the starch image which the normalized correlation coefficient goes greater than a threshold. Finally we determine a corresponding feature points among candidate points by using dynamic programming. In experiments we show results that match feature points in synthetic image and real image.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.11
• /
• pp.4726-4731
• /
• 2011

This paper proposed the algorithm to select optimal grinding condition for plunge grinding in the batch production unit. In order to apply to the proposed algorithm, the state variable for plunge grinding process was defined and the optimal grinding condition for each cycle in batch production was decided by genetic algorithm. Based on the optimized grinding condition in each cycle, the optimal grinding condition for whole batch production was selected by dynamic programming. The proposed algorithm was evaluated by computer simulation.

• Journal of the Semiconductor & Display Technology
• /
• v.9 no.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.