Graphics enhanced version of this site

Replanning with RRTs
D. Ferguson, N. Kalra, and A. Stentz
Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), May, 2006, pp. 1243 - 1248.

Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference

Adobe portable document format (pdf) [351 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

We present a replanning algorithm for repairing Rapidly-exploring Random Trees when changes are made to the configuration space. Instead of abandoning the current RRT, our algorithm efficiently removes just the newly-invalid parts and maintains the rest. It then grows the resulting tree until a new solution is found. We use this algorithm to create a probabilistic analog to the widely-used D* family of deterministic algorithms, and demonstrate its effectiveness in a multirobot planning domain.

Associated centers: VASC and FRC
Associated lab/group: NavLab
Associated project: CTA Robotics

Number of pages: 6

D. Ferguson, N. Kalra, and A. Stentz, "Replanning with RRTs," Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), May, 2006, pp. 1243 - 1248.

@inproceedings{Ferguson_2006_5304,
   author = "David Ferguson and Nidhi Kalra and Anthony (Tony) Stentz",
   title = "Replanning with RRTs",
   booktitle = "Proceedings of the IEEE International Conference on Robotics and Automation (ICRA)",
   month = "May",
   year = "2006",
   pages = "1243 - 1248"
}