Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments
- 1 June 2015
- journal article
- Published by Elsevier BV in Robotics and Autonomous Systems
- Vol. 68, 1-11
- https://doi.org/10.1016/j.robot.2015.02.007
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Sampling-based algorithms for optimal motion planningThe International Journal of Robotics Research, 2011
- Differentially constrained mobile robot motion planning in state latticesJournal of Field Robotics, 2009
- Anytime search in dynamic graphsArtificial Intelligence, 2008
- Motion Planning: A Journey of Robots, Molecules, Digital Actors, and Other ArtifactsThe International Journal of Robotics Research, 1999
- Robotics for SurgeryAnnual Review of Biomedical Engineering, 1999
- SANDROS: a dynamic graph search algorithm for motion planningIEEE Transactions on Robotics and Automation, 1998
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996
- Real-Time Obstacle Avoidance for Manipulators and Mobile RobotsThe International Journal of Robotics Research, 1986
- On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifoldsAdvances in Applied Mathematics, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979