ConceptPFS / Probabilistic Focal Search
Probabilistic Focal Search
Probabilistic Focal Search (PFS) is a bounded suboptimal search algorithm that extends classical focal search by introducing a probabilistic mechanism. With probability p it performs heuristic-guided node selection, and with probability 1−p it advances the lower bound, thereby breaking search plateaus and substantially reducing the number of node expansions.
Timeline (last 90 days)
Sep 12
Probabilistic Focal Search (PFS) follows the heuristic-guided selection of FS with probability p, and with probability 1-p expands the node with the minimum f value in the OPEN list.
Unverified50%