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. 1; pp. 51 - 57
Main Authors Chen, Yanyan, Bell, Michael G. H., Wang, Dongzhu, Bogenberger, Klaus
Format Journal Article
LanguageEnglish
Published Los Angeles, CA SAGE Publications 01.01.2006
Online AccessGet full text
ISSN0361-1981
2169-4052
DOI10.1177/0361198106194400107

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.
ISSN:0361-1981
2169-4052
DOI:10.1177/0361198106194400107