This article provides insufficient context for those unfamiliar with the subject. (September 2018) |
Rapidly exploring dense trees is a family of planning algorithms that includes the rapidly exploring random tree.
References
edit- 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. |