{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:24:38Z","timestamp":1754151878974,"version":"3.41.2"},"reference-count":0,"publisher":"Association for the Advancement of Artificial Intelligence (AAAI)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SOCS"],"abstract":"<jats:p>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.\nWe 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.<\/jats:p>","DOI":"10.1609\/socs.v18i1.36011","type":"journal-article","created":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T06:06:48Z","timestamp":1753078008000},"page":"265-266","source":"Crossref","is-referenced-by-count":0,"title":["Bidirectional Bounded-Suboptimal Heuristic Search with Consistent Heuristics (Extended Abstract)"],"prefix":"10.1609","volume":"18","author":[{"given":"Shahaf","family":"Shperberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natalie","family":"Morad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lior","family":"Siag","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Felner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dor","family":"Atzmon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9382","published-online":{"date-parts":[[2025,7,20]]},"container-title":["Proceedings of the International Symposium on Combinatorial Search"],"original-title":[],"link":[{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/36011\/38166","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/download\/36011\/38166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T06:59:29Z","timestamp":1753081169000},"score":1,"resource":{"primary":{"URL":"https:\/\/ojs.aaai.org\/index.php\/SOCS\/article\/view\/36011"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,20]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1609\/socs.v18i1.36011","relation":{},"ISSN":["2832-9163","2832-9171"],"issn-type":[{"type":"electronic","value":"2832-9163"},{"type":"print","value":"2832-9171"}],"subject":[],"published":{"date-parts":[[2025,7,20]]}}}