ICRA 2011 Paper Abstract

Close

Paper TuP109.5

Karaman, Sertac (Massachusetts Institute of Technology), Walter, Matthew (MIT), Perez, Alejandro (Polytechnic University of Puerto Rico), Frazzoli, Emilio (Massachusetts Institute of Technology), Teller, Seth (MIT)

Anytime Motion Planning Using the RRT$^*$

Scheduled for presentation during the Regular Sessions "Motion and Path Planning I" (TuP109), Tuesday, May 10, 2011, 14:40−14:55, Room 5D

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on March 30, 2020

Keywords Motion and Path Planning, Nonholonomic Motion Planning

Abstract

The Rapidly-exploring Random Tree (RRT) algorithm, based on incremental sampling, efficiently computes motion plans. Although the RRT algorithm quickly produces candidate feasible solutions, it tends to converge to a solution that is far from optimal. Practical applications favor ``anytime'' algorithms that quickly identify an initial feasible plan, then, given more computation time available during plan execution, improve the plan toward an optimal solution. This paper describes an anytime algorithm based on the RRT$^*$ which (like the RRT) finds an initial feasible solution quickly, but (unlike the RRT) almost surely converges to an optimal solution. We present two key extensions to the RRT$^*$, committed trajectories and branch-and-bound tree adaptation, that together enable the algorithm to make more efficient use of computation time online, resulting in an anytime algorithm for real-time implementation. We evaluate the method using a series of Monte Carlo runs in a high-fidelity simulation environment, and compare the operation of the RRT and RRT$^*$ methods. We also demonstrate experimental results for an outdoor wheeled robotic vehicle.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2020 PaperCept, Inc.
Page generated 2020-03-30  01:04:37 PST  Terms of use