https://github.com/mkner/road-network-paths

Shortest road network paths with Open Street Map using a Dijkstra/A* Combo Algorithm
https://github.com/mkner/road-network-paths

a-star-algorithm autonomous-vehicles dijkstra-algorithm mission-planning open-street-map shortest-path-algorithm

Last synced: 4 months ago
JSON representation

Shortest road network paths with Open Street Map using a Dijkstra/A* Combo Algorithm

• Host: GitHub
• URL: https://github.com/mkner/road-network-paths
• Owner: mkner
• License: mit
• Created: 2021-05-13T00:26:06.000Z (about 4 years ago)
• Default Branch: main
• Last Pushed: 2021-05-13T01:06:20.000Z (about 4 years ago)
• Last Synced: 2025-01-13T13:52:10.555Z (5 months ago)
• Topics: a-star-algorithm, autonomous-vehicles, dijkstra-algorithm, mission-planning, open-street-map, shortest-path-algorithm
• Language: Jupyter Notebook
• Homepage:
• Size: 1.82 MB
• Stars: 0
• Watchers: 1
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
## Mission Planning  - Shortest Path in a Road Network

Shortest road network paths with Open Street Map using a Dijkstra/A* Combo Algorithm

Finds a shortest path in a road network graph.

This shortest path algorithm combines Dijkstra's and A* algorithms into one function. The type is selectable and Dijkstras is treated as a special case of A* 

The heuristic function can easily be modified to accomplish distance related variants.

An example shows a detour attempt to bypass the shortest path.