Fast stochastic routing under time-varying uncertainty

Data are increasingly available that enable detailed capture of travel costs associated with the movements of vehicles in road networks, notably travel time, and greenhouse gas emissions. In addition to varying across time, such costs are inherently uncertain, due to varying traffic volumes, weather conditions, different driving styles among drivers, etc. In this setting, we address the problem of enabling fast route planning with time-varying, uncertain edge weights. We initially present a practical approach to transforming GPS trajectories into time-varying, uncertain edge weights that guarantee the first-in-first-out property. Next, we propose time-dependent uncertain contraction hierarchies (TUCHs), a generic speed-up technique that supports a wide variety of stochastic route planning functionality in the paper’s setting. In particular, we propose query processing methods based on TUCH for two representative types of stochastic routing: non-dominated routing and probabilistic budget routing. Experimental studies with a substantial GPS data set offer insight into the design properties of the paper’s proposals and suggest that they are capable of enabling efficient stochastic routing.

[1]  Christian S. Jensen,et al.  EcoMark: evaluating models of vehicular environmental impact , 2012, SIGSPATIAL/GIS.

[2]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[3]  Christian S. Jensen,et al.  Enabling Time-Dependent Uncertain Eco-Weights For Road Networks , 2014, GeoRich'14.

[4]  Christian S. Jensen,et al.  Outlier Detection for Multidimensional Time Series Using Deep Neural Networks , 2018, 2018 19th IEEE International Conference on Mobile Data Management (MDM).

[5]  Christian S. Jensen,et al.  EcoMark 2.0: empowering eco-routing with vehicular environmental models and actual vehicle fuel consumption data , 2014, GeoInformatica.

[6]  Aoying Zhou,et al.  Finding Top-k Optimal Sequenced Routes , 2018, 2018 IEEE 34th International Conference on Data Engineering (ICDE).

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

[8]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

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

[10]  Rolf H. Möhring,et al.  Acceleration of Shortest Path and Constrained Shortest Path Computation , 2005, WEA.

[11]  Eric Horvitz,et al.  Trip Router with Individualized Preferences (TRIP): Incorporating Personalization into Route Planning , 2006, AAAI.

[12]  Masashi Sugiyama,et al.  Trajectory Regression on Road Networks , 2011, AAAI.

[13]  Hani S. Mahmassani,et al.  Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks , 1998 .

[14]  Christian S. Jensen,et al.  Finding non-dominated paths in uncertain road networks , 2016, SIGSPATIAL/GIS.

[15]  H. Nussbaumer Fast Fourier transform and convolution algorithms , 1981 .

[16]  Zbigniew S. Kolber,et al.  Monte Carlo convolution method for simulation and analysis of fluorescence decay data , 1991 .

[17]  Christian S. Jensen,et al.  Path Cost Distribution Estimation Using Trajectory Data , 2016, Proc. VLDB Endow..

[18]  Ugur Demiryurek,et al.  Probabilistic estimation of link travel times in dynamic road networks , 2015, SIGSPATIAL/GIS.

[19]  M. A. ShehnazBegum,et al.  T-Drive: Enhancing Driving Directions with Taxi Drivers' Intelligence , 2014 .

[20]  Christian S. Jensen,et al.  Distinguishing Trajectories from Different Drivers using Incompletely Labeled Trajectories , 2018, CIKM.

[21]  Christian S. Jensen,et al.  Risk-aware path selection with time-varying, uncertain travel costs: a time series approach , 2018, The VLDB Journal.

[22]  Francisco C. Pereira,et al.  An off-line map-matching algorithm for incomplete map databases , 2009 .

[23]  Yang Du,et al.  Finding Fastest Paths on A Road Network with Speed Patterns , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[24]  B. Mobasseri Path planning under uncertainty from a decision analytic perspective , 1989, Proceedings. IEEE International Symposium on Intelligent Control 1989.

[25]  C. C. Heyde,et al.  Central Limit Theorem , 2006 .

[26]  Guanfeng Liu,et al.  Reference-Based Framework for Spatio-Temporal Trajectory Compression and Query Processing , 2020, IEEE Transactions on Knowledge and Data Engineering.

[27]  Christian S. Jensen,et al.  Toward personalized, context-aware routing , 2015, The VLDB Journal.

[28]  Christian S. Jensen,et al.  PACE: a PAth-CEntric paradigm for stochastic path finding , 2017, The VLDB Journal.

[29]  Jian Dai,et al.  Personalized route recommendation using big trajectory data , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[30]  Bin Yang,et al.  Stochastic Shortest Path Finding in Path-Centric Uncertain Road Networks , 2018, 2018 19th IEEE International Conference on Mobile Data Management (MDM).

[31]  Christian S. Jensen,et al.  Outlier Detection for Time Series with Recurrent Autoencoder Ensembles , 2019, IJCAI.

[32]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[33]  Christian S. Jensen,et al.  Using Incomplete Information for Complete Weight Annotation of Road Networks , 2013, IEEE Transactions on Knowledge and Data Engineering.

[34]  Andrew V. Goldberg,et al.  A Hub-Based Labeling Algorithm for Shortest Paths in Road Networks , 2011, SEA.

[35]  Christian S. Jensen,et al.  Stochastic skyline route planning under time-varying uncertainty , 2014, 2014 IEEE 30th International Conference on Data Engineering.

[36]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[37]  Vassilis J. Tsotras,et al.  Engineering Generalized Shortest Path queries , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

[38]  Christian S. Jensen,et al.  Travel Cost Inference from Sparse, Spatio-Temporally Correlated Time Series Using Markov Models , 2013, Proc. VLDB Endow..

[39]  Shashi Shekhar,et al.  Time-Aggregated Graphs for Modeling Spatio-temporal Networks , 2006, J. Data Semant..

[40]  Zhaowang Ji,et al.  Path finding under uncertainty , 2005 .

[41]  Christian S. Jensen,et al.  Stochastic Weight Completion for Road Networks Using Graph Convolutional Networks , 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE).

[42]  Jian Pei,et al.  Probabilistic path queries in road networks: traffic uncertainty aware path selection , 2010, EDBT '10.

[43]  Michael P. Wellman,et al.  Path Planning under Time-Dependent Uncertainty , 1995, UAI.

[44]  Aoying Zhou,et al.  Finding Top-k Shortest Paths with Diversity , 2018, IEEE Transactions on Knowledge and Data Engineering.

[45]  Christian S. Jensen,et al.  Towards Total Traffic Awareness , 2014, SGMD.

[46]  Jeffrey Xu Yu,et al.  Finding time-dependent shortest paths over large graphs , 2008, EDBT '08.

[47]  Christian S. Jensen,et al.  Learning to Route with Sparse Trajectory Sets , 2018, 2018 IEEE 34th International Conference on Data Engineering (ICDE).

[48]  Nicholas Jing Yuan,et al.  Online Discovery of Gathering Patterns over Trajectories , 2014, IEEE Transactions on Knowledge and Data Engineering.

[49]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..