Robot Control Independent joint control Lyapunov Theory Multivariable PD control and Lyapunov Theory Inverse Dynamic Control Robust Inverse Dynamic Control.

Slides:



Advertisements
Similar presentations
Introductory Control Theory I400/B659: Intelligent robotics Kris Hauser.
Advertisements

Ch 7.6: Complex Eigenvalues
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
A De-coupled Sliding Mode Controller and Observer for Satellite Attitude Control Ronald Fenton.
Ch 7.8: Repeated Eigenvalues
Ch. 7: Dynamics.
The City College of New York 1 Jizhong Xiao Department of Electrical Engineering City College of New York Manipulator Control Introduction.
Linear system by meiling CHEN1 Lesson 8 Stability.
Forward Kinematics.
AAE 666 Final Presentation Spacecraft Attitude Control Justin Smith Chieh-Min Ooi April 30, 2005.
February 24, Final Presentation AAE Final Presentation Backstepping Based Flight Control Asif Hossain.
Modern Control Systems1 Lecture 07 Analysis (III) -- Stability 7.1 Bounded-Input Bounded-Output (BIBO) Stability 7.2 Asymptotic Stability 7.3 Lyapunov.
Orthogonality and Least Squares
Slide# Ketter Hall, North Campus, Buffalo, NY Fax: Tel: x 2400 Control of Structural Vibrations.
5.1 Orthogonality.
1 © Alexis Kwasinski, 2011 DC micro-grids comprise cascade distributed power architectures – converters act as interfaces Point-of-load converters present.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
MODEL REFERENCE ADAPTIVE CONTROL
Definition of an Industrial Robot
Chapter 10 Review: Matrix Algebra
EXAMPLES: Example 1: Consider the system Calculate the equilibrium points for the system. Plot the phase portrait of the system. Solution: The equilibrium.
CHAPTER 2 MATRIX. CHAPTER OUTLINE 2.1 Introduction 2.2 Types of Matrices 2.3 Determinants 2.4 The Inverse of a Square Matrix 2.5 Types of Solutions to.
Math 002 College Algebra Final Exam Review.
Lecture 18. Electric Motors simple motor equations and their application 1.
1 In this lecture we will compare two linearizing controller for a single-link robot: Linearization via Taylor Series Expansion Feedback Linearization.
1 Deadzone Compensation of an XY –Positioning Table Using Fuzzy Logic Adviser : Ying-Shieh Kung Student : Ping-Hung Huang Jun Oh Jang; Industrial Electronics,
To clarify the statements, we present the following simple, closed-loop system where x(t) is a tracking error signal, is an unknown nonlinear function,
Mon 30 July 2007 Overview of the course
Introduction to ROBOTICS
KINEMATIC CHAINS & ROBOTS (I).
Feedback Linearization Presented by : Shubham Bhat (ECES-817)
ADAPTIVE CONTROL SYSTEMS
Review: Neural Network Control of Robot Manipulators; Frank L. Lewis; 1996.
1 Dynamics Differential equation relating input torques and forces to the positions (angles) and their derivatives. Like force = mass times acceleration.
AUTOMATIC CONTROL THEORY II Slovak University of Technology Faculty of Material Science and Technology in Trnava.
Domain of Attraction Remarks on the domain of attraction
SOLVING QUADRATIC EQUATIONS Factoring Method. Warm Up Factor the following. 1. x 2 – 4x – x 2 + 2x – x 2 -28x + 48.
Review of Matrix Operations Vector: a sequence of elements (the order is important) e.g., x = (2, 1) denotes a vector length = sqrt(2*2+1*1) orientation.
1 Lecture 15: Stability and Control III — Control Philosophy of control: closed loop with feedback Ad hoc control thoughts Controllability Three link robot.
Joint Moments and Joint Characteristic Functions.
City College of New York 1 Dr. John (Jizhong) Xiao Department of Electrical Engineering City College of New York Review for Midterm.
(COEN507) LECTURE III SLIDES By M. Abdullahi
Lecture #7 Stability and convergence of ODEs João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems NO CLASSES.
Automatic Control Theory School of Automation NWPU Teaching Group of Automatic Control Theory.
17 1 Stability Recurrent Networks 17 3 Types of Stability Asymptotically Stable Stable in the Sense of Lyapunov Unstable A ball bearing, with dissipative.
5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.
MA2213 Lecture 9 Nonlinear Systems. Midterm Test Results.
Ch 9.6: Liapunov’s Second Method In Section 9.3 we showed how the stability of a critical point of an almost linear system can usually be determined from.
Monday, Apr. 14, 2008 PHYS , Spring 2008 Dr. Jaehoon Yu 1 PHYS 1441 – Section 002 Lecture #21 Monday, Apr. 14, 2008 Dr. Jaehoon Yu Rolling Motion.
11-1 Lyapunov Based Redesign Motivation But the real system is is unknown but not necessarily small. We assume it has a known bound. Consider.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Eigenvalues, Zeros and Poles
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Review of Matrix Operations
Manipulator Dynamics 1 Instructor: Jacob Rosen
Chapter 10 Optimal Control Homework 10 Consider again the control system as given before, described by Assuming the linear control law Determine the constants.
Introduction to ROBOTICS
§7-4 Lyapunov Direct Method
University of Bridgeport
Systems of First Order Linear Equations
Autonomous Cyber-Physical Systems: Dynamical Systems
Modern Control Systems (MCS)
Elementary Matrix Methid For find Inverse
8. Stability, controllability and observability
Homework 9 Refer to the last example.
Stability Analysis of Linear Systems
KINEMATIC CHAINS & ROBOTS (I)
Motion Control.
EXAMPLES: Example 1: Consider the system
Chapter 7 Inverse Dynamics Control
Presentation transcript:

