Structure and Synthesis of Robot Motion Introduction: Some Concepts in Dynamics and Control Subramanian Ramamoorthy School of Informatics 23 January, 2012.

Slides:



Advertisements
Similar presentations
Signals and Systems March 25, Summary thus far: software engineering Focused on abstraction and modularity in software engineering. Topics: procedures,
Advertisements

Dynamics of Articulated Robots Kris Hauser CS B659: Principles of Intelligent Robot Motion Spring 2013.
1Notes  Handing assignment 0 back (at the front of the room)  Read the newsgroup!  Planning to put 16mm films on the web soon (possibly tomorrow)
Motion Planning of Multi-Limbed Robots Subject to Equilibrium Constraints. Timothy Bretl Presented by Patrick Mihelich and Salik Syed.
1 MECH 221 FLUID MECHANICS (Fall 06/07) Tutorial 6 FLUID KINETMATICS.
COMP322/S2000/L121 Workspace Analysis Work Space: Let q min and q max be the vectors in R n denoting the joint variable limits, the set of all values that.
BINARY MORPHOLOGY and APPLICATIONS IN ROBOTICS. Applications of Minkowski Sum 1.Minkowski addition plays a central role in mathematical morphology 2.It.
CS 326A: Motion Planning Kynodynamic Planning + Dealing with Moving Obstacles + Dealing with Uncertainty + Dealing with Real-Time Issues.
Theoretical Mechanics - PHY6200 Chapter 6 Introduction to the calculus of variations Prof. Claude A Pruneau, Physics and Astronomy Department Wayne State.
Semester Physics 1901 (Advanced) A/Prof Geraint F. Lewis Rm 560, A29
Integrated Grasp and Motion Planning For grasping an object in a cluttered environment several tasks need to take place: 1.Finding a collision free path.
Mobile Robotics: 11. Kinematics 2
Itti: CS564 - Brain Theory and Artificial Intelligence. Systems Concepts 1 CS564 - Brain Theory and Artificial Intelligence University of Southern California.
1 Single Robot Motion Planning Liang-Jun Zhang COMP Sep 22, 2008.
COMPUTER VIZUALIZATION OF MULTY-LINK MECHANISMS WITH TWO DEGREES OF FREEDOM Georgian Technical University PhD Student Marina Razmadze.
Definition of an Industrial Robot
IMPLEMENTATION ISSUES REGARDING A 3D ROBOT – BASED LASER SCANNING SYSTEM Theodor Borangiu, Anamaria Dogar, Alexandru Dumitrache University Politehnica.
Signals and Systems March 25, Summary thus far: software engineering Focused on abstraction and modularity in software engineering. Topics: procedures,
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
Central Force Motion Chapter 8
Game Physics – Part I Dan Fleck Coming up: Rigid Body Dynamics.
Parallelism and Robotics: The Perfect Marriage By R.Theron,F.J.Blanco,B.Curto,V.Moreno and F.J.Garcia University of Salamanca,Spain Rejitha Anand CMPS.
A PPLIED M ECHANICS Lecture 02 Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Structure and Synthesis of Robot Motion Kinematics Subramanian Ramamoorthy School of Informatics 18 January, 2010.
Chapter 5 Trajectory Planning 5.1 INTRODUCTION In this chapters …….  Path and trajectory planning means the way that a robot is moved from one location.
Chapter 5 Trajectory Planning 5.1 INTRODUCTION In this chapters …….  Path and trajectory planning means the way that a robot is moved from one location.
Robotics Chapter 5 – Path and Trajectory Planning
Quadruped Robot Modeling and Numerical Generation of the Open-Loop Trajectory Introduction We model a symmetric quadruped gait for a planar robot with.
NUS CS5247 Deadlock-Free and Collision-Free Coordination of Two Robot Manipulators By Patrick A. O’Donnell and Tomás Lozano-Pérez MIT Artificial Intelligence.
Control 1 Keypoints: The control problem Forward models: –Geometric –Kinetic –Dynamic Process characteristics for a simple linear dynamic system.
20/10/2009 IVR Herrmann IVR:Control Theory OVERVIEW Control problems Kinematics Examples of control in a physical system A simple approach to kinematic.
Robotics Sharif In the name of Allah. Robotics Sharif Introduction to Robotics o Leila Sharif o o Lecture #2: The.
Plane Motion of Rigid Bodies: Forces and Accelerations
Motor Control. Beyond babbling Three problems with motor babbling: –Random exploration is slow –Error-based learning algorithms are faster but error signals.
ME451 Kinematics and Dynamics of Machine Systems Introduction to Dynamics 6.1 October 09, 2013 Radu Serban University of Wisconsin-Madison.
ME451 Kinematics and Dynamics of Machine Systems Singular Configurations 3.7 October 07, 2013 Radu Serban University of Wisconsin-Madison.
ME451 Kinematics and Dynamics of Machine Systems Review of Differential Calculus 2.5, 2.6 September 11, 2013 Radu Serban University of Wisconsin-Madison.
Structure and Synthesis of Robot Motion Topics in Control Subramanian Ramamoorthy School of Informatics 19 February, 2009.
COMP322/S2000/L281 Task Planning Three types of planning: l Gross Motion Planning concerns objects being moved from point A to point B without problems,
1cs426-winter-2008 Notes  Will add references to splines on web page.
Outline: Introduction Solvability Manipulator subspace when n<6
Dynamic Programming. A Simple Example Capital as a State Variable.
Phy 303: Classical Mechanics (2) Chapter 3 Lagrangian and Hamiltonian Mechanics.
Trajectory Generation
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Structure and Synthesis of Robot Motion Introduction Subramanian Ramamoorthy School of Informatics 16 January, 2012.
1 Lecture 15: Stability and Control III — Control Philosophy of control: closed loop with feedback Ad hoc control thoughts Controllability Three link robot.
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
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
The Hamiltonian method
Robot Formations Motion Dynamics Based on Scalar Fields 1.Introduction to non-holonomic physical problem 2.New Interaction definition as a computational.
Structure and Synthesis of Robot Motion Dynamics Subramanian Ramamoorthy School of Informatics 2 February, 2009.
Canonical Equations of Motion -- Hamiltonian Dynamics
Deadlock-Free and Collision-Free Coordination for Two Robot Manipulators Patrick A. O’Donnell and Tomas Lozano-Perez MIT Artificial Intelligence Lab (1989)
Particle Kinematics Direction of velocity vector is parallel to path Magnitude of velocity vector is distance traveled / time Inertial frame – non accelerating,
Introduction.
OPERATING SYSTEMS CS 3502 Fall 2017
CE 102 Statics Chapter 1 Introduction.
Introduction.
Special English for Industrial Robot
Introduction.
Inverse Kinematics 12/30/2018.
Introduction.
Continuous Systems and Fields
Large Time Scale Molecular Paths Using Least Action.
Basilio Bona DAUIN – Politecnico di Torino
Special English for Industrial Robot
Chapter 4 . Trajectory planning and Inverse kinematics
Introduction.
Presentation transcript:

