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. - See more at.
No comments:
Post a Comment