Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance
Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin
Abstract
We introduce the Cooperative Multi-Agent Path Finding (Co-MAPF) problem, an extension to the classical MAPF problem, where cooperative behavior is incorporated. In this setting, a group of autonomous agents operate in a shared environment and have to complete cooperative tasks while avoiding collisions with each other. This extension naturally models many real-world applications, where groups of agents must work together to complete a given task. To this end, we formalize the Co-MAPF problem and introduce Cooperative Conflict-Based Search (Co-CBS), a CBS-based algorithm for solving the problem optimally for a wide set of Co-MAPF problems. Co-CBS uses a cooperation-planning module integrated into CBS such that cooperation planning is decoupled from path planning, while ensuring that paths obtained are optimal. Finally, we present empirical results on several MAPF benchmarks demonstrating our algorithm's properties.