Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

A* vs. Dijkstra #124

Open
geoHeil opened this issue Sep 12, 2018 · 1 comment
Open

A* vs. Dijkstra #124

geoHeil opened this issue Sep 12, 2018 · 1 comment
Labels

Comments

@geoHeil
Copy link

geoHeil commented Sep 12, 2018

Why did you choose Dijkstra over A*?

@smattheis
Copy link

smattheis commented Sep 23, 2018

Sorry for the delay. For short routing distances as we have it in map matching even for 3 min sampling intervals, we encountered more overhead for the calculation of the heuristic distance function than a benefit from "guiding" the route search. Further, our Dijkstra implementation uses a single-source-multiple-target approach to save time/workload when we calculate some number of similar routes between matching candidates. This is not straight-forward with A* because for each target we must maintain a different value of the heuristic function per edge.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

2 participants