Skip to main content

Module fringe_search

Module fringe_search 

Source
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ยง

FringeSearchConfig
Configuration for Fringe Search.
FringeSearchPlanner
Fringe Search planner on an 8-connected occupancy grid.
FringeSearchStats
Search-effort statistics collected during one Fringe Search query.