Rapidly Exploring Random Trees

(written by lawrence krubner, however indented passages are often quotes). You can contact lawrence at: lawrence@krubner.com, or follow me on Twitter.

Interesting. It says the RRT proceeds by breaking the Voronoi spaces into smaller Voronoi spaces. The algorithm has a bias towards unexplored territory, unlike a purely random algorithm, which tends to loop back to explored space. I didn’t dig into the algorithm, but I can imagine how this would be useful in some situations.

Post external references

  1. 1
    http://msl.cs.uiuc.edu/~lavalle/papers/Lav98c.pdf
Source