Skip to main content

Sequence-Based Bidirectional Merge Map-Matching Algorithm for Simplified Road Network

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10233))

Included in the following conference series:

  • 1884 Accesses

Abstract

Current map matching algorithms do not perform well for simplified road networks. In this paper, we propose a sequence-based bidirectional merge algorithm called SBBM for map matching on the simplified road network. SBBM splits a GPS trajectory into a set of sequences first, and then merges the sequences from the one with the highest confidence. During the merging procedure, the algorithm would address the problems of outliers. Last, an experiment is conducted based on GeoLife dataset in Beijing, China, and the result shows that the proposed algorithm in this paper performs better than Passby algorithm and incremental algorithm.

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

References

  1. Liu, K., Li, Y., He, F., Xu, J., Ding, Z.: Effective map-matching on the most simplified road network. In: Proceedings of the 20th International Conference on Advances in Geographic Information Systems, pp. 609–612. ACM (2012)

    Google Scholar 

  2. Quddus, M.A., Ochieng, W.Y., Noland, R.B.: Current map-matching algorithms for transport applications: state-of-the art and future research directions. Transp. Res. Part C: Emerg. Technol. 15(5), 312–328 (2007)

    Article  Google Scholar 

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

    Google Scholar 

  4. Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: Proceedings of the 31st International Conference on Very Large Databases, pp. 853–864. VLDB Endowment (2005)

    Google Scholar 

  5. Lou, Y., Zhang, C., Zheng, Y., Xie, X., Wang, W., Huang, Y.: Map-matching for low-sampling-rate GPS Trajectories. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 352–361. ACM (2009)

    Google Scholar 

  6. Zheng, Y., Zhang, L., Xie, X., Ma, W.Y.: Mining interesting locations and travel sequences from GPS trajectories. In: Proceedings of the 18th International Conference on World Wide Web, pp. 791–800. ACM (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xin Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Cui, G., Ma, C., Wang, X. (2017). Sequence-Based Bidirectional Merge Map-Matching Algorithm for Simplified Road Network. In: Mouhoub, M., Langlais, P. (eds) Advances in Artificial Intelligence. Canadian AI 2017. Lecture Notes in Computer Science(), vol 10233. Springer, Cham. https://doi.org/10.1007/978-3-319-57351-9_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57351-9_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57350-2

  • Online ISBN: 978-3-319-57351-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics