This paper applies the A^* algorithm commonly used in game development to mobile robot
path planning. Although the A^* algorithm is characterized by optimality, simplicity, and …

In this paper we study the One-to-Many Shortest Path Problem (OMSPP), which is the
problem of solving k shortest path problems that share the same start node. This problem …

Multi-criteria path planning is an important combinatorial optimization problem with broad
real-world applications. Finding the Pareto-optimal set of paths ideal for all requiring …

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 …

Abstract Multi-Agent Meeting (MAM) is the problem of finding a meeting location for multiple
agents and paths to that location. Practically, a solution to MAM may contain conflicting …

Bidirectional search algorithms interleave a search forward from the start state (start) and a
search backward (ie using reverse operators) from the goal state (goal). We say that the two …

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 …

Planning a collision-free path efficiently among obstacles is crucial in robotics. Conventional
one-shot unidirectional path planning algorithms work well in the static environment, but …