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 - 1 Jan 2023 |
Event | 33rd International Conference on Automated Planning and Scheduling, ICAPS 2023 - Prague, Czech Republic Duration: 8 Jul 2023 → 13 Jul 2023 |
ASJC Scopus subject areas
- Artificial Intelligence
- Computer Science Applications
- Information Systems and Management