Expand description
Dijkstra path planning algorithm
Grid-based shortest path planning using Dijkstra’s algorithm.
Functions§
- dijkstra_
plan - Run Dijkstra’s algorithm on a grid obstacle map.
- has_
collision - Check if a cell or its neighbors contain an obstacle