28 citations · 143 across the 25 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.RO2014
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors
Michal Kleinbort, Oren Salzman, Dan Halperin
Sampling-based motion-planning algorithms typically rely on nearest-neighbor (NN) queries when constructing a roadmap. Recent results suggest that in various settings NN queries ma…
cs.RO2014★ 2 cited
Asymptotically-Optimal Motion Planning using Lower Bounds on Cost
Oren Salzman, Dan Halperin
Many path-finding algorithms on graphs such as A* are sped up by using a heuristic function that gives lower bounds on the cost to reach the goal. Aiming to apply similar technique…