skip to main content
10.1145/1653771.1653820acmconferencesArticle/Chapter ViewAbstractPublication PagesgisConference Proceedingsconference-collections
research-article

Map-matching for low-sampling-rate GPS trajectories

Published:04 November 2009Publication History

ABSTRACT

Map-matching is the process of aligning a sequence of observed user positions with the road network on a digital map. It is a fundamental pre-processing step for many applications, such as moving object management, traffic flow analysis, and driving directions. In practice there exists huge amount of low-sampling-rate (e.g., one point every 2--5 minutes) GPS trajectories. Unfortunately, most current map-matching approaches only deal with high-sampling-rate (typically one point every 10--30s) GPS data, and become less effective for low-sampling-rate points as the uncertainty in data increases. In this paper, we propose a novel global map-matching algorithm called ST-Matching for low-sampling-rate GPS trajectories. ST-Matching considers (1) the spatial geometric and topological structures of the road network and (2) the temporal/speed constraints of the trajectories. Based on spatio-temporal analysis, a candidate graph is constructed from which the best matching path sequence is identified. We compare ST-Matching with the incremental algorithm and Average-Fréchet-Distance (AFD) based global map-matching algorithm. The experiments are performed both on synthetic and real dataset. The results show that our ST-matching algorithm significantly outperform incremental algorithm in terms of matching accuracy for low-sampling trajectories. Meanwhile, when compared with AFD-based global algorithm, ST-Matching also improves accuracy as well as running time.

References

  1. Alt, H., Efrat, A., Rote, G., and Wenk, C. 2003. Matching planar maps. In Journal of Algorithms 49, 2, 262--283, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Bing maps search (formerly Live maps search). http://cn.bing.com/ditu/. Microsoft Corporation.Google ScholarGoogle Scholar
  3. Brakatsoulas, S., Pfoser, D., Salas, R., and Wenk, C. 2005. On map-matching vehicle tracking data. In Proceedings of the 31st international Conference on Very Large Data Bases, 853--864, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Chawathe, S. S. Segment-based Map Matching. In IEEE Symposium on Intelligent Vehicles, 2007.Google ScholarGoogle Scholar
  5. Fu, L., Sun, D., and Rilett, L. R. Heuristic shortest path algorithms for transportation applications: state of the art. In Comput. Oper. Res. 33, 11, 3324--3343, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Goldberg, A. V. and Harrelson, C. 2005. Computing the shortest path: A* search meets graph theory. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete, 156--165, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Gonzalez, H., Han, J., Li, X., Myslinska, M., and Sondag, J. P. 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 794--805, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Greenfeld, J. Matching GPS observations to locations on a digital map. In Proceedings of 81th Annual Meeting of the Transportation Research Board, 2002.Google ScholarGoogle Scholar
  9. Gutman, R. Reach-based routing: a new approach to shortest path algorithms optimized for road networks. In Proceedings of 6th ALENEX, 100--111, 2004.Google ScholarGoogle Scholar
  10. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. In IEEE Transactions on system science and cybernetics, 4:100--107, 1968.Google ScholarGoogle ScholarCross RefCross Ref
  11. Hummel, B., and Tischler, K. GPS-only map matching: exploiting vehicle position history, driving restriction information and road network topology in a statistical framework. In Proceedings of the GIS Research UK Conference, 68--77, 2005.Google ScholarGoogle Scholar
  12. JAT, Nicholson. Finding the shortest route between two points in a network. In Computer Journal, 9, 275--80, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  13. J. F., Dillenburg, P. C., Nelson. Improving search efficiency using possible subgoals. In Mathematical and Computer Modeling, 22(2--7):379--414, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Jing, N., Huang, Y., and Rundensteiner, E. A. Hierarchical optimization of optimal path finding for transportation applications. In Proceedings of the Fifth international Conference on information and Knowledge Management, 261--268, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Kuehne, R. et al. New approaches for traffic management in metropolitan areas. In 10th IFAC Symposium on Control in Transportation Systems, 2003.Google ScholarGoogle Scholar
  16. Li, X., Han, J., Lee, J., and Gonzalez, H. Traffic density-based discovery of hot routes in road networks. In 10th International Symposium on Spatial and Temporal Databases, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Pfoser, D. and Jensen, C. S. Capturing the uncertainty of moving-object representations. In Proceedings of the 6th international Symposium on Advances in Spatial Databases, 111--132, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Pink, O. Hummel, B. A statistical approach to map matching using road network geometry, topology and vehicular motion constraints. In the 11th International IEEE Conference on Intelligent Transportation Systems, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  19. Samet, H., Sankaranarayanan, J., and Alborzi, H. Scalable network distance browsing in spatial databases. In Proceedings of the 2008 ACM SIGMOD international Conference on Management of Data, 43--54, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Wenk, C., Salas, R., and Pfoser, D. 2006. Addressing the need for map-matching speed: localizing global curve-matching algorithms. In Proceedings of the 18th international Conference on Scientific and Statistical Database Management, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Yin, H. and Wolfson, O. A Weight-based map matching method in moving objects databases. In Proceedings of the 16th international Conference on Scientific and Statistical Database Management, 437, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Zheng, Y., Chen, Y., Xie, X., and Ma, W. GeoLife2.0: a location-based social networking service. In proceedings of International Conference on Mobile Data Management, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Zheng, Y., Wang, L., Xie, X., and Ma, W. GeoLife-managing and understanding your past life over maps. In 9th International Conference on Mobile Data Management, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Map-matching for low-sampling-rate GPS trajectories

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      GIS '09: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
      November 2009
      575 pages
      ISBN:9781605586496
      DOI:10.1145/1653771

      Copyright © 2009 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 4 November 2009

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate220of1,116submissions,20%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader