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 Dantheman (talk | contribs) at 17:44, 29 November 2009. 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.

[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=328618789"