Refined Hardness of Distance-Optimal Multi-Agent Path Finding

14 March 2022

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

4 / 4 papers shown

Title
Computing Coordinated Motion Plans for Robot Swarms: The CG:SHOP Challenge 2021 S. Fekete Phillip Keldenich Dominik Krupke Joseph S. B. Mitchell 52 20 0 29 Mar 2021
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses Jiaoyang Li Andrew Tinka Scott Kiesel Joseph W. Durham T. K. S. Kumar Sven Koenig AI4CE 38 232 0 15 May 2020
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch Erik D. Demaine S. Fekete Phillip Keldenich H. Meijer Christian Scheffer 46 51 0 05 Jan 2018
Pebble Motion on Graphs with Rotations: Efficient Feasibility Tests and Planning Algorithms Jingjin Yu Daniela Rus LRM 69 61 0 23 May 2012