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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Advanced Transportation Ročník 97-98; s. 1
Hlavní autoři: Zhu, Ling Xiang, Zou, Liang, Zhang, Zi
Médium: Kapitola Journal Article
Jazyk:angličtina
Vydáno: Zurich Trans Tech Publications 01.01.2011
Trans Tech Publications Ltd
Témata:
General References
Transportation Engineering
ITS
Dynamic Route Guidance
Consistency Assumption
Shortest Path
ISBN:9783037852446, 3037852445
ISSN:1660-9336, 1662-7482, 1662-7482
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie: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