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 …

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 …

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 …

A* is optimal among admissible unidirectional algorithms when searching with a consistent
heuristic. Recently, similar optimality bounds have been established for bidirectional search …

A* is optimally effective with regard to node expansions among unidirectional admissible
algorithms—those that only assume that the heuristic used is admissible. Among …

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 …

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 …

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 …

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 …

In this paper, we develop theoretical foundations for bidirectional bounded-suboptimal
search (BiBSS) based on recent advancements in optimal bidirectional search. In addition …