Generalizing Multi-Agent Path Finding for Heterogeneous Agents

Multi-Agent Path Finding (MAPF) is the problem of finding non-colliding paths for multiple agents. The classical problem assumes that all agents are homogeneous, with a fixed size and behavior. However, in reality agents are heterogeneous, with different sizes and behaviors. In this paper, we generalize MAPF to G-MAPF for the case of heterogeneous agents. We then show how two previous settings of large agents and k-robust agents are special cases of G-MAPF. Finally, we introduce G-CBS, a variant of the Conflict-Based Search (CBS) algorithm for G-MAPF, which does not cause significant extra overhead.

Authors

• Dor Atzmon
• Yonathan Zax
• Einat Kivity
• Lidor Avitan
• Jonathan Morag
• Ariel Felner

Keywords

No keywords are indexed for this paper.