Improvement A Algorithm Based on Dynamic Consistency Assumption

Efficient dynamic shortest path algorithm in static networks plays an important role in ITS. To solve this problem, this paper brings forward the dynamic form of Consistency Assumption and Dynamic A* algorithm (A* algorithm based on dynamic lower bound, DA* algorithm) based on dynamic lower bound. D...

Full description

Saved in:
Bibliographic Details
Published inAdvanced Transportation Vol. 97-98; p. 1
Main Authors Zhu, Ling Xiang, Zou, Liang, Zhang, Zi
Format Book Chapter Journal Article
LanguageEnglish
Published Zurich Trans Tech Publications 01.01.2011
Trans Tech Publications Ltd
Subjects
General References
Transportation Engineering
ITS
Dynamic Route Guidance
Consistency Assumption
Shortest Path
Online AccessGet full text
ISBN9783037852446
3037852445
ISSN1660-9336
1662-7482
1662-7482
DOI10.4028/www.scientific.net/AMM.97-98.883

Cover

More Information
Summary:Efficient dynamic shortest path algorithm in static networks plays an important role in ITS. To solve this problem, this paper brings forward the dynamic form of Consistency Assumption and Dynamic A* algorithm (A* algorithm based on dynamic lower bound, DA* algorithm) based on dynamic lower bound. DA* algorithm and the dynamic form of Consistency Assumption are described in detail. It is proved that DA* algorithm can solve one origin node to one destination node shortest paths problem in dynamic networks, if DA* algorithm’s dynamic lower bound satisfies the dynamic form of Consistency Assumption.
Bibliography:Selected, peer reviewed papers from the 2011 International Conference on Civil Engineering and Transportation, (ICCET 2011), 14-16 October, 2011, Jinan, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISBN:9783037852446
3037852445
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.97-98.883