Towards adaptable and tunable cloud-based map-matching strategy for GPS trajectories

Article

Abstract

Smart cities have given a significant impetus to manage traffic and use transport networks in an intelligent way. For the above reason, intelligent transportation systems (ITSs) and location-based services (LBSs) have become an interesting research area over the last years. Due to the rapid increase of data volume within the transportation domain, cloud environment is of paramount importance for storing, accessing, handling, and processing such huge amounts of data. A large part of data within the transportation domain is produced in the form of Global Positioning System (GPS) data. Such a kind of data is usually infrequent and noisy and achieving the quality of real-time transport applications based on GPS is a difficult task. The map-matching process, which is responsible for the accurate alignment of observed GPS positions onto a road network, plays a pivotal role in many ITS applications. Regarding accuracy, the performance of a map-matching strategy is based on the shortest path between two consecutive observed GPS positions. On the other extreme, processing shortest path queries (SPQs) incurs high computational cost. Current map-matching techniques are approached with a fixed number of parameters, i.e., the number of candidate points (NCP) and error circle radius (ECR), which may lead to uncertainty when identifying road segments and either low-accurate results or a large number of SPQs. Moreover, due to the sampling error, GPS data with a high-sampling period (i.e., less than 10 s) typically contains extraneous datum, which also incurs an extra number of SPQs. Due to the high computation cost incurred by SPQs, current map-matching strategies are not suitable for real-time processing. In this paper, we propose real-time map-matching (called RT-MM), which is a fully adaptive map-matching strategy based on cloud to address the key challenge of SPQs in a map-matching process for real-time GPS trajectories. The evaluation of our approach against state-of-the-art approaches is performed through simulations based on both synthetic and real-world datasets.

Key words

Map-matching GPS trajectories Tuning-based Cloud computing Bulk synchronous parallel 

CLC number

