The control of a multiple unmanned aerial vehicle (UAV) system is popular and attracting a
lot of attentions. This is motivated by many practical civil and commercial UAV applications …

Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that every agent reaches its goal and the agents do not collide. In recent years, there …

Abstract Multi-Agent Path Finding (MAPF), ie, finding collision-free paths for multiple robots,
is important for many applications where small runtimes are necessary, including the kind of …

Abstract Multi-Agent Pathfinding (MAPF) is the problem of finding paths for multiple agents
such that each agent reaches its goal and the agents do not collide. In recent years, variants …

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 …

Abstract Conflict-Based Search (CBS) and its enhancements are among the strongest
algorithms for Multi-Agent Path Finding. Recent work introduced an admissible heuristic to …

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 consider two new classes of pairwise path symmetries which appear in the context of
Multi-Agent Path Finding (MAPF). The first of them, corridor symmetry, arises when two …

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 …