DeepAI AI Chat
Log In Sign Up

Multi-Agent Pathfinding (MAPF) with Continuous Time

by   Anton Andreychuk, et al.
Institute for Systems Analysis of Russian Academy of Sciences
Ben-Gurion University of the Negev

MAPF is the problem of finding paths for multiple agents such that every agent reaches its goal and the agents do not collide. Most prior work on MAPF were on grid, assumed all actions cost the same, agents do not have a volume, and considered discrete time steps. In this work we propose a MAPF algorithm that do not assume any of these assumptions, is complete, and provides provably optimal solutions. This algorithm is based on a novel combination of SIPP, a continuous time single agent planning algorithms, and CBS, a state of the art multi-agent pathfinding algorithm. We analyze this algorithm, discuss its pros and cons, and evaluate it experimentally on several standard benchmarks.


page 1

page 2

page 3

page 4


Roadmap-Optimal Multi-robot Motion Planning using Conflict-Based Search

Multi-Agent Pathfinding (MAPF) is the problem of finding a set of feasib...

Improving Continuous-time Conflict Based Search

Conflict-Based Search (CBS) is a powerful algorithmic framework for opti...

Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks

The MAPF problem is the fundamental problem of planning paths for multip...

Towards A Complete Multi-Agent Pathfinding Algorithm For Large Agents

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

Systems, Actors and Agents: Operation in a multicomponent environment

Multi-agent approach has become popular in computer science and technolo...

Optimal Physical Sorting of Mobile Agents

Given a collection of red and blue mobile agents located on two grid row...

Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality

Conflict-Based Search is one of the most popular methods for multi-agent...