• 제목/요약/키워드: Dynamic programming algorithm

검색결과 364건 처리시간 0.025초

MOEPE: 스테레오 정합 하드웨어를 위한 Merged Odd-Even PE 구조 (MOEPE: Merged Odd-Even PE Architecture for Stereo Matching Hardware)

  • 한필우;양영일
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 1998년도 추계종합학술대회 논문집
    • /
    • pp.1137-1140
    • /
    • 1998
  • In this paper, we propose the new hardware architecture which implements the stereo matching algorithm using the dynamic programming method. The dynamic programming method is used in finding the corresponding pixels between the left image and the right image. The proposed MOEPE(Merged Odd-Even PE) architecture operates in the systolic manner and finds the disparities from the intensities of the pixels on the epipolar line. The number of PEs used in the MOEPE architecture is the number of the range constraint, which reduced the number of the necessary PEs dramatically compared to the traditional method which uses the PEs with the number of pixels on the epipolar line. For the normal method by 25 times. The proposed architecture is modeled with the VHDL code and simulated by the SYNOPSYS tool.

  • PDF

A Study on Automation of Image Collection Planning

  • Han, Jae-Joong;Jung, Kyung-Jin;Choi, Jae-Seung;Kwak, Sung-Hee;Kim, Moong-Yu
    • 대한원격탐사학회지
    • /
    • 제27권6호
    • /
    • pp.743-752
    • /
    • 2011
  • One of main concerns of operators of the Earth observation satellite is taking images as many as possible under the constraints of satellite resources during fixed period. In order to achieve this goal, satellite operators are strongly required to generate the optimized image collection plans, and it is a very time consuming process to achieve an optimized image collection plan when it is done by manual. This paper suggests automation of image collection planning based on the dynamic programming algorithm to reduce the time required for image collection planning. The validity of the proposed method is tested using operating satellite system and the result is given in this paper.

OPTIMAL TORQUE MANAGEMENT STRATEGY FOR A PARALLEL HYDRAULIC HYBRID VEHICLE

  • Sun, H.;Jiang, J.H.;Wang, X.
    • International Journal of Automotive Technology
    • /
    • 제8권6호
    • /
    • pp.791-798
    • /
    • 2007
  • The hydraulic hybrid vehicle(HHV) is an application of hydrostatic transmission technology to improve vehicle fuel economy and emissions. A relatively lower energy density of hydraulic accumulator and complicated coordinating operations between two power sources require a special energy management strategy to maximize the fuel saving potential. This paper presents a new type of configuration for parallel HHV to minimize the disadvantages of the hydraulic accumulator, as well as a methodology for developing an energy management strategy tailored specially for PHHV. Based on an analysis of the optimal energy distribution between two power sources over a representative urban driving cycle with a Dynamic Programming(DP) algorithm, a fuzzy-based optimal torque management strategy is designed and developed to control the torque distribution. Simulation results demonstrates that the optimal torque management strategy maximizes the advantages of this hybrid type of configuration, and the high power density characteristics of hydraulic technology effectively improve the robustness of the energy management strategy and fuel economy of the PHHV.

서비스 고정비용을 고려한 복수제품 선별검사와 서비스시스템 설계 (Design of Rectifying Inspection Plans and Service Capacities for Multi-Products with the Fixed Costs for Products Servicing)

  • 김성철
    • 경영과학
    • /
    • 제33권3호
    • /
    • pp.89-103
    • /
    • 2016
  • In this paper, we design sampling inspections and service capacities simultaneously for multi-products. Products are supplied in batches after rectifying inspections, that is, rejected lot is subject to total inspection and defective products are reworked to good ones. When supplied, all defective products are uncovered and returned to service. Particularly, we extend Kim [1] by introducing the fixed costs of providing services and show that the cost function of a product is no longer linear or convex in terms of the level of service provision. We develop a framework for a product to deal with this joint design problem and a dynamic programming algorithm for multi-products which allocates the given number of the total service capacities among products with the considerably smaller computations than the total number of possible allocations.

자율주행로봇의 최소경로계획을 위한 그래프 탐색 방법 (A Graph Search Method for Shortest Path-Planning of Mobile Robots)

  • 유진오;채호병;박태형
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
    • /
    • pp.184-186
    • /
    • 2006
  • We propose a new method for shortest path planning of mobile robots. The topological information of the graph is obtained by thinning method to generate the collision-free path of robot. And the travelling path is determined through hierarchical planning stages. The first stage generates an initial path by use of Dijkstra's algorithm. The second stage then generates the final path by use of dynamic programming (DP). The DP adjusts the intial path to reduce the total travelling distance of robot. Simulation results are presented to verify the performance of the proposed method.

  • PDF

