Abstract
In this paper, we develop theoretical foundations for bidirectional bounded-suboptimal search (BiBSS) based on recent advancements in optimal bidirectional search. In addition, we introduce a BiBSS variant of the prominent meet-in-the-middle (MM) algorithm, called Weighted MM (WMM). We show that WMM has an interesting property of being Wrestrained, and study it empirically.
| Original language | English |
|---|---|
| Pages (from-to) | 26-30 |
| Number of pages | 5 |
| Journal | Proceedings International Conference on Automated Planning and Scheduling, ICAPS |
| Volume | 33 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2023 |
| Externally published | Yes |
| Event | 33rd International Conference on Automated Planning and Scheduling, ICAPS 2023 - Prague, Czech Republic Duration: 8 Jul 2023 → 13 Jul 2023 |
Bibliographical note
Publisher Copyright:Copyright © 2023, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
Funding
This work was funded by the United States-Israel Binational Science Foundation (BSF) under grant numbers 2017692 and 2021643, and by the Canada CIFAR AI Chairs Program. We acknowledge the support of the Natural Sciences and Engineering Research Council of Canada (NSERC).
| Funders | Funder number |
|---|---|
| Natural Sciences and Engineering Research Council of Canada | |
| British Skin Foundation | 2017692, 2021643 |
| United States-Israel Binational Science Foundation |