Rapidly exploring dense trees
From HandWiki
 | This article provides insufficient context for those unfamiliar with the subject. (September 2018) (Learn how and when to remove this template 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. doi:10.1109/ROBOT.2005.1570709. ISBN 0-7803-8914-X.
- Lavalle, S.M. (2006). Planning Algorithms, Section 5.5: Rapidly Exploring Dense Trees. http://planning.cs.uiuc.edu/node230.html.
- Lavalle, S.M. (2006). Planning Algorithms, Section 14.4.3: RDT-Based Methods. http://planning.cs.uiuc.edu/node772.html.
 |  |
