Journal
ACM TRANSACTIONS ON SPATIAL ALGORITHMS AND SYSTEMS
Volume 6, Issue 1, Pages -Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3368617
Keywords
Frechet distance; graph matching; shortest paths
Categories
Funding
- National Science Foundation [IIS-1319944, CCF-1054779, CCF1614562, DBI-1759807, CCF-1618605, CCF-1618247, CCF-1618469]
Ask authors/readers for more resources
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 mapmatching 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 Frechet distance, which is a suitable distance measure for curves since it takes the continuity of the curves into account.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available