Abstract
In this paper we present an efficient solution to the offline map matching problem that occurs in the area of position measurements on a road network: given a set of measured positions, what was the most probable trip that led to these measurements? For this, we assume a user who moves according a certain degree of optimality across a road network. A solution has to face certain problems; most important: as a single measurement may be mapped to multiple positions on the road network, the total number of combination exceeds any reasonable limit.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bertsimas, D., Tsitsiklis, J.: Simulated Annealing. Stat. Sci. 8(1), 10–15 (1993)
Haunert, J.H., Budig, B.: An algorithm for map matching given incomplete road data. In: Proceedings of the 20th International Conference on Advances in Geographic Information Systems, pp. 510–513 (2012)
Marchal, F., Hackney, J., Axhausen, K.W.: Efficient map-matching of large GPS data sets – tests on a speed monitoring experiment in Zurich. J. Transp. Res. Board 2005, 93–100 (1935). Transportation Research Re-cord
Pereira, F.C., Costa, H., Pereira, N.M.: An off-line map-matching algorithm for incomplete map databases. Eur. Transp. Res. Rev. 1(3), 107–124 (2009)
Roth, J.: Combining symbolic and spatial exploratory search – the homerun explorer. In: Innovative Internet Computing Systems (I2CS), Hagen, June 19–21 2013, Fortschritt-Berichte VDI, Reihe 10, Nr. 826, pp. 94–108 (2013)
Roth, J.: Predicting route targets based on optimality considerations. In: International Conference on Innovations for Community Services (I4CS), Reims (France) 4–6 June, 2014, pp. 61–68. IEEE xplore (2014)
Roth, J.: Generating meaningful location descriptions. In: International Conference on Innovations for Community Services (I4CS), July 8–10, 2015, Nuremberg (Germany), pp. 30–37. IEEE xplore (2015)
Roth, J.: Efficient many-to-many path planning and the traveling salesman problem on road networks. In: KES Journal: Innovation in Knowledge-Based and Intelligent Engineering Systems, to appear (2016)
Schuessler, N., Axhausen, K. W.: Map-matching of GPS traces on high-resolution navigation networks using the Multiple Hypothesis Technique (MHT), Working Paper 568, Institute for Transport Planning and System (IVT), ETH Zurich (2009)
Viterbi, A.: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm. IEEE Trans. Inf. Theory 13(2), 260–269 (1967)
White, C.E., Bernstein, D., Kornhauser, A.: Some map matching algorithms for personal navigation assistants. Transp. Res. Part C Emerg. Technol. 8, 91–108 (2000)
Yanagisawa, H.: An offline map matching via integer programming. In: 2010 Proceedings of the 20th International Conference on Pattern Recognition (ICPR), pp. 4206–4209. IEEE (2010)
Zhou, J., Golledge, R.: A three-step general map matching method in the GIS environment: travel/transportation study perspective. Int. J. Geogr. Inf. Syst. 8(3), 243–260 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing AG
About this paper
Cite this paper
Roth, J. (2016). The Offline Map Matching Problem and its Efficient Solution. In: Fahrnberger, G., Eichler, G., Erfurth, C. (eds) Innovations for Community Services. I4CS 2016. Communications in Computer and Information Science, vol 648. Springer, Cham. https://doi.org/10.1007/978-3-319-49466-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-49466-1_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-49465-4
Online ISBN: 978-3-319-49466-1
eBook Packages: Computer ScienceComputer Science (R0)