In this article, the authors propose an efficient algorithm for finding a risk-averse path for use in autonomous vehicle navigation systems. When no dynamic traffic information is available, a risk-averse path can be found by a constrained A* search. The accuracy of navigation on the basis of static network data is improved by taking travel-time uncertainty into account. When dynamic traffic information in the form of broadcast traffic messages is available, rerouting is achieved by a constrained A* search, which takes congestion propagation into account. By making use of information computed at the start of the trip, the authors propose a responsive version of the constrained A* search, which reduces the on-demand response time. An experimental performance analysis of the proposed methods on grid graphs demonstrates their efficiency.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:

    Published in:

    Publication date :

    2010-07-01


    Size :

    9 pages




    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, Y. / Bell, M. G. H. / Wang, D. et al. | British Library Conference Proceedings | 2006


    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, Yanyan / Bell, Michael G. H. / Wang, Dongzhu et al. | Transportation Research Record | 2006