• Title/Summary/Keyword: Dynamic programming

Search Result 957, Processing Time 0.03 seconds

Target Object Search Algorithm under Dynamic Programming in the Tree-Type Maze (Dynamic Programming을 적용한 트리구조 미로내의 목표물 탐색 알고리즘)

  • Lee Dong-Hoon;Yoon Han-Ul;Lee Dong-Wook;Sim Kwee-Bo
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.389-392
    • /
    • 2005
  • 어떤 미로환경 내에서 로봇이 스스로 목표물을 찾기 위해서는 탐색경로를 결정하는 알고리즘이 요구된다. 본 논문에서는 'Y'형 미로에서 목표물을 탐색하기 위하여 Dynamic Programming을 적용한 미로 탐색 알고리즘을 제안한다. 실험에서는 규격화된 미로 블록을 만들고, 먼저 기존에 연구 되었던 자수법 알고리즘을 자율이동 로봇에 적용해 'Y'형 미로 블록을 탐색하게 한다. 그리고 본 논문에서 제시한 Dynamic Programming을 이용한 미로탐색 알고리즘을 자율이동로봇에 적용하고 미로를 탐색한 후 이두가지 알고리즘을 적용한 로봇의 주행 결과를 각각 비교해 봄으로서 Dynamic Programming을 적용한 자율이동로봇의 미로탐색 방법의 성능을 확인한다.

  • PDF

A Study about Finding Optimal Path Using HAS Dynamic Programming (RAS Dynamic Programming을 이용한 최적 경로 탐색에 관한 연구)

  • Kim, Jeong-Tae;Cho, Hyun-Chul;Lee, Kwon-Soon
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2007.12a
    • /
    • pp.226-227
    • /
    • 2007
  • Significant increase of container flows in marine terminals requires more efficient automatic port systems. This paper presents a novel routing and collision avoidance algorithm of linear motor based shuttle cars using random access sequence dynamic programming (RAS DP). The proposed RAS DP is accomplished online for determining optimal paths for each shuttle car.

  • PDF

Development of Unit Commitment Methodology Considering Direct Load Control by 3-Dimensional Dynamic Programming (3차원 동적계획법에 의한 직접부하제어를 고려한 기동정지계획 방법론의 개발)

  • Lee, Buhm;Kim, Yong-Ha;Choi, Sang-Kyu;Kim, Hyeong-Jung
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.51 no.12
    • /
    • pp.591-596
    • /
    • 2002
  • This Paper Presents a new methodology for Direct Load Control(DLC) and Unit Commitment. To consider economical effect of DLC, we developed 3-Dimensional dynamic programming which can combine unit commitment and DLC. Traditional dynamic programming has 2-Dimensional which consist of state and stage, but newly developed dynamic programming has DLC state, U.C. state, and stage. As a result, economical DLC and unit commitment schedule of the power system is possible. This method is applied to the test system, and the usefulness of the method is verified.

Design and Implementation of the Systolic Array for Dynamic Programming

  • Lee, Jae-Jin;Tien, David;Song, Gi-Yong
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.4 no.3
    • /
    • pp.61-67
    • /
    • 2003
  • We propose a systolic array for dynamic programming which is a technique for solving combinatorial optimization problems. We derive a systolic array for single source shortest path Problem, SA SSSP, and then show that the systolic array serves as dynamic Programming systolic array which is applicable to any dynamic programming problem by developing a systolic array for 0 1 knapsack problem, SA 01KS, with SA SSSP for a basis. In this paper, each of SA SSSP and SA 01KS is modeled and simulated in RT level using VHDL, then synthesized to a schematic and finally implemented to a layout using the cell library based on 0.35${\mu}{\textrm}{m}$ 1 poly 4 metal CMOS technology.

  • PDF

A Dynamic Programming Approach to PCB Assembly Optimization for Surface Mounters

  • Park, Tae-Hyoung;Kim, Nam
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.192-199
    • /
    • 2007
  • This paper proposes a new printed circuit board (PCB) assembly planning method for multi-head surface mounters. We present an integer programming formulation for the optimization problem, and propose a heuristic method to solve the large NP-complete problem within a reasonable time. A dynamic programming technique is then applied to the feeder arrangement optimization and placement sequence optimization to reduce the overall assembly time. Comparative simulation results are finally presented to verify the usefulness of the proposed method.

