Oren Salzman
Title
Cited by
Cited by
Year
Asymptotically near-optimal RRT for fast, high-quality motion planning
O Salzman, D Halperin
IEEE Transactions on Robotics 32 (3), 473-483, 2016
1422016
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
K Solovey, O Salzman, D Halperin
The International Journal of Robotics Research 35 (5), 501-513, 2016
1262016
Asymptotically Near-Optimal Motion Planning using Lower Bounds on Cost⋆
O Salzman, D Halperin
arXiv preprint arXiv:1403.7714, 2014
48*2014
Sparsification of motion-planning roadmaps by edge contraction
D Shaharabani, O Salzman, PK Agarwal, D Halperin
2013 IEEE International Conference on Robotics and Automation, 4098-4105, 2013
43*2013
On the power of manifold samples in exploring configuration spaces and the dimensionality of narrow passages
O Salzman, M Hemmer, D Halperin
IEEE Transactions on Automation Science and Engineering 12 (2), 529-538, 2014
332014
New perspective on sampling-based motion planning via random geometric graphs
K Solovey, O Salzman, D Halperin
The International Journal of Robotics Research 37 (10), 1117-1133, 2018
302018
The provable virtue of laziness in motion planning
N Haghtalab, S Mackenzie, A Procaccia, O Salzman, S Srinivasa
Proceedings of the International Conference on Automated Planning and …, 2018
282018
Motion planning via manifold samples
O Salzman, M Hemmer, B Raveh, D Halperin
Algorithmica 67 (4), 547-565, 2013
282013
Algorithmic motion planning
D Halperin, O Salzman, M Sharir
Handbook of Discrete and Computational Geometry, 1311-1342, 2017
272017
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning
M Kleinbort, O Salzman, D Halperin
Algorithmic Foundations of Robotics XII, 624-639, 2020
252020
Lazy receding horizon A* for efficient path planning in graphs with expensive-to-evaluate edges
A Mandalika, O Salzman, S Srinivasa
Proceedings of the International Conference on Automated Planning and …, 2018
242018
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors
M Kleinbort, O Salzman, D Halperin
2015 IEEE International Conference on Robotics and Automation (ICRA), 2985-2990, 2015
212015
An efficient algorithm for computing high-quality paths amid polygonal obstacles
PK Agarwal, K Fox, O Salzman
ACM Transactions on Algorithms (TALG) 14 (4), 1-21, 2018
192018
Generalized lazy search for robot motion planning: Interleaving search and edge evaluation via event-based toggles
A Mandalika, S Choudhury, O Salzman, S Srinivasa
Proceedings of the International Conference on Automated Planning and …, 2019
172019
Motion planning for multilink robots by implicit configuration-space tiling
O Salzman, K Solovey, D Halperin
IEEE Robotics and Automation Letters 1 (2), 760-767, 2016
172016
Online, interactive user guidance for high-dimensional, constrained motion planning
F Islam, O Salzman, M Likhachev
arXiv preprint arXiv:1710.03873, 2017
162017
Minimizing task-space Frechet error via efficient incremental graph search
R Holladay, O Salzman, S Srinivasa
IEEE Robotics and Automation Letters 4 (2), 1999-2006, 2019
142019
Toward asymptotically-optimal inspection planning via efficient near-optimal graph search
M Fu, A Kuntz, O Salzman, R Alterovitz
Robotics science and systems: online proceedings 2019, 2019
122019
Effective footstep planning using homotopy-class guidance
V Ranganeni, S Chintalapudi, O Salzman, M Likhachev
Artificial Intelligence 286, 103346, 2020
11*2020
Research challenges and opportunities in multi-agent path finding and multi-agent pickup and delivery problems
O Salzman, R Stern
Proceedings of the 19th International Conference on Autonomous Agents and …, 2020
112020
The system can't perform the operation now. Try again later.
Articles 1–20