Bi-objective search is a problem of finding a set of optimal solutions in a two-dimensional
domain. This study proposes several enhancements to the state-of-the-art bi-objective …

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 …

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

Recent work in bidirectional heuristic search characterize pairs of nodes from which at least
one node must be expanded in order to ensure optimality of solutions. We use these …

Recently, the proposal of individual bounds that use consistent heuristics in front-to-end
bidirectional search has improved the state of the art. However, modern theory in …

The question of when bidirectional heuristic search outperforms unidirectional heuristic
search has been revisited numerous times in the field of Artificial Intelligence. This paper re …

This paper presents a bidirectional search algorithm that dynamically improves the bounds
during its execution. It has the property that it always terminates on or before the forward …

The field of bidirectional heuristic search has recently seen great advances. However, the
subject of memory-restricted bidirectional search has not received recent attention. In this …

This paper presents two new bidirectional heuristic search algorithms for solving the shortest
path problem on graphs: consistent-heuristic bucket-based bidirectional search (CBBS) and …