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.


    Access

    Download

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Additional title:

    Transportation Research Record: Journal of the Transportation Research Board


    Contributors:


    Publication date :

    2006-01-01




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



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

    Chen, Yanyan / Bell, Michael / Wang, Dongzhu et al. | Transportation Research Record | 2006


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

    Chen, Y. / Bell, M. G. H. / Wang, D. et al. | British Library Conference Proceedings | 2006




    Risk-Averse Autonomous Route Guidance by a Constrained A* Search

    Chen, Yanyan / Bell, Michael G. H. / Bogenberger, Klaus | Taylor & Francis Verlag | 2010