Risk-averse time-dependent route guidance by constrained dynamic A* search in decentralized system architecture

Yanyan Chen; Michael G.H. Bell; Dongzhu Wang; Klaus Bogenberger

doi:10.3141/1944-07

Risk-averse time-dependent route guidance by constrained dynamic A* search in decentralized system architecture

Yanyan Chen
, Michael G.H. Bell
, Dongzhu Wang
, Klaus Bogenberger

Beijing University of Technology
Imperial College London
National Intelligent Transport Systems Center of Engineering and Technology
BMW AG

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

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.

Original language	English
Title of host publication	Intelligent Transportation Systems and Vehicle-Highway Automation 2006
Publisher	National Research Council
Pages	51-57
Number of pages	7
Edition	1944
ISBN (Print)	0309099528, 9780309099523
DOIs	https://doi.org/10.3141/1944-07
State	Published - 2006
Externally published	Yes

Access to Document

10.3141/1944-07

Cite this

@inproceedings{d5beed24f59647a9bdbfe2694c7d017a,

title = "Risk-averse time-dependent route guidance by constrained dynamic A* search in decentralized system architecture",

abstract = "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.",

author = "Yanyan Chen and Bell, \{Michael G.H.\} and Dongzhu Wang and Klaus Bogenberger",

year = "2006",

doi = "10.3141/1944-07",

language = "English",

isbn = "0309099528",

pages = "51--57",

booktitle = "Intelligent Transportation Systems and Vehicle-Highway Automation 2006",

publisher = "National Research Council",

edition = "1944",

}

Risk-averse time-dependent route guidance by constrained dynamic A* search in decentralized system architecture. / Chen, Yanyan; Bell, Michael G.H.; Wang, Dongzhu et al.
Intelligent Transportation Systems and Vehicle-Highway Automation 2006. 1944. ed. National Research Council, 2006. p. 51-57.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Risk-averse time-dependent route guidance by constrained dynamic A* search in decentralized system architecture

AU - Chen, Yanyan

AU - Bell, Michael G.H.

AU - Wang, Dongzhu

AU - Bogenberger, Klaus

PY - 2006

Y1 - 2006

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

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

UR - https://www.scopus.com/pages/publications/33749563876

U2 - 10.3141/1944-07

DO - 10.3141/1944-07

M3 - Conference contribution

AN - SCOPUS:33749563876

SN - 0309099528

SN - 9780309099523

SP - 51

EP - 57

BT - Intelligent Transportation Systems and Vehicle-Highway Automation 2006

PB - National Research Council

ER -

Risk-averse time-dependent route guidance by constrained dynamic A* search in decentralized system architecture

Abstract

Access to Document

Other files and links

Fingerprint

Cite this