TP399 U495 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brakatsoulas, S., Pfoser, D., Salas, R., et al., 2005. On map-matching vehicle tracking data. Proc. 31st Int. Conf. on Very Large Data Bases, p.853–864.Google Scholar
  2. Chandio, A.A., Zhang, F., Memon, T.D., 2014. Study on LBS for characterization and analysis of big data benchmarks. Mehran Univ. Res. J. Eng. Technol., 33(4):432–440.Google Scholar
  3. Chandio, A.A., Tziritas, N., Xu, C.Z., 2015a. Big-data pro-cessing techniques and their challenges in transport do-main. ZTE Commun., 13(1):50–59.Google Scholar
  4. Chandio, A.A., Tziritas, N., Zhang, F., et al., 2015b. An ap-proach for map-matching strategy of gps-trajectories based on the locality of road networks. 2nd Int. Conf. on Internet of Vehicles, p.234–246. http://dx.doi.org/10.1007/978-3-319-27293-1_21Google Scholar
  5. Chen, B.Y., Yuan, H., Li, Q., et al., 2014. Map-matching al-gorithm for large-scale low-frequency floating car data. Int. J. Geograph. Inform. Sci., 28(1):22–38. http://dx.doi.org/10.1080/13658816.2013.816427CrossRefGoogle Scholar
  6. Chen, C., Liu, Z., Lin, W.H., et al., 2013. Distributed modeling in a MapReduce framework for data-driven traffic flow forecasting. IEEE Trans. Intell. Transp. Syst., 14(1):22–33. http://dx.doi.org/10.1109/TITS.2012.2205144CrossRefGoogle Scholar
  7. Dean, J., Ghemawat, S., 2008. MapReduce: simplified data processing on large clusters. Commun. ACM, 51(1):107–113. http://dx.doi.org/10.1145/1327452.1327492CrossRefGoogle Scholar
  8. Dijkstra, E.W., 1959. A note on two problems in connexion with graphs. Numer. Math., 1(1):269–271. http://dx.doi.org/10.1007/BF01386390MathSciNetCrossRefGoogle Scholar
  9. Fang, S.K., Zimmermann, R., 2011. EnAcq: energy-efficient GPS trajectory data acquisition based on improved map matching. Proc. 19th ACM SIGSPATIAL Int. Conf. on Advances in Geographic Information Systems, p.221–230. http://dx.doi.org/10.1145/2093973.2094004Google Scholar
  10. Goh, C.Y., Dauwels, J., Mitrovic, N., et al., 2012. Online map-matching based on hidden Markov model for real-time traffic sensing applications. 15th Int. IEEE Conf. on Intelligent Transportation Systems, p.776–781. http://dx.doi.org/10.1109/ITSC.2012.6338627Google Scholar
  11. Gonzalez, H., Han, J., Li, X., et al., 2007. Adaptive fastest path computation on a road network: a traffic mining approacht. 33rd In. Conf. on Very Large Data Bases, p.794–805.Google Scholar
  12. Greenfeld, J.S., 2002. Matching GPS observations to locations on a digital map. Proc. 81st Annual Meeting of the Transportation Research Board, p.1–13.Google Scholar
  13. He, Z.C., She, X.W., Zhuang, L.J., et al., 2013. On-line map-matching framework for floating car data with low sampling rate in urban road networks. IET Intell. Transp. Syst., 7(4):404–414. http://dx.doi.org/10.1049/iet-its.2011.0226CrossRefGoogle Scholar
  14. Hu, H., Lee, D.L., Lee, V., 2006. Distance indexing on road networks. Proc. 32nd Int. Conf. on Very Large Data Bases, p.894–905.Google Scholar
  15. Hummel, B., Tischler, K., 2005. Robust, GPS-only map matching: exploiting vehicle position history, driving re-striction information and road network topology in a sta-tistical framework. GIS Research UK Conf., p.68–77.Google Scholar
  16. Kajdanowicz, T., Kazienko, P., Indyk, W., 2014. Parallel pro-cessing of large graphs. Fut. Gener. Comput. Syst., 32:324–337. http://dx.doi.org/10.1016/j.future.2013.08.007CrossRefGoogle Scholar
  17. Kolahdouzan, M., Shahabi, C., 2004. Voronoi-based K nearest neighbor search for spatial network databases. Proc. 30th Int. Conf. on Very Large Data Bases, p.840–851.Google Scholar
  18. Kühne, R., Schäfer, R., Mikat, J., et al., 2003. New approaches for traffic management in metropolitan areas. Proc. IFAC CTS Symp.Google Scholar
  19. Li, Q., Zhang, T., Yu, Y., 2011a. Using cloud computing to process intensive floating car data for urban traffic sur-veillance. Int. J. Geograph. Inform. Sci., 25(8):1303–1322. http://dx.doi.org/10.1080/13658816.2011.577746CrossRefGoogle Scholar
  20. Li, X., Han, J., Lee, J.G., et al., 2007. Traffic density-based discovery of hot routes in road networks. Int. Symp. on Spatial and Temporal Databases, p.441–459. http://dx.doi.org/10.1007/978-3-540-73540-3_25CrossRefGoogle Scholar
  21. Li, Z.J., Chen, C., Wang, K., 2011b. Cloud computing for agent-based urban transportation systems. IEEE Intell. Syst., 26(1):73–79. http://dx.doi.org/10.1109/MIS.2011.10CrossRefGoogle Scholar
  22. Liu, K., Li, Y., He, F., et al., 2012. Effective map-matching on the most simplified road network. Proc. 20th Int. Conf. on Advances in Geographic Information Systems, p.609–612. http://dx.doi.org/10.1145/2424321.2424429Google Scholar
  23. Lou, Y., Zhang, C., Zheng, Y., et al., 2009. Map-matching for low-sampling-rate GPS trajectories. Proc. 17th ACM SIGSPATIAL Int. Conf. on Advances in Geographic In-formation Systems, p.352–361. http://dx.doi.org/10.1145/1653771.1653820Google Scholar
  24. Malewicz, G., Austern, M.H., Bik, A.J., et al., 2010. Pregel: a system for large-scale graph processing. Proc. ACM SIGMOD Int. Conf. on Management of Data, p.135–146. http://dx.doi.org/10.1145/1807167.1807184Google Scholar
  25. Newson, P., Krumm, J., 2009. Hidden Markov map matching through noise and sparseness. Proc. 17th ACM SIGSPA-TIAL Int. Conf. on Advances in Geographic Information Systems, p.336–343. http://dx.doi.org/10.1145/1653771.1653818Google Scholar
  26. Pink, O., Hummel, B., 2008. A statistical approach to map matching using road network geometry, topology and vehicular motion constraints. Proc. 11th Int. IEEE Conf. on Intelligent Transprotation Systems, p.862–867. http://dx.doi.org/10.1109/ITSC.2008.4732697Google Scholar
  27. Quddus, M.A., Ochieng, W.Y., Noland, R.B., 2007. Current map-matching algorithms for transport applications: state-of-the art and future research directions. Transp. Res. Part C, 15(5):312–328. http://dx.doi.org/10.1016/j.trc.2007.05.002CrossRefGoogle Scholar
  28. Seo, S., Yoon, E.J., Kim, J., et al., 2010. HAMA: an efficient matrix computation with the MapReduce framework. IEEE 2nd Int. Conf. on Cloud Computing Technology and Science, p.721–726. http://dx.doi.org/10.1109/CloudCom.2010.17Google Scholar
  29. Tang, W., Ren, D., Lan, Z., et al., 2013. Toward balanced and sustainable job scheduling for production supercomputers. Parall. Comput., 39(12):753–768. http://dx.doi.org/10.1016/j.parco.2013.08.007CrossRefGoogle Scholar
  30. Thomsen, J.R., Yiu, M.L., Jensen, C.S., 2012. Effective cach-ing of shortest paths for location-based services. Proc. ACM SIGMOD Int. Conf. on Management of Data, p.313–324. http://dx.doi.org/10.1145/2213836.2213872Google Scholar
  31. Tiwari, S., Kaushik, S., 2013. Scalable method for k optimal meeting points (k-omp) computation in the road network databases. Int. Workshop on Databases in Networked Information Systems, p.277–292. http://dx.doi.org/10.1007/978-3-642-37134-9_21CrossRefGoogle Scholar
  32. Wang, J.Z., Wang, Z.J., 2013. Architecture design of urban intelligent transportation using cloud computing. Adv. Mater. Res., 605-607:2549–2552. http://dx.doi.org/10.4028/www.scientific.net/AMR.605-607.2549CrossRefGoogle Scholar
  33. Wang, S., 2010. A cyberGIS framework for the synthesis of cyberinfrastructure, GIS, and spatial analysis. Ann. Assoc. Am. Geograph., 100(3):535–557. http://dx.doi.org/10.1080/00045601003791243CrossRefGoogle Scholar
  34. Wang, S., Liu, Y., 2009. TeraGrid GIScience gateway: bridg-ing cyberinfrastructure and GIScience. Int. J. Geograph. Inform. Sci., 23(5):631–656. http://dx.doi.org/10.1080/13658810902754977CrossRefGoogle Scholar
  35. Wang, Z.Y., Du, Y., Wang, G., et al., 2008. A quick map-matching algorithm by using grid-based selecting. Int. Workshop on Education Technology and Training and Geoscience and Remote Sensing, p.306–311. http://dx.doi.org/10.1109/ETTandGRS.2008.217Google Scholar
  36. Wenk, C., Salas, R., Pfoser, D., 2006. Addressing the need for map-matching speed: localizing global curve-matching algorithms. 18th Int. Conf. on Scientific and Statistical Database Management, p.379–388. http://dx.doi.org/10.1109/SSDBM.2006.11Google Scholar
  37. Yin, G.G., Xu, C.Z., Wang, L.Y., 2003. Optimal remapping in dynamic bulk synchronous computations via a stochastic control approach. IEEE Trans. Parall. Distr. Syst., 14(1):51–62. http://dx.doi.org/10.1109/TPDS.2003.1167370CrossRefGoogle Scholar
  38. Yuan, J., Zheng, Y., Zhang, C., et al., 2010. An interactive-voting based map matching algorithm. 11th Int. Conf. on Mobile Data Management, p.43–52. http://dx.doi.org/10.1109/MDM.2010.14Google Scholar
  39. Zheng, Y., Wang, L., Zhang, R., et al., 2008. GeoLife: man-aging and understanding your past life over maps. 9th Int. Conf. on Mobile Data Management, p.211–212. http://dx.doi.org/10.1109/MDM.2008.20Google Scholar
  40. Zheng, Y., Capra, L., Wolfson, O., et al., 2014. Urban compu-ting: concepts, methodologies, and applications. ACM Trans. Intell. Syst. Technol., 5(3):38. http://dx.doi.org/10.1145/2629592Google Scholar

Copyright information

© Journal of Zhejiang University Science Editorial Office and Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Shenzhen Institutes of Advanced TechnologyChinese Academy of SciencesShenzhenChina
  2. 2.Institute of Mathematics and Computer ScienceUniversity of SindhJamshoroPakistan
  3. 3.Department of Electrical and Computer EngineeringWayne State UniversityDetroitUSA

Personalised recommendations