Motion Planning Based on RRT for Autonomous Road Vehicles: A Review.
- Department of Electronics and Communication Engg. , Amity University, Uttar Pradesh.
23 Downloads
129 Views
Abstract
The Rapidly-exploring Random Tree is an algorithm which is used in motion planning for autonomous vehicles which have a defined starting point and a defined ending point. The positive point in this algorithm is that it is probabilistically complete that is even in the constrained areas we get a random tree and may find a path through that area. It is very fast as compared to other algorithms such as Genetic Algorithm. There are different kinds of RRT for different application and optimization purposes. This paper compares the simple RRT algorithm with the more optimized RRT* algorithm for autonomous cars.
Keywords
Article Analytics
How to Cite This Article
Sharad Pandey and K.K. Singh. (2016); Motion Planning Based on RRT for Autonomous Road Vehicles: A Review., Int. J. of Adv. Res., 4 (05), 779-782, ISSN 2320-5407. DOI: https://doi.org/10.21474/IJAR01/523
Corresponding Author
This work is licensed under a Creative Commons Attribution 4.0 International License.





