Asymptotically-optimal path planning for manipulation using incremental sampling-based algorithms

A desirable property of path planning for robotic manipulation is the ability to identify solutions in a sufficiently short amount of time to be usable. This is particularly challenging for the manipulation problem due to the need to plan over high-dimensional configuration spaces and to perform computationally expensive collision checking procedures. Consequently, existing planners take steps to achieve desired solution times at the cost of low quality solutions. This paper presents a planning algorithm that overcomes these difficulties by augmenting the asymptotically-optimal RRT* with a sparse sampling procedure. With the addition of a collision checking procedure that leverages memoization, this approach has the benefit that it quickly identifies low-cost feasible trajectories and takes advantage of subsequent computation time to refine the solution towards an optimal one. We evaluate the algorithm through a series of Monte Carlo simulations of seven, twelve, and fourteen degree of freedom manipulation planning problems in a realistic simulation environment. The results indicate that the proposed approach provides significant improvements in the quality of both the initial solution and the final path, while incurring almost no computational overhead compared to the RRT algorithm. We conclude with a demonstration of our algorithm for single-arm and dual-arm planning on Willow Garage's PR2 robot.

Authors

• Alejandro Perez
• Sertac Karaman
• Alexander C. Shkolnik
• Emilio Frazzoli
• Seth J. Teller
• Matthew R. Walter

Keywords

• Planning
• Trajectory
• Robots
• Joints
• Approximation algorithms
• Monte Carlo methods
• Collision avoidance
• Path Planning
• Sampling-based Algorithms
• Degrees Of Freedom
• Monte Carlo Simulation
• Computational Overhead
• Configuration Space
• Advantages Of Time
• Collision Detection
• Planning Algorithm
• Planning Problem
• Rapidly-exploring Random Tree
• Cost Function
• Average Cost
• Feasible Solution
• Reachable
• Tree Nodes
• Radians
• Collision-free Path
• Asymptotic Optimality
• Rejection Sampling
• Cost Path
• Hash Function
• Triplet Formation
• Straight Path
• Robotic Arm