Oren Salzman

According to our database1, Oren Salzman authored at least 38 papers between 2013 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Minimizing Task-Space Fréchet Error via Efficient Incremental Graph Search.
IEEE Robotics and Automation Letters, 2019

Task-Informed Fidelity Management for Speeding Up Robotics Simulation.
CoRR, 2019

Planning, Learning and Reasoning Framework for Robot Truck Unloading.
CoRR, 2019

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

Provable Infinite-Horizon Real-Time Planning for Repetitive Tasks.
CoRR, 2019

Sampling-based robot motion planning.
Commun. ACM, 2019

Intuitive, Reliable Plans with Contingencies: Planning with Safety Nets for Landmark-Based Routing.
Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Toward Asymptotically-Optimal Inspection Planning Via Efficient Near-Optimal Graph Search.
Proceedings of the Robotics: Science and Systems XV, 2019

optimizing Motion-Planning Problem Setup via Bounded Evaluation with Application to Following Surgical Trajectories.
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.
Proceedings of the 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2019

Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-Based Toggles.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

POMHDP: Search-Based Belief Space Planning Using Multiple Heuristics.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Provable Indefinite-Horizon Real-Time Planning for Repetitive Tasks.
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.
ACM Trans. Algorithms, 2018

New perspective on sampling-based motion planning via random geometric graphs.
I. J. Robotics Res., 2018

Effective metrics for multi-robot motion-planning.
I. J. Robotics Res., 2018

Online, Interactive User Guidance for High-dimensional, Constrained Motion Planning.
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.
Proceedings of the 2018 IEEE International Conference on Robotics and Automation, 2018

Effective Footstep Planning for Humanoids Using Homotopy-Class Guidance.
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.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

The Provable Virtue of Laziness in Motion Planning.
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.
CoRR, 2017

Densification strategies for anytime motion planning over large dense roadmaps.
Proceedings of the 2017 IEEE International Conference on Robotics and Automation, 2017

Efficient Motion Planning for Problems Lacking Optimal Substructure.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016
Asymptotically Near-Optimal RRT for Fast, High-Quality Motion Planning.
IEEE Trans. Robotics, 2016

Motion Planning for Multilink Robots by Implicit Configuration-Space Tiling.
IEEE Robotics and Automation Letters, 2016

Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning.
I. J. Robotics Res., 2016

Open problem on risk-aware planning in the plane.
CoRR, 2016

Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning.
CoRR, 2016

A methodological, task-based approach to Procedure-Specific Simulations training.
Int. J. Comput. Assist. Radiol. Surg., 2016

2015
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages.
IEEE Trans. Automation Science and Engineering, 2015

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

Asymptotically-optimal Motion Planning using lower bounds on cost.
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.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Efficient high-quality motion planning by fast all-pairs r-nearest-neighbors.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

2014
Sparsification of motion-planning roadmaps by edge contraction.
I. J. Robotics Res., 2014

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

2013
Motion Planning via Manifold Samples.
Algorithmica, 2013


  Loading...