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.
| Attributes | Values |
|---|
| rdfs:label
| - شجرة عشوائية سريعة الاستكشاف (ar)
- Rapidly-exploring random tree (de)
- Rapidly-exploring random tree (en)
|
| rdfs:comment
| - شجرة عشوائية سريعة الاستكشاف (بالإنجليزية: Rapidly exploring random tree) أو اختصاراً (RRT) هي وخوارزمية بحث فعالة في الفراغات متعددة الأبعاد وغير المُحدبة. تم تطوير الفكرة الأساسية لهذه الخوارزمية في 1998 من قبل و . تستخدم هذه الخوارزمية بشكل واسع في مجال الروبوتات لحل مسألة البحث عن مسار. (ar)
- Rapidly-exploring random tree (RRT) (dt. etwa schnell erkundender zufälliger Baum) ist ein Suchalgorithmus (und dessen zugrunde liegende Baum-Datenstruktur), der hochdimensionale Suchräume zufällig nach möglichen Pfaden absucht. In der Robotik werden der Algorithmus und Variationen davon häufig für verwendet, also für die Planung von effizienten Bewegungen, z. B. von Greifarmen. (de)
- 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. (en)
|
| foaf:depiction
| |
| dcterms:subject
| |
| Wikipage page ID
| |
| Wikipage revision ID
| |
| Link from a Wikipage to another Wikipage
| |
| Link from a Wikipage to an external page
| |
| sameAs
| |
| dbp:wikiPageUsesTemplate
| |
| thumbnail
| |
| caption
| - An animation of an RRT starting from iteration 0 to 10000 (en)
- A visualization of an RRT graph after 45 and 390 iterations (en)
|
| direction
| |
| image
| - RRT graph1.png (en)
- Rapidly-exploring Random Tree 500x373.gif (en)
|
| width
| |
| has abstract
| - شجرة عشوائية سريعة الاستكشاف (بالإنجليزية: Rapidly exploring random tree) أو اختصاراً (RRT) هي وخوارزمية بحث فعالة في الفراغات متعددة الأبعاد وغير المُحدبة. تم تطوير الفكرة الأساسية لهذه الخوارزمية في 1998 من قبل و . تستخدم هذه الخوارزمية بشكل واسع في مجال الروبوتات لحل مسألة البحث عن مسار. (ar)
- Rapidly-exploring random tree (RRT) (dt. etwa schnell erkundender zufälliger Baum) ist ein Suchalgorithmus (und dessen zugrunde liegende Baum-Datenstruktur), der hochdimensionale Suchräume zufällig nach möglichen Pfaden absucht. In der Robotik werden der Algorithmus und Variationen davon häufig für verwendet, also für die Planung von effizienten Bewegungen, z. B. von Greifarmen. (de)
- 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. RRTs can be viewed as a technique to generate open-loop trajectories for nonlinear systems with state constraints. An RRT can also be considered as a Monte-Carlo method to bias search into the largest Voronoi regions of a graph in a configuration space. Some variations can even be considered stochastic fractals. RRTs can be used to compute approximate control policies to control high dimensional nonlinear systems with state and action constraints. (en)
|
| prov:wasDerivedFrom
| |
| page length (characters) of wiki page
| |
| foaf:isPrimaryTopicOf
| |
| is Link from a Wikipage to another Wikipage
of | |
| is Wikipage redirect
of | |
| is foaf:primaryTopic
of | |
_500x373.gif)
![[RDF Data]](/fct/images/sw-rdf-blue.png)
![[cxml]](/fct/images/cxml_doc.png)
![[csv]](/fct/images/csv_doc.png)
![[text]](/fct/images/ntriples_doc.png)
![[turtle]](/fct/images/n3turtle_doc.png)
![[ld+json]](/fct/images/jsonld_doc.png)
![[rdf+json]](/fct/images/json_doc.png)
![[rdf+xml]](/fct/images/xml_doc.png)
![[atom+xml]](/fct/images/atom_doc.png)
![[html]](/fct/images/html_doc.png)
