The Rapidly exploring Random Tree, RRT, starts from the start location, in red, and incrementally
builds the tree.
New samples are drawn randomly from the configuration space and connected to the nearest vertex.
When the goal, in green, can be connected, then a search algorithm is applied to find
the best path.