Advertisement

An Incremental Map Matching Algorithm Based on Weighted Shortest Path

  • Jixiao Chen
  • Yongjian Yang
  • Liping Huang
  • Zhuo Zhu
  • Funing Yang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11334)

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.

Keywords

Map matching GPS trajectory Low-sampling-rate Incremental algorithm Shortest path 

Notes

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

References

  1. 1.
    Gao, W.C., Li, G.L., Ta, N.: Map matching algorithm: a survey. J. Softw. 02, 225–250 (2018)Google Scholar
  2. 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.049MathSciNetCrossRefGoogle Scholar
  3. 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. 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)CrossRefGoogle Scholar
  5. 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. 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)CrossRefGoogle Scholar
  7. 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. 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)CrossRefGoogle Scholar
  9. 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_51CrossRefGoogle Scholar
  10. 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. 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)CrossRefGoogle Scholar
  12. 12.
    Greenfeld, J.S.: Matching GPS observations to locations on a digital map. In: Transportation Research Board 81st Annual Meeting (2002)Google Scholar
  13. 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)CrossRefGoogle Scholar
  14. 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. 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. 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

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  • Jixiao Chen
    • 1
  • Yongjian Yang
    • 1
  • Liping Huang
    • 1
  • Zhuo Zhu
    • 1
  • Funing Yang
    • 1
  1. 1.Jilin UniversityChangchunChina

Personalised recommendations