default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOren Salzman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j20]Priyanka Rao
, Oren Salzman, Jessica Burgner-Kahrs:
Towards Contact-Aided Motion Planning for Tendon-Driven Continuum Robots. IEEE Robotics Autom. Lett. 9(5): 4687-4694 (2024)- [c57]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Sven Koenig:
Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths. ICAPS 2024: 680-688 - [c56]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Theoretical Study on Multi-objective Heuristic Search. IJCAI 2024: 7021-7028 - [c55]Justin Kottinger, Tzvika Geft, Shaull Almagor, Oren Salzman, Morteza Lahijanian:
Introducing Delays in Multi Agent Path Finding. SOCS 2024: 37-45 - [c54]Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A-A*pex: Efficient Anytime Approximate Multi-Objective Search. SOCS 2024: 179-187 - [c53]Carlos Hernández Ulloa, Han Zhang, Sven Koenig, Ariel Felner, Oren Salzman:
Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations. SOCS 2024: 208-212 - [c52]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures. SOCS 2024: 228-232 - [i46]Priyanka Rao, Oren Salzman, Jessica Burgner-Kahrs:
Towards Contact-Aided Motion Planning for Tendon-Driven Continuum Robots. CoRR abs/2402.14175 (2024) - [i45]Eitan Bloch, Oren Salzman:
Offline Task Assistance Planning on a Graph:Theoretic and Algorithmic Foundations. CoRR abs/2409.06373 (2024) - 2023
- [j19]Carlos Hernández, William Yeoh, Jorge A. Baier, Han Zhang, Luis Suazo, Sven Koenig, Oren Salzman:
Simple and efficient bi-objective search algorithms via fast dominance checks. Artif. Intell. 314: 103807 (2023) - [j18]Mengyu Fu, Alan Kuntz, Oren Salzman, Ron Alterovitz:
Asymptotically optimal inspection planning via efficient near-optimal search on sampled roadmaps. Int. J. Robotics Res. 42(4-5): 150-175 (2023) - [j17]Mengyu Fu, Kiril Solovey, Oren Salzman, Ron Alterovitz:
Toward certifiable optimal motion planning for medical steerable needles. Int. J. Robotics Res. 42(10): 798-826 (2023) - [j16]Michael Bentley, Caleb Rucker, Chakravarthy Reddy, Oren Salzman, Alan Kuntz:
Safer Motion Planning of Steerable Needles via a Shaft-to-Tissue Force Model. J. Medical Robotics Res. 8(1&2): 2350003:1-2350003:16 (2023) - [c51]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Carlos Hernández Ulloa, Sven Koenig:
Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies. ICAPS 2023: 452-461 - [c50]Dean Zadok, Oren Salzman, Alon Wolf, Alex M. Bronstein:
Towards Predicting Fine Finger Motions from Ultrasound Images via Kinematic Representation. ICRA 2023: 12645-12651 - [c49]Oren Salzman, Ariel Felner, Carlos Hernández, Han Zhang, Shao-Hung Chan, Sven Koenig:
Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities. IJCAI 2023: 6759-6768 - [c48]Oren Salzman:
Algorithmic Motion Planning Meets Minimially-Invasive Robotic Surgery. IJCAI 2023: 7039-7044 - [c47]David Vainshtein, Yaakov Sherma, Kiril Solovey, Oren Salzman:
Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery. SOCS 2023: 92-100 - [c46]Han Zhang, Oren Salzman, Ariel Felner, T. K. Satish Kumar, Shawn Skyler, Carlos Hernández Ulloa, Sven Koenig:
Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics. SOCS 2023: 101-109 - [c45]Shawn Skyler, Shahaf S. Shperberg, Dor Atzmon, Ariel Felner, Oren Salzman, Shao-Hung Chan, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Must-Expand Nodes in Multi-Objective Search [Extended Abstract]. SOCS 2023: 183-184 - [e1]Roman Barták, Wheeler Ruml, Oren Salzman:
Sixteenth International Symposium on Combinatorial Search, SOCS 2023, Prague, Czech Republic, July 14-16, 2023. AAAI Press 2023 [contents] - [i44]David Vainshtein, Yaakov Sherma, Kiril Solovey, Oren Salzman:
Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery. CoRR abs/2305.11510 (2023) - [i43]Justin Kottinger, Shaull Almagor, Oren Salzman, Morteza Lahijanian:
Introducing Delays in Multi-Agent Path Finding. CoRR abs/2307.11252 (2023) - [i42]Shmuel David Alpert, Kiril Solovey, Itzik Klein, Oren Salzman:
Inspection planning under execution uncertainty. CoRR abs/2309.06113 (2023) - 2022
- [j15]Doron Pinsky, Petr Vána, Jan Faigl, Oren Salzman:
T*$\boldsymbol{\varepsilon}$ - Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems. IEEE Robotics Autom. Lett. 7(2): 4102-4109 (2022) - [c44]Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
A*pex: Efficient Approximate Multi-Objective Search on Graphs. ICAPS 2022: 394-403 - [c43]Mengyu Fu, Kiril Solovey, Oren Salzman, Ron Alterovitz:
Resolution-Optimal Motion Planning for Steerable Needles. ICRA 2022: 9652-9659 - [c42]Nitzan Madar, Kiril Solovey, Oren Salzman:
Leveraging Experience in Lifelong Multi-Agent Pathfinding. SOCS 2022: 118-126 - [c41]Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig:
Anytime Approximate Bi-Objective Search. SOCS 2022: 199-207 - [c40]Shawn Skyler, Dor Atzmon, Ariel Felner, Oren Salzman, Han Zhang, Sven Koenig, William Yeoh, Carlos Hernández Ulloa:
Bounded-Cost Bi-Objective Heuristic Search. SOCS 2022: 239-243 - [i41]Nitzan Madar, Kiril Solovey, Oren Salzman:
Leveraging Experience in Lifelong Multi-Agent Pathfinding. CoRR abs/2202.04382 (2022) - [i40]Dean Zadok, Oren Salzman, Alon Wolf, Alex M. Bronstein:
Towards Predicting Fine Finger Motions from Ultrasound Images via Kinematic Representation. CoRR abs/2202.05204 (2022) - [i39]David Vainshtein, Kiril Solovey, Oren Salzman:
Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation. CoRR abs/2203.10540 (2022) - [i38]Doron Pinsky, Petr Vána, Jan Faigl, Oren Salzman:
T*ε - Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems. CoRR abs/2204.01673 (2022) - [i37]Dan Elbaz, Gal Novik, Oren Salzman:
Wall Street Tree Search: Risk-Aware Planning for Offline Reinforcement Learning. CoRR abs/2211.04583 (2022) - 2021
- [j14]Fahad Islam, Oren Salzman, Aditya Agarwal, Maxim Likhachev:
Provably constant-time planning and replanning for real-time grasping objects off a conveyor belt. Int. J. Robotics Res. 40(12-14): 1370-1384 (2021) - [c39]Boris Goldin, Oren Salzman:
Approximate Bi-Criteria Search by Efficient Representation of Subsets of the Pareto-Optimal Frontier. ICAPS 2021: 149-158 - [c38]Mengyu Fu, Oren Salzman, Ron Alterovitz:
Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search. ICRA 2021: 7449-7456 - [c37]Jaein Lim, Oren Salzman, Panagiotis Tsiotras:
Class-Ordered LPA*: An Incremental-Search Algorithm for Weighted Colored Graphs. IROS 2021: 6907-6913 - [c36]Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin:
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. MRS 2021: 20-28 - [c35]Mengyu Fu, Oren Salzman, Ron Alterovitz:
Toward Certifiable Motion Planning for Medical Steerable Needles. Robotics: Science and Systems 2021 - [c34]Ofir Gordon, Yuval Filmus, Oren Salzman:
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. SOCS 2021: 64-72 - [c33]Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin:
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. SOCS 2021: 173-175 - [c32]David Vainshtein, Oren Salzman:
Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation. SOCS 2021: 239-241 - [i36]Michael Bentley, D. Caleb Rucker, Chakravarthy Reddy, Oren Salzman, Alan Kuntz:
A Novel Shaft-to-Tissue Force Model for Safer Motion Planning of Steerable Needles. CoRR abs/2101.02246 (2021) - [i35]Fahad Islam, Oren Salzman, Aditya Agarwal, Maxim Likhachev:
Provably Constant-time Planning and Replanning for Real-time Grasping Objects off a Conveyor Belt. CoRR abs/2101.07148 (2021) - [i34]Mengyu Fu, Oren Salzman, Ron Alterovitz:
Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search. CoRR abs/2103.13573 (2021) - [i33]Ofir Gordon, Yuval Filmus, Oren Salzman:
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. CoRR abs/2104.08759 (2021) - [i32]Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin:
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. CoRR abs/2105.10993 (2021) - [i31]Mengyu Fu, Oren Salzman, Ron Alterovitz:
Toward Certifiable Motion Planning for Medical Steerable Needles. CoRR abs/2107.04939 (2021) - [i30]Mengyu Fu, Kiril Solovey, Oren Salzman, Ron Alterovitz:
Resolution-Optimal Motion Planning for Steerable Needles. CoRR abs/2110.02907 (2021) - 2020
- [j13]Vinitha Ranganeni, Sahit Chintalapudi, Oren Salzman, Maxim Likhachev:
Effective footstep planning using homotopy-class guidance. Artif. Intell. 286: 103346 (2020) - [c31]Oren Salzman, Roni Stern:
Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems. AAMAS 2020: 1711-1715 - [c30]Fahad Islam, Anirudh Vemula, Sung-Kyun Kim, Andrew Dornbush, Oren Salzman, Maxim Likhachev:
Planning, Learning and Reasoning Framework for Robot Truck Unloading. ICRA 2020: 5011-5017 - [c29]Fahad Islam, Oren Salzman, Aditya Agarwal, Maxim Likhachev:
Provably Constant-time Planning and Re-planning for Real-time Grasping Objects off a Conveyor Belt. Robotics: Science and Systems 2020 - [i29]Fahad Islam, Oren Salzman, Aditya Agraval, Maxim Likhachev:
Provably Constant-Time Planning and Re-planning for Real-time Grasping Objects off a Conveyor. CoRR abs/2003.08517 (2020) - [i28]Oren Salzman:
Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier. CoRR abs/2006.10302 (2020)
2010 – 2019
- 2019
- [j12]Oren Salzman:
Sampling-based robot motion planning. Commun. ACM 62(10): 54-63 (2019) - [j11]Rachel M. Holladay, Oren Salzman, Siddhartha S. Srinivasa:
Minimizing Task-Space Fréchet Error via Efficient Incremental Graph Search. IEEE Robotics Autom. Lett. 4(2): 1999-2006 (2019) - [c28]Fahad Islam, Oren Salzman, Maxim Likhachev:
Provable Indefinite-Horizon Real-Time Planning for Repetitive Tasks. ICAPS 2019: 716-724 - [c27]Sung-Kyun Kim, Oren Salzman, Maxim Likhachev:
POMHDP: Search-Based Belief Space Planning Using Multiple Heuristics. ICAPS 2019: 734-744 - [c26]Aditya Mandalika, Sanjiban Choudhury, Oren Salzman, Siddhartha S. Srinivasa:
Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-Based Toggles. ICAPS 2019: 745-753 - [c25]Tushar Kusnur, Shohin Mukherjee, Dhruv Mauria Saxena, Tomoya Fukami, Takayuki Koyama, Oren Salzman, Maxim Likhachev:
A Planning Framework for Persistent, Multi-UAV Coverage with Global Deconfliction. FSR 2019: 459-474 - [c24]Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa:
The Provable Virtue of Laziness in Motion Planning. IJCAI 2019: 6161-6165 - [c23]Sherdil Niyaz, Alan Kuntz, Oren Salzman, Ron Alterovitz, Siddhartha S. Srinivasa:
optimizing Motion-Planning Problem Setup via Bounded Evaluation with Application to Following Surgical Trajectories. IROS 2019: 1355-1362 - [c22]Wei Du, Sung-Kyun Kim, Oren Salzman, Maxim Likhachev:
Escaping Local Minima in Search-Based Planning using Soft Duplicate Detection. IROS 2019: 2365-2371 - [c21]Mengyu Fu, Alan Kuntz, Oren Salzman, Ron Alterovitz:
Toward Asymptotically-Optimal Inspection Planning Via Efficient Near-Optimal Graph Search. Robotics: Science and Systems 2019 - [c20]Kalyan Vasudev Alwala, Margarita Safonova, Oren Salzman, Maxim Likhachev:
Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing. SOCS 2019: 2-9 - [i27]Fahad Islam, Oren Salzman, Maxim Likhachev:
Provable Infinite-Horizon Real-Time Planning for Repetitive Tasks. CoRR abs/1901.07698 (2019) - [i26]Aditya Mandalika, Sanjiban Choudhury, Oren Salzman, Siddhartha S. Srinivasa:
Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles. CoRR abs/1904.02795 (2019) - [i25]Mengyu Fu, Alan Kuntz, Oren Salzman, Ron Alterovitz:
Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search. CoRR abs/1907.00506 (2019) - [i24]Tushar Kusnur, Shohin Mukherjee, Dhruv Mauria Saxena, Tomoya Fukami, Takayuki Koyama, Oren Salzman, Maxim Likhachev:
A Planning Framework for Persistent, Multi-UAV Coverage with Global Deconfliction. CoRR abs/1908.09236 (2019) - [i23]Fahad Islam, Anirudh Vemula, Sung-Kyun Kim, Andrew Dornbush, Oren Salzman, Maxim Likhachev:
Planning, Learning and Reasoning Framework for Robot Truck Unloading. CoRR abs/1910.09453 (2019) - [i22]Abhijeet Tallavajhula, Adrian Schoisengeier, Sung-Kyun Kim, Anirudh Vemula, Levi Lister, Oren Salzman:
Task-Informed Fidelity Management for Speeding Up Robotics Simulation. CoRR abs/1910.12284 (2019) - 2018
- [j10]Kiril Solovey, Oren Salzman, Dan Halperin:
New perspective on sampling-based motion planning via random geometric graphs. Int. J. Robotics Res. 37(10) (2018) - [j9]Aviel Atias, Kiril Solovey, Oren Salzman, Dan Halperin:
Effective metrics for multi-robot motion-planning. Int. J. Robotics Res. 37(13-14) (2018) - [j8]Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. ACM Trans. Algorithms 14(4): 46:1-46:21 (2018) - [c19]Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa:
The Provable Virtue of Laziness in Motion Planning. ICAPS 2018: 106-113 - [c18]Aditya Mandalika, Oren Salzman, Siddhartha S. Srinivasa:
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges. ICAPS 2018: 476-484 - [c17]Vinitha Ranganeni, Oren Salzman, Maxim Likhachev:
Effective Footstep Planning for Humanoids Using Homotopy-Class Guidance. ICAPS 2018: 500-508 - [c16]Daqing Yi, Rohan Thakker, Cole Gulino, Oren Salzman, Siddhartha S. Srinivasa:
Generalizing Informed Sampling for Asymptotically-Optimal Sampling-Based Kinodynamic Planning via Markov Chain Monte Carlo. ICRA 2018: 7063-7070 - [c15]Fahad Islam, Oren Salzman, Maxim Likhachev:
Online, Interactive User Guidance for High-dimensional, Constrained Motion Planning. IJCAI 2018: 4921-4928 - [c14]Sherdil Niyaz, Alan Kuntz, Oren Salzman, Ron Alterovitz, Siddhartha S. Srinivasa:
Following Surgical Trajectories with Concentric Tube Robots via Nearest-Neighbor Graphs. ISER 2018: 3-13 - [i21]Aditya Mandalika, Oren Salzman, Siddhartha S. Srinivasa:
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges. CoRR abs/1803.04998 (2018) - 2017
- [c13]Oren Salzman, Brian Hou, Siddhartha S. Srinivasa:
Efficient Motion Planning for Problems Lacking Optimal Substructure. ICAPS 2017: 531-539 - [c12]Shushman Choudhury, Oren Salzman, Sanjiban Choudhury, Siddhartha S. Srinivasa:
Densification strategies for anytime motion planning over large dense roadmaps. ICRA 2017: 3770-3777 - [i20]Oren Salzman, Brian Hou, Siddhartha S. Srinivasa:
Efficient motion planning for problems lacking optimal substructure. CoRR abs/1703.02582 (2017) - [i19]Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. CoRR abs/1706.02939 (2017) - [i18]Fahad Islam, Oren Salzman, Maxim Likhachev:
Online, interactive user guidance for high-dimensional, constrained motion planning. CoRR abs/1710.03873 (2017) - [i17]Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa:
The Provable Virtue of Laziness in Motion Planning. CoRR abs/1710.04101 (2017) - [i16]Daqing Yi, Rohan Thakker, Cole Gulino, Oren Salzman, Siddhartha S. Srinivasa:
Generalizing Informed Sampling for Asymptotically Optimal Sampling-based Kinodynamic Planning via Markov Chain Monte Carlo. CoRR abs/1710.06092 (2017) - [i15]Rachel M. Holladay, Oren Salzman, Siddhartha S. Srinivasa:
Minimizing Task Space Frechet Error via Efficient Incremental Graph Search. CoRR abs/1710.06738 (2017) - [i14]Shushman Choudhury, Oren Salzman, Sanjiban Choudhury, Christopher M. Dellin, Siddhartha S. Srinivasa:
Anytime Motion Planning on Large Dense Roadmaps with Expensive Edge Evaluations. CoRR abs/1711.04040 (2017) - [i13]Vinitha Ranganeni, Oren Salzman, Maxim Likhachev:
Effective Footstep Planning for Humanoids Using Homotopy-Class Guidance. CoRR abs/1712.00531 (2017) - 2016
- [b1]Oren Salzman:
Efficient high-quality motion planning in tight settings. Tel Aviv University, Israel, 2016 - [j7]Yaki Setty, Oren Salzman:
A methodological, task-based approach to Procedure-Specific Simulations training. Int. J. Comput. Assist. Radiol. Surg. 11(12): 2317-2324 (2016) - [j6]Kiril Solovey, Oren Salzman, Dan Halperin:
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning. Int. J. Robotics Res. 35(5): 501-513 (2016) - [j5]Oren Salzman, Kiril Solovey, Dan Halperin:
Motion Planning for Multilink Robots by Implicit Configuration-Space Tiling. IEEE Robotics Autom. Lett. 1(2): 760-767 (2016) - [j4]Oren Salzman, Dan Halperin:
Asymptotically Near-Optimal RRT for Fast, High-Quality Motion Planning. IEEE Trans. Robotics 32(3): 473-483 (2016) - [c11]Kiril Solovey, Oren Salzman, Dan Halperin:
New perspective on sampling-based motion planning via random geometric graphs. Robotics: Science and Systems 2016 - [c10]Pankaj K. Agarwal, Kyle Fox, Oren Salzman:
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. SODA 2016: 1179-1192 - [c9]Michal Kleinbort, Oren Salzman, Dan Halperin:
Collision Detection or Nearest-Neighbor Search? On the Computational Bottleneck in Sampling-based Motion Planning. WAFR 2016: 624-639 - [i12]Kiril Solovey, Oren Salzman, Dan Halperin:
New perspective on sampling-based motion planning via random geometric graphs. CoRR abs/1602.05460 (2016) - [i11]Michal Kleinbort, Oren Salzman, Dan Halperin:
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning. CoRR abs/1607.04800 (2016) - [i10]Shushman Choudhury, Oren Salzman, Sanjiban Choudhury, Siddhartha S. Srinivasa:
Densification Strategies for Anytime Motion Planning over Large Dense Roadmaps. CoRR abs/1611.00111 (2016) - [i9]Oren Salzman, Siddhartha S. Srinivasa:
Open problem on risk-aware planning in the plane. CoRR abs/1612.05101 (2016) - 2015
- [j3]Oren Salzman, Michael Hemmer, Dan Halperin:
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. IEEE Trans Autom. Sci. Eng. 12(2): 529-538 (2015) - [c8]Michal Kleinbort, Oren Salzman, Dan Halperin:
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. ICRA 2015: 2985-2990 - [c7]Oren Salzman, Dan Halperin:
Optimal motion planning for a tethered robot: Efficient preprocessing for fast shortest paths queries. ICRA 2015: 4161-4166 - [c6]Oren Salzman, Dan Halperin:
Asymptotically-optimal Motion Planning using lower bounds on cost. ICRA 2015: 4167-4172 - [i8]Oren Salzman, Kiril Solovey, Dan Halperin:
Motion Planning for Multi-Link Robots by Implicit Configuration-Space Tiling. CoRR abs/1504.06631 (2015) - 2014
- [j2]Oren Salzman, Doron Shaharabani, Pankaj K. Agarwal, Dan Halperin:
Sparsification of motion-planning roadmaps by edge contraction. Int. J. Robotics Res. 33(14): 1711-1725 (2014) - [c5]Oren Salzman, Dan Halperin:
Asymptotically near-optimal RRT for fast, high-quality, motion planning. ICRA 2014: 4680-4685 - [c4]Kiril Solovey, Oren Salzman, Dan Halperin:
Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-robot Motion Planning. WAFR 2014: 591-607 - [i7]Oren Salzman, Dan Halperin:
Asymptotically Near-Optimal Motion Planning using Lower Bounds on Cost. CoRR abs/1403.7714 (2014) - [i6]Michal Kleinbort, Oren Salzman, Dan Halperin:
Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors. CoRR abs/1409.8112 (2014) - 2013
- [j1]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. Algorithmica 67(4): 547-565 (2013) - [c3]Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin:
Sparsification of motion-planning roadmaps by edge contraction. ICRA 2013: 4098-4105 - [i5]Kiril Solovey, Oren Salzman, Dan Halperin:
Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-Robot Motion Planning. CoRR abs/1305.2889 (2013) - [i4]Oren Salzman, Dan Halperin:
Asymptotically near-optimal RRT for fast, high-quality, motion planning. CoRR abs/1308.0189 (2013) - 2012
- [c2]Oren Salzman, Michael Hemmer, Dan Halperin:
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. WAFR 2012: 313-329 - [i3]Oren Salzman, Michael Hemmer, Dan Halperin:
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages. CoRR abs/1202.5249 (2012) - [i2]Doron Shaharabani, Oren Salzman, Pankaj K. Agarwal, Dan Halperin:
Sparsification of Motion-Planning Roadmaps by Edge Contraction. CoRR abs/1209.4463 (2012) - 2011
- [c1]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. ESA 2011: 493-505 - [i1]Oren Salzman, Michael Hemmer, Barak Raveh, Dan Halperin:
Motion Planning via Manifold Samples. CoRR abs/1107.0803 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-21 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
