Time-dependent Hyperstar algorithm for robust vehicle navigation
Authors:
- Michael G.H. BellMBMichael G.H. Bell
- Valentina TrozziVTValentina Trozzi
- Solmaz Haji HosseinlooSHSolmaz Haji Hosseinloo
- Guido GentileGuido Gentile
- Achille FonzoneAFAchille Fonzone
- 1 June 2012
- journal article
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 46 (5) , 790-800
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Hyperstar: A multi-path Astar algorithm for risk averse vehicle navigationTransportation Research Part B: Methodological, 2009
- Reliable Pretrip Multipath Planning and Dynamic Adaptation for a Centralized Road Navigation SystemIEEE Transactions on Intelligent Transportation Systems, 2007
- Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networksIEEE Transactions on Intelligent Transportation Systems, 2002
- Least Expected Time Paths in Stochastic, Time-Varying Transportation NetworksTransportation Science, 2000
- Adaptive least-expected time paths in stochastic, time-varying transportation and data networksNetworks, 2000
- Directed hypergraphs and applicationsDiscrete Applied Mathematics, 1993
- Equilibrium traffic assignment for large scale transit networksEuropean Journal of Operational Research, 1988
- The Fastest Path through a Network with Random Time-Dependent Travel TimesTransportation Science, 1986
- A Formal Basis for the Heuristic Determination of Minimum Cost PathsIEEE Transactions on Systems Science and Cybernetics, 1968
- A note on two problems in connexion with graphsNumerische Mathematik, 1959