Expand description
Fringe Search path planning algorithm.
Fringe Search replaces the priority queue of A* with iteratively
increasing f-cost thresholds over two fringe lists. It keeps the same
admissible Euclidean heuristic as A* while avoiding heap maintenance.
Structsยง
- Fringe
Search Config - Configuration for Fringe Search.
- Fringe
Search Planner - Fringe Search planner on an 8-connected occupancy grid.
- Fringe
Search Stats - Search-effort statistics collected during one Fringe Search query.