A simulation of obstical avoidance with a two link robot which uses a sampling based RRT* algorithm. RRT overview Original Paper on RRT
- A start and goal position is chosen
- The objects are mapped from cartesian space into joint space (the combination of joint positions for the robot)
- Randomly explore joint space with the RRT and once the tree comes within a certain threshold of the goal, the algorithm stops and an optimal path through the tree towards the goal is found.
The driver for the program is RRTStar.m which runs the simulation in Matlab. The progam uses Robot Toolbox for Matlab.