Jump to content

Rapidly exploring dense trees

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Veryproicelandic (talk | contribs) at 07:52, 24 September 2018 (removed underlink flag; is fine as-is there... added context flag, stubbed it...). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)

This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (November 2016)

This article provides insufficient context for those unfamiliar with the subject. Please help improve the article by providing more context for the reader. (September 2018) (Learn how and when to remove this message)

(Learn how and when to remove this message)

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

References

Yershova, Anna; Jaillet, Léonard; Siméon, Thierry; LaVelle, Steven M. (2005). "Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain". Proceedings of the 2005 IEEE International Conference on Robotics and Automation: 3856–3861. CiteSeerX 10.1.1.76.4820.

Lavalle, S.M. (2006). Planning Algorithms, Section 5.5: Rapidly Exploring Dense Trees.

Lavalle, S.M. (2006). Planning Algorithms, Section 14.4.3: RDT-Based Methods.

This algorithms or data structures-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Rapidly_exploring_dense_trees&oldid=860964758"

Hidden categories: