motion-planning / rrt-algorithms

n-dimensional RRT, RRT* (RRT-Star)
MIT License
600 stars 173 forks source link

Branch-and-bound #5

Open SZanlongo opened 6 years ago

SZanlongo commented 6 years ago

Efficiently keep track of vertex weights, and update them when a parent is modified. Probabilistically prune the trees when a solution has already been found and the edges cannot possibly beat the solution. #