93 citations · 129 across the 10 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CG2022
Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds
Bahareh Banyassady, Mark de Berg, Karl Bringmann +6
We consider the unlabeled motion-planning problem of unit-disc robots moving in a simple polygonal workspace of edges. The goal is to find a motion plan that moves the robo…
cs.MA2022★ 5 cited
Refined Hardness of Distance-Optimal Multi-Agent Path Finding
Tzvika Geft, Dan Halperin
We study the computational complexity of multi-agent path finding (MAPF). Given a graph and a set of agents, each having a start and target vertex, the goal is to find collisio…