28 citations · 143 across the 25 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2017
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
Pankaj K. Agarwal, Kyle Fox, Oren Salzman
We study a path-planning problem amid a set of obstacles in , in which we wish to compute a short path between two points while also maintaining a high…
cs.CG2016
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…
cs.CG2011★ 10 cited
Motion Planning via Manifold Samples
Oren Salzman, Michael Hemmer, Barak Raveh +1
We present a general and modular algorithmic framework for path planning of robots. Our framework combines geometric methods for exact and complete analysis of low-dimensional conf…