Structure and Synthesis of Robot Motion Introduction: Some Concepts in Dynamics and Control Subramanian Ramamoorthy School of Informatics 23 January, 2012

How do we describe motion? From the previous lecture: Describe what needs to happen in the task space (e.g., trace a line) Use kinematics calculations to figure out what this means for joints (c-space) Next question: Dynamics: when should each c-space point be visited? 23/01/2011Structure and Synthesis of Robot Motion2

Motion of a Particle 23/01/2011Structure and Synthesis of Robot Motion3

Motion of a Lunar Lander 23/01/2011Structure and Synthesis of Robot Motion4

How to Move Beyond Point Masses? Clearly, we want to be able to model more complex robots as they appear in practice Within the Newton-Euler formalism, one can try to derive further conservation laws, e.g., momentum This yields additional equations that act as differential constraints on the state space 23/01/2011Structure and Synthesis of Robot Motion5

One ‘Modern’/General Method: Lagrangian Mechanics Based on calculus of variations – optimisation over the space of paths Motion is described in terms of the minimisation of an action functional: 23/01/2011Structure and Synthesis of Robot Motion6 Optimization is over possible small perturbations in functional form

Recap from Calculus: Extrema of Functions 23/01/2011Structure and Synthesis of Robot Motion7

Similar Question for Paths 23/01/2011Structure and Synthesis of Robot Motion8

An Interesting Question about Paths 23/01/2011Structure and Synthesis of Robot Motion9

Q.: What is the Derivative of a Functional? From basic calculus, we know what to do with functions: – A statement about how y changes for “small” changes in x But now, instead of x & y, we have: How does T change with respect to “small” changes in f (x(t)) – What does it mean to make a “small” change in f (x(t)) ? 23/01/2011Structure and Synthesis of Robot Motion10

Euler-Lagrange Equation 23/01/2011Structure and Synthesis of Robot Motion11 Through a derivation to work out when  I (term within limits) vanishes

Solving the Brachistochrone Problem 23/01/2011Structure and Synthesis of Robot Motion12 A ball will roll down the cycloid faster than the straight line!

Deriving Equations of Motion from Lagrangians: A Planar Robot 23/01/2011Structure and Synthesis of Robot Motion13 q1q1 q2q2 q3q3 agag External forces balance accel. terms

RP Manipulator 23/01/2011Structure and Synthesis of Robot Motion14

RP Manipulator Equations 23/01/2011Structure and Synthesis of Robot Motion15

Question The equations of motion (and corresponding geometric/ kinematic descriptions) will tell you what will happen given initial conditions, forces, etc. You want exactly the opposite – what should you tell the robot so it will go through the states you are interested in?! 23/01/2011Structure and Synthesis of Robot Motion16 [Source: NaturalMotion Ltd.]

