93 citations · 292 across the 46 of their papers we have counts for
49 papers
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…
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…
Localization with Single or Antipodal Distance Measurements
Barak Ugav, Steven M. LaValle, Dan Halperin
Given a polygonal workspace , a depth sensor placed at point inside and oriented in direction measures the distance between and the closest po…
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…
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…
CGAL Made More Accessible
Nir Goren, Efi Fogel, Dan Halperin
We introduce bindings that enable the convenient, efficient, and reliable use of software modules of CGAL (Computational Geometry Algorithm Library), which are written in C++, from…