Abstract
Recent advancements in bidirectional heuristic search have yielded significant theoretical insights and novel algorithms. While most previous work has concentrated on optimal search methods, this paper focuses on bounded-suboptimal bidirectional search, where a bound on the suboptimality of the solution cost is specified. We build upon the state-of-the-art optimal bidirectional search algorithm, BAE*, designed for consistent heuristics, and introduce several variants of BAE* specifically tailored for the bounded-suboptimal context. Through experimental evaluation, we compare the performance of these new variants against other bounded-suboptimal bidirectional algorithms as well as the standard weighted A* algorithm. Our results demonstrate that each algorithm excels under distinct conditions, highlighting the strengths and weaknesses of each approach.
| Original language | English |
|---|---|
| Title of host publication | 18th International Symposium on Combinatorial Search, SoCS 2025 |
| Editors | Maxim Likhachev, Hana Rudová, Enrico Scala |
| Publisher | Association for the Advancement of Artificial Intelligence |
| Pages | 265-266 |
| Number of pages | 2 |
| ISBN (Print) | 9781577359012 |
| DOIs | |
| State | Published - 2025 |
| Event | 18th International Symposium on Combinatorial Search, SoCS 2025 - Glasgow, United Kingdom Duration: 12 Aug 2025 → 15 Aug 2025 |
Publication series
| Name | The International Symposium on Combinatorial Search |
|---|---|
| Volume | 18 |
| ISSN (Print) | 2832-9171 |
| ISSN (Electronic) | 2832-9163 |
Conference
| Conference | 18th International Symposium on Combinatorial Search, SoCS 2025 |
|---|---|
| Country/Territory | United Kingdom |
| City | Glasgow |
| Period | 12/08/25 → 15/08/25 |
Bibliographical note
Publisher Copyright:© 2025, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.