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 …

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 …

Online social networks greatly promote peoples' online interaction, where trust plays a
crucial role. Trust prediction with trust path search is widely used to help users find the …

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 …

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 …

Path search is designed to find a path by traversing the state spaces from the initial state to
the target state. Given enough memory and run time, the A* algorithm can find an optimal …

This paper presents a new bidirectional search algorithm to solve the shortest path problem.
The new algorithm uses an iterative deepening technique with a consistent heuristic to …