Vishal Verma: Rapidly Exploring Random Trees
Upcoming SlideShare
Loading in...5
×
 

Vishal Verma: Rapidly Exploring Random Trees

on

  • 1,121 views

Presentation on ...

Presentation on

S.M. LaValle and J.J Kuffner. Rapidly-exploring random trees: Progress and prospects. In Robotics: The Algorithmic Perspective. 4th Int. Workshop on the Algorithmic Foundations of Robotics., Hanover, NH, 2000. A. K. Peters.

Statistics

Views

Total Views
1,121
Views on SlideShare
1,107
Embed Views
14

Actions

Likes
0
Downloads
11
Comments
0

1 Embed 14

http://correll.cs.colorado.edu 14

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Vishal Verma: Rapidly Exploring Random Trees Presentation Transcript

  • 1. Rapidly Exploring Random Trees CSCI 7000 ADVANCED ROBOTICS ~VISHAL VERMA
  • 2. Agenda Intro to Motion Planning Problem Formulation Intro to RRTs RRT Algorithm RRT Analysis Implementing RRT Planners Examples
  • 3. Intro to Motion Planning Used in:  Robotics (:D)  Spacecraft  Computer Graphics/Animations  Computational Biology  Virtual Prototyping  Vehicle safety
  • 4. Problem Formulation
  • 5. Intro to RRTs Search high dimensional spaces Consider algebraic constraints  Obstacles Consider local constraints  Differential constraints of Motion  Non Holonomic constraints
  • 6. Differential Constraints
  • 7. Non Holonomic Constraints Controllable DOF < Total DOF Example – Car:  Total DOF – 3 [x,y,θ]  Controllable DOF – 2 [x, θ] Constraints introduced:  Cannot make sharp turns
  • 8. Concept of RRTs Intuitively:  Monte-Carlo Search  Biased to favor largest Voronoi regions Binary Tree:  Searched Systematically  NP-Hard RRT:  Searched (pseudo)randomly  Pull tree toward unexplored portions
  • 9. RRT - Justification Other similar options:  Randomized Potential Field Method:  Depends on a good heuristic potential function  Difficult to find with obstacles/Differential Constraints  Probabilistic Roadmap approach  Generates many random configurations  Connects with local planner  Good for Holonomic  Local planner too complicated for non holonomic  Needs non-linear control system
  • 10. RRT Algorithm
  • 11. RRT Analysis
  • 12. Implementing RRT Planners
  • 13. The RRT CONNECT() Routine Replaces EXTEND() Multiple calls to EXTEND() Better for holonomic planning EXTEND() still better for non-holonomic  Lack of good metric
  • 14. Bidirectional RRT
  • 15. Further Thoughts More than 2 RRTs?  Computation time divided  Construct RRTs/Explore state space  Interconnect RRTs Probabilistic Roadmap:  Limiting/Extreme version of this  Max separate RRTs merged
  • 16. Example: Growing RRT
  • 17. Example: Holonomic Planning
  • 18. Example: Holonomic Planning
  • 19. Example: Holonomic Planning
  • 20. Example: Non - Holonomic Planning
  • 21. Example: Non - Holonomic Planning
  • 22. Example: Non - Holonomic Planning
  • 23. Example: KinodynamicPlanning
  • 24. Questions?