Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.09549 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911262005264384 |
|---|---|
| author | Platnick, Daniel Tomasz, Dawson Earl, Eamon Khanzadeh, Sourena Valenzano, Richard |
| author_facet | Platnick, Daniel Tomasz, Dawson Earl, Eamon Khanzadeh, Sourena Valenzano, Richard |
| contents | Greedy search methods like Greedy Best-First Search (GBFS) and Enforced Hill-Climbing (EHC) often struggle when faced with Uninformed Heuristic Regions (UHRs) like heuristic local minima or plateaus. In this work, we theoretically and empirically compare two popular methods for escaping UHRs in breadth-first search (BrFS) and restarting random walks (RRWs). We first derive the expected runtime of escaping a UHR using BrFS and RRWs, based on properties of the UHR and the random walk procedure, and then use these results to identify when RRWs will be faster in expectation than BrFS. We then evaluate these methods for escaping UHRs by comparing standard EHC, which uses BrFS to escape UHRs, to variants of EHC called EHC-RRW, which use RRWs for that purpose. EHC-RRW is shown to have strong expected runtime guarantees in cases where EHC has previously been shown to be effective. We also run experiments with these approaches on PDDL planning benchmarks to better understand their relative effectiveness for escaping UHRs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_09549 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions Platnick, Daniel Tomasz, Dawson Earl, Eamon Khanzadeh, Sourena Valenzano, Richard Artificial Intelligence Greedy search methods like Greedy Best-First Search (GBFS) and Enforced Hill-Climbing (EHC) often struggle when faced with Uninformed Heuristic Regions (UHRs) like heuristic local minima or plateaus. In this work, we theoretically and empirically compare two popular methods for escaping UHRs in breadth-first search (BrFS) and restarting random walks (RRWs). We first derive the expected runtime of escaping a UHR using BrFS and RRWs, based on properties of the UHR and the random walk procedure, and then use these results to identify when RRWs will be faster in expectation than BrFS. We then evaluate these methods for escaping UHRs by comparing standard EHC, which uses BrFS to escape UHRs, to variants of EHC called EHC-RRW, which use RRWs for that purpose. EHC-RRW is shown to have strong expected runtime guarantees in cases where EHC has previously been shown to be effective. We also run experiments with these approaches on PDDL planning benchmarks to better understand their relative effectiveness for escaping UHRs. |
| title | Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2511.09549 |