Multi-agent pathfinding (MAPF) is an area of expanding research interest. At the core of this
research area, numerous diverse search-based techniques were developed in the past 6 …

The determination of the computational complexity of multi-agent pathfinding on directed
graphs has been an open problem for many years. For undirected graphs, solvability can be …

This letter combines sampling-based motion planning with multi-agent search to efficiently
solve challenging multi-robot motion-planning problems with dynamics. This idea has …

In multi-agent path finding (MAPF), it is usually assumed that planning is performed centrally
and that the destinations of the agents are common knowledge. We will drop both …

This paper presents a collection of path planning algorithms for real-time movement of
multiple robots across a Robotic Mobile Fulfillment System (RMFS). Robots are assigned to …

Abstract Multi-Agent Path Finding (MAPF) aims to find a set of conflict-free paths for multiple
agents on a given graph from parking locations to specified goal locations while optimizing …

The pebble motion on trees (PMT) problem consists in finding a feasible sequence of moves
that repositions a set of pebbles to assigned target vertices. This problem has been widely …

This paper presents an effective, cooperative, and probabilistically-complete multirobot
motion planner that enables each robot to move to a desired location while avoiding …

Multi-agent path planning is a very challenging problem that has several applications. It has
received a lot of attention in the last decade. Multi-agent optimal path planning is …

Much of the literature on suboptimal, polynomial-time algorithms for multi-agent path finding
focuses on undirected graphs, where motion is permitted in both directions along a graph …