Skip to main content

Dijkstra-Based Selection for Parallel Multi-lanes Map-Matching and an Actual Path Tagging System

  • Conference paper
Intelligent Information and Database Systems (ACIIDS 2016)

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

Included in the following conference series:

Abstract

Map-matching between a road network and a raw GPS trajectory must be done in order to analyze the urban traffic computing. A weight-based map-matching algorithm has proposed some important features to solve this problem, such as perpendicular distance between a raw GPS point and a road segment, bearing difference and connectivity. However, the connectivity of a map-matching problem becomes complex when the raw trajectory traveled a parallel multi-lanes road network segments, even humans will have difficulty selecting the correct road segment. To solve this problem, a dijkstra-based selection map-matching (DBSMM) algorithm is asserted by us. Candidate segment set formation, dijkstra-based selection and a friendly driver tagging system are presented in this paper. With the driver-tagged actual paths of our tagging system, it is possible to evaluate the DBSMM algorithm. Therefore, the precise map-matched network traffic data can be the basis for more further traffic researches.

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. Luxen, D., Vetter, C.: Actual-time routing with OpenStreetMap data. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, GIS 2011, NY, USA, pp. 513–516 (2011)

    Google Scholar 

  2. Kawak, D., Kim, D., Liu, R., Nath, B., Iftode, L.: DoppelDriver: counterfactual actual travel times for alternative routes. In: 2015 IEEE International Conference on Pervasive Computing and Communications (PerCom), pp. 178–185 (2015)

    Google Scholar 

  3. Saremi, F., Fatemieh, O., Ahmadi, H., Wang, H., Abdelzaher, T., Ganti, R., Liu, H., Hu, S., Li, S., Su, L.: Experiences with GreenGPS – fuel-efficient navigation using participatory sensing. In: IEEE Transactions on Mobile Computing, vol. 99 (2015)

    Google Scholar 

  4. Quddus, M., Washington, S.: Shortest path and vehicle trajectory aided map-matching for low frequency GPS data. Transp. Res. Part C Emerg. Technol. 55, 328–339 (2015)

    Article  Google Scholar 

  5. Yanagi, T, Yamamoto, D.; Takahashi, N.: Development of mobile voice navigation system using user-based mobile maps annotations. In: 2015 IEEE/ACIS 14th International Conference on Computer and Information Science (ICIS), Las Vegas, NV, pp. 373–378 (2015)

    Google Scholar 

  6. Yuan, J., Zheng, Y., Zhang, C., Xie, X, Sun, G.Z.: An interactive-voting based map matching algorithm. In: 2010 Eleventh International Conference on Mobile Data Management (MDM), pp. 43–52. IEEE, Kansas City (2010)

    Google Scholar 

  7. Mao, H., Luo, W., Tan, H., Ni, L.M., Xiao, N.: Exploration of ground truth from raw GPS data. In: Proceedings of the ACM SIGKDD International Workshop on Urban Computing, UrbComp 2012, pp. 118–125. ACM, New York (2012)

    Google Scholar 

  8. Newson, P., Krumm, J.: Hidden markov map matching through noise and sparseness. In: Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 336–343, NY, USA. (2009)

    Google Scholar 

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

    Google Scholar 

  10. Ochieng, W.Y., Quddus, M.A., Noland, R.B.: Map-matching in complex urban road networks. Braz. J. Cartography 55(2), 1–18 (2004)

    Google Scholar 

  11. Biagioni, J., Eriksson, J.: Inferring road maps from gps traces: survey and comparative evaluation. In: Transportation Research Board 91st Annual Meeting (2012)

    Google Scholar 

  12. Dijkstra’s algorithm. https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

  13. Tidy algorithm. https://github.com/mapbox/geojson-tidy

  14. 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, GIS 2009, pp. 352–361. ACM, New York (2009)

    Google Scholar 

  15. Mapbox map-matching. https://www.mapbox.com/blog/map-matching/

  16. Viterbi algorithm. https://en.wikipedia.org/wiki/Viterbi_algorithm

Download references

Acknowledgement

This project was partly supported by the Ministry of Science and Technology of Taiwan under grant NSC101-2221-E-001-021-MY3 and NjiSC100-2219-E-001-002.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mick Chang-Heng Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, M.CH., Huang, FM., Liu, PC., Huang, YH., Chung, Ys. (2016). Dijkstra-Based Selection for Parallel Multi-lanes Map-Matching and an Actual Path Tagging System. In: Nguyen, N.T., Trawiński, B., Fujita, H., Hong, TP. (eds) Intelligent Information and Database Systems. ACIIDS 2016. Lecture Notes in Computer Science(), vol 9622. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49390-8_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49390-8_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49389-2

  • Online ISBN: 978-3-662-49390-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics