These Star Student Project application fields yield increasingly difficult, highly-dimensional problems with complex geometric and differential constraints. The Rapidly-exploring Random Tree (RRT) is a popular sampling based algorithm applied to single-query path-planning problems. It is suited to solve robot motion-planning problems that involve holonomic, nonholonomic, kinodynamic, or kinematic loop-closure constraints.
https://www.blogger.com/blogger.g?blogID=4435256300017036823#allposts