anytime rrts dave fergusson and antony stentz. rrt – rapidly exploring random trees good at...
TRANSCRIPT
![Page 1: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/1.jpg)
Anytime RRTs
Dave Fergusson and Antony Stentz
![Page 2: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/2.jpg)
RRT – Rapidly Exploring Random Trees
• Good at complex configuration spaces• Efficient at providing “feasible” solutions• No control over solution quality• Does not pay attention to solution cost
![Page 3: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/3.jpg)
Earlier Improvements
• Can add a goal bias – makes it a best-first search
• Nearest Neighbor could look for k-nearest neighbors (Urmson and Simmons) and select:– Qnearest to Qtarget where path-cost< r– First of k-nodes ordered by estimated path-cost
whose current path-cost < r– Node with minimum estimated path cost where
cost < r
![Page 4: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/4.jpg)
An idea from ARA*
• Get an initial suboptimal solution to an inflated A* search with a highly suboptimality bound ε
• Repeat running new searches with decreasing values of ε
• After each search, cost of most recent solution is guaranteed to be at most ε times the cost of an optimal solution
![Page 5: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/5.jpg)
Anytime RRT algorithm
![Page 6: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/6.jpg)
Algorithm contd…
![Page 7: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/7.jpg)
Anytime RRT planning
• RRT being grown from initial configuration to goal configuration
![Page 8: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/8.jpg)
Node Sampling
• Only areas that can potentially lead to an improved solution are considered
• Uses a heuristic function to restrict search
![Page 9: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/9.jpg)
Node Selection
• Order by distance from the sample point and cost of their path from start node
• Select node with path cost lower than others
![Page 10: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/10.jpg)
Extending tree
• Generate a set of
possible extensions• Choose extension which
is cheapest among these
![Page 11: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/11.jpg)
Accepting new elements
• Check if sum of cost of path from start node through tree to new element and heuristic cost of path to goal is less than solution bound
• If “yes” add element to the tree
![Page 12: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/12.jpg)
Single Robot planning with Anytime RRTs
![Page 13: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/13.jpg)
Resulting PathsOn avg 3.6 times better
![Page 14: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/14.jpg)
Multi-robot Constrained exploration
On avg 2.8 times better
![Page 15: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/15.jpg)
Comparison of Relative Cost vs. Time
![Page 16: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/16.jpg)
Average relative solution cost for single robot
![Page 17: Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”](https://reader036.vdocument.in/reader036/viewer/2022062515/56649cfa5503460f949cbd4a/html5/thumbnails/17.jpg)
Average relative solution cost for multiple robots