• Title/Summary/Keyword: dynamic programming

Search Result 952, Processing Time 0.035 seconds

Component Sizing and Evaluating Fuel Economies of a Hybrid Electric Scooter (하이브리드 이륜차의 동력원 용량 매칭 및 연비평가)

  • Lee, Dae-In;Park, Yeong-Il
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.20 no.3
    • /
    • pp.98-105
    • /
    • 2012
  • Recently, most of the countries started to regulate the emission of vehicle because of the global warming. The engine scooter is also one of the factor which cause the pollution. The hybrid system of a vehicle has many advantages such as fuel saving and emission reduction. The purpose of this study is to choose optimal size of engine, motor and battery for hybrid scooter system using Dynamic programming. The dynamic programming is an effective method to find an optimal solution for the complicated nonlinear system, which contains various constraints of control variables. The power source size of hybrid scooter was chosen through the backward simulator using dynamic programming. From the analysis, we choose the optimal size of each power source. To verify the optimal size of the power source, the Forward simulation was carried out. As a result, the fuel efficiency of hybrid scooter has significantly increased in comparison with that of engine scooter.

A Study on Optimal Electric Load Distribution and Generator Operating Mode Using Dynamic Programming (동적계획법을 이용한 발전기의 운전모드 및 최적부하 배분에 관한 연구)

  • H-H Yoo
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.26 no.3
    • /
    • pp.313-319
    • /
    • 2002
  • Since the oil crisis in 1970, a great deal of effort has been made to develop automatic electric load sharing systems as a part of the efforts to save energy. A large scale electric generating system composes more than two generators whose characteristics may be different. When such a system is operated individually or in parallel, the lagrange multiplier's method has difficulty in achieving optimal load distribution because generators usually have the limitations of the operating range with inequality constraints. Therefore, a suitable operating mode of generators has to be decided according to the selection of the generators to meet electric power requirements at the minimum cost. In this study, a method which solves the optimal electric load distribution problem using the dynamic programming technique is proposed. This study also shows that the dynamic programming method has an advantage in dealing with the optimal load distribution problem under the limitations of the operating range with inequality constraints including generator operation mode. In this study, generator operating cost curve of second order equation by shop trial test results of diesel generators are used. The results indicate that the proposed method can be applied to the ship's electric generating system.

Detention System Design Model with consideration of the rainfall distribution and mutual connection (강우 분포 및 상호 관련성을 고려한 유수체계 설계 모형)

  • Lee, Beom-Hui
    • The Journal of Engineering Research
    • /
    • v.6 no.1
    • /
    • pp.75-81
    • /
    • 2004
  • To solve the urban flood problems, it must get the enough channel conveyances and pumping capacities. It needs set up the detention system to control the flow over the channel capacity. Inspite of this detention system, the peak flow may increased by rainfall distribution and the delay of flow. This shows a design model of detention system which can consider the time problems from mutual connections of the detention storages and pumping flow using IDP(Incremental Dynamic Programming) method.

  • PDF

Analog Celluar Nonlinear Circuits-Based Dynamic Programming with Subgoal Setting (서브 골 설정에 의한 아날로그 셀룰라 비선형 회로망 기반 동적계획법)

  • Kim, Hyong-Suk;Park, Jin-Hee;Son, Hong-Rak;Lee, Jae-Chul;Lee, Wang-Hee
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.49 no.10
    • /
    • pp.582-590
    • /
    • 2000
  • A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits(CNC) is proposed. The analog circuits based optimal path planning is very useful since most of the optimal path planning problems require real time computation. There has already been a previous study to implement the dynamic programming with analog circuits. However, it could not be applied for the practically large size of problems since the algorithm employs the mechanism of reducing its input current/voltage by the amount of cost, which causes outputs of distant cells to become zero. In this study, a subgoal-based dynamic programming algorithm to compute the optimal path is proposed. In the algorithm, the optimal paths are computed regardless of the distance between the starting and the goal points. It finds subgoals starting from the starting point when the output of the starting cell is raised from its initial value. The subgoal is set as the next initial position to find the next subgoal until the final goal is reached. The global optimality of the proposed algorithm is discussed and two different kinds of simulations have been done for the proposed algorithm.

  • PDF

Dynamic Programming-based Stereo Matching Using Image Segmentation (영상 분할을 이용한 다이내믹 프로그래밍 기반의 스테레오 정합)

  • Seo, Yong-Seok;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8C
    • /
    • pp.680-688
    • /
    • 2010
  • In this paper, we present a dynamic programming(DP)-based stereo matching method using image segmentation algorithm. DP has been a classical and popular optimization method for various computer vision problems including stereo matching. However, the performance of conventional DP has not been satisfactory when it is applied to the stereo matching since the vertical correlation between scanned lines has not been properly considered. In the proposed algorithm, accurate edge information is first obtained from segmented image information then we considers the discontinuity of disparity and occlusions region based on the obtained edge information. The experimental results applied to the Middlebury stereo images demonstrate that the proposed algorithm has better performances in stereo matching than the previous DP based algorithms.

