Jump to content

Rapidly exploring dense trees

From Wikipedia, the free encyclopedia

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.