Probabilistic Focal Search: Accelerating Bounded-Suboptimal Search via Lower-Bound Advancement
This story is from 2026-09-12. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2609.10584v1 Announce Type: new Abstract: Bounded-suboptimal search seeks a solution within a factor $w$ of optimal while reducing search effort. Focal Search (FS) uses heuristic guidance within FOCAL, the frontier nodes eligible under the threshold $w f_{\min}$, but its deterministic policy…
Read the full story at arXiv cs.AI ↗
Timeline · 1 report
- 2026-09-12 04:00 · arXiv cs.AI
Probabilistic Focal Search: Accelerating Bounded-Suboptimal Search via Lower-Bound Advancement