Skip to main content
SpringerLink
Log in

Dynamic Transportation Navigation

  • Chapter
  • First Online:
Moving Objects Management

  • 887 Accesses

Abstract

The widespread use of GPS navigation and trip planning on web has aroused considerable interests in fast and scalable path query processing. Existing research has mainly focused on static route optimization where the traffic network is assumed to be stable. Nevertheless, in most cases, route planning is in presence of frequent updates to the traffic graph due to the dynamic nature of traffic network, and such updates always greatly affect the performance of route planning. Most existing methods, however, cannot efficiently support traffic aware route planning. In this chapter, we overview some existing approaches for dynamic transportation navigation, and then introduce an novel traffic aware route planning strategy, in which a set of effective techniques are employed to avoid both unnecessary calculations on huge graph and excessive re-calculations caused by traffic condition updates.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bast H, Funke S, Matijevic D, Sanders P, Schultes D (2007) In transit to constant time shortest-path queries in road networks. In: Proceedings of the workshop on algorithm engineering and experiments (ALENEX 2007), New Orleans

    Google Scholar 

  2. Chen S, Tu YC, Xia Y (2011) Performance analysis of a dual-tree algorithm for computing spatial distance histograms. VLDB J 20(4):471–494

    Article  Google Scholar 

  3. Demiyurek U, Kashani FB, Shahabi C, Ranganathan A (2011) Online computation of fastest path in time-dependent spatial networks. In: Proceedings of 12th international symposium on spatial and temporal databases (SSTD 2011), Minneapolis, pp 92–111

    Google Scholar 

  4. Deng K, Zhou X, Shen HT (2007) Multi-source skyline query processing in road networks. In: Proceedings of the 23rd international conference on data engineering (ICDE 2007), Istanbul, pp 796–805

    Google Scholar 

  5. Ding B, Yu JX, Qin L (2008) Finding time-dependent shortest paths over large graphs. In: Proceedings of the 11th international conference on extending database technology (EDBT 2008), Nantes, pp 205–216

    Google Scholar 

  6. Gao J, Jin R, Zhou J, Yu JX, Jiang X, Wang T (2011) Relational approach for shortest path discovery over large graphs. Proc PVLDB 5(4):358–369

    Google Scholar 

  7. Gao J, Qiu H, Jiang X, Wang T, Yang D (2010) Fast top-k simple shortest paths discovery in graphs. In: Proceedings of the 19th ACM conference on information and knowledge management (CIKM 2010), Toronto, pp 509–518

    Google Scholar 

  8. Geisberger R, Sanders P, Schultes D, Delling D (2008) Faster and simpler hierarchical routing in road networks. In: Proceedings of 7th international workshop WEA 2008, Provincetown, pp 319–333

    Google Scholar 

  9. Goldberg A, Harrelson C (2005) Computing the shortest path, a search meets graph theory. In: Proceedings of the 6th annual ACM-SIAM symposium on discrete algorithms (SODA 2005), Vancouver, pp 156–165

    Google Scholar 

  10. Gonzalez H, Han J, Li X, Myslinska M, Sondag J (2007) Adaptive fastest path computation on a road network: a traffic mining approach. In: Proceedings of the 33rd international conference on very large data bases (VLDB 2007), Vienna, pp 794–805

    Google Scholar 

  11. Gunturi V, Nunes E, Yang K, Shekhar S (2011) A critical-time-point approach to all-start-time Lagrangian shortest paths: a summary of results. In: Proceedings of 12th international symposium on spatial and temporal databases (SSTD 2011), Minneapolis, pp 74–91

    Google Scholar 

  12. Hua M, Pei J (2010) Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: Proceedings of the 13th international conference on extending database technology (EDBT 2010), Lausanne, pp 347–358

    Google Scholar 

  13. Huang B, Wu Q, Zhan F (2007) A shortest path algorithm with novel heuristics for dynamic transportation networks. Int J Geogr Inf Sci 21(6):625–644

    Article  Google Scholar 

  14. Kanoulas E, Du Y, Xia T, Zhang D (2006) Finding fastest paths on a road network with speed patterns. In: Proceedings of the 22nd international conference on data engineering (ICDE 2006), Atlanta, p 10

    Google Scholar 

  15. Koenig S, Likhachev M, Furcy D (2004) Lifelong planning A*. Artif Intell 155(1–2):93–146

    Article  MATH  MathSciNet  Google Scholar 

  16. Kriegel H, Renz M, Schubert M (2010) Route skyline queries: a multi-preference path planning approach. In: Proceedings of the 26th international conference on data engineering (ICDE 2010), Long Beach, pp 261–272

    Google Scholar 

  17. Li F, Chen D, Hadjieleftheriou M, Kollios G, Teng S (2005) On trip planning queries in spatial databases. In: Proceedings of 7th international symposium on spatial and temporal databases (SSTD 2005), Angra dos Reis, pp 273–290

    Google Scholar 

  18. Likhachev M, Ferguson D, Gordon G, Stentz A, Thrun S (2005) Anytime dynamic A*: an anytime, replanning algorithm. In: Proceedings of ICAPS 2005, Monterey, pp 262–271

    Google Scholar 

  19. Malviya N, Madden S, Bhattacharya A (2011) A continuous query system for dynamic route planning. In: Proceedings of the 27th international conference on data engineering (ICDE 2011), Hannover, pp 792–803

    Google Scholar 

  20. Mouratidis K, Yiu M, Papadias D, Mamoulis N (2006) Continuous nearest neighbor monitoring in road networks. In: Proceedings of the 32nd international conference on very large data bases (VLDB 2006), Seoul, pp 43–54

    Google Scholar 

  21. Potamias M, Bonchi F, Castillo C, Gionis A (2009) Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM conference on information and knowledge management (CIKM 2009), Hong Kong, pp 867–876

    Google Scholar 

  22. Rice M, Tsotras V (2010) Graph indexing of road networks for shortest path queries with label restrictions. Proc PVLDB 4(2):69–80

    Google Scholar 

  23. Samet H, Sankaranarayanan J, Alborzi H (2008) Scalable network distance browsing in spatial databases. In: Proceedings of the ACM SIGMOD international conference on management of data (SIGMOD 2008), Vancouver, pp 43–54

    Google Scholar 

  24. Sanders P, Schultes D (2005) Highway hierarchies hasten exact shortest path queries. In: Proceedings of ESA 2005, Palma de Mallorca, pp 568–579

    Google Scholar 

  25. Sankaranarayanan J, Samet H, Alborzi H (2009) Path oracles for spatial networks. Proc PVLDB 2(1):1210–1221

    Google Scholar 

  26. Stentz A (1994) Optimal and efficient path planning for partially-known environments. In: Proceedings of the international conference on robotics and automation, San Diego, pp 3310–3317

    Google Scholar 

  27. Xiao Y, Wu W, Pei J, Wang W, He Z (2009) Efficiently indexing shortest paths by exploiting symmetry in graphs. In: Proceedings of the 12th international conference on extending database technology (EDBT 2009), Saint-Petersburg, pp 493–504

    Google Scholar 

  28. Xu J, Guo L, Ding Z, Sun X, Liu C (2012) Traffic aware route planning in dynamic road networks. In: Proceedings of the 17th international conference on database systems for advanced applications (DASFAA 2012), Busan, pp 576–591

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Renmin University of China, Beijing, China

    Xiaofeng Meng

  2. Chinese Academy of Sciences, Beijing, China

    Zhiming Ding & Jiajie Xu

Authors
  1. Xiaofeng Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhiming Ding
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jiajie Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Tsinghua University Press, Beijing and Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Meng, X., Ding, Z., Xu, J. (2014). Dynamic Transportation Navigation. In: Moving Objects Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38276-5_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38276-5_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38275-8

  • Online ISBN: 978-3-642-38276-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation