Faster hyperpath generating algorithms for vehicle navigation
Faster hyperpath generating algorithms for vehicle navigation
- Neue Suche nach: Ma, Jiangshan
- Neue Suche nach: Fukuda, Daisuke
- Neue Suche nach: Schmöcker, Jan-Dirk
- Neue Suche nach: Ma, Jiangshan
- Neue Suche nach: Fukuda, Daisuke
- Neue Suche nach: Schmöcker, Jan-Dirk
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.
Dokumentinformationen
Faster hyperpath generating algorithms for vehicle navigation
Transportmetrica A: Transport Science ; 9 , 10 ; 925-948
2013-11-01
24 pages
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
Ähnliche Titel
Estimating Weights of Times and Transfers for Hyperpath Travelers
| Online Contents | 2012
Control Algorithms Charge Batteries Faster
NTRS | 2012
Some algorithms for unmanned aerial vehicle navigation
| TIBKAT | 2019
| Europäisches Patentamt | 2019