activity
20122021
most citedToward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search

16 citations · 55 across the 9 of their papers we have counts for

collaborators

12 papers

cs.RO202113 cited

Toward Certifiable Motion Planning for Medical Steerable Needles

Mengyu Fu, Oren Salzman, Ron Alterovitz

Medical steerable needles can move along 3D curvilinear trajectories to avoid anatomical obstacles and reach clinically significant targets inside the human body. Automating steera…

cs.RO20216 cited

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

Mengyu Fu, Oren Salzman, Ron Alterovitz

The inspection-planning problem calls for computing motions for a robot that allow it to inspect a set of points of interest (POIs) while considering plan quality (e.g., plan lengt…

cs.RO201916 cited

Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search

Mengyu Fu, Alan Kuntz, Oren Salzman +1

Inspection planning, the task of planning motions that allow a robot to inspect a set of points of interest, has applications in domains such as industrial, field, and medical robo…

cs.RO201915 cited

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

Aditya Mandalika, Sanjiban Choudhury, Oren Salzman +1

Lazy search algorithms can efficiently solve problems where edge evaluation is the bottleneck in computation, as is the case for robotic motion planning. The optimal algorithm in t…

cs.RO2018

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

Aditya Mandalika, Oren Salzman, Siddhartha Srinivasa

Motion-planning problems, such as manipulation in cluttered environments, often require a collision-free shortest path to be computed quickly given a roadmap graph. Typically, the…

cs.RO20172 cited

Anytime Motion Planning on Large Dense Roadmaps with Expensive Edge Evaluations

Shushman Choudhury, Oren Salzman, Sanjiban Choudhury +2

We propose an algorithmic framework for efficient anytime motion planning on large dense geometric roadmaps, in domains where collision checks and therefore edge evaluations are co…