Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/jonasmalacofilho/map-matching-lab
An old WIP lab for developing and testing map-matching algorithms
https://github.com/jonasmalacofilho/map-matching-lab
Last synced: 25 days ago
JSON representation
An old WIP lab for developing and testing map-matching algorithms
- Host: GitHub
- URL: https://github.com/jonasmalacofilho/map-matching-lab
- Owner: jonasmalacofilho
- License: other
- Created: 2014-01-23T21:07:42.000Z (almost 11 years ago)
- Default Branch: master
- Last Pushed: 2015-09-10T20:28:35.000Z (about 9 years ago)
- Last Synced: 2023-06-16T03:35:23.064Z (over 1 year ago)
- Language: Haxe
- Homepage:
- Size: 338 KB
- Stars: 1
- Watchers: 4
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.md
Awesome Lists containing this project
README
Map-matching lab
================
_An old work-in-progress lab for developing and testing map-matching algorithms_The problem
-----------Retrace the path on a network from GPS tracks or other sources. Can also be used for retracing paths between alternative networks (for the same region).
Steps towards a solution
------------------------### Path comparison and errors
We want to measure the error between a matched path and the expected result. For this we use the Levenstein distance between the two (align both paths and weight each missed or wrong link with 1).
### Checking if a solution is optimal
For this, we could use the area of the **complex** polygon formed by the two curves: input track and (reversed) matched path. But be careful, computing this area as if it was of a simple polygon will reduce how effective the check is and will only assert how "centered" the matched path to the input.
### Map-matching algorithms
#### TrImp3 and Shrimp
TrImp3 solves map-matching problems by computing multiple shortest paths between each input point. Shrimp is a simplified TrImp3 map-matching algorithm for testing purposes.
#### BlueSwiss
Map-matching with multiple shortest paths on the graph of link fit to each input point.