• Title/Summary/Keyword: Dynamic Programming

Search Result 955, Processing Time 0.031 seconds

EXPLORING THE FUEL ECONOMY POTENTIAL OF ISG HYBRID ELECTRIC VEHICLES THROUGH DYNAMIC PROGRAMMING

  • Ao, G.Q.;Qiang, J.X.;Zhong, H.;Yang, L.;Zhuo, B.
    • International Journal of Automotive Technology
    • /
    • v.8 no.6
    • /
    • pp.781-790
    • /
    • 2007
  • Hybrid electric vehicles(HEV) combined with more than one power sources have great potential to improve fuel economy and reduce pollutant emissions. The Integrated Starter Generator(ISG) HEV researched in this paper is a two energy sources vehicle, with a conventional internal combustion engine(ICE) and an energy storage system(batteries). In order to investigate the potential of diesel engine hybrid electric vehicles in fuel economy improvement and emissions reduction, a Dynamic Programming(DP) based supervisory controller is developed to allocate the power requirement between ICE and batteries with the objective of minimizing a weighted cost function over given drive cycles. A fuel-economy-only case and a fuel & emissions case can be achieved by changing specific weighting factors. The simulation results of the fuel-economy-only case show that there is a 45.1% fuel saving potential for this ISG HEV compared to a conventional transit bus. The test results present a 39.6% improvement in fuel economy which validates the simulation results. Compared to the fuel-economy-only case, the fuel & emissions case further reduces the pollutant emissions at a cost of 3.2% and 4.5% of fuel consumption with respect to the simulation and test result respectively.

A Dynamic Programming Neural Network to find the Safety Distance of Industrial Field (산업 현장의 안전거리 계측을 위한 동적 계획 신경회로망)

  • Kim, Jong-Man;Kim, Won-Sub;Kim, Yeong-Min;Hwang, Jong-Sun;Park, Hyun-Chul
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2001.09a
    • /
    • pp.23-27
    • /
    • 2001
  • Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

  • PDF

Seoul National University of Science and Technology (칼라 나사 검사를 위한 표면 영역 자동 검출)

  • Song, Tae-Hoon;Ha, Jong-Eun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.1
    • /
    • pp.107-112
    • /
    • 2016
  • Fastener is a very important component that is used in various areas in industry. Recently, various color fasteners are introduced. According to this, online inspection is required in this area. In this paper, an algorithm for the automatic extraction of the surface of color fastener using color information and dynamic programming is presented. The outer boundary of fastener is found using the difference of color that enables robust processing. The inner boundary of fastener is found by dynamic programming that uses the difference of brightness value within fixed area after converting image to polar coordinate. Experiments are done using the same parameters.

Component Sizing for the Hybrid Electric Vehicle (HEV) of Our Own Making Using Dynamic Programming (동적계획법을 이용한 자작 하이브리드 자동차의 용량 매칭)

  • Kim, Gisu;Kim, Jinseong;Park, Yeong-il
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.24 no.5
    • /
    • pp.576-582
    • /
    • 2015
  • Generally, the fuel economy of hybrid electric vehicle (HEV) is effected by the size of each component. In this study the fuel economy for HEV of our own making is evaluated using backward simulator, where dynamic programming is applied. In a competition, the vehicle is running through the road course that includes many speed bumps and steep grade. Therefore, the new driving cycle including road grade is developed for the simulation. The backward simulator is also developed through modeling each component. A performance map of engine and motor for component sizing is made from the existing engine map and motor map adapted to the HEV of our own making. For optimal component sizing, the feasible region is defined by restricting the power range of power sources. Optimal component size for best fuel economy is obtained within the feasible region through the backward simulation.

Economic Analysis of Snow Damage on Sugi (Cryptomeria japonica) Forest Stands in Japan Within the Forest Stand Optimization Framework

  • Yoshimoto, Atsushi;Kato, Akio;Yanagihara, Hirokazu
    • Journal of Forest and Environmental Science
    • /
    • v.24 no.3
    • /
    • pp.143-149
    • /
    • 2008
  • We conduct economic analysis of the snow damage on sugi (Cryptomeria japonica) forest stands in Toyama Prefecture, Japan. We utilize a single tree and distant independent growth simulator called "Silv-Forest." With this growth simulator, we developed an optimization model by dynamic programming, called DP-Silv (Dynamic Programming Silv-Forest). The MS-PATH (multiple stage projection alternative technique) algorithm was embedded as a searching algorithm of dynamic programming. The height / DBH ratio was used to constrain the thinning regime for snow damage protection. The optimal rotation age turned out to be 65 years for the non-restricted case, while it was 50 years for the restricted case. The difference in NPV of these two cases as the induced costs ranged from 179,867 to 1,910,713yen/ha over the rotation age of 20 to 75 years. Under the optimal rotation of 65 years, the cost became 914,226 yen/ha. The estimated annual payment based on the difference in NPV, was from 9,869 yen/ha/yr to 85,900 yen/ha/yr. All in all, 10,000 yen/ha/yr to 20,000 yen/ha/yr seems to cover the payment from the rotation age of 35 to 75 years.

  • PDF

