CS 326 A: Motion Planning 2 Dynamic Constraints and Optimal Planning.

Slides:



Advertisements
Similar presentations
Motion Planning for Point Robots CS 659 Kris Hauser.
Advertisements

Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Kinodynamic Path Planning Aisha Walcott, Nathan Ickes, Stanislav Funiak October 31, 2001.
NUS CS5247 Randomized Kinodynamic Motion Planning with Moving Obstacles - D. Hsu, R. Kindel, J.C. Latombe, and S. Rock. Int. J. Robotics Research, 21(3): ,
Randomized Kinodynamics Motion Planning with Moving Obstacles David Hsu, Robert Kindel, Jean-Claude Latombe, Stephen Rock.
Dynamics of Articulated Robots Kris Hauser CS B659: Principles of Intelligent Robot Motion Spring 2013.
Sampling and Connection Strategies for PRM Planners Jean-Claude Latombe Computer Science Department Stanford University.
EE631 Cooperating Autonomous Mobile Robots Lecture 5: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
Path Planning for Multiple Marine Vehicles Andreas J. Häusler¹, Reza Ghabcheloo², Isaac Kaminer³ António M. Pascoal¹, A. Pedro Aguiar¹ ¹Instituto Superior.
CH24 in Robotics Handbook Presented by Wen Li Ph.D. student Texas A&M University.
Multiple Marine Vehile Deconflicted Path Planning with Currents and Communication Constraints A. Häusler 1, R. Ghabcheloo 2, A. Pascoal 1, A. Aguiar 1.
David Hsu, Robert Kindel, Jean- Claude Latombe, Stephen Rock Presented by: Haomiao Huang Vijay Pradeep Randomized Kinodynamic Motion Planning with Moving.
JCT:6/11/20151 Robotics II Planning and Manipulation Jeff Trinkle MRC 330c TA: Blake Farman.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Non-Holonomic Motion Planning.
Configuration Space CS 326 A: Motion Planning
Paper by Kevin M.Lynch, Naoji Shiroma, Hirohiko Arai, and Kazuo Tanie
Motion Planning: A Journey of Robots, Digital Actors, Molecules and Other Artifacts Jean-Claude Latombe Computer Science Department Stanford University.
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
CS 326 A: Motion Planning and Under-Actuated Robots.
Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Presented by David Camarillo.
CS 326A: Motion Planning Jean-Claude Latombe CA: Aditya Mandayam.
Self-Collision Detection and Prevention for Humonoid Robots Paper by James Kuffner et al. Jinwhan Kim.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Jean-Claude Latombe Computer Science Department Stanford University.
CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)
CS 326 A: Motion Planning Instructor: Jean-Claude Latombe Teaching Assistant: Itay Lotan Computer Science.
CSCE 641: Forward kinematics and inverse kinematics Jinxiang Chai.
CS 326A: Motion Planning Non-Holonomic Motion Planning.
Kinodynamic Planning Using Probabalistic Road Maps Steven M. LaValle James J. Kuffner, Jr. Presented by Petter Frykman.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Kinodynamic Planning and Navigation with Movable Obstacles.
Presented By: Huy Nguyen Kevin Hufford
Randomized Motion Planning for Car-like Robots with C-PRM Guang Song, Nancy M. Amato Department of Computer Science Texas A&M University College Station,
CS 326A: Motion Planning Kynodynamic Planning + Dealing with Moving Obstacles + Dealing with Uncertainty + Dealing with Real-Time Issues.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
CS 326A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Jean-Claude Latombe Computer Science Department Stanford University.
Motion Planning in Dynamic Environments Jur van den Berg.
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
CS 326 A: Motion Planning Target Tracking and Virtual Cameras.
CS 326 A: Motion Planning Coordination of Multiple Robots.
CS 326 A: Motion Planning Kinodynamic Planning.
CS 326A: Motion Planning Probabilistic Roadmaps: Sampling and Connection Strategies.
CS 326A: Motion Planning ai.stanford.edu/~latombe/cs326/2007/index.htm Collision Detection and Distance Computation.
NUS CS5247 Motion Planning for Humanoid Robots Presented by: Li Yunzhen.
Definition of an Industrial Robot
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
Robotics Chapter 5 – Path and Trajectory Planning
PRE-DECISIONAL DRAFT; For planning and discussion purposes only 1 Mars Science Laboratory Rover Trajectory Planning Constrained Global Planning and Path.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
Dynamics of Articulated Robots. Rigid Body Dynamics The following can be derived from first principles using Newton’s laws + rigidity assumption Parameters.
CSCE 441: Computer Graphics Forward/Inverse kinematics Jinxiang Chai.
Spatio-Temporal Case-Based Reasoning for Behavioral Selection Maxim Likhachev and Ronald Arkin Mobile Robot Laboratory Georgia Tech.
1 Distributed and Optimal Motion Planning for Multiple Mobile Robots Yi Guo and Lynne Parker Center for Engineering Science Advanced Research Computer.
Introduction to Motion Planning
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Real-time motion planning for Manipulator based on Configuration Space Chen Keming Cis Peking University.
Non-Holonomic Motion Planning. Probabilistic Roadmaps What if omnidirectional motion in C-space is not permitted?
Tree-Growing Sample-Based Motion Planning
Optimal Path Planning Using the Minimum-Time Criterion by James Bobrow Guha Jayachandran April 29, 2002.
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Chapter 14. Active Vision for Goal-Oriented Humanoid Robot Walking (2/2) in Creating Brain-Like Intelligence, Sendhoff et al. Course: Robots Learning from.
Vision-Guided Humanoid Footstep Planning for Dynamic Environments P. Michel, J. Chestnutt, J. Kuffner, T. Kanade Carnegie Mellon University – Robotics.
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
NUS CS 5247 David Hsu Configuration Space. 2 What is a path?
Motion Planning CS121 – Winter Basic Problem Are two given points connected by a path?
Yueshi Shen Dept. of Information Engineering
EE631 Cooperating Autonomous Mobile Robots Lecture: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Non-Holonomic Motion Planning
Learning Control for Dynamically Stable Legged Robots
Motion Planning CS121 – Winter 2003 Motion Planning.
Classic Motion Planning Methods
Presentation transcript:

