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” algo...

Full description

Bibliographic Details
Main Authors: Karaman, Sertac, Walter, Matthew R., Perez, Alejandro, Frazzoli, Emilio, Teller, Seth
Other Authors: Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Format: Article
Language:en_US
Published: Institute of Electrical and Electronics Engineers 2011
Online Access:http://hdl.handle.net/1721.1/63170
https://orcid.org/0000-0002-0505-1400
https://orcid.org/0000-0002-2225-7275

Internet

http://hdl.handle.net/1721.1/63170
https://orcid.org/0000-0002-0505-1400
https://orcid.org/0000-0002-2225-7275

Similar Items