A Study of Criteria of the Reliability Test for C# programming software in Weapon System (C# 프로그래밍 무기체계 소프트웨어에 대한 신뢰성 시험 기준 연구)

  • Shin, Bongdeug;Oh, Hyukjun
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.12 no.4
    • /
    • pp.13-24
    • /
    • 2016
  • Defense Acquisition Program Administration's weapon system software development and management guideline specifies the criteria of software reliability tests including static and dynamic tests mainly on C/C++ languages. Recently, Defense Acquisition Program Administration expanded the scope of software reliability test for the various languages including C#, java etc. but specific criteria for them are not established. This study suggests the reliability test procedures and standards on C# programming software in weapon system. For the static test, considering the nature of the C# which depends on .NET framework, this paper introduces applying coding rules recommended by Microsoft Corp. Visual Studio 2012. Block coverage provided by Visual Studio is applied on dynamic tests and the achievement objectives for block coverage according to the software levels(A, B, C) are suggested. Also, the software reliability test procedures and standards proposed by this paper are properly verified through the case study. The result of this study can be used for establishing the specific criteria of the software reliability test for C# programming software in weapon system.

Multiple Sequence Aligmnent Genetic Algorithm (진화 알고리즘을 사용한 복수 염기서열 정렬)

  • Kim, Jin;Song, Min-Dong;Choi, Hong-Sik;Chang, Yeon-Ah
    • Korean Journal of Microbiology
    • /
    • v.35 no.2
    • /
    • pp.115-120
    • /
    • 1999
  • Multiple Sequence Alignment of DNA and protem sequences is a imnport'mt tool in the study of molecular evolution, gene regulation. and prolein suucture-function relationships. Progressive pairwise alignment method generates multiple sequence alignment fast but not necessarily with optimal costs. Dynamic programming generates multiple sequence alig~~menl with optimal costs in most cases but long execution time. In this paper. we suggest genetlc algorithm lo improve the multiple sequence alignment generated from the cnlent methods, describe the design of the genetic algorithm, and compare the multiple sequence alignments from 0111 method and current methods.

  • PDF

Development of Contig Assembly Program for Nucleotide Sequencing (염기서열 해독작업을 위한 핵산 단편 조립 프로그램의 개발)

  • 이동훈
    • Korean Journal of Microbiology
    • /
    • v.35 no.2
    • /
    • pp.121-127
    • /
    • 1999
  • An effective computer program for assembling fragments in DNA sequencing has been developed. The program, called SeqEditor (Sequence Editor), is usable on the pcrsonal computer systems of MS-Widows which is the mosl popular operating system in Korea. It c'm recd several sequence file formats such as GenBak, FASTA, and ASCII. In the SeqEditor program, a dynamic programming algorihm is applied to compute the maximalscoring overlapping alignment between each pjlr of fragments. A novel feature of the program is that SeqEdilor implemnents interaclive operation with a graphical user interface. The performance lests of the prograln 011 fragmen1 data from 16s and 18s rDNA sequencing pi-ojects produced saiisIactory results. This program may be useful to a person who has work of time with large-scale DNA sequencing projects.

  • PDF

The Minimum-cost Network Selection Scheme to Guarantee the Periodic Transmission Opportunity in the Multi-band Maritime Communication System (멀티밴드 해양통신망에서 전송주기를 보장하는 최소 비용의 망 선택 기법)

  • Cho, Ku-Min;Yun, Chang-Ho;Kang, Chung-G
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2A
    • /
    • pp.139-148
    • /
    • 2011
  • This paper presents the minimum-cost network selection scheme which determines the transmission instance in the multi-band maritime communication system, so that the shipment-related real-time information can be transmitted within the maximum allowed period. The transmission instances and the corresponding network selection process are modeled by a Markov Decision Process (MDP), for the channel model in the 2-state Markov chain, which can be solved by stochastic dynamic programming. It derives the minimum-cost network selection rule, which can reduce the network cost significantly as compared with the straight-forward scheme with a periodic transmission.

A Localized Adaptive QoS Routing Scheme Using POMDP and Exploration Bonus Techniques (POMDP와 Exploration Bonus를 이용한 지역적이고 적응적인 QoS 라우팅 기법)

  • Han Jeong-Soo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3B
    • /
    • pp.175-182
    • /
    • 2006
  • In this paper, we propose a Localized Adaptive QoS Routing Scheme using POMDP and Exploration Bonus Techniques. Also, this paper shows that CEA technique using expectation values can be simply POMDP problem, because performing dynamic programming to solve a POMDP is highly computationally expensive. And we use Exploration Bonus to search detour path better than current path. For this, we proposed the algorithm(SEMA) to search multiple path. Expecially, we evaluate performances of service success rate and average hop count with $\phi$ and k performance parameters, which is defined as exploration count and intervals. As result, we knew that the larger $\phi$, the better detour path search. And increasing n increased the amount of exploration.