Front-to-end bidirectional heuristic search with near-optimal node expansions
It is well-known that any admissible unidirectional heuristic search algorithm must expand all
states whose $ f $-value is smaller than the optimal solution cost when using a consistent …
states whose $ f $-value is smaller than the optimal solution cost when using a consistent …
Necessary and sufficient conditions for avoiding reopenings in best first suboptimal search with general bounding functions
J Chen, NR Sturtevant - Proceedings of the AAAI Conference on …, 2021 - ojs.aaai.org
Recent work introduced XDP and XUP priority functions for best-first bounded-suboptimal
search that do not need to perform state re-expansions as long as the search heuristic is …
search that do not need to perform state re-expansions as long as the search heuristic is …
A brief history and recent achievements in bidirectional search
The state of the art in bidirectional search has changed significantly a very short time period;
we now can answer questions about unidirectional and bidirectional search that until very …
we now can answer questions about unidirectional and bidirectional search that until very …
The minimal set of states that must be expanded in a front-to-end bidirectional search
A* is optimal among admissible unidirectional algorithms when searching with a consistent
heuristic. Recently, similar optimality bounds have been established for bidirectional search …
heuristic. Recently, similar optimality bounds have been established for bidirectional search …
Minimizing node expansions in bidirectional search with consistent heuristics
A* is optimally effective with regard to node expansions among unidirectional admissible
algorithms—those that only assume that the heuristic used is admissible. Among …
algorithms—those that only assume that the heuristic used is admissible. Among …
Enriching non-parametric bidirectional search algorithms
NBS is a non-parametric bidirectional search algorithm proven to expand at most twice the
number of node expansions required to verify the optimality of a solution. We introduce new …
number of node expansions required to verify the optimality of a solution. We introduce new …
Comparing Front-to-Front and Front-to-End Heuristics in Bidirectional Search
Most recent theoretical and algorithmic work in bidirectional heuristic search (BiHS) used
front-to-end (F2E) heuristics that estimate the distance to the start and goal states. In this …
front-to-end (F2E) heuristics that estimate the distance to the start and goal states. In this …
A unifying view on individual bounds and heuristic inaccuracies in bidirectional search
In the past few years, new very successful bidirectional heuristic search algorithms have
been proposed. Their key novelty is a lower bound on the cost of a solution that includes …
been proposed. Their key novelty is a lower bound on the cost of a solution that includes …
W-restrained bidirectional bounded-suboptimal heuristic search
In this paper, we develop theoretical foundations for bidirectional bounded-suboptimal
search (BiBSS) based on recent advancements in optimal bidirectional search. In addition …
search (BiBSS) based on recent advancements in optimal bidirectional search. In addition …
GBFHS: A generalized breadth-first heuristic search algorithm
Recently there has been renewed interest in bidirectional heuristic search. New algorithms,
eg, MM, MMe, and NBS, have been introduced which seem much closer to refuting the …
eg, MM, MMe, and NBS, have been introduced which seem much closer to refuting the …