Skip to main content

An Incremental Map Matching Algorithm Based on Weighted Shortest Path

  • Conference paper
  • First Online:
Algorithms and Architectures for Parallel Processing (ICA3PP 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11334))

  • 1544 Accesses

Abstract

GPS (global position system) trajectories collected by urban cars depict the citizens’ daily trips and reflect the traffic situation in city areas. The process called map matching is to match the GPS point sequence to the corresponding road which is the fundamental step for further travel pattern mining and transport situation analysis. The existing research based on the incremental map matching applies only to GPS trajectories of high-sampling-rate (0 to 30 s). However most actually collected GPS trajectories are with a low-sampling-rate (more than 2 min) for saving the collection and transmission costs. In this paper, we proposed an incremental map matching algorithm based on weighted shortest path, called WSI-matching. By matching single GPS point to its candidate road and filling the missing path between two GPS points, it improves the overall matching accuracy with a relatively low time complexity compared to the traditional global matching algorithm. Experiment results show that our WSI-matching algorithm present obvious advantages over traditional incremental algorithms and global algorithms in terms of both matching accuracy and running time, and it adapts to either high-sampling-rate trajectories or low-sampling-rate trajectories.

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 39.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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://www.openstreetmap.org/export.

References

  1. Gao, W.C., Li, G.L., Ta, N.: Map matching algorithm: a survey. J. Softw. 02, 225–250 (2018)

    Google Scholar 

  2. Shim, C., Kim, W., Wan, H., et al.: Nearest close friend search in geo-social networks. Inf. Sci. 423, 235–256 (2018). https://doi.org/10.1016/j.ins.2017.09.049

    Article  MathSciNet  Google Scholar 

  3. Sharma, K.P., Pooniaa, R.C., Sunda, S.: Map matching algorithm: curve simplification for Frechet distance computing and precise navigation on road network using RTKLIB. Cluster Comput. 2, 1–9 (2018)

    Google Scholar 

  4. Liu, X., Liu, K., Li, M., et al.: A ST-CRF map-matching method for low-frequency floating car data. IEEE Trans. Intell. Transp. Syst. 18(5), 1241–1254 (2017)

    Article  Google Scholar 

  5. Gui, Z., Yu, H., Tang, Y.: Locating traffic hot routes from massive taxi tracks in clusters. J. Inf. Sci. Eng. 32(1), 113–131 (2016)

    Google Scholar 

  6. Yuan, N.J., Zheng, Y., Xie, X., et al.: Discovering urban functional zones using latent activity trajectories. IEEE Trans. on Knowl. Data Eng. 27(3), 712–725 (2015)

    Article  Google Scholar 

  7. Ming, X., Du, Y., Wu, J., et al.: Map matching based on conditional random fields and route preference mining for uncertain trajectories. Math. Prob. Eng. 2015 (2015). http://dx.doi.org/10.1155/2015/717095

  8. Yuan, N.J., Zheng, Y., Xie, X., et al.: Discovering urban functional zones using latent activity trajectories. IEEE Trans. Knowl. Data Eng. 27(3), 712–725 (2015)

    Article  Google Scholar 

  9. Szwed, P., Pekala, K.: An incremental map-matching algorithm based on hidden markov model. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2014. LNCS (LNAI), vol. 8468, pp. 579–590. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-07176-3_51

    Chapter  Google Scholar 

  10. Shang, J., Zheng, Y., Tong, W., et al.: Inferring gas consumption and pollution emission of vehicles throughout a city, pp. 1027–1036. ACM (2014)

    Google Scholar 

  11. Lint, H.V.: Network-wide traffic state estimation using loop detector and floating car data. J. Intell. Transp. Syst. 18(1), 41–50 (2014)

    Article  Google Scholar 

  12. Greenfeld, J.S.: Matching GPS observations to locations on a digital map. In: Transportation Research Board 81st Annual Meeting (2002)

    Google Scholar 

  13. Civilis, A., Jensen, C.S., Pakalnis, S.: Techniques for efficient road-network-based tracking of moving objects. IEEE Trans. Knowl. Data Eng. 17(5), 698–712 (2005)

    Article  Google Scholar 

  14. Chen, D., Driemel, A., Guibas, L.J., et al.: Approximate map matching with respect to the Fréchet distance. In: Meeting on Algorithm Engineering and Experiments, pp. 75–83. Society for Industrial and Applied Mathematics (2011)

    Google Scholar 

  15. Lou, Y., Zhang, C., Zheng, Y., et al.: Map-matching for low-sampling-rate GPS trajectories. In: Proceedings of ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems, ACM-GIS 2009, Seattle, Washington, USA, 4–6 November 2009, pp. 352–361. DBLP (2009)

    Google Scholar 

  16. Pink, O., Hummel, B.A.: statistical approach to map matching using road network geometry, topology and vehicular motion constraints. In: International IEEE Conference on Intelligent Transportation Systems, pp. 862–867. IEEE (2008)

    Google Scholar 

Download references

Acknowledgment

We thanks that this work was financially supported by National Natural Science Foundation of China (61772230, 61702215), Science & Technology Development Project of Jilin Province (20160204021GX) and Special Foundation Project for Industrial Innovation of Jilin Province (2017C032-1).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liping Huang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, J., Yang, Y., Huang, L., Zhu, Z., Yang, F. (2018). An Incremental Map Matching Algorithm Based on Weighted Shortest Path. In: Vaidya, J., Li, J. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2018. Lecture Notes in Computer Science(), vol 11334. Springer, Cham. https://doi.org/10.1007/978-3-030-05051-1_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05051-1_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05050-4

  • Online ISBN: 978-3-030-05051-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics