93 citations · 292 across the 46 of their papers we have counts for
Showing 2014 · cs.ROShow all
3 papers · 2 filters
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★ 14 cited
On the hardness of unlabeled multi-robot motion planning
Kiril Solovey, Dan Halperin
In unlabeled multi-robot motion planning several interchangeable robots operate in a common workspace. The goal is to move the robots to a set of target positions such that each po…
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…