Skip to main content

Encoding Travel Traces by Using Road Networks and Routing Algorithms

  • Conference paper
Intelligent Interactive Multimedia: Systems and Services

Abstract

Large numbers of travel traces are collected by vehicles and stored for applications such as optimizing delivery routes, predicting and avoiding traffic, and providing directions. Many of the applications preprocess the travel traces, usually composed of position data, by matching these with links in the underlying road network. This paper addresses the problem of persistent storage of large numbers of vehicle travel traces. We propose two methods for using a routing algorithm and road network to encode a travel trace formed by a sequence of links. An encoded trace, composed of a few links, is useful to store or share and can be decoded into the original travel trace. Considering that drivers tend to proceed from an origin to a destination by using the shortest path or going as straight as possible, the two proposed methods use the following two routing algorithms: a shortest path algorithm; and a following path algorithm, which finds the path that avoids turns. The experimental results for 30 real traces show that a travel trace is encoded into only 5% or 7% of its links on average using the shortest path algorithm or the following path algorithm, respectively.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Xue, G., Li, Z., Zhu, H., Liu, Y.: Traffic-known urban vehicular route prediction based on partial mobility patterns. In: Proc. ICPADS, pp. 369–375 (2009)

    Google Scholar 

  2. Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: Proc. GIS, pp. 99–108 (2010)

    Google Scholar 

  3. McMaster, R.B.: Automated line generalization. Cartographica 24(2), 74–111 (1987)

    Article  MathSciNet  Google Scholar 

  4. Leu, J.G., Chen, L.: Polygonal approximation of 2-D shapes through boundary merging. Pattern Recognition Letters 7(4), 231–238 (1988)

    Article  Google Scholar 

  5. Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proc. 31st Int’l Conf. on Very Large Data Bases (VLDB 2005), pp. 853–864 (2005)

    Google Scholar 

  6. Yuan, J., Zheng, Y., Zhang, C., Xie, X., Sun, G.-Z.: An interactive-voting based map matching algorithm. In: Proc. 11th Int’l Conf. on Mobile Data Management (MDM), pp. 43–52 (2010)

    Google Scholar 

  7. Cao, H., Wolfson, O., Trajcevski, G.: Spatio-temporal data reduction with deterministic error bounds. VLDB Journal 15(3), 211–228 (2006)

    Article  Google Scholar 

  8. Hönle, N., Grossmann, M., Reimann, S., Mitschang, B.: Usability analysis of compression algorithms for position data streams. In: Proc. 18th ACM SIGSPATIAL Int’l Conf. on Advances in Geographic Information Systems, pp. 240–249 (2010)

    Google Scholar 

  9. Takahashi, N.: An elastic map system with cognitive map-based operations. In: International Perspectives on Maps and Internet. Lecture Notes in Geoinformation and Cartography, pp. 73–87 (2008)

    Google Scholar 

  10. Yamamoto, D., Ozeki, S., Takahashi, N.: Focus+Glue+Context: an improved fisheye approach for web map services. In: Proc. 17th ACM SIGSPATIAL Int’l Conf. on Advances in Geographic Information Systems, pp. 101–110 (2009)

    Google Scholar 

  11. Dijkstra, E.W.: A note on two problems in connection with graph theory. Numerische Mathematik 1, 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  12. Idwan, S., Etaiwi, W.: Dijkstra algorithm heuristic approach for large graph. Journal of Applied Sciences 11, 2255–2259 (2011)

    Article  Google Scholar 

  13. Cho, H.-J., Lan, C.-L.: Hybrid shortest path algorithm for vehicle navigation. Journal of Supercomputing 49(2), 234–247 (2009)

    Article  MathSciNet  Google Scholar 

  14. Huang, Y.-W., Jing, N., Rundensteiner, E.A.: A semi-materialized view approach for route maintenance in IVHS. In: Proc. 2nd ACM Workshop on Geographic Information Systems, pp. 144–151 (1994)

    Google Scholar 

  15. Huang, Y.-W., Jing, N., Rundensteiner, E.A.: A hierarchical path view model for path finding in intelligent transportation systems. GeoInformatica 1(2), 125–159 (1997)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pablo Martinez Lerin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lerin, P.M., Yamamoto, D., Takahashi, N. (2012). Encoding Travel Traces by Using Road Networks and Routing Algorithms. In: Watanabe, T., Watada, J., Takahashi, N., Howlett, R., Jain, L. (eds) Intelligent Interactive Multimedia: Systems and Services. Smart Innovation, Systems and Technologies, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29934-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29934-6_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29933-9

  • Online ISBN: 978-3-642-29934-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics