93 citations · 292 across the 46 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
cs.CG2013
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons
Aviv Adler, Mark de Berg, Dan Halperin +1
We consider the following motion-planning problem: we are given unit discs in a simple polygon with vertices, each at their own start position, and we want to move the disc…
cs.RO2013★ 7 cited
Asymptotically near-optimal RRT for fast, high-quality, motion planning
Oren Salzman, Dan Halperin
We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near-optimal. Namely, the solution extracted from LBT-RRT converges to a s…
cs.RO2013★ 2 cited
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
Kiril Solovey, Oren Salzman, Dan Halperin
We present a sampling-based framework for multi-robot motion planning which combines an implicit representation of a roadmap with a novel approach for pathfinding in geometrically…