Oren Salzman

Jessica Burgner-Kahrs

IEEE Robotics Autom. Lett., May, 2024

Efficient Set Dominance Checks in Multi-Objective Shortest-Path Algorithms via Vectorized Operations.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Introducing Delays in Multi Agent Path Finding.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

A-A*pex: Efficient Anytime Approximate Multi-Objective Search.

[BibT_eX]

[DOI]

Han Zhang

Ariel Felner

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Speeding Up Dominance Checks in Multi-Objective Search: New Techniques and Data Structures.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth International Symposium on Combinatorial Search, 2024

Bounded-Suboptimal Weight-Constrained Shortest-Path Search via Efficient Representation of Paths.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

2023

Toward certifiable optimal motion planning for medical steerable needles.

[BibT_eX]

[DOI]

Int. J. Robotics Res., September, 2023

Asymptotically optimal inspection planning via efficient near-optimal search on sampled roadmaps.

[BibT_eX]

[DOI]

Int. J. Robotics Res., April, 2023

Safer Motion Planning of Steerable Needles via a Shaft-to-Tissue Force Model.

[BibT_eX]

[DOI]

J. Medical Robotics Res., 2023

Inspection planning under execution uncertainty.

[BibT_eX]

[DOI]

CoRR, 2023

Introducing Delays in Multi-Agent Path Finding.

[BibT_eX]

[DOI]

CoRR, 2023

Simple and efficient bi-objective search algorithms via fast dominance checks.

[BibT_eX]

[DOI]

Artif. Intell., 2023

Towards Effective Multi-Valued Heuristics for Bi-objective Shortest-Path Algorithms via Differential Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Terraforming - Environment Manipulation during Disruptions for Multi-Agent Pickup and Delivery.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Must-Expand Nodes in Multi-Objective Search [Extended Abstract].

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023

Heuristic-Search Approaches for the Multi-Objective Shortest-Path Problem: Progress and Research Opportunities.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Algorithmic Motion Planning Meets Minimially-Invasive Robotic Surgery.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Towards Predicting Fine Finger Motions from Ultrasound Images via Kinematic Representation.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2023

Efficient Multi-Query Bi-Objective Search via Contraction Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

T*$\boldsymbol{\varepsilon}$ - Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2022

Wall Street Tree Search: Risk-Aware Planning for Offline Reinforcement Learning.

[BibT_eX]

[DOI]

Dan Elbaz

Gal Novik

CoRR, 2022

T*ε - Bounded-Suboptimal Efficient Motion Planning for Minimum-Time Planar Curvature-Constrained Systems.

[BibT_eX]

[DOI]

CoRR, 2022

Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation.

[BibT_eX]

[DOI]

David Vainshtein

CoRR, 2022

Anytime Approximate Bi-Objective Search.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Bounded-Cost Bi-Objective Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Leveraging Experience in Lifelong Multi-Agent Pathfinding.

[BibT_eX]

[DOI]

Nitzan Madar

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

Resolution-Optimal Motion Planning for Steerable Needles.

[BibT_eX]

[DOI]

Proceedings of the 2022 International Conference on Robotics and Automation, 2022

A*pex: Efficient Approximate Multi-Objective Search on Graphs.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021

Provably constant-time planning and replanning for real-time grasping objects off a conveyor belt.

[BibT_eX]

[DOI]

Int. J. Robotics Res., 2021

A Novel Shaft-to-Tissue Force Model for Safer Motion Planning of Steerable Needles.

[BibT_eX]

[DOI]

CoRR, 2021

Multi-Agent Terraforming: Efficient Multi-Agent Path Finding via Environment Manipulation.

[BibT_eX]

[DOI]

David Vainshtein

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Cooperative Multi-Agent Path Finding: Beyond Path Planning and Collision Avoidance.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Revisiting the Complexity Analysis of Conflict-Based Search: New Computational Techniques and Improved Bounds.

[BibT_eX]

[DOI]

Ofir Gordon

Yuval Filmus

Proceedings of the Fourteenth International Symposium on Combinatorial Search, 2021

Toward Certifiable Motion Planning for Medical Steerable Needles.

[BibT_eX]

[DOI]

Mengyu Fu

Ron Alterovitz

Proceedings of the Robotics: Science and Systems XVII, Virtual Event, July 12-16, 2021., 2021

Class-Ordered LPA*: An Incremental-Search Algorithm for Weighted Colored Graphs.

[BibT_eX]

[DOI]

Jaein Lim

Panagiotis Tsiotras

Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2021

Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search.

[BibT_eX]

[DOI]

Mengyu Fu

Ron Alterovitz

Proceedings of the IEEE International Conference on Robotics and Automation, 2021

Approximate Bi-Criteria Search by Efficient Representation of Subsets of the Pareto-Optimal Frontier.

[BibT_eX]

[DOI]

Boris Goldin

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020

Approximate bi-criteria search by efficient representation of subsets of the Pareto-optimal frontier.

[BibT_eX]

[DOI]

CoRR, 2020

Provably Constant-Time Planning and Re-planning for Real-time Grasping Objects off a Conveyor.

[BibT_eX]

[DOI]

CoRR, 2020

Effective footstep planning using homotopy-class guidance.

[BibT_eX]

[DOI]

Artif. Intell., 2020

Provably Constant-time Planning and Re-planning for Real-time Grasping Objects off a Conveyor Belt.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems XVI, 2020

Planning, Learning and Reasoning Framework for Robot Truck Unloading.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Research Challenges and Opportunities in Multi-Agent Path Finding and Multi-Agent Pickup and Delivery Problems.

