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.
Risk-Averse Time-Dependent Route Guidance by Constrained Dynamic A* Search in Decentralized System Architecture
Transportation Research Record: Journal of the Transportation Research Board
Transportation Research Record: Journal of the Transportation Research Board ; 1944 , 1 ; 51-57
2006-01-01
Article (Journal)
Electronic Resource
English
Transportation Research Record | 2006
|British Library Conference Proceedings | 2006
|Risk-Averse Autonomous Route Guidance by a Constrained A* Search
Online Contents | 2010
|Risk-Averse Autonomous Route Guidance by a Constrained A* Search
Taylor & Francis Verlag | 2010
|