This article interprets hyperpath in the context of risk-averse vehicle navigation and proposes several accelerated algorithms for generating hyperpaths based on studies in shortest path problems. A hyperpath search can be accelerated in two ways: first, by using the optimistic travel time as heuristic node potentials and, second, by introducing a node-directed search that reduces the node/link set to be checked. These two acceleration techniques can be applied independently or jointly to the existing Spiess and Florian (SF) algorithm or hyperpath-Dijkstra algorithm without changing the hyperpath, which results in eight algorithms including the existing ones. Having investigated the performance of each algorithm numerically in both synthetic and real traffic networks, we found that the optimistic node potential-based SF algorithm implemented by a node-directed search was the best one for the traffic networks tested.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Faster hyperpath generating algorithms for vehicle navigation


    Contributors:

    Published in:

    Publication date :

    2013-11-01


    Size :

    24 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English






    Estimating Weights of Times and Transfers for Hyperpath Travelers

    Kurauchi, Fumitaka / Schmöcker, Jan-Dirk / Fonzone, Achille et al. | Transportation Research Record | 2012


    Some algorithms for unmanned aerial vehicle navigation

    Larin, Vladimir B. / Tunik, Anatoly A. / Ilnytska, Svitlana I. | TIBKAT | 2019