Home/Oren Salzman

Oren Salzman

Postdoctoral Fellow
Email: osalzman@andrew.cmu.edu
Office: NSH 4519
Mailing Address:

Carnegie Mellon University
Robotics Institute
5000 Forbes Avenue
Pittsburgh, PA 15213

Displaying 16 Publications
Asymptotically-optimal Motion Planning using lower bounds on cost
Oren Salzman and Dan Halperin

Conference Paper, 2017 IEEE International Conference on Robotics and Automation (ICRA), pp. 4167-4172, May, 2017
Densification Strategies for Anytime Motion Planning over Large Dense Roadmaps
Shushman Choudhury, Oren Salzman, Sanjiban Choudhury and Siddhartha Srinivasa

Conference Paper, 2017 IEEE International Conference on Robotics and Automation (ICRA), May, 2017
Asymptotically Near-Optimal RRT for Fast, High-Quality Motion Planning
Oren Salzman and Dan Halperin

Journal Article, IEEE Trans. Robotics, Vol. 32, No. 3, pp. 473-483, June, 2016
New perspective on sampling-based motion planning via random geometric graphs
Kiril Solovey, Oren Salzman and Dan Halperin

Robotics: Science and Systems (RSS), June, 2016
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
Pankaj K. Agarwal, Kyle Fox and Oren Salzman

Conference Paper, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1179-1192, January, 2016
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
Kiril Solovey, Oren Salzman and Dan Halperin

Journal Article, The International Journal of Robotics Research (IJRR), Vol. 35, No. 5, pp. 501-513, January, 2016
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors
Michal Kleinbort, Oren Salzman and Dan Halperin

Conference Paper, Carnegie Mellon University, IEEE International Conference on Robotics and Automation (ICRA), pp. 2985-2990, May, 2015
Optimal motion planning for a tethered robot: Efficient preprocessing for fast shortest paths queries
Oren Salzman and Dan Halperin

Conference Paper, Carnegie Mellon University, IEEE International Conference on Robotics and Automation (ICRA), pp. 4161-4166, May, 2015
Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-robot Motion Planning
Kiril Solovey, Oren Salzman and Dan Halperin

Conference Paper, Carnegie Mellon University, Workshop on the Algorithmic Foundations of Robotics (WAFR), pp. 591-607, April, 2015
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages
Oren Salzman, Michael Hemmer and Dan Halperin

Conference Paper, Carnegie Mellon University, IEEE Trans. Automation Science and Engineering (TASE), Vol. 12, No. 2, pp. 529-538, April, 2015
Sparsification of motion-planning roadmaps by edge contraction
Oren Salzman, Doron Shaharabani, Pankaj K. Agarwal and Dan Halperin

Conference Paper, Carnegie Mellon University, The International Journal of Robotics Research (IJRR), Vol. 33, No. 14, pp. 1711-1725, November, 2014
Asymptotically near-optimal RRT for fast, high-quality, motion planning
Oren Salzman and Dan Halperin

Conference Paper, Carnegie Mellon University, IEEE International Conference on Robotics and Automation (ICRA), pp. 4680-4685, May, 2014
Motion Planning via Manifold Samples
Oren Salzman, Michael Hemmer, Barak Raveh and Dan Halperin

Journal Article, Carnegie Mellon University, Algorithmica, Vol. 67, No. 4, pp. 547-565, January, 2013
Sparsification of motion-planning roadmaps by edge contraction
Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal and Dan Halperin

Conference Paper, Carnegie Mellon University, IEEE International Conference on Robotics and Automation (ICRA), pp. 4098-4105, January, 2013
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages
Oren Salzman, Michael Hemmer and Dan Halperin

Conference Paper, Carnegie Mellon University, Workshop on the Algorithmic Foundations of Robotics (WAFR), pp. 313-329, June, 2012
Motion Planning via Manifold Samples
Oren Salzman, Michael Hemmer, Barak Raveh and Dan Halperin

Conference Paper, Carnegie Mellon University, European Symposium on Algorithms (ESA), pp. 493-505, September, 2011
2017-05-22T12:35:02+00:00