21 citations · 41 across the 11 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.RO2016★ 1 cited
Efficient sampling-based bottleneck pathfinding over cost maps
Kiril Solovey, Dan Halperin
We introduce a simple yet effective sampling-based planner that is tailored for bottleneck pathfinding: Given an implicitly-defined cost map $\mathcal{M}:\mathbb{R}^d\rightarrow \m…
cs.RO2016★ 21 cited
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning
Michal Kleinbort, Oren Salzman, Dan Halperin
The complexity of nearest-neighbor search dominates the asymptotic running time of many sampling-based motion-planning algorithms. However, collision detection is often considered…