The Optimal Control Problem Given a dynamical system with states and controls Find policy or sequence of control actions u(t) up to some final time Forcing the state to go from an initial value to a final value While minimizing a specified cost function The resulting state trajectory x(t) is an optimal trajectory Remarks: Certain combinations of cost functions and dynamical systems yield analytical solutions (most need to be solved numerically…) Often, the control policy can be described as a feedback function or control law 23/01/2011Structure and Synthesis of Robot Motion17

The Optimal Control Problem 23/01/2011Structure and Synthesis of Robot Motion18

The Optimal Control Problem 23/01/2011Structure and Synthesis of Robot Motion19

Classical Solution: Necessary Conditions for Optimality 23/01/2011Structure and Synthesis of Robot Motion20

Some Observations In robotics, the variability across tasks is exceptionally large – Robot morphologies differ – Task specifications differ – Disturbance classes and sources of uncertainty differ We do have certain coarse classification of types of tasks – manipulation, locomotion, area coverage, etc. But we are very far from being able to standardize our applications down to modules that can be entirely abstracted and dealt with using traditional program design approaches Let us look at one single (relatively old, but instructive) system to understand what the needs are … 23/01/2011Structure and Synthesis of Robot Motion21

Handey System created by Thomas Lozano-Perez and many collaborators at MIT AI Lab Described in a book: T. Lozano-Perez, J.L. Jones, E. Mazer, P.A. O’Donnell, Handey: A Robot Task Planner, MIT Press, Goal was to explore what it takes to program pick-and-place robots with certain basic properties: 23/01/2011Structure and Synthesis of Robot Motion22

State of the Art, in 1992 When systems like Handey were being built, robots were being programmed at a very primitive level (“move to 1.2, 2.3, 3.4”) – like very primitive machine code Now, programming a pick-and-place task for a specific object, in a specific environment, with a specific robot, and to a specific destination is not that difficult. – The difficulty resides in achieving some degree of generality (i.e., autonomy) Research Goal: Manipulate a wide class of objects in a wide class of environments using a wide class of robots 23/01/2011Structure and Synthesis of Robot Motion23

What Handey Could Do Input: Object models for parts to be manipulated; High-level Move commands involving objects and destinations What Robot Does: Locates parts, picks a grasp, plans a path and moves towards goals (in cluttered environment) 23/01/2011Structure and Synthesis of Robot Motion24

What Problems might the Robot Face? Unexpected Changes Consider the simplest issue: If you pre-program movements then what happens if A or B are not exactly where you thought they would be? In cases where you have sensory feedback, how might you account for still larger scale unexpected events (e.g., missing B)? 23/01/2011Structure and Synthesis of Robot Motion25

What Problems might the Robot Face? Workspace Obstacles If you pre-program movement patterns (e.g., ways to grasp) then what happens when obstacles impede your path? 23/01/2011Structure and Synthesis of Robot Motion26

What Problems might the Robot Face? Computing Collision-Free Paths How to compute the gross motion of getting from start pose to destination pose, respecting all constraints along the way? 23/01/2011Structure and Synthesis of Robot Motion27

What Problems might the Robot Face? Uncertainty How to compute the gross/fine motion of the robot and objects, when none of the coordinates are known exactly (e.g., due to sensor/motor noise)? 23/01/2011Structure and Synthesis of Robot Motion28

What Problems might the Robot Face? Error Detection and Recovery Arguably, one of the most important issues – what should the robot do after something has done wrong? e.g., part has slipped, environment has significantly changed w.r.t. models 23/01/2011Structure and Synthesis of Robot Motion29

Also Need to Think of Interactions between Constraints 23/01/2011Structure and Synthesis of Robot Motion30 Stable grasp vs. Collisions Good grasp vs. Feasible Gross Motion Plans

Many High-Level Concerns Broadly speaking, even with this simple setup, we can identify patterns of high-level concerns: – Gross motion planning – Grasp/Regrasp planning – Multi-arm coordination 23/01/2011Structure and Synthesis of Robot Motion31

Gross Motion in Handey The c-space is represented in terms of slices The free-space is then represented using a tree data structure that utilizes the joint information in the slices In those days, these computations were implemented in parallell on a Connection Machine 23/01/2011Structure and Synthesis of Robot Motion32

Grasp Planning in Handey Broadly, involves the following calculations: – Choose faces to grasp – Project obstacles/constraints onto grasp plane – Characterize grasp and decide on approach/departure – Search c-space for grasp pose, approach pose, departure pose, approach path, departure path 23/01/2011Structure and Synthesis of Robot Motion33

Multi-Robot Coordination in Handey Concept of a temporal coordination diagram A monotonically increasing line corresponds to sequence of poses Collisions can be represented as well and hence constraints can be specified 23/01/2011Structure and Synthesis of Robot Motion34