论文信息 - Connect Multi-Agent Path Finding: Generation and Visualization

Connect Multi-Agent Path Finding: Generation and Visualization

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.

François Schwarzentruber | Ocan Sankur | Arthur Queffelec

[1] Geoffrey A. Hollinger,et al. Multirobot Coordination With Periodic Connectivity: Theory and Experiments , 2012, IEEE Transactions on Robotics.

[2] François Schwarzentruber,et al. Planning for Connected Agents in a Partially Known Environment , 2021, Canadian Conference on AI.

[3] Ocan Sankur,et al. Conflict-Based Search for Connected Multi-Agent Path Finding , 2020, ArXiv.

[4] Nathan R. Sturtevant,et al. Conflict-based search for optimal multi-agent pathfinding , 2012, Artif. Intell..

[5] Andrea Bonarini,et al. Multiagent Connected Path Planning: PSPACE-Completeness and How to Deal With It , 2018, AAAI.

[6] Sven Koenig,et al. Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding , 2018, ICAPS.

[7] Steven M. LaValle,et al. Optimal Multirobot Path Planning on Graphs: Complete Algorithms and Effective Heuristics , 2015, IEEE Transactions on Robotics.

[8] Petr Koupý. Visualization of problems of motion on a graph , 2010 .

[9] Daniela Rus,et al. Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms , 2012, WAFR.

[10] François Schwarzentruber,et al. Generating Plans for Cooperative Connected UAVs , 2018, IJCAI.

[11] David Tolpin,et al. ICBS: The Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding , 2015, SOCS.