Anytime Motion Planning using the RRT*

Anytime Motion Planning using the RRT*

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"...

Full description

Bibliographic Details
Main Authors: Karaman, Sertac (Contributor), Walter, Matthew R. (Contributor), Perez, Alejandro (Author), Frazzoli, Emilio (Contributor), Teller, Seth (Contributor)
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor), Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor)
Format: Article
Language:English
Published: Institute of Electrical and Electronics Engineers, 2011-06-02T17:41:24Z.
Subjects:
Article
Online Access:Get fulltext

Internet

Get fulltext

Similar Items