28 citations · 143 across the 25 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
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…