Multi-agent pathfinding (MAPF) is a well-studied abstract model for navigation in a multi-
robot system, where every robot finds the path to its goal position without any collision. Due …

Abstract Purpose of Review Planning collision-free paths for multiple robots is important for
real-world multi-robot systems and has been studied as an optimization problem on graphs …

Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of
robots is tasked with transporting a set of tasks, each from an initial location and each to a …

Multi-agent path finding (MAPF) is an indispensable component of large-scale robot
deployments in numerous domains ranging from airport management to warehouse …

Abstract Multi-Agent Path Finding (MAPF) is a challenging combinatorial problem that asks
us to plan collision-free paths for a team of cooperative agents. In this work, we show that …

We propose a novel complete algorithm for multi-agent pathfinding (MAPF) called lazy
constraints addition search for MAPF (LaCAM). MAPF is a problem of finding collision-free …

This paper proposes an A* guiding deep Q-network (AG-DQN) algorithm for solving the
pathfinding problem of an automated guided vehicle (AGV) in a robotic mobile fulfillment …

Abstract In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph
must reach their own respective destinations without inter-agent collisions. In practical MAPF …

We study the problem of generating arbitrarily large environments to improve the throughput
of multi-robot systems. Prior work proposes Quality Diversity (QD) algorithms as an effective …

The development of connected and autonomous vehicles opens an opportunity to manage
intersections without signals. One promising approach is to use a central autonomous …