SOURCE-LINKED INTELLIGENCE

Probabilistic Focal Search: Accelerating Bounded-Suboptimal Search via Lower-Bound Advancement

arXiv · AI, language, vision and robotics · article · Sep 6, 2026 · UTC

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 may leave $f_{\min}$ unchanged for many expansions. We introduce Probabilistic Focal Search (PFS), which follows the FS guided choice with probability $p$ and expands a minimum-$f$ OPEN node with probability $1-p$. The latter branch encourages the lower bound to advance, enlarging FOCAL and admitting nodes that may lead to feasible solutions. By b

Read original source ↗ Open in workspace

recordType

paper

region

Global