Conflict-Based Search for Connected Multi-Agent Path Finding

We study a variant of the multi-agent path finding problem (MAPF) in which agents are required to remain connected to each other and to a designated base. This problem has applications in search and rescue missions where the entire execution must be monitored by a human operator. We re-visit the conflict-based search algorithm known for MAPF, and define a variant where conflicts arise from disconnections rather than collisions. We study optimizations, and give experimental results in which we compare our algorithms with the literature.

[1]  Nathan R. Sturtevant,et al.  Benchmarks for Grid-Based Pathfinding , 2012, IEEE Transactions on Computational Intelligence and AI in Games.

[2]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[3]  Roni Stern,et al.  Don't Split, Try To Work It Out: Bypassing Conflicts in Multi-Agent Pathfinding , 2015, ICAPS.

[4]  Nathan R. Sturtevant,et al.  Partial-Expansion A* with Selective Node Generation , 2012, SOCS.

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

[6]  David Silver,et al.  Cooperative Pathfinding , 2005, AIIDE.

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

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

[9]  François Schwarzentruber,et al.  Reachability and Coverage Planning for Connected Agents , 2019, AAMAS.

[10]  Trevor Scott Standley.  Finding Optimal Solutions to Cooperative Pathfinding Problems , 2010, AAAI.

[11]  Peter J. Stuckey,et al.  Disjoint splitting for conflict-based search for Multi-Agent Path Finding , 2019 .

[12]  Nicola Basilico,et al.  Multirobot Exploration of Communication-Restricted Environments: A Survey , 2017, IEEE Intelligent Systems.

[13]  Teruhisa Miura,et al.  A* with Partial Expansion for Large Branching Factor Problems , 2000, AAAI/IAAI.

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

[15]  Nathan R. Sturtevant,et al.  Meta-Agent Conflict-Based Search For Optimal Multi-Agent Path Finding. , 2012 .

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