Encyclopedia of GIS

2017 Edition
| Editors: Shashi Shekhar, Hui Xiong, Xun Zhou

Predictive Path Planning

  • Ugur DemiryurekEmail author
  • Cyrus Shahabi
Reference work entry
DOI: https://doi.org/10.1007/978-3-319-17885-1_1567

Definition

A combination of navigation services is currently being used to find the most optimal route that minimizes travel time on road networks. For example, online maps (e.g., Google Maps, Bing Maps) help us to determine the fastest path ahead of our journey. In-car GPS navigation and smartphone applications (e.g., Waze) calculate our path and update it during the drive using real-time traffic information. Our research shows that all these services have two main shortcomings in finding the optimal path. First, online map applications offer paths based on a snapshot of traffic that displays the best path if all conditions remain constant during the entire trip duration. Those that integrate real-time traffic, such as in-car GPS navigation systems and smartphone applications, can divert drivers based on unexpected congestion but with the same...

This is a preview of subscription content, log in to check access.

References

  1. Batz GV, Delling D, Sanders P, Vetter C (2009) Time-dependent contraction hierarchies. In: ALENEX, New YorkCrossRefGoogle Scholar
  2. Delling D (2008) Time-dependent SHARC-routing. In: ESA, KarlsruhezbMATHCrossRefGoogle Scholar
  3. Delling D, Wagner D (2007) Landmark-based routing in dynamic graphs. In: WEA, RomeCrossRefGoogle Scholar
  4. Demiryurek U, Pan B, Banaei Kashani F, Shahabi C (2009) Towards modeling the traffic data on road networks. In: SIGSPATIAL-IWCTS, SeattleCrossRefGoogle Scholar
  5. Demiryurek U, Banaei Kashani F, Shahabi C (2010) A case for time-dependent shortest path computation in spatial networks. In: ACM SIGSPATIAL, San JoseCrossRefGoogle Scholar
  6. Demiryurek U, Banaei-Kashani F, Shahabi C, Ranganathan A (2011) Online computation of fastest path in time-dependent spatial networks. In: SSTD, MinneapolisCrossRefGoogle Scholar
  7. Ding B, Xu Yu J, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: EDBT, NantesCrossRefGoogle Scholar
  8. Dreyfus SE (1969) An appraisal of some shortest-path algorithms. Oper Res 17(3):395–412zbMATHCrossRefGoogle Scholar
  9. Foschini L, Hershberger J, Suri S (2012) On the complexity of time-dependent shortest paths. Algorithmica 68(4):1075–1097MathSciNetzbMATHCrossRefGoogle Scholar
  10. George B, Kim S, Shekhar S (2007) Spatio-temporal network databases and routing algorithms: a summary of results. In: SSTD, BostonGoogle Scholar
  11. Goldberg AV, Harellson C (2005) Computing the shortest path: a search meets graph theory. In: SODA, VancouverGoogle Scholar
  12. Guc B, Ranganathan A (2010) Real-time, scalable route planning using stream-processing infrastructure. In: ITSGoogle Scholar
  13. Jagadish HV, Gehrke J, Labrinidis A, Papakonstantinou Y, Patel JM, Ramakrishnan R, Shahabi C (2014) Big data and its technical challenges. Commun ACM 57(7):86–94CrossRefGoogle Scholar
  14. Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: ICDE. IEEE Computer Society, Washington, DCCrossRefGoogle Scholar
  15. Li F, Hadjieleftheriou M, Kollios G, Cheng D, Teng S-H (2008) Trip planning queries in road network databases. In: Shekhar S, Xiong H (eds) Encyclopedia of GIS. Springer, Boston, pp 1176–1181CrossRefGoogle Scholar
  16. Nannicini G, Delling D, Liberti L, Schultes D (2008) Bidirectional a* search for time-dependent fast paths. In: WEA, ProvincetownzbMATHCrossRefGoogle Scholar
  17. Pajor T, Delling D, Goldberg AV, Werneck RF (2011) Customizable route planning. In: SEA, KolimpariGoogle Scholar
  18. Pan B, Demiryurek U, Shahabi C (2012) Utilizing real-world transportation data for accurate traffic prediction. In: ICDMGoogle Scholar
  19. Pan B, Demiryurek U, Shahabi C, Gupta C (2013) Forecasting spatiotemporal impact of traffic incidents on road networks. In: ICDM, DallasCrossRefGoogle Scholar
  20. Pohl IS (1971) Bi-directional search. Mach Intell 6: 127–140MathSciNetzbMATHGoogle Scholar
  21. Potamias M, Bonchi F, Castillo C, Gionis A (2009) Fast shortest path distance estimation in large networks. In: CIKM, Hong KongCrossRefGoogle Scholar
  22. Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: SIGMOD, VancouverCrossRefGoogle Scholar
  23. Sanders P, Schultes D (2007) Engineering fast route planning algorithms. In: WEA, RomezbMATHCrossRefGoogle Scholar
  24. Wagner D, Willhalm T (2003) Geometric speed-up techniques for finding shortest paths in large sparse graphs. In: ESA, BudapestzbMATHCrossRefGoogle Scholar
  25. Zhang D (2008) Fastest-path computation. In: Shekhar S, Xiong H (eds) Encyclopedia of GIS. Springer, Boston, pp 309–313CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA
  2. 2.Information Laboratory (InfoLab), Computer Science DepartmentUniversity of Southern CaliforniaLos AngelesUSA
  3. 3.University of Southern CaliforniaLos AngelesUSA
  4. 4.Integrated Media Systems CenterUniversity of Southern CaliforniaLos AngelesUSA