서열의 길이에 무관한 유사도 측정 알고리즘 (A Sequence Similarity Algorithm Irrelevant to Sequence Length)

  • 김재광;이지형
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국지능시스템학회 2008년도 춘계학술대회 학술발표회 논문집
    • /
    • pp.13-16
    • /
    • 2008
  • Dynamic Programming (DP)을 이용한 서열 비교 알고리즘은 DNA, RNA, 단백질 서열의 비교와 프로그래밍 소스 코드 유사도를 측정하는 곳 등에 널리 사용되어 왔다. 이 알고리즘은 DP를 이용하여 행렬을 구성한 후, 행렬의 가장 마지막 생성 값을 이용해 두 서열의 유사도를 측정하는 방법이다. 그러나 이 알고리즘에서 사용하는 마지막 생성 값은 비교 서열이 길이에 따라 크게 좌우되기 때문에 다양한 서열들의 유사도를 알아내기에는 부적합하다. 본 논문에서는 서열의 길이에 무관한 유사도 측정 (S2) 알고리즘을 제안한다. 제안된 알고리즘을 이용하면 비교 서열의 길이에 영향을 받지 않고 정당한 서열 비교를 할 수 있다. 제안된 알고리즘의 검증을 위해 본 논문에서는 프로그램 소스 코드의 유사도 측정을 수행한다.

  • PDF

직선 조합의 에너지 전파를 이용한 고속 물체인식 (Fast Object Recognition using Local Energy Propagation from Combination of Saline Line Groups)

  • 강동중
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.311-311
    • /
    • 2000
  • We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

  • PDF

주간 단위로한 확률론적 년간 최적 저수지 경제 운용에 관한 연구 (A Study on Optimal Economic Operation of Hydro-reservoir System by Stochastic Dynamic Programming with Weekly Interval)

  • 송영길;김영태;한병률
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1987년도 정기총회 및 창립40주년기념 학술대회 학회본부
    • /
    • pp.106-108
    • /
    • 1987
  • Until now, inflow has been handled an independent log-normal random variable in the problem of planning the long-term operation of a multi-reservoir hydrothermal electric power generation system. This paper introduces the detail study for making rule curve by applying weekly time interval for handling inflows. The hydro system model consists of a set of reservoirs and ponds. Thermal units are modeld by one equivalent thermal unit. Objective is minimizing the total cost that the summation of the fuel cost of equivalent thermal unit at each time interval. For optimization, stochastic dynamic programming(SDP) algorithm using successive approximations is used.

  • PDF

영업용 물류센터 사용하에서 자가 물류센터의 크기 확장계획 모형 (Capacity Expansion Planning Model of Private Distribution Center Under Usability of Public Distribution Center)

  • 장석화
    • 산업경영시스템학회지
    • /
    • 제33권1호
    • /
    • pp.71-79
    • /
    • 2010
  • This paper addresses capacity expansion planning model of distribution center under usability of public distribution center. For discrete and finite time periods, demands for distribution center increase dynamically. The capacity expansion planning is to determine the capacity expansion size of private distribution center and usage size of public distribution center for each period through the time periods. The capacity expansion of private distribution center or lease usage of public distribution center must be done to satisfy demand increase for distribution center. The costs are capacity expansion cost and excess capacity holding cost of private distribution center, lease usage cost of public distribution center. Capacity expansion planning of minimizing the total costs is mathematically modelled. The properties of optimal solution are characterized and a dynamic programming algorithm is developed. A numerical example is shown to explain the problem.

객체지향기법을 적용한 동적경계부하배분 (DYNAMIC ECONOMIC DISPATCH USING OBJECT-ORIENTED PROGRAMMING)

  • 백영식;권규진
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1996년도 하계학술대회 논문집 B
    • /
    • pp.790-792
    • /
    • 1996
  • According to increase in electric power demand, the increasing rate of peak load compared with that of base load grows larger every year. Thus this paper deals with the optimal dynamic dispatch problem due to power rate limits and spinning reserve with loss or without loss. The first is adjusting module for gradual change of generator power by Object-Oriented Programming. The latter is an efficient dispatch module for the consideration of reasonable spinning reserve requirements. The proposed algorithm has been shown efficiency in real power system with loss.

  • PDF