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

REFERENCES

• Abdel-Aty , M. , Kitamura , R. and Jovanis , P. 1995 . Investigating effect of travel time variability on route choice using repeated measurement stated preference data . Transportation Research Record , 1493 : 39 – 45 .
   Google Scholar
• Bates , J. , Polak , J. , Jones , P. and Cook , A. 2001 . The valuation of reliability for personal travel . Transportation Research E , 37 : 191 – 229 .
   Google Scholar
• Bell , M. G. H. and Cassir , C. 2002 . Risk-averse user equilibrium traffic assignment: An application of game theory . Transportation Research B , 36 : 671 – 681 .
   Google Scholar
• Clark , S. and Watling , D. 2004 . Modelling network travel time reliability under stochastic demand . Transportation Research B , 39B : 1 – 22 .
   Google Scholar
• Dijkstra , E. W. 1959 . A note on two problems in connexion with graphs . Numerische Mathematik , 1 : 269 – 271 .
   Web of Science ®Google Scholar
• Ehrgott , M. and Gandibleux , X. 2000 . A survey and annotated bibliography of multi-objective combinatorial optimisation . OR Spektrum , 22 : 425 – 460 .
   Google Scholar
• Fu , L. P. and Rilett , L. R. 1998 . Expected shortest paths in dynamic and stochastic traffic networks . Transportation Research B , 32 : 499 – 516 .
   Google Scholar
• Hart , E. P. , Nilsson , N. J. and Raphael , B. 1968 . A formal basis for the heuristic determination of minimum cost paths . IEEE Transactions on Systems Science and Cybernetics , 4 : 100 – 107 .
   Web of Science ®Google Scholar
• Jacob , R. , Marathe , M. V. and Nagel , K. A computational study of routing algorithms for realistic transportation networks . Proceedings from the 2nd Workshop on Algorithmic Engineering, CITY, Germany . MONTH
   Google Scholar
• Kaparias , I. , Bell , M. G. H. and Belzner , H. 2008 . A new measure of travel time reliability for in-vehicle navigation systems . Journal of Intelligent Transportation Systems , 12 : 202 – 211 .
   Web of Science ®Google Scholar
• Kim , J. and Jung , S. W. 2002 . “ A dynamic window-based approximate shortest path re-computation method for digital road map databases in mobile environments ” . In Lecture Notes in Computer Science , 711 – 720 . Berlin : Springer .
   Google Scholar
• Koenig , S. , Likhachev , M. and Furcy , D. 2004 . Lifelong planning A* . Artificial Intelligence , 155 : 93 – 146 .
   Web of Science ®Google Scholar
• Lam , T. C. and Small , K. A. 2001 . The value of time and reliability: Measurement from a value pricing experiment . Transportation Research E , 37 : 231 – 251 .
   Google Scholar
• Liu , H. X. , Recker , W. and Chen , A. 2004 . Uncovering the contribution of travel time reliability to dynamic route choice using real-time loop data . Transportation Research A , 38 : 435 – 453 .
   Google Scholar
• Noland , R. B. , Small , K. A. , Koskenoja , P. M. and Chu , X. 1998 . Simulating travel reliability . Regional Science and Urban Economics , 28 : 535 – 564 .
   Web of Science ®Google Scholar
• Pattanamekar , P. , Park , D. , Rilett , L. R. , Lee , J. and Lee , C. 2003 . Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty . Transportation Research C , 11 : 331 – 354 .
   Web of Science ®Google Scholar
• Pu , J. , Manning , E. G. , Shoja , G. C. and Srinivasan , A. 2001 . A new algorithm to compute alternate paths in reliable OSPF (ROSPF) . Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications , 1 : 299 – 304 .
   Google Scholar
• Rouphail , N. M. , Ranjithan , S. R. , El Dessouki , W. , Smith , T. and Brill , E. D. A decision support system for dynamic pre-trip route planning . Proceedings of the 4th ASCE International Conference on Application of Advanced Technologies in Transportation . June , pp. 325 – 329 .
   Google Scholar
• Sivakumar , R. A. and Batta , R. 1994 . The variance-constrained shortest path problem . Transportation Science , 28 : 309 – 406 .
   Google Scholar
• Skiver , A. J. V. 2000 . A classification of bicriterion shortest path (BSP) algorithms . Asia-Pacific Journal of Operational Research , 17 : 199 – 212 .
   Google Scholar
• Stentz , A. Optimal and efficient path planning for partially known environments . Proceedings of the IEEE International Conference on Robotics and Automation . San Diego, California. May ,
   Google Scholar
• Stentz , A. The focused D* algorithm for real-time replanning . Proceedings of the 14th International Joint Conference on Artificial Intelligence . Montreal, Quebec, Canada. August ,
   Google Scholar
• Yen , J. Y. 1971 . Finding the k shortest loopless paths in a network . Management Science , 17 : 711 – 715 .
   Google Scholar