Jump to content

Rapidly exploring dense trees

From English Wikipedia @ Freddythechick

This is the current revision of this page, as edited by imported>Citation bot at 07:57, 25 July 2023 (Alter: title, template type. Add: chapter. Removed parameters. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox2 | #UCB_webform_linked 1566/2384). The present address (URL) is a permanent link to this version.

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

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)

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. pp. 3856–3861. CiteSeerX 10.1.1.76.4820. doi:10.1109/ROBOT.2005.1570709. ISBN 0-7803-8914-X. S2CID 745300.

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://enwiki.freddythechick.net/index.php?title=Rapidly_exploring_dense_trees&oldid=1214520"

Hidden categories: