mapf.info

webmaster: Sven Koenig

Learn all about Multi-Agent Path Finding (MAPF)

Publication

J. Li, A. Tinka, S. Kiesel, J. Durham, S. Kumar and S. Koenig. Lifelong Multi-Agent Path Finding in Large-Scale Warehouses. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pages (in print), 2020.


Abstract: Multi-Agent Path Finding (MAPF) is the problem of moving a team of agents from their start locations to their goal locations without collisions. We study the lifelong variant of MAPF where agents are constantly engaged with new goal locations, such as in warehouses. We propose a new framework for solving lifelong MAPF by decomposing the problem into a sequence of Windowed MAPF instances, where a Windowed MAPF solver resolves collisions among the paths of agents only within a finite time horizon and ignores collisions beyond it. Our framework is particularly well suited to generating pliable plans that adapt to continually arriving new goal locations. We evaluate our framework with a variety of MAPF solvers and show that it can produce high-quality solutions for up to 1,000 agents, significantly outperforming existing methods.


Download the paper in pdf.


(last updated in 2020)