Heuristic optimizations for high-speed low-latency online map matching with probabilistic sequence models
The computation speed and output latency of map matching are important considerations when processing location data, especially smartphone-generated noisy and sparse data, from a large number of users for real-time transportation applications. In this paper, we examine the factors affecting the effi...
Saved in:
Main Authors: | Jagadeesh, George Rosario, Srikanthan, Thambipillai |
---|---|
Other Authors: | School of Computer Science and Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/145765 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Probabilistic map matching of sparse and noisy smartphone location data
by: Jagadeesh, George Rosario, et al.
Published: (2021) -
Online map-matching of noisy and sparse location data with hidden Markov and route choice models
by: Jagadeesh, George Rosario, et al.
Published: (2020) -
Fast computation of clustered many-to-many shortest paths and its application to map matching
by: Jagadeesh, George Rosario, et al.
Published: (2020) -
Map matching imprecise trajectories for smart mobility applications
by: Jagadeesh, George Rosario
Published: (2019) -
Robust real-time route inference from sparse vehicle position data
by: Jagadeesh, George Rosario, et al.
Published: (2015)