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

> *机器翻译 (AI-generated content)*

> 标题为英语

> 全文为英语

**Published:** 2026年9月12日
**Author:** Minh Vu Duc, Trung Le Huu, H\`a Minh Ho\`ang, Trung Thanh Nguyen, Phuong Khanh Nguyen, Huynh Thi Thanh Binh
**Source:** arXiv — cs.AI
**Language:** en-US
**HTML:** https://aiqazaqstan.com/zh/articles/probabilistic-focal-search-accelerating-bounded-suboptimal-search-via-lo

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…

> 内容来自原始来源： **arXiv — cs.AI**
> [在 arXiv — cs.AI 阅读全文](https://arxiv.org/abs/2609.10584)

**标签：** #arXiv

---

*AI Qazaqstan — non-commercial informational portal about AI in Kazakhstan. Machine translations and summaries are AI-generated.*