Expand description
Breadth-First Search path planning algorithm
Grid-based path planning using BFS. Unlike A*, BFS uses a FIFO queue instead of a priority queue and does not use a heuristic for node ordering. It guarantees the shortest path in terms of number of grid steps (unweighted).
Structsยง
- BFSConfig
- Configuration for BFS planner
- BFSPlanner
- Breadth-First Search path planner