21 citations · 21 across the 5 of their papers we have counts for
5 papers
Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation
David Vainshtein, Kiril Solovey, Oren Salzman
Multi-agent pathfinding (MAPF) is concerned with planning collision-free paths for a team of agents from their start to goal locations in an environment cluttered with obstacles. T…
Open problem on risk-aware planning in the plane
Oren Salzman, Siddhartha Srinivasa
We consider the problem of planning a collision-free path of a robot in the presence of risk zones. The robot is allowed to travel in these zones but is penalized in a super-linear…
Densification Strategies for Anytime Motion Planning over Large Dense Roadmaps
Shushman Choudhury, Oren Salzman, Sanjiban Choudhury +1
We consider the problem of computing shortest paths in a dense motion-planning roadmap . We assume that~, the number of vertices of , is very large. Th…
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…
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…