Development of Detention System Design Model with Consideration of the Rainfall Distribution and Mutual Connection (강우 분포 및 상호 관련성을 고려한 유수체계의 최적 설계 모형 개발)

  • Lee, BeumHee
    • Journal of the Korean Geophysical Society
    • /
    • v.7 no.2
    • /
    • pp.151-155
    • /
    • 2004
  • To solve the urban flood problems, it must get the enough channel conveyances and pumping capacities. It needs set up the detention system to control the flow over the channel capacity. Inspite of this detention system, the peak flow may increased by rainfall distribution and the delay of flow. This shows a design model of detention system which can consider the time problems from mutual connections of the detention storages and pumping flow using IDP(Incremental Dynamic Programming) method.

  • PDF

Application to Generation Expansion Planning of Evolutionary Programming (진화 프로그래밍의 전원개발계획에의 적용 연구)

  • Won, Jong-Ryul
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.50 no.4
    • /
    • pp.180-187
    • /
    • 2001
  • This paper proposes an efficient evolutionary programming algorithm for solving a generation expansion planning(GEP) problem known as a highly-nonlinear dynamic problem. Evolutionary programming(EP) is an optimization algorithm based on the simulated evolution (mutation, competition and selection). In this paper, new algorithm is presented to enhance the efficiency of the EP algorithm for solving the GEP problem. By a domain mapping procedure, yearly cumulative capacity vectors are transformed into one dummy vector, whose change can yield a kind of trend in the cost value. To validate the proposed approach, this algorithm is tested on two cases of expansion planning problems. Simulation results show that the proposed algorithm can provide successful results within a resonable computational time compared with conventional EP and dynamic programming.

  • PDF

Fast Disparity Estimation Method Considering Temporal and Spatial Redundancy Based on a Dynamic Programming (시.공간 중복성을 고려한 다이내믹 프로그래밍 기반의 고속 변이 추정 기법)

  • Yun, Jung-Hwan;Bae, Byung-Kyu;Park, Se-Hwan;Song, Hyok;Kim, Dong-Wook;Yoo, Ji-Sang
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.10C
    • /
    • pp.787-797
    • /
    • 2008
  • In this paper, we propose a fast disparity estimation method considering temporal and spatial redundancy based on a dynamic programming for stereo matching. For the first step, the dynamic programming is performed to estimate disparity vectors with correlation between neighboring pixels in an image. Next, we efficiently compensate regions, which disparity vectors are not allocated, with neighboring disparity vectors assuming that disparity vectors in same object are quite similar. Moreover, in case of video sequence, we can decrease a complexity with temporal redundancy between neighboring frames. For performance comparison, we generate an intermediate-view image using the estimated disparity vector. Test results show that the proposed algorithm gives $0.8{\sim}2.4dB$-increased PSNR(peak signal to noise ratio) compared to a conventional block matching algorithm, and the proposed algorithm also gives approximately 0.1dB-increased PSNR and $48{\sim}68%$-lower complexity compared to the disparity estimation method based on general dynamic programming.

Development of Optimal Design Simulation Model for Least Cost Urban Sewer System Considering Risk (I) (위험도를 고려한 최소비용 도시우수관망 설계의 최적화 모형개발 (I): 모형의 개발과 시험유역의 적용)

  • Jang, Suk-Hwan;Park, Sang-Woo
    • Journal of Korea Water Resources Association
    • /
    • v.38 no.12 s.161
    • /
    • pp.1021-1028
    • /
    • 2005
  • This study purpose to develop simulation model of optimal design condition of urban storm sewer system considering risk. Urban Storm Sewer Optimal Design Model(USSOD) can compute pipe capacity, pipe slope, crown elevation, excavation depth, risk and return cost in the condition of design discharge. Rational formula is adopted for design discharge and Manning's formula is used for pipe capacity. Discrete differential dynamic programming(DDDP) technique which is a kind of dynamic programming(DP) is used for optimization and first order second moment approximation method and uncertainty analysis is also for developing model. USSOD is applied to hypothetical drainage basin to test and verify, which resulted economical and efficient design in urban drainage sewer system.

Automated Measurement System of Carotid Artery Intima-Media Thickness based on Dynamic Programming (다이나믹 프로그래밍 기반 경동맥 내막-중막 두께 자동측정 시스템)

  • Lee, Yu-Bu;Kim, Myoung-Hee
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.1
    • /
    • pp.21-29
    • /
    • 2007
  • In this paper, we present a method of detecting the boundary of the intima-media complex for automated measurement based on dynamic programming from carotid artery B-mode ultrasound images and then show the experimental results. We apply the dynamic programming for determining the optimal locations that a cost function is minimized. The cost function includes cost terms which are representing image features such as intensity, intensity gradient and geometrical continuity of the vessel interfaces. Moreover, we improve the boundary continuity by applying the B-spline to smooth the rough boundary due to noise such as speckle, dropout and weak edges. The proposed method has obtained more accurate reproducible results than conventional edge-detection by considering multiple image features and ensures efficient automated measurement by solving the problems of the inter- and intra-observer variability and its inefficiency due to manual measurement.

  • PDF