Robot Control Independent joint control Lyapunov Theory Multivariable PD control and Lyapunov Theory Inverse Dynamic Control Robust Inverse Dynamic Control Monday 12 Sept 2005

Feedforward Compensation – Independent Joint + + -

Chain Rule:

, will be positive definite if and only if the matrix P is positive definite matrix, that is, has all eigenvalues positive., equivalently the quadratic form, is said to be positive definite if and only if

Positive Definite Functions

The null solution of is asymptotically stable if there exists a Lyapunov function candidate V such that is negative definite along solution trajectories, that is, Theorem:

A Non-rigorous Proof

Example

Given the system suppose a Lyapunov function candidate V such that along solution trajectories Then the above system is asymptotically stable if does not vanish identically along any solution of the above system other than the null solution, that is, the system is asymptotically stable if the only solution of the system satisfying is the null solution. LaSalle’s Theorem:

Example: V-dot is zero when x 2 is zero. When x 2 is zero (in steady- state) then its rate of change also must be zero so x 1 has to be identically zero from the second equation. So finally the rate of change of x 1 should be zero from the first equation hence V is identically zero only along the equilibrium solution (0,0) of the system. Hence according to LaSalle’s Theorem the system is asymptotically stable.

From a previous slide (30 Aug 2005 Lecture)

Independent joint PD-control Scheme Simplify V-dot. Is this sign definite?

Theorem (p. 143 of the textbook) Define the matrix Then is skew symmetric, that is, the components Proof: Since the inertia matrix D(q) is symmetric, it is not difficult to see that N is skew symmetric.

Independent joint PD-control Scheme 1.We neglect the gravity terms or add an extra term g(q) in the input u. 2.We choose K D such that K D +B is positive definite. 3.This makes V-dot negative semi-definite.

When V-dot is identically equal to zero then it implies that q-dot and q-double dot are both identically equal to zero. But this doesn’t imply that the error is zero, i.e., q- desired may not equal q. But from we see that when v-dot is zero we must have LaSalle’s Theorem then implies that the system is asymptotically stable. To account for the gravity torque we can either have the position gains Kp very large or modify the input expression as

Inverse Dynamics or Computed Torque

Robust compensator Trajectory planner Nonlinear interface Plant Inner loop Outer loop Nominally linear system

Example (page 226)

Trajectory Interpolation Solve for (a,b,c,d,e).

Example (page 226)

