Research1 min read
Probabilistic Focal Search: Accelerating Bounded-Suboptimal Search via Lower-Bound Advancement
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 u...
From arXiv cs.AI
