.png){kind=icon}
.png){kind=icon}
Return
Is DIBBS a DXBB Algorithm?
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2025.104468.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The recently-introduced Dynamically Improved Bounds Bidirectional Search (DIBBS) algorithm attributes its success to the fact that it is not a deterministic expansion-based black box algorithm (DXBB). After communication with the authors, there is agreement that this characterization is incorrect. The goal of this research note is to provide correction in the literature regarding the claims around DIBBS, to make it clearer why DIBBS is a DXBB algorithm, and to explain why its performance is bounded by bidirectional search theory.
Keywords:
bidirectional
heuristic
search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
A
IF:
4.6
Papers:
74
Citations:
1