Abstract The Multi-Objective Multi-Agent Path Finding (MO-MAPF) problem is the problem of
finding the Pareto-optimal frontier of collision-free paths for a team of agents while …

In multi-agent path finding (MAPF) the task is to find nonconflicting paths for multiple agents.
In this paper we focus on finding suboptimal solutions for MAPF for the sum-of-costs variant …

The determination of the computational complexity of multi-agent pathfinding on directed
graphs (diMAPF) has been an open research problem for many years. While diMAPF has …

Abstract Multi-Agent Path Finding (MAPF) is a fundamental motion coordination problem
arising in multi-agent systems with a wide range of applications. The problem's intractability …

Abstract The Multi-Objective Multi-Agent Path Finding (MO-MAPF) problem is the problem of
computing collision-free paths for a team of agents while minimizing multiple cost metrics …

Since more and more algorithms are proposed for multi-agent path finding (MAPF) and each
of them has its strengths, choosing the correct one for a specific scenario that fulfills some …

Mutex propagation and its concomitant symmetry-breaking techniques have proven useful in
Multi-Agent Path Finding (MAPF) with point agents. In this paper, we show that they can be …

The article proposes a new path planning method for a multi-robot system for transportation
with various loading conditions. For a given system, one needs to distribute given pickup …

We propose a task-allocation procedure that includes preplanning and a resource
reallocation method using negotiation for the path management of multiple carry robots …

Multi-agent path finding (MAPF) is a task of finding non-conflicting paths connecting agents'
specified initial and goal positions in a shared environment. We focus on compilation-based …