5 citations · 14 across the 10 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.RO2022
Multi-Robot Motion Planning for Unit Discs with Revolving Areas
Pankaj K. Agarwal, Tzvika Geft, Dan Halperin +1
We study the problem of motion planning for a collection of labeled unit disc robots in a polygonal environment. We assume that the robots have revolving areas around their sta…
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…