Rapidly exploring dense trees
{{Orphan|date=November 2016}}
{{context|date=September 2018}}
Rapidly exploring dense trees is a family of planning algorithms that includes the rapidly exploring random tree.
References
{{reflist|2}}
- {{cite book
|last1=Yershova
|first1=Anna
|last2=Jaillet
|first2=Léonard
|last3=Siméon
|first3=Thierry
|last4=LaVelle
|first4=Steven M.
|title=Proceedings of the 2005 IEEE International Conference on Robotics and Automation
|chapter=Dynamic-Domain RRTS: Efficient Exploration by Controlling the Sampling Domain
|date=2005
|citeseerx = 10.1.1.76.4820
|pages=3856–3861
|doi=10.1109/ROBOT.2005.1570709
|isbn=0-7803-8914-X
|s2cid=745300
}}
- {{cite book
| last = Lavalle | first = S.M.
| date = 2006
| title = Planning Algorithms, Section 5.5: Rapidly Exploring Dense Trees
| url = http://planning.cs.uiuc.edu/node230.html
}}
- {{cite book
| last = Lavalle | first = S.M.
| date = 2006
| title = Planning Algorithms, Section 14.4.3: RDT-Based Methods
| url = http://planning.cs.uiuc.edu/node772.html
}}
{{algorithm-stub}}