Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries

We describe an algorithm for stochastic path planning and applications to route planning in the presence of traffic delays. We improve on the prior state of the art by designing, analyzing, implementing, and evaluating data structures that answer approximate stochastic shortest-path queries. For example, our data structures can be used to efficiently compute paths that maximize the probability of arriving at a destination before a given time deadline. Our main theoretical result is an algorithm that, given a directed planar network with edge lengths characterized by expected travel time and variance, pre-computes a data structure in quasi-linear time such that approximate stochastic shortestpath queries can be answered in poly-logarithmic time (actual worst-case bounds depend on the probabilistic model). Our main experimental results are two-fold: (i) we provide methods to extract travel-time distributions from a large set of heterogenous GPS traces and we build a stochastic model of an entire city, and (ii) we adapt our algorithms to work for realworld road networks, we provide an efficient implementation, and we evaluate the performance of our method for the model of the aforementioned city.

[1]  Ittai Abraham,et al.  Object location using path separators , 2006, PODC '06.

[2]  Peter Sanders,et al.  Route Planning with Flexible Objective Functions , 2010, ALENEX.

[3]  Matthew Brand,et al.  Stochastic Shortest Paths Via Quasi-convex Maximization , 2006, ESA.

[4]  Moshe Lewenstein,et al.  Fast, precise and dynamic distance queries , 2011, SODA '11.

[5]  Joachim Gudmundsson,et al.  Approximate distance oracles for geometric spanners , 2008, TALG.

[6]  Mikkel Thorup.  Compact oracles for reachability and approximate distances in planar digraphs , 2004, JACM.

[7]  Hari Balakrishnan,et al.  Stochastic motion planning and applications to traffic , 2011, Int. J. Robotics Res..

[8]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[9]  J. Greenfeld.  MATCHING GPS OBSERVATIONS TO LOCATIONS ON A DIGITAL MAP , 2002 .

[10]  Wei Yu,et al.  Distance Oracles for Sparse Graphs , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[11]  John Krumm,et al.  Hidden Markov map matching through noise and sparseness , 2009, GIS.

[12]  Peter Sanders,et al.  Fast Routing in Road Networks with Transit Nodes , 2007, Science.

[13]  Stephan Winter,et al.  Modeling Costs of Turns in Route Planning , 2002, GeoInformatica.

[14]  David R. Karger,et al.  Optimal Route Planning under Uncertainty , 2006, ICAPS.

[15]  Robert Geisberger,et al.  Efficient Routing in Road Networks with Turn Costs , 2011, SEA.

[16]  Evdokia Nikolova,et al.  Approximation Algorithms for Reliable Stochastic Combinatorial Optimization , 2010, APPROX-RANDOM.

[17]  Tom Caldwell,et al.  On finding minimum routes in a network with turn penalties , 1961, CACM.

[18]  Daniel Delling,et al.  SHARC: Fast and robust unidirectional routing , 2008, JEAL.

[19]  Amos Fiat,et al.  VC-Dimension and Shortest Path Algorithms , 2011, ICALP.

[20]  Ralf-Peter Schäfer.  IQ routes and HD traffic: technology insights about tomtom's time-dynamic navigation concept , 2009, ESEC/FSE '09.

[21]  Peter Sanders,et al.  Highway Hierarchies Hasten Exact Shortest Path Queries , 2005, ESA.

[22]  David Bernstein,et al.  Some map matching algorithms for personal navigation assistants , 2000 .

[23]  Mikkel Thorup,et al.  Approximate distance oracles , 2001, JACM.

[24]  David Eppstein,et al.  Studying (non-planar) road networks through an algorithmic lens , 2008, GIS '08.

[25]  Amos Fiat,et al.  Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.

[26]  S. Lorkowski,et al.  Travel Time Measurements using GSM and GPS Probe Data , 2009 .