Refined Hardness of Distance-Optimal Multi-Agent Path Finding

14 March 2022

Papers citing "Refined Hardness of Distance-Optimal Multi-Agent Path Finding"

5 / 5 papers shown

Title
The Parameterized Complexity of Coordinated Motion Planning E. Eiben R. Ganian Iyad A. Kanj 37 9 0 12 Dec 2023
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids Tzvika Geft 32 3 0 25 May 2023
Multi-Robot Motion Planning for Unit Discs with Revolving Areas P. Agarwal Tzvika Geft Dan Halperin Erin Taylor 35 5 0 30 Sep 2022
Efficiently Reconfiguring a Connected Swarm of Labeled Robots S. Fekete Peter Kramer Christian Rieck Christian Scheffer Arne Schmidt 27 6 0 22 Sep 2022
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms Jingjin Yu Daniela Rus LRM 51 61 0 23 May 2012