You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
University group project concerning the use of an optimal motion planning algorithm to move a mobile that is assigned a navigation task. The optimal motion planning algorithm chosen is the anytime motion planning based on the RRT*, which is a sampling-based algorithm with an asymptotic optimality property. The simulation environment is V-rep.
This project consists of C++ implementations of a 3D Rapidly Exploring Random Tree and three other extensions called RRT*, Execution Extended RRT and Synchronised Greedy Biased RRT. It also includes a heuristically guided RRT* with biased sampling towards relevant bottleneck points predicted by a 3D CNN(modified VoxNet in Tensorflow).
Implemented Dubin's Curves and Rapidly Exploring Random Trees and RRT Star with branches as Dubin's Curves for path planning in Python and also simulated in Gazebo using ROS.