2025
Suboptimal Search with Dynamic Distribution of Suboptimality
AAAI 2025technical
In bounded-suboptimal heuristic search, the aim is to find a solution path within a given bound as quickly as possible, which is crucial when computational resources are limited. Recent research has demonstrated Weighted A* variants such as XDP that find bounded suboptimal solutions without needing…