3 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.MA2023
Fine-Grained Complexity Analysis of Multi-Agent Path Finding on 2D Grids
Tzvika Geft
Multi-Agent Path Finding (MAPF) is a fundamental motion coordination problem arising in multi-agent systems with a wide range of applications. The problem's intractability has led…
cs.RO2023★ 3 cited
Coordination of Multiple Robots along Given Paths with Bounded Junction Complexity
Mikkel Abrahamsen, Tzvika Geft, Dan Halperin +1
We study a fundamental NP-hard motion coordination problem for multi-robot/multi-agent systems: We are given a graph and set of agents, where each agent has a given directed pa…