5 citations · 14 across the 10 of their papers we have counts for
Showing cs.MAShow all
2 papers · 1 filter
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.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…