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 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 …

Abstract Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents to their
goal locations without collisions. In this paper, we study the lifelong variant of MAPF, where …

We study optimal multirobot path planning on graphs (MPP) over four minimization
objectives: the makespan (last arrival time), the maximum (single-robot traveled) distance …

The multi-agent path-finding (MAPF) problem has recently received a lot of attention.
However, it does not capture important characteristics of many real-world domains, such as …

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 …

Abstract Multi-Agent Path Finding (MAPF) is well studied in both AI and robotics. Given a
discretized environment and agents with assigned start and goal locations, MAPF solvers …

In this paper, we study the problem of optimal multi-robot path planning (MPP) on graphs.
We propose two multiflow based integer linear programming (ILP) models that compute …

Multi-agent path finding (MAPF) is a well-studied problem in artificial intelligence that can be
solved quickly in practice when using simplified agent assumptions. However, real-world …

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 …