Probabilistic Focal Search: Accelerating Bounded-Suboptimal Search via Lower-Bound Advancement
· Source: arXiv cs.AI
The sub‑optimal bounded‑quality search aims to find a solution whose cost does not exceed a factor w above the optimum while keeping computational effort low.