Oren Salzman

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 102

Top Venues

Publications

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)
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)
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)
Han Zhang, Oren Salzman, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
A-A*pex: Efficient Anytime Approximate Multi-Objective Search. SOCS (2024)
Priyanka Rao, Oren Salzman, Jessica Burgner-Kahrs
Towards Contact-Aided Motion Planning for Tendon-Driven Continuum Robots. IEEE Robotics Autom. Lett. 9 (5) (2024)
Priyanka Rao, Oren Salzman, Jessica Burgner-Kahrs
Towards Contact-Aided Motion Planning for Tendon-Driven Continuum Robots. CoRR (2024)
Justin Kottinger, Tzvika Geft, Shaull Almagor, Oren Salzman, Morteza Lahijanian
Introducing Delays in Multi Agent Path Finding. SOCS (2024)
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) (2023)
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)
Shmuel David Alpert, Kiril Solovey, Itzik Klein, Oren Salzman
Inspection planning under execution uncertainty. CoRR (2023)
Dean Zadok, Oren Salzman, Alon Wolf, Alex M. Bronstein
Towards Predicting Fine Finger Motions from Ultrasound Images via Kinematic Representation. ICRA (2023)
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)
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) (2023)
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)
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 (2023)
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)
Oren Salzman
Algorithmic Motion Planning Meets Minimially-Invasive Robotic Surgery. IJCAI (2023)
David Vainshtein, Yaakov Sherma, Kiril Solovey, Oren Salzman
Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery. CoRR (2023)
David Vainshtein, Yaakov Sherma, Kiril Solovey, Oren Salzman
Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery. SOCS (2023)
Mengyu Fu, Kiril Solovey, Oren Salzman, Ron Alterovitz
Toward certifiable optimal motion planning for medical steerable needles. Int. J. Robotics Res. 42 (10) (2023)
Justin Kottinger, Shaull Almagor, Oren Salzman, Morteza Lahijanian
Introducing Delays in Multi-Agent Path Finding. CoRR (2023)
Dean Zadok, Oren Salzman, Alon Wolf, Alex M. Bronstein
Towards Predicting Fine Finger Motions from Ultrasound Images via Kinematic Representation. CoRR (2022)
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) (2022)
Doron Pinsky, Petr Vána, Jan Faigl, Oren Salzman
T*ε - Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems. CoRR (2022)
Han Zhang, Oren Salzman, T. K. Satish Kumar, Ariel Felner, Carlos Hernández Ulloa, Sven Koenig
Anytime Approximate Bi-Objective Search. SOCS (2022)
Nitzan Madar, Kiril Solovey, Oren Salzman
Leveraging Experience in Lifelong Multi-Agent Pathfinding. SOCS (2022)
Dan Elbaz, Gal Novik, Oren Salzman
Wall Street Tree Search: Risk-Aware Planning for Offline Reinforcement Learning. CoRR (2022)
Mengyu Fu, Kiril Solovey, Oren Salzman, Ron Alterovitz
Resolution-Optimal Motion Planning for Steerable Needles. ICRA (2022)
David Vainshtein, Kiril Solovey, Oren Salzman
Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation. CoRR (2022)
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)
Nitzan Madar, Kiril Solovey, Oren Salzman
Leveraging Experience in Lifelong Multi-Agent Pathfinding. CoRR (2022)
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)
Mengyu Fu, Oren Salzman, Ron Alterovitz
Toward Certifiable Motion Planning for Medical Steerable Needles. Robotics: Science and Systems (2021)
Mengyu Fu, Oren Salzman, Ron Alterovitz
Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search. ICRA (2021)
Mengyu Fu, Oren Salzman, Ron Alterovitz
Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search. CoRR (2021)
Jaein Lim, Oren Salzman, Panagiotis Tsiotras
Class-Ordered LPA*: An Incremental-Search Algorithm for Weighted Colored Graphs. IROS (2021)
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) (2021)
David Vainshtain, Oren Salzman
Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation. SOCS (2021)
Ofir Gordon, Yuval Filmus, Oren Salzman
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. SOCS (2021)
Mengyu Fu, Kiril Solovey, Oren Salzman, Ron Alterovitz
Resolution-Optimal Motion Planning for Steerable Needles. CoRR (2021)
Boris Goldin, Oren Salzman
Approximate Bi-Criteria Search by Efficient Representation of Subsets of the Pareto-Optimal Frontier. ICAPS (2021)
Fahad Islam, Oren Salzman, Aditya Agarwal, Maxim Likhachev
Provably Constant-time Planning and Replanning for Real-time Grasping Objects off a Conveyor Belt. CoRR (2021)
Mengyu Fu, Oren Salzman, Ron Alterovitz
Toward Certifiable Motion Planning for Medical Steerable Needles. CoRR (2021)
Michael Bentley, Caleb Rucker, Chakravarthy Reddy, Oren Salzman, Alan Kuntz
A Novel Shaft-to-Tissue Force Model for Safer Motion Planning of Steerable Needles. CoRR (2021)
Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. SOCS (2021)
Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. MRS (2021)
Ofir Gordon, Yuval Filmus, Oren Salzman
Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds. CoRR (2021)
Nir Greshler, Ofir Gordon, Oren Salzman, Nahum Shimkin
Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance. CoRR (2021)
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)
Vinitha Ranganeni, Sahit Chintalapudi, Oren Salzman, Maxim Likhachev
Effective footstep planning using homotopy-class guidance. Artif. Intell. 286 (2020)
Oren Salzman
Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier. CoRR (2020)
Fahad Islam, Oren Salzman, Aditya Agraval, Maxim Likhachev
Provably Constant-Time Planning and Re-planning for Real-time Grasping Objects off a Conveyor. CoRR (2020)
Fahad Islam, Anirudh Vemula, Sung-Kyun Kim, Andrew Dornbush, Oren Salzman, Maxim Likhachev
Planning, Learning and Reasoning Framework for Robot Truck Unloading. ICRA (2020)
Oren Salzman, Roni Stern
Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems. AAMAS (2020)
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)
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 (2019)
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)
Oren Salzman
Sampling-based robot motion planning. Commun. ACM 62 (10) (2019)
Sung-Kyun Kim, Oren Salzman, Maxim Likhachev
POMHDP: Search-Based Belief Space Planning Using Multiple Heuristics. ICAPS (2019)
Fahad Islam, Oren Salzman, Maxim Likhachev
Provable Indefinite-Horizon Real-Time Planning for Repetitive Tasks. ICAPS (2019)
Fahad Islam, Oren Salzman, Maxim Likhachev
Provable Infinite-Horizon Real-Time Planning for Repetitive Tasks. CoRR (2019)
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) (2019)
Wei Du, Sung-Kyun Kim, Oren Salzman, Maxim Likhachev
Escaping Local Minima in Search-Based Planning using Soft Duplicate Detection. IROS (2019)
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 (2019)
Kalyan Vasudev Alwala, Margarita Safonova, Oren Salzman, Maxim Likhachev
Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing. SOCS (2019)
Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa
The Provable Virtue of Laziness in Motion Planning. IJCAI (2019)
Abhijeet Tallavajhula, Adrian Schoisengeier, Sung-Kyun Kim, Anirudh Vemula, Levi Lister, Oren Salzman
Task-Informed Fidelity Management for Speeding Up Robotics Simulation. CoRR (2019)
Mengyu Fu, Alan Kuntz, Oren Salzman, Ron Alterovitz
Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search. CoRR (2019)
Fahad Islam, Anirudh Vemula, Sung-Kyun Kim, Andrew Dornbush, Oren Salzman, Maxim Likhachev
Planning, Learning and Reasoning Framework for Robot Truck Unloading. CoRR (2019)
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)
Mengyu Fu, Alan Kuntz, Oren Salzman, Ron Alterovitz
Toward Asymptotically-Optimal Inspection Planning Via Efficient Near-Optimal Graph Search. Robotics: Science and Systems (2019)
Fahad Islam, Oren Salzman, Maxim Likhachev
Online, Interactive User Guidance for High-dimensional, Constrained Motion Planning. IJCAI (2018)
Aditya Mandalika, Oren Salzman, Siddhartha S. Srinivasa
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges. ICAPS (2018)
Sherdil Niyaz, Alan Kuntz, Oren Salzman, Ron Alterovitz, Siddhartha S. Srinivasa
Following Surgical Trajectories with Concentric Tube Robots via Nearest-Neighbor Graphs. ISER (2018)
Kiril Solovey, Oren Salzman, Dan Halperin
New perspective on sampling-based motion planning via random geometric graphs. Int. J. Robotics Res. 37 (10) (2018)
Pankaj K. Agarwal, Kyle Fox, Oren Salzman
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. ACM Trans. Algorithms 14 (4) (2018)
Vinitha Ranganeni, Oren Salzman, Maxim Likhachev
Effective Footstep Planning for Humanoids Using Homotopy-Class Guidance. ICAPS (2018)
Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa
The Provable Virtue of Laziness in Motion Planning. ICAPS (2018)
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)
Aditya Mandalika, Oren Salzman, Siddhartha S. Srinivasa
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges. CoRR (2018)
Aviel Atias, Kiril Solovey, Oren Salzman, Dan Halperin
Effective metrics for multi-robot motion-planning. Int. J. Robotics Res. 37 (13-14) (2018)
Pankaj K. Agarwal, Kyle Fox, Oren Salzman
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. CoRR (2017)
Shushman Choudhury, Oren Salzman, Sanjiban Choudhury, Siddhartha S. Srinivasa
Densification strategies for anytime motion planning over large dense roadmaps. ICRA (2017)
Vinitha Ranganeni, Oren Salzman, Maxim Likhachev
Effective Footstep Planning for Humanoids Using Homotopy-Class Guidance. CoRR (2017)
Oren Salzman, Brian Hou, Siddhartha S. Srinivasa
Efficient Motion Planning for Problems Lacking Optimal Substructure. ICAPS (2017)
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 (2017)
Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa
The Provable Virtue of Laziness in Motion Planning. CoRR (2017)
Oren Salzman, Brian Hou, Siddhartha S. Srinivasa
Efficient motion planning for problems lacking optimal substructure. CoRR (2017)
Rachel M. Holladay, Oren Salzman, Siddhartha S. Srinivasa
Minimizing Task Space Frechet Error via Efficient Incremental Graph Search. CoRR (2017)
Fahad Islam, Oren Salzman, Maxim Likhachev
Online, interactive user guidance for high-dimensional, constrained motion planning. CoRR (2017)
Shushman Choudhury, Oren Salzman, Sanjiban Choudhury, Christopher M. Dellin, Siddhartha S. Srinivasa
Anytime Motion Planning on Large Dense Roadmaps with Expensive Edge Evaluations. CoRR (2017)
Kiril Solovey, Oren Salzman, Dan Halperin
New perspective on sampling-based motion planning via random geometric graphs. CoRR (2016)
Kiril Solovey, Oren Salzman, Dan Halperin
New perspective on sampling-based motion planning via random geometric graphs. Robotics: Science and Systems (2016)
Oren Salzman, Siddhartha S. Srinivasa
Open problem on risk-aware planning in the plane. CoRR (2016)
Yaki Setty, Oren Salzman
A methodological, task-based approach to Procedure-Specific Simulations training. Int. J. Comput. Assist. Radiol. Surg. 11 (12) (2016)
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) (2016)
Shushman Choudhury, Oren Salzman, Sanjiban Choudhury, Siddhartha S. Srinivasa
Densification Strategies for Anytime Motion Planning over Large Dense Roadmaps. CoRR (2016)
Pankaj K. Agarwal, Kyle Fox, Oren Salzman
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles. SODA (2016)
Michal Kleinbort, Oren Salzman, Dan Halperin
Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning. CoRR (2016)
Michal Kleinbort, Oren Salzman, Dan Halperin
Collision Detection or Nearest-Neighbor Search? On the Computational Bottleneck in Sampling-based Motion Planning. WAFR (2016)

Oren Salzman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Oren Salzman