93 citations · 129 across the 10 of their papers we have counts for
Showing cs.MAShow all
3 papers · 1 filter
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…
cs.MA2019★ 2 cited
Sensory Regimes of Effective Distributed Searching without Leaders
Ravid Cohen, Yossi Yovel, Dan Halperin
Collective animal movement fascinates children and scientists alike. One of the most commonly given explanations for collective animal movement is improved foraging. Animals are hy…
cs.MA2017
Scalable Asymptotically-Optimal Multi-Robot Motion Planning
Andrew Dobson, Kiril Solovey, Rahul Shome +2
Finding asymptotically-optimal paths in multi-robot motion planning problems could be achieved, in principle, using sampling-based planners in the composite configuration space of…