• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2005년도 추계학술대회 학술발표 논문집 제15권 제2호
• /
• pp.389-392
• /
• 2005

어떤 미로환경 내에서 로봇이 스스로 목표물을 찾기 위해서는 탐색경로를 결정하는 알고리즘이 요구된다. 본 논문에서는 'Y'형 미로에서 목표물을 탐색하기 위하여 Dynamic Programming을 적용한 미로 탐색 알고리즘을 제안한다. 실험에서는 규격화된 미로 블록을 만들고, 먼저 기존에 연구 되었던 자수법 알고리즘을 자율이동 로봇에 적용해 'Y'형 미로 블록을 탐색하게 한다. 그리고 본 논문에서 제시한 Dynamic Programming을 이용한 미로탐색 알고리즘을 자율이동로봇에 적용하고 미로를 탐색한 후 이두가지 알고리즘을 적용한 로봇의 주행 결과를 각각 비교해 봄으로서 Dynamic Programming을 적용한 자율이동로봇의 미로탐색 방법의 성능을 확인한다.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2007년도 추계학술대회 및 제23회 정기총회
• /
• pp.226-227
• /
• 2007

항만 물동량의 증가로 자동화 항만 시스템에 대한 연구가 활발히 진행되고 있다. 본 연구는 선형 모터 기반 이송 장비인 LMTT 시스템의 자동화 운용에 있어 충돌 및 교착상태를 방지하기 위해 Random Access Sequence Dynamic Programming(RAS DP)를 이용한 최적 경로 탐색 알고리즘을 제안한다. 제안하는 알고리즘은 실시간으로 각 shuttle car의 최적 경로를 탐색한다.

• 대한전기학회논문지:전력기술부문A
• /
• 제51권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.

• 융합신호처리학회논문지
• /
• 제4권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.

• International Journal of Control, Automation, and Systems
• /
• 제5권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.

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

• 컴퓨터교육학회논문지
• /
• 제11권4호
• /
• pp.23-36
• /
• 2008

알고리즘은 효과적인 프로그래밍 기법을 익히는데 가장 핵심이 되는 과목이나 학생들이 개념 이해에 어려움을 느끼며 흥미도 낮은 것으로 나타났다. 특히, 알고리즘 관련 주제들 중 동적 프로그래밍 방법은 컴퓨터과학을 전공하는 학생들이 반드시 학습해야 하는 중요한 프로그래밍 기법임에도 불구하고 학부 과정에 있는 학생들이 어려워하는 부분으로 수업에서도 잘 다루어지지 않고 있다. 동적 프로그래밍은 추상적인 알고리즘 지식과 더불어 문제 해결 절차와 저장 공간에 대한 이해가 필요한 방법으로, 다른 개념 보다 이해하기 어려운 주제이다. 이에 본 논문에서는 동적 프로그래밍 기법에 대해 학습자가 이해하기 쉽고 흥미를 가지고 학습할 수 있도록 지원하는 시각화 시뮬레이터를 개발하였다. 본 학습 시뮬레이터는 학습자가 직접 동적 프로그래밍의 수행 단계를 진행하며 문제 해결 절차를 학습하고 저장 공간 및 프로그램의 진행 과정을 시각적으로 확인할 수 있도록 설계 및 구현되었다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제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.

• Journal of Electrical Engineering and Technology
• /
• 제11권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.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권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.