skip to main content
10.1145/3191801.3191812acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiwiscConference Proceedingsconference-collections
research-article
Public Access

Map-matching using shortest paths

Published: 12 April 2018 Publication History

Abstract

We consider several variants of the map-matching problem, which seeks to find a path Q in graph G that has the smallest distance to a given trajectory P (which is likely not to be exactly on the graph). In a typical application setting, P models a noisy GPS trajectory from a person traveling on a road network, and the desired path Q should ideally correspond to the actual path in G that the person has traveled. Existing map-matching algorithms in the literature consider all possible paths in G as potential candidates for Q. We find solutions to the map-matching problem under different settings. In particular, we restrict the set of paths to shortest paths, or concatenations of shortest paths, in G. As a distance measure, we use the Fréchet distance, which is a suitable distance measure for curves since it takes the continuity of the curves into account.

References

[1]
Mahmuda Ahmed and Carola Wenk. 2012. Constructing Street Networks from GPS Trajectories. In Algorithms-ESA 2012. Springer, 60--71.
[2]
Helmut Alt, Alon Efrat, Günter Rote, and Carola Wenk. 2003. Matching Planar Maps. Journal of Algorithms 49 (2003), 262--283.
[3]
Helmut Alt and Michael Godau. 1995. Computing the Fréchet Distance between Two Polygonal Curves. Int. J. Comput. Geometry Appl. 5 (1995), 75--91.
[4]
Theo A Arentze and Harry J.P Timmermans. 2004. A learning-based transportation oriented simulation system. Transportation Research Part B: Methodological 38, 7 (2004), 613 -- 633.
[5]
Michael Balmer, Kay Axhausen, and Kai Nagel. 2006. Agent-Based Demand-Modeling Framework for Large-Scale Microsimulations. Transportation Research Record: Journal of the Transportation Research Board 1985 (2006), 125--134.
[6]
Sotiris Brakatsoulas, Dieter Pfoser, Randall Salas, and Carola Wenk. 2005. On Map-matching Vehicle Tracking Data. In Proc. 31st VLDB Conf. 853--864.
[7]
Wilner Ciscal-Terry, Mauro Dell'Amico, Natalia Selini Hadjidimitriou, and Manuel Iori. 2016. An analysis ofdrivers route choice behaviour using GPS data and optimal alternatives. Journal of Transport Geography 51 (2016), 119--129.
[8]
Maurice Fréchet. 1906. Sur quelques Points du Calcul Fonctionnel. Rendiconti del Circolo Matematico di Palermo 22, 1 (1906), 1--74.
[9]
Amin Gheibi, Anil Maheshwari, and Jörg-Rüdiger Sack. 2016. Minimizing Walking Length in Map Matching. In Topics in Theoretical Computer Science: The First IFIP WG 1.8 International Conference, M. T. Hajiaghayi and M. R. Mousavi (Eds.). 105--120.
[10]
Sariel Har-Peled and Benjamin Raichel. 2014. The Fréchet Distance Revisited and Extended. ACM Trans. Algorithms 10, 1 (Jan. 2014), 3:1--3:22.
[11]
Mithilesh Jha, Samer Madanat, and Srinivas Peeta. 1998. Perception updating and day-to-day travel choice dynamics in traffic networks with information provision. Transportation Research Part C: Emerging Technologies 6, 3 (1998), 189 -- 212.
[12]
Yin Lou, Chengyang Zhang, Yu Zheng, Xing Xie, Wei Wang, and Yan Huang. 2009. Map-Matching for Low-Sampling-Rate GPS Trajectories. In Proc. 17th ACM SIGSPATIAL Int. Conf. Advances in Geographic Information Systems. 352--361.
[13]
Paul Newson and John Krumm. 2009. Hidden Markov MapMatching Through Noise and Sparseness. In Proc. 17th ACM SIGSPATIAL Int. Conf. Advances in Geographic Information Systems. 336--343.
[14]
Carlo Prato and Shlomo Bekhor. 2006. Applying Branch-and-Bound Technique to Route Choice Set Generation. Transportation Research Record: Journal of the Transportation Research Board 1985 (2006), 19--28.
[15]
Mohammed Quddus and Simon Washington. 2015. Shortest path and vehicle trajectory aided map-matching for low frequency GPS data. Transportation Research Part C: Emerging Technologies 55 (2015), 328--339.
[16]
Piotr Szwed and Kamil Pekala. 2014. An Incremental Map-Matching Algorithm Based on Hidden Markov Model. In Artificial Intelligence and Soft Computing. 579--590.
[17]
Muhammad Reaz Uddin, Chinya Ravishankar, and Vassilis J. Tsotras. 2011. A System for Discovering Regions of Interest from Trajectory Data. In Advances in Spatial and Temporal Databases. Springer, 481--485.
[18]
Jing Yuan, Yu Zheng, Chengyang Zhang, Wenlei Xie, Xing Xie, and Yan Huang. 2010. T-Drive: Driving Directions Based on Taxi Trajectories. In Proc. 18th ACM SIGSPATIAL Int. Conf. Advances in Geographic Information Systems. 99--108.
[19]
Lei Zhang, David M. Levinson, and Shanjiang Zhu. 2008. Agent-Based Model of Price Competition, Capacity Choice, and Product Differentiation on Congested Networks. Journal of Transport Economics and Policy 42, 3 (2008), 435--461.
[20]
L. Zhu, J.R. Holden, and J.D Gonder. 2017. Trajectory Segmentation Map-Matching Approach for Large-Scale, High-Resolution GPS Data. Transportation Research Record: Journal of the Transportation Research Board 2645, 67--75 (2017).
[21]
Shanjiang Zhu and David Levinson. 2015. Do People Use the Shortest Path? An Empirical Test of Wardrop's First Principle. PLOS ONE 10 (08 2015), 1--18.

Cited By

View all
  • (2020)Map-Matching Using Shortest PathsACM Transactions on Spatial Algorithms and Systems10.1145/33686176:1(1-17)Online publication date: 13-Feb-2020

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
IWISC '18: Proceedings of the 3rd International Workshop on Interactive and Spatial Computing
April 2018
118 pages
ISBN:9781450354394
DOI:10.1145/3191801
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 April 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Fréchet distance
  2. map matching
  3. shortest paths

Qualifiers

  • Research-article

Funding Sources

Conference

IWISC 2018

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)52
  • Downloads (Last 6 weeks)13
Reflects downloads up to 20 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2020)Map-Matching Using Shortest PathsACM Transactions on Spatial Algorithms and Systems10.1145/33686176:1(1-17)Online publication date: 13-Feb-2020

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media