Connect Multi-Agent Path Finding: Generation and Visualization

Connect Multi-Agent Path Finding: Generation and Visualization

Arthur Queffelec, Ocan Sankur, Francois Schwarzentruber

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence

We present a generic tool to visualize missions of the Connected Multi-Agent Path Finding (CMAPF) problem. This problem is a variant of MAPF which requires a group of agents to navigate from an initial configuration to a goal configuration while maintaining connection. The user can create an instance of CMAPF and can play the generated plan. Any algorithm for CMAPF can be plugged into the tool.
Keywords:
Multi-agent Systems: General
Planning and Scheduling: General