Blind RRT: A probabilistically complete distributed RRT

Rapidly-Exploring Random Trees (RRTs) have been successful at finding feasible solutions for many types of problems. With motion planning becoming more computationally demanding, we turn to parallel motion planning for efficient solutions. Existing work on distributed RRTs has been limited by the overhead that global communication requires. A recent approach, Radial RRT, demonstrated a scalable algorithm that subdivides the space into regions to increase the computation locality. However, if an obstacle completely blocks RRT growth in a region, the planning space is not covered and is thus not probabilistically complete. We present a new algorithm, Blind RRT, which ignores obstacles during initial growth to efficiently explore the entire space. Because obstacles are ignored, free components of the tree become disconnected and fragmented. Blind RRT merges parts of the tree that have become disconnected from the root. We show how this algorithm can be applied to the Radial RRT framework allowing both scalability and effectiveness in motion planning. This method is a probabilistically complete approach to parallel RRTs. We show that our method not only scales but also overcomes the motion planning limitations that Radial RRT has in a series of difficult motion planning tasks.

Authors

• Cesar Rodriguez
• Jory Denny
• Sam Ade Jacobs
• Shawna L. Thomas
• Nancy M. Amato

Keywords

• Planning
• Probabilistic logic
• Scalability
• Robots
• Complexity theory
• Awards activities
• Algorithm design and analysis
• Rapidly-exploring Random Tree
• Probabilistic Completeness
• Scalable
• Path Planning
• Global Communication
• Degrees Of Freedom
• Parallelization
• Time Complexity
• Adjacent Regions
• Tree Nodes
• Processing Elements
• Root Of The Tree
• Regional Connectivity
• Neighboring Regions
• Post-processing Step
• Nearest Neighbor Search
• Global Connectivity
• Collision Detection
• Robot Configuration