research
∙
05/25/2023
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
Multi-Agent Path Finding (MAPF) is a fundamental motion coordination pro...
share
research
∙
03/01/2023
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity
We study a fundamental NP-hard motion coordination problem for multi-rob...
research
∙
09/30/2022
Multi-Robot Motion Planning for Unit Discs with Revolving Areas
We study the problem of motion planning for a collection of n labeled un...
research
∙
03/14/2022
Refined Hardness of Distance-Optimal Multi-Agent Path Finding
We study the computational complexity of multi-agent path finding (MAPF)...
research
∙
04/14/2021
On the Complexity of a Family of Decoupled Multi-Robot Motion Planning Problems
In multi-robot motion planning (MRMP) the aim is to plan the motion of s...
research
∙
09/25/2020
On Two-Handed Planar Assembly Partitioning
Assembly planning, which is a fundamental problem in robotics and automa...
research
∙
09/20/2020
