Rapidly exploring dense trees
It is proposed that this article be deleted because of the following concern:
If you can address this concern by improving, copyediting, sourcing, renaming, or merging the page, please edit this page and do so. You may remove this message if you improve the article or otherwise object to deletion for any reason. Although not required, you are encouraged to explain why you object to the deletion, either in your edit summary or on the talk page. If this template is removed, do not replace it. This message has remained in place for seven days, so the article may be deleted without further notice. Find sources: "Rapidly exploring dense trees" – news · newspapers · books · scholar · JSTOR Nominator: Please consider notifying the author/project: {{subst:proposed deletion notify|Rapidly exploring dense trees|concern=not enough info to warrant a page}} ~~~~Timestamp: 20130603023943 02:39, 3 June 2013 (UTC) Administrators: delete |
Rapidly exploring dense trees is a family of planning algorithms that includes Rapidly exploring random tree.
http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.76.4820&rep=rep1&type=pdf
References
- ^ 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.