Analysis of Dynamic Production Planning Model Using Linear Programming (선형계획을 이용한 동적 생산계획 모형의 분석)

  • Chang, Suk-Hwa
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.19 no.3
    • /
    • pp.71-79
    • /
    • 1993
  • Dynamic production planning problems are to determine the optimal production times and production quantities of product for discrete finite periods. In previous many researches, the solutions for these problems have been developed through the algorithms using dynamic programming. The purpose of this research is to suggest the new algorithm using linear programming. This research is to determine optimal production quantities of product in each period to satisfy dynamic for discrete finite periods, minimizing the total of production cost and inventory holding cost. Cost functions are concave, and no backlogging for product is allowed. The new algorithm for capacity constrained problem is developed.

  • PDF

Visual simulator for supporting to learn efficiently on dynamic programming (동적 프로그래밍에 대한 효율적인 학습을 지원하는 시각화 시뮬레이터)

  • Jung, Soon-Young;Kwon, Han-Sook
    • The Journal of Korean Association of Computer Education
    • /
    • v.11 no.4
    • /
    • pp.23-36
    • /
    • 2008
  • It's known by recent surveys that many students have difficulty in understanding the concepts of programming algorithms, and don't feel interested in learning them. Dynamic programming, one of the most important and widely-used algorithms in computer science, is especially feared by students and unlike other algorithms, it also requires understanding of the process of problem solving and storage space design as well as basic principles of the algorithm. And so it has not been properly covered in classes. In this paper, we developed a visual simulator to solve the above problems in learning dynamic programming. This learning simulator is designed for students to run the algorithms themselves and learn how it works by visualizing each step of dynamic programming and corresponding states of storage space.

  • PDF

An Applied Technique of Linear Programming Using Multi-Softwares (다종 S/W 적용에 의한 선형계획법 연구)

  • 한계섭
    • The Journal of Information Systems
    • /
    • v.5
    • /
    • pp.21-41
    • /
    • 1996
  • Linear programming has become an important tool in decision-making of modern business management. This remarkable growth can be traced to the pioneering efforts of many individuals and research organizations. The popular using of personal computers make it very easy to process those complicated linear programming models. Furthermore advanced linear programming software packages assist us to solve L.P. models without any difficult process. Even though the advanced L.P. professional packages, the needs of more detailed deterministic elements for business decisions have forced us to apply dynamic approaches for more resonable solutions. For the purpose of these problems applying to the "Mathematica" packages which is composed of mathematic tools, the simplex processes show us the flexible and dynamic decision elements included to any other professional linear programming tools. Especially we need proper dynamic variables to analyze the shadow prices step by step. And applying SAS(Statistical Analysis System) packages to the L.P. problems, it is also one of the best way to get good solution. On the way trying to the other L.P. packages which are prepared for Spreadsheets i.e., MS-Excel, Lotus-123, Quatro etc. can be applied to linear programming models. But they are not so much useful for the problems. Calculating simplex tableau is an important method to interpret L.P. format for the optimal solution. In this paper we find out that the more detailed and efficient techniques to interpret useful software of mathematica and SAS for business decision making of linear programming. So it needs to apply more dynamic technique of using of Mathematica and SAS multiple software to get more efficient deterministic factors for the sophiscated L.P. solutions.

  • PDF

Optimal Voltage and Reactive Power Scheduling for Saving Electric Charges using Dynamic Programming with a Heuristic Search Approach

  • Jeong, Ki-Seok;Chung, Jong-Duk
    • Journal of Electrical Engineering and Technology
    • /
    • v.11 no.2
    • /
    • pp.329-337
    • /
    • 2016
  • With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

Optimal Seam-line Determination for the Image Mosaicking Using the Adaptive Cost Transform (적응 정합 값 변환을 이용한 영상 모자이크 과정에서의 최적 Seam-Line 결정)

  • CHON Jaechoon;KIM Hyongsuk
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.3
    • /
    • pp.148-155
    • /
    • 2005
  • 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.