Single-pair shortest pathfinding (SP) algorithms are used to identify the path with the
minimum cost between two vertices in a given graph. However, their time complexity can …

This paper extends a study on improving the performance of reduction-based solvers for the
problem of multi-agent pathfinding. The task is to navigate a set of agents in a graph without …

Multi-agent pathfinding (MAPF) is the problem of finding safe paths for multiple mobile
agents within a shared environment. This problem finds practical applications in real-world …

Multi-agent pathfinding is the task of guiding a group of agents through a shared
environment while preventing collisions. This problem is highly relevant in various real-life …

Multi-Agent Pathfinding [9, MAPF] is the problem of finding paths for agents in graphs while
avoiding collisions. Agents may traverse a graph's edges or wait at vertices. All agents have …

Motivated by autonomous warehouse applications in the real world, we study a variant of
Multi-Agent Path Finding (MAPF) problem where robots also need to pick and deliver some …