Transportation Research Record Journal of the Transportation Research Board · 2017 · 55 citations · 26 references
ComputingGeoinformaticsGeographic Information SystemsGlobal Navigation Satellite SystemsTransportationIntelligent Transportation SystemsMappingShortest Path AlgorithmsTrajectory AnalysisComputational EfficiencyLongest Common SubsequenceMap MatchingMap SegmentationTrajectory MatchingTrajectory MiningTrajectory SegmentationTrajectory Similarity Measurement
With the development of smartphones and portable GPS devices, large-scale, high-resolution GPS data can be collected. Map matching is a critical step in studying vehicle driving activity and recognizing network traffic conditions from the data. A new trajectory segmentation map-matching algorithm is proposed to deal accurately and efficiently with large-scale, high-resolution GPS trajectory data. The new algorithm separated the GPS trajectory into segments. It found the shortest path for each segment in a scientific manner and ultimately generated a best-matched path for the entire trajectory. The similarity of a trajectory segment and its matched path is described by a similarity score system based on the longest common subsequence. The numerical experiment indicated that the proposed map-matching algorithm was very promising in relation to accuracy and computational efficiency. Large-scale data set applications verified that the proposed method is robust and capable of dealing with real-world, large-scale GPS data in a computationally efficient and accurate manner.
26
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text