Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:motion_planning_algorithm
|
| gptkbp:advantage |
faster convergence than single-tree RRT
|
| gptkbp:approach |
grows two trees from start and goal
|
| gptkbp:category |
gptkb:artificial_intelligence
robot motion planning |
| gptkbp:developedBy |
efficiently finding paths in high-dimensional spaces
|
| gptkbp:firstDescribed |
2000s
|
| gptkbp:fullName |
Bidirectional Rapidly-exploring Random Tree
|
| gptkbp:relatedTo |
gptkb:RRT
gptkb:RRT* |
| gptkbp:supportsAlgorithm |
sampling-based
|
| gptkbp:usedIn |
autonomous vehicles
path planning robotics |
| gptkbp:bfsParent |
gptkb:Rapidly-exploring_Random_Tree_(RRT)
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
Bidirectional RRT
|