| Information | |
|---|---|
| has gloss | eng: A Rapidly-exploring Random Tree (RRT) is a data structure and algorithm designed for efficiently searching nonconvex, high-dimensional search spaces. Simply put, the tree is constructed in such a way that any sample in the space is added by connecting it to the closest sample already in the tree. |
| lexicalization | eng: Rapidly-exploring Random Tree |
| instance of | c/Probabilistic data structures |
| Media | |
|---|---|
| media:img | RRT graph1.png |
| media:img | RRT graph2.png |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint
