Rapidly-exploring random tree
A rapidly exploring random tree (RRT) is an algorithm designed to efficiently search nonconvex, high-dimensional spaces by randomly building a space-filling tree. The tree is constructed incrementally from samples drawn randomly from the search space and is inherently biased to grow towards large unsearched areas of the problem. RRTs were developed by Steven M. LaValle and James J. Kuffner Jr..They easily handle problems with obstacles and differential constraints (nonholonomic and kinodynamic) and have been widely used in autonomous robotic motion planning.
Wikipage disambiguates
Any-angle path planningIndex of robotics articlesInformed RRT*James J. Kuffner Jr.List of data structuresMotion planningRRTRRT*Random graphRandom treeRapidly-exploring Random TreeRapidly-exploring random graphRapidly exploring dense treesRapidly exploring random treeReal-time path planningRobotics Toolbox for MATLABSpace-filling treeSteven M. LaValle
Link from a Wikipage to another Wikipage
primaryTopic
Rapidly-exploring random tree
A rapidly exploring random tree (RRT) is an algorithm designed to efficiently search nonconvex, high-dimensional spaces by randomly building a space-filling tree. The tree is constructed incrementally from samples drawn randomly from the search space and is inherently biased to grow towards large unsearched areas of the problem. RRTs were developed by Steven M. LaValle and James J. Kuffner Jr..They easily handle problems with obstacles and differential constraints (nonholonomic and kinodynamic) and have been widely used in autonomous robotic motion planning.
has abstract
A rapidly exploring random tre ...... onsidered stochastic fractals.
@en
Rapidly-exploring random tree ...... egungen, z. B. von Greifarmen.
@de
شجرة عشوائية سريعة الاستكشاف ( ...... بوتات لحل مسألة البحث عن مسار.
@ar
Link from a Wikipage to an external page
Wikipage page ID
14,105,159
page length (characters) of wiki page
Wikipage revision ID
1,022,624,455
Link from a Wikipage to another Wikipage
caption
A visualization of an RRT graph after 45 and 390 iterations
@en
An animation of an RRT starting from iteration 0 to 10000
@en
direction
vertical
@en
image
@en
@en
wikiPageUsesTemplate
comment
A rapidly exploring random tre ...... omous robotic motion planning.
@en
Rapidly-exploring random tree ...... egungen, z. B. von Greifarmen.
@de
شجرة عشوائية سريعة الاستكشاف ( ...... بوتات لحل مسألة البحث عن مسار.
@ar
label
Rapidly-exploring random tree
@de
Rapidly-exploring random tree
@en
شجرة عشوائية سريعة الاستكشاف
@ar