Risk-Averse Time-Dependent Route Guidance by Constrained Dynamic A Search in Decentralized System Architecture

Both the risk of concentration phenomenon for the navigation system and the risk of encountering unacceptable delay are reduced by guiding risk-averse drivers along reliable paths while avoiding high-risk links as far as possible. A constrained dynamic A* algorithm is proposed to search for a reliab...

Full description

Saved in:
Bibliographic Details
Published inTransportation research record Vol. 1944; no. 1944; pp. 51 - 57
Main Authors Chen, Yanyan, Bell, Michael, Wang, Dongzhu, Bogenberger, Klaus
Format Journal Article
LanguageEnglish
Published 01.01.2006
Online AccessGet full text
ISSN0361-1981
DOI10.3141/1944-07

Cover

More Information
Summary:Both the risk of concentration phenomenon for the navigation system and the risk of encountering unacceptable delay are reduced by guiding risk-averse drivers along reliable paths while avoiding high-risk links as far as possible. A constrained dynamic A* algorithm is proposed to search for a reliable path subject to a trip duration constraint in a time-dependent road network. The efficiency of the dynamic A* search is increased by taking advantage of information computed off-line. The algorithms proposed are implemented, and their computational performance is analyzed in simulation.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0361-1981
DOI:10.3141/1944-07