Rapidly-Exploring Random Vines (RRV) for Motion Planning in Configuration Spaces with Narrow Passages
Authors:
- 1 May 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 7055-7062
Abstract
Classical RRT algorithm is blind to efficiently explore configuration space for expanding the tree through a narrow passage when solving a motion planning (MP) problem. Although there have been several attempts to deal with narrow passages which are based on a wide spectrum of assumptions and configuration setups, we solve this problem in rather general way. We use dominant eigenvectors of the configuration sets formed by properly sampling the space around the nearest node, to efficiently expand the tree around the obstacles and through narrow passages. Unlike classical RRT, our algorithm is aware of having the tree nodes in front of a narrow passage and in a narrow passage, which enables a proper tree expansion in a vine-like manner. A thorough comparison with RRT, RRT-connect, and DDRRT algorithm is provided by solving three different difficult MP problems. The results suggest a significant superiority the proposed Rapidly-exploring Random Vines (RRV) algorithm might have in configuration spaces with narrow passages.Keywords
This publication has 14 references indexed in Scilit:
- Burs of free C-space: A novel structure for path planning2016
- Linear dimensionality reduction in random motion planningThe International Journal of Robotics Research, 2011
- RESAMPL: A Region-Sensitive Adaptive Motion Planner2008
- A Fast and Practical Algorithm for Generalized Penetration Depth Computation2007
- Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain2006
- Using Workspace Information as a Guide to Non-uniform Sampling in Probabilistic Roadmap PlannersThe International Journal of Robotics Research, 2005
- Practical Local Planning in the Contact Space2005
- RRT-connect: An efficient approach to single-query path planning2000
- A framework for using the workspace medial axis in PRM planners2000
- Probabilistic roadmaps for path planning in high-dimensional configuration spacesIEEE Transactions on Robotics and Automation, 1996