Paper Titles

Robust PID Parameters Optimization Design Based on Improved Particle Swarm Optimization
p.1125

Particle Swarm Optimization with Crossover Operator for Global Optimization Problems
p.1131

Ways to Obtain Training Sample in Inversible System of Neural Network
p.1135

Framework for Emergency Decision Exercise System of Urban Crisis Based on Wargaming
p.1139

Research on Vehicle Path Planning Based on the BDD in the Uncertain Environment
p.1144

A Improved Particle Swarm Optimization and its Application in the Parameter Estimation
p.1150

Application of Improved Back Propagation Neural Network for the Recognition of Composite Insulator Hydrophobicity Grade
p.1155

Simulation Realization of Adaptive Filtering Based on a Normalized LMS Algorithm
p.1159

The Research on the BP-Neural-Network-Based Pre-Warning System for the Sustainable Forestry Economic Development
p.1164

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 373-375Research on Vehicle Path Planning Based on the BDD...

Research on Vehicle Path Planning Based on the BDD in the Uncertain Environment

Article Preview

Abstract:

Aimed at the high dynamics and uncertainty of road traffic, we propose a method combine BDD (binary decision diagram)-Based heuristic algorithm which used to do the initial path planning with BDD-Based incremental to solve the route replanning problem. In order to get the optimal path set, BDD-Based heuristic Search is firstly used for global planning. BDD is a compact data structure, the BDD-Based heuristic Search use this characteristic to represent state space and compress the search space through heuristic information at the same time; when the road network information changes, incremental replanning was used in difference type of congestion and the optimum path set again. The simulation results show that the BDD-Based heuristic Search and incremental replanning method has high efficiency and practicability in solving vehicle routing problem under dynamic and uncertain environment.

You might also be interested in these eBooks

Mechatronics, Robotics and Automation

Info:

Periodical:

Applied Mechanics and Materials (Volumes 373-375)

Pages:

1144-1149

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.373-375.1144

Citation:

Cite this paper

Online since:

August 2013

Authors:

Ya Li Peng, Jia Yao Liu, Hong Yin

Keywords:

Binary Decision Diagram (BDD) - Based Heuristic Algorithm, Dynamic Uncertain Environment, Incremental Replanning, Vehicle Path Planning

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Qingbao Zhu. Chinese Journal of Computers, 2005, 28(11): 1898-1906. In Chinese.

[2] Maoxiang Lang, siji Hu. Journal of Industrial Engineering and Engineering Management, 2004, 18(1): 81-84. In Chinese.

[3] Genjun Chen1, Guoqing Tang. Power System Technology, 2005，29(2): 23-27. In Chinese.

[4] Weihua Su, Research of the Incremental Dynamic Probabilistic Planning[D]. Dongbei: Dongbei Normal University, 2008. In Chinese.

[5] Wei Wei , Dan-Tong Yang, Shuai Lu. Chinese Journal of Computers, 2011, 34 (5): 836-846. In Chinese.

[6] McMILLAN K L．Symbolic Model Checking[M]．London：Kluwer Academic Publisher，1993.

[7] CLARKE E，GRUMBERG O，PELED D．Model Checking[M]．Boston：MIT Press，1999.

[8] LIN H M，ZHANG W H． Acta Electronica Sinica，2002，30(12A)：1907—1912. In Chinese.

[9] N B，FENG Y L，HUANG T． Journal of Software，1999，10(10)：1025—1031. In Chinese.

[10] LONG W N，YANG S M，MIN Y H，et a1. Chinese Journal of Computer，1997，20(8): 702—710. In Chinese.

[11] BEI J S，BIAN J N，XUE H X，et a1．Joural of Computer Aided Design and Computer Graphics, 1999, 05(9): 412—416. In Chinese.

[12] Edelkamp S, Reffel F. OBDDs in heuristic search. In: Herzog O, Gunter A, eds. Proc. of the 22nd Annual German Conf. on Advances in Artificial Intelligence (KI-98). LNCS 1504, New York: Springer-Verlag, 1998. 81−92.

DOI: 10.1007/bfb0095430

[13] Jensen RM, Bryant RE, Manuela M. Veloso. SetA*: An efficient BDD-based heuristic search algorithm. In: Proc. of the 18th National Conf. on Artificial Intelligence and 14th Conf. on Innovative Applications of Artificial Intelligence. AAAI-2002. Menlo Park: AAAI Press, 2002. 668−673.

[14] Jensen RM, Veloso MM, Bryant RE. State-Set branching: Leveraging BDDs for heuristic search. Artificial Intelligence, 2008, 172: 103−139.

DOI: 10.1016/j.artint.2007.05.009

[15] LV Guanfeng, SU Kaile, LIN Han. ACTC Scientiarum Naturalium Universitatis Sunyatseni, 2005, 45(1): 20-24. In Chinese.

[16] YanYan Xu, WeiYa Yue. Journal of Software, 2009, 20(9): 2352-2364. In Chinese.

[17] B. Akers. Binary decision diagrams IEEE Transactions on computers, 1978, 27(6): 509-516.

DOI: 10.1109/tc.1978.1675141