[BibT_eX]

[DOI]

Roni Stern

Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019

Minimizing Task-Space Fréchet Error via Efficient Incremental Graph Search.

[BibT_eX]

[DOI]

Rachel M. Holladay

IEEE Robotics Autom. Lett., 2019

Task-Informed Fidelity Management for Speeding Up Robotics Simulation.

[BibT_eX]

[DOI]

Abhijeet Tallavajhula

CoRR, 2019

Provable Infinite-Horizon Real-Time Planning for Repetitive Tasks.

[BibT_eX]

[DOI]

Fahad Islam

CoRR, 2019

Sampling-based robot motion planning.

[BibT_eX]

[DOI]

Commun. ACM, 2019

Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing.

[BibT_eX]

[DOI]

Kalyan Vasudev Alwala

Margarita Safonova

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Toward Asymptotically-Optimal Inspection Planning Via Efficient Near-Optimal Graph Search.

[BibT_eX]

[DOI]

Proceedings of the Robotics: Science and Systems XV, 2019

optimizing Motion-Planning Problem Setup via Bounded Evaluation with Application to Following Surgical Trajectories.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2019

Escaping Local Minima in Search-Based Planning using Soft Duplicate Detection.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2019

A Planning Framework for Persistent, Multi-UAV Coverage with Global Deconfliction.

[BibT_eX]

[DOI]

Proceedings of the Field and Service Robotics, 2019

Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-Based Toggles.

[BibT_eX]

[DOI]

Aditya Mandalika

Sanjiban Choudhury

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

POMHDP: Search-Based Belief Space Planning Using Multiple Heuristics.

[BibT_eX]

[DOI]

Sung-Kyun Kim

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Provable Indefinite-Horizon Real-Time Planning for Repetitive Tasks.

[BibT_eX]

[DOI]

Fahad Islam

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018

An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles.

[BibT_eX]

[DOI]

Pankaj K. Agarwal

Kyle Fox

ACM Trans. Algorithms, 2018

New perspective on sampling-based motion planning via random geometric graphs.

[BibT_eX]

[DOI]

Int. J. Robotics Res., 2018

Effective metrics for multi-robot motion-planning.

[BibT_eX]

[DOI]

Int. J. Robotics Res., 2018

Following Surgical Trajectories with Concentric Tube Robots via Nearest-Neighbor Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2018 International Symposium on Experimental Robotics, 2018

Online, Interactive User Guidance for High-dimensional, Constrained Motion Planning.

[BibT_eX]

[DOI]

Fahad Islam

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Generalizing Informed Sampling for Asymptotically-Optimal Sampling-Based Kinodynamic Planning via Markov Chain Monte Carlo.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Conference on Robotics and Automation, 2018

Effective Footstep Planning for Humanoids Using Homotopy-Class Guidance.

[BibT_eX]

[DOI]

Vinitha Ranganeni

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges.

[BibT_eX]

[DOI]

Aditya Mandalika

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

The Provable Virtue of Laziness in Motion Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017

Anytime Motion Planning on Large Dense Roadmaps with Expensive Edge Evaluations.

[BibT_eX]

[DOI]

Shushman Choudhury

Sanjiban Choudhury

Christopher M. Dellin

CoRR, 2017

Densification strategies for anytime motion planning over large dense roadmaps.

[BibT_eX]

[DOI]

Shushman Choudhury

Sanjiban Choudhury

Proceedings of the 2017 IEEE International Conference on Robotics and Automation, 2017

Efficient Motion Planning for Problems Lacking Optimal Substructure.

[BibT_eX]

[DOI]

Brian Hou

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016

Efficient high-quality motion planning in tight settings

[BibT_eX]

[DOI]

PhD thesis, 2016

Asymptotically Near-Optimal RRT for Fast, High-Quality Motion Planning.

[BibT_eX]

[DOI]

IEEE Trans. Robotics, 2016

Motion Planning for Multilink Robots by Implicit Configuration-Space Tiling.

[BibT_eX]

[DOI]

IEEE Robotics Autom. Lett., 2016

Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning.

[BibT_eX]

[DOI]

Int. J. Robotics Res., 2016

Open problem on risk-aware planning in the plane.

[BibT_eX]

[DOI]

CoRR, 2016

A methodological, task-based approach to Procedure-Specific Simulations training.

[BibT_eX]

[DOI]

Yaki Setty

Int. J. Comput. Assist. Radiol. Surg., 2016

Collision Detection or Nearest-Neighbor Search? On the Computational Bottleneck in Sampling-based Motion Planning.

[BibT_eX]

[DOI]

Michal Kleinbort

Proceedings of the Algorithmic Foundations of Robotics XII, 2016

2015

On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages.

[BibT_eX]

[DOI]

Michael Hemmer

IEEE Trans Autom. Sci. Eng., 2015

Motion Planning for Multi-Link Robots by Implicit Configuration-Space Tiling.

[BibT_eX]

[DOI]

CoRR, 2015

Asymptotically-optimal Motion Planning using lower bounds on cost.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Optimal motion planning for a tethered robot: Efficient preprocessing for fast shortest paths queries.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors.

[BibT_eX]

[DOI]

Michal Kleinbort

Proceedings of the IEEE International Conference on Robotics and Automation, 2015

2014

Sparsification of motion-planning roadmaps by edge contraction.

[BibT_eX]

[DOI]

Int. J. Robotics Res., 2014

Asymptotically Near-Optimal Motion Planning using Lower Bounds on Cost.

[BibT_eX]

[DOI]