Rapidly exploring dense trees
 | This article needs more links to other articles to help integrate it into the encyclopedia. (October 2013) |
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.
- 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.