Jump to content

Rapidly exploring dense trees

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Screen111 (talk | contribs) at 04:40, 4 December 2013 (Reverted good faith edits by Nikhilchauhan20 (talk). (TW)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Rapidly exploring dense trees is a family of planning algorithms that includes Rapidly exploring random tree.

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.76.4820&rep=rep1&type=pdf

[1]

[2]

References

  1. ^ Lavalle, S.M. (2006). Planning Algorithms, Section 5.5: Rapidly Exploring Dense Trees.
  2. ^ Lavalle, S.M. (2006). Planning Algorithms, Section 14.4.3: RDT-Based Methods.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Rapidly_exploring_dense_trees&oldid=584474812"