Rapidly exploring dense trees: Difference between revisions
Content deleted Content added
removed underlink flag; is fine as-is there... added context flag, stubbed it... |
m Normalize {{Multiple issues}}: Remove {{Multiple issues}} for only 1 maintenance template(s): Context |
||
| Line 1: | Line 1: | ||
{{Multiple issues| |
|||
{{Orphan|date=November 2016}} |
{{Orphan|date=November 2016}} |
||
{{context|date=September 2018}} |
{{context|date=September 2018}} |
||
}} |
|||
'''Rapidly exploring dense trees''' is a family of planning [[algorithms]] that includes the [[rapidly exploring random tree]]. |
'''Rapidly exploring dense trees''' is a family of planning [[algorithms]] that includes the [[rapidly exploring random tree]]. |
||
Revision as of 06:13, 31 May 2020
 | 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
- 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. CiteSeerX 10.1.1.76.4820.
- 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. |