2019
DOI: 10.1007/s13369-019-04247-1
|View full text |Cite
|
Sign up to set email alerts
|

Genetic-Inspired Map Matching Algorithm for Real-Time GPS Trajectories

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(3 citation statements)
references
References 51 publications
0
3
0
Order By: Relevance
“…For example, attempting to solve the problem of match uncertainty caused by varying map densities, Quddus and Washington (2015) proposed a new shortest path and vehicle trajectory aided map-matching (stMM) algorithm to match low-frequency GPS data on a road map. In more recent work, Singh et al (2020) applied a novel genetic algorithm to evaluate both sparse and dense GPS data for map matching. DMM, a fast map matching framework for cellular data that uses a recurrent neural network (RNN), has also been proposed to find the most likely road path given a sequence of cell towers (Singh et al, 2020).…”
Section: Map-matchingmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, attempting to solve the problem of match uncertainty caused by varying map densities, Quddus and Washington (2015) proposed a new shortest path and vehicle trajectory aided map-matching (stMM) algorithm to match low-frequency GPS data on a road map. In more recent work, Singh et al (2020) applied a novel genetic algorithm to evaluate both sparse and dense GPS data for map matching. DMM, a fast map matching framework for cellular data that uses a recurrent neural network (RNN), has also been proposed to find the most likely road path given a sequence of cell towers (Singh et al, 2020).…”
Section: Map-matchingmentioning
confidence: 99%
“…In more recent work, Singh et al (2020) applied a novel genetic algorithm to evaluate both sparse and dense GPS data for map matching. DMM, a fast map matching framework for cellular data that uses a recurrent neural network (RNN), has also been proposed to find the most likely road path given a sequence of cell towers (Singh et al, 2020). This method contrasts the commonly used Hidden Markov Models (HMM), which incur heavy computational overhead and scale poorly on large datasets.…”
Section: Map-matchingmentioning
confidence: 99%
“…These differences per mode of transportation stem from the difference in maximum speed, i.e., more candidate routes and positions have to be calculated given a certain time interval. For comparison, the execution times reported in recent literature vary between 39 ms and 5.62 s, depending on the algorithm's settings and the input sample interval [52]- [54].…”
Section: ) Execution Timementioning
confidence: 99%