Multi-Agent Pathfinding (MAPF) with Continuous Time

01/16/2019

∙

by   Anton Andreychuk, et al.

∙

mail.com

∙

Institute for Systems Analysis of Russian Academy of Sciences

∙

Ben-Gurion University of the Negev

∙

0

∙

share

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.