DeepAI AI Chat
Log In Sign Up

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

by   Roni Stern, et al.
University of Denver
University of Alberta
University of Southern California
Charles University in Prague
Ben-Gurion University of the Negev

The MAPF problem is the fundamental problem of planning paths for multiple agents, where the key constraint is that the agents will be able to follow these paths concurrently without colliding with each other. Applications of MAPF include automated warehouses and autonomous vehicles. Research on MAPF has been flourishing in the past couple of years. Different MAPF research papers make different assumptions, e.g., whether agents can traverse the same road at the same time, and have different objective functions, e.g., minimize makespan or sum of agents' actions costs. These assumptions and objectives are sometimes implicitly assumed or described informally. This makes it difficult to establish appropriate baselines for comparison in research papers, as well as making it difficult for practitioners to find the papers relevant to their concrete application. This paper aims to fill this gap and support researchers and practitioners by providing a unifying terminology for describing common MAPF assumptions and objectives. In addition, we also provide pointers to two MAPF benchmarks. In particular, we introduce a new grid-based benchmark for MAPF, and demonstrate experimentally that it poses a challenge to contemporary MAPF algorithms.


Multi-Agent Pathfinding (MAPF) with Continuous Time

MAPF is the problem of finding paths for multiple agents such that every...

An Introduction to Multi-Agent Reinforcement Learning and Review of its Application to Autonomous Mobility

Many scenarios in mobility and traffic involve multiple different agents...

Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity

We study a fundamental NP-hard motion coordination problem for multi-rob...

A Decentralized Multi-Objective Optimization Algorithm

During the past two decades, multi-agent optimization problems have draw...

Proximal operators for multi-agent path planning

We address the problem of planning collision-free paths for multiple age...

Towards A Complete Multi-Agent Pathfinding Algorithm For Large Agents

Multi-agent pathfinding (MAPF) is a challenging problem which is hard to...

Code Repositories



view repo