CS 326 A: Motion Planning 2 Dynamic Constraints and Optimal Planning

Nonholonomic vs. Dynamic Constraints  Nonholonomic constraint: q’ = f(q,u) where u is the control input (function of time)  Dynamic constraint:  s = (q,q’), the state of the system  s’ = f(s,u) where u is the control input

Aerospace Robotics Lab Robot air bearing gas tank air thrusters obstacles robot

Modeling of Robot x y  f q = (x,y) s = (q,q’) u = (f,  ) x” = (f/m) cos  y” = (f/m) sin  f  f max

Example with Moving Obstacles

General Case For an arbitrary mechanical linkage: u = M(q)q” + C(q,q’) + G(q) + F(q,q’) where: - M is the inertia matrix - C is the vector of centrifugal and Coriolis terms - G is the vector of gravity terms - F is the vector of friction terms

Optimality of a Trajectory Often one seeks a trajectory that optimizes a given criterion, e.g.: –smallest number of backup maneuvers, –minimal execution time, –minimal energy consumption

Path Planning Approaches  Direct planning: –Build a tree of milestones until a connection to the goal has been made LaValle and Kuffner, and Donald et al.’s papers  Two-phase planning: –Compute a collision-free path ignoring constraints –Optimize this path into a trajectory satisfying the kinodynamic constraints Bobrow’s paper

Path Optimization  Steepest descent technique.  Parameterize the geometry of a trajectory, e.g., by defining control points through which cubic spines are fitted.  Vary the parameters. For the new values re-compute the optimal control. If better value of criterion, vary further.

Two-Phase Planning  Gives good results in practice  But computationally expensive (real- time planning possible?)  No performance guarantee regarding optimality of computed trajectory

Direct Planning  Optimality guarantee in Donald et al.’s paper, but running time exponential in number of degrees of freedom  No optimality guarantee in LaValle and Kuffner’s paper, but provably quick convergence of algorithm, allowing for real-time planning (and re-planning) among moving obstacles