//(1) trajectory planning //(2) simulation of inverse dynamic control of one link manipulator //I*theta-double dot+MgL*sin(theta) = u //10 Sept 2005 //Go to the directory where you keep this file and then to run it //exec('invdynpendulum.sce') clear t0 t1 t2 t I Ihat Mglhat k0 k1 dt abcde pos speed acc x1 x2 z m traj t0=0; t1=0.5; t2=1; I=5;Mgl=10;Ihat=5;Mglhat=5; k0=10;k1=10;dt=0.01; //theta=a+b*t+c*t^2+d*t^3+e*t^4 traj=[0;1;1;0;0];//position at t=t0, t=t1, t=t2; speed at t=t2; acceleration at t=t2 m=[1,t0,t0^2,t0^3,t0^4;1,t1,t1^2,t1^3,t1^4;1,t2,t2^2,t2^3,t2^4;0,1,2*t2,3*t2^2,4*t2^3;0,0,2,6*t2,12*t2^2]; abcde=inv(m)*traj; t=[0:dt:1]; pos=abcde'*[ones(size(t,1),size(t,2));t;t.*t;(t.*t).*t;(t.*t).*(t.*t)]; speed=abcde'*[zeros(size(t,1),size(t,2));ones(size(t,1),size(t,2));2*t;3*(t.*t);4*(t.*t).*t]; acc=abcde'*[zeros(size(t,1),size(t,2));zeros(size(t,1),size(t,2));... 2*ones(size(t,1),size(t,2));6*(t);12*t.*t]; x1(1)=pos(1); x2(1) = speed(1); z=[x1(1);x2(1)]; //initial conditions for k = 2:size(t,2), z(1)=z(1)+z(2)*dt; z(2)=z(2)+(-Mgl*sin(z(1))+Ihat*(acc(k)+k1*(speed(k)-z(2))+k0*(pos(k)-z(1)))+Mglhat*sin(z(1)))*(dt/I); x1(k)=z(1);x2(k)=z(2); end; f1=scf(1);clf(f1,'reset'); plot2d(t,pos,1);plot(t,x1,2); xgrid;xtitle('Theta', 'Time (s)','Angle (rad)');

k 0 =1, k 1 =2k 0 =10, k 1 =10I = 5, MgL = 10 desired

Implementation and Robustness Issues Define:

We need to choose the control such that

This is not likely because of the zero elements of the upper left quarter of the matrix. This means we have to try another Lyapunov function candidate. Find

This should be possible. So choose the P matrix and K 0 and K 1 such that Q is negative definite.

Example (page 226)

//(1) trajectory planning //(2) simulation of inverse dynamic control of one link manipulator //I*theta-double dot+MgL*sin(theta) = u //10 Sept 2005 //Go to the directory where you keep this file and then to run it //exec('invdynpendulum.sce') clear t0 t1 t2 t I Ihat Mglhat k0 k1 dt abcde pos speed acc x1 x2 z m traj Q1 t0=0; t1=0.5; t2=1; I=5;Mgl=10;Ihat=7.5;Mglhat=7.5; k0=1;k1=2;dt=0.01; alpha=0.5;Mbar=0.2; phi=2.5;p11=1;p12=1;p21=11;p22=1; //theta=a+b*t+c*t^2+d*t^3+e*t^4 traj=[0;1;1;0;0];//position at t=t0, t=t1, t=t2; speed at t=t2; acceleration at t=t2 m=[1,t0,t0^2,t0^3,t0^4;1,t1,t1^2,t1^3,t1^4;1,t2,t2^2,t2^3,t2^4;0,1,2*t2,3*t2^2,4*t2^3;0,0,2,6*t2,12*t2^2]; abcde=inv(m)*traj; t=[0:dt:1]; pos=abcde'*[ones(size(t,1),size(t,2));t;t.*t;(t.*t).*t;(t.*t).*(t.*t)]; speed=abcde'*[zeros(size(t,1),size(t,2));ones(size(t,1),size(t,2));2*t;3*(t.*t);4*(t.*t).*t]; acc=abcde'*[zeros(size(t,1),size(t,2));zeros(size(t,1),size(t,2));... 2*ones(size(t,1),size(t,2));6*(t);12*t.*t]; Q1=max(acc);

x1(1)=pos(1); x2(1) = speed(1); z=[x1(1);x2(1)]; //initial conditions for k = 2:size(t,2), etheta=z(1)-pos(k); espeed=z(2)-speed(k); rho=(1/(1- alpha))*(alpha*Q1+alpha*sqrt(k0*k0+k1*k1)*sqrt(etheta*etheta+espeed*espeed)+Mba r*phi); if abs(z(2)+z(1)) > then delv=-rho*(etheta+espeed)/abs((etheta+espeed)); else delv=0; end; z(1)=z(1)+z(2)*dt; z(2)=z(2)+(-Mgl*sin(z(1))+Ihat*(acc(k)+k1*(speed(k)-z(2))+k0*(pos(k)- z(1))+delv)+Mglhat*sin(z(1)))*(dt/I); x1(k)=z(1);x2(k)=z(2); end; f1=scf(1);clf(f1,'reset'); plot2d(t,pos,1);plot(t,x1,2); xgrid;xtitle('Theta', 'Time (s)','Angle (rad)');

k 0 =1, k 1 =2I = 5, MgL = 10 desired