Bounded Suboptimal Search

Bounded suboptimal search is a class of search algorithm paradigms that relax the optimality requirement by guaranteeing solutions within a factor w of the optimal. This trade-off between solution quality and search efficiency makes the approach widely applicable to path planning and combinatorial optimization problems.