Informed search under budgets
8 methods in the atlas attack this one problem. They are rivals: each wins something the others do not.
Phrasings that mean this problem
Bounded-suboptimal searchAnytime pathfindingLinear-memory informed searchBounded-memory informed searchBounded-width searchFast non-optimal routingBounded-width stochastic searchOptimal bounded-width search
backtracking-cp
- Beam stack searchBacktrackable beamspecialistbacktracking-cp
graphs-paths
- Weighted A*Inflated admissible heuristiccanongraphs-paths
- Anytime Repairing A*Decreasing inflation schedulestandardgraphs-paths
- Recursive best-first searchBacked-up f-value boundsstandardgraphs-paths
- SMA*Worst-leaf evictionspecialistgraphs-paths
- Greedy best-first searchEuclidean distancecanongraphs-paths
- Beam searchTop-k frontier pruningcanongraphs-paths
metaheuristics
- Stochastic beam searchFitness-proportional retentionspecialistmetaheuristics