Variable Structure Control ~ Basics

Similar documents
Introduction. - The Second Lyapunov Method. - The First Lyapunov Method

Chapter 11. Supplemental Text Material. The method of steepest ascent can be derived as follows. Suppose that we have fit a firstorder

Flight Dynamics & Control Eigenvalue-Eigenvector Assignment

Scattering of two identical particles in the center-of. of-mass frame. (b)

Specification -- Assumptions of the Simple Classical Linear Regression Model (CLRM) 1. Introduction

Small signal analysis

Linear System Fundamentals

However, since P is a symmetric idempotent matrix, of P are either 0 or 1 [Eigen-values

MEM 255 Introduction to Control Systems Review: Basics of Linear Algebra

The equation of motion of a dynamical system is given by a set of differential equations. That is (1)

Start Point and Trajectory Analysis for the Minimal Time System Design Algorithm

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

Lecture 21: Numerical methods for pricing American type derivatives

Harmonic oscillator approximation

Inner Product. Euclidean Space. Orthonormal Basis. Orthogonal

Root Locus Techniques

APPENDIX A Some Linear Algebra

Tensor Analysis. For orthogonal curvilinear coordinates, ˆ ˆ (98) Expanding the derivative, we have, ˆ. h q. . h q h q

Modelli Clamfim Equazioni differenziali 22 settembre 2016

Team. Outline. Statistics and Art: Sampling, Response Error, Mixed Models, Missing Data, and Inference

PHYS 705: Classical Mechanics. Newtonian Mechanics

Modelli Clamfim Equazioni differenziali 7 ottobre 2013

SL n (F ) Equals its Own Derived Group

The multivariate Gaussian probability density function for random vector X (X 1,,X ) T. diagonal term of, denoted

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Transfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system

SELECTED SOLUTIONS, SECTION (Weak duality) Prove that the primal and dual values p and d defined by equations (4.3.2) and (4.3.3) satisfy p d.

Strong Markov property: Same assertion holds for stopping times τ.

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

Robust observed-state feedback design. for discrete-time systems rational in the uncertainties

DISCRIMINANTS AND RAMIFIED PRIMES. 1. Introduction A prime number p is said to be ramified in a number field K if the prime ideal factorization

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 13

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

Improvements on Waring s Problem

Electrical Circuits II (ECE233b)

Pythagorean triples. Leen Noordzij.

728. Mechanical and electrical elements in reduction of vibrations

Notes on Analytical Dynamics

STAT 309: MATHEMATICAL COMPUTATIONS I FALL 2018 LECTURE 16

1 cos. where v v sin. Range Equations: for an object that lands at the same height at which it starts. v sin 2 i. t g. and. sin g

Introduction to Interfacial Segregation. Xiaozhe Zhang 10/02/2015

Canonical transformations

1 (1 + ( )) = 1 8 ( ) = (c) Carrying out the Taylor expansion, in this case, the series truncates at second order:

and decompose in cycles of length two

CS 468 Lecture 16: Isometry Invariance and Spectral Techniques

ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Neuro-Adaptive Design - I:

Projectile Motion. Parabolic Motion curved motion in the shape of a parabola. In the y direction, the equation of motion has a t 2.

CHAPTER X PHASE-CHANGE PROBLEMS

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Orthogonal Functions and Fourier Series. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell

Orthogonal Functions and Fourier Series. University of Texas at Austin CS384G - Computer Graphics Spring 2010 Don Fussell

In this section is given an overview of the common elasticity models.

MTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i

MEM633 Lectures 7&8. Chapter 4. Descriptions of MIMO Systems 4-1 Direct Realizations. (i) x u. y x

Bézier curves. Michael S. Floater. September 10, These notes provide an introduction to Bézier curves. i=0

Computer Control Systems

Weak McCoy Ore Extensions

The Prncpal Component Transform The Prncpal Component Transform s also called Karhunen-Loeve Transform (KLT, Hotellng Transform, oregenvector Transfor

MAE140 - Linear Circuits - Winter 16 Final, March 16, 2016

Extended Prigogine Theorem: Method for Universal Characterization of Complex System Evolution

Hybrid State Feedback Controller Design of Networked Switched Control Systems with Packet Dropout

Solutions to exam in SF1811 Optimization, Jan 14, 2015

Affine and Riemannian Connections

Separation Axioms of Fuzzy Bitopological Spaces

CALCULUS CLASSROOM CAPSULES

Electromagnetic scattering. Graduate Course Electrical Engineering (Communications) 1 st Semester, Sharif University of Technology

PHYS 705: Classical Mechanics. Calculus of Variations II

Advanced Quantum Mechanics

Lecture 10 Support Vector Machines II

Two Approaches to Proving. Goldbach s Conjecture

MATH 5630: Discrete Time-Space Model Hung Phan, UMass Lowell March 1, 2018

ALGEBRA HW 7 CLAY SHONKWILER

Dynamic Systems on Graphs

FEEDDBACK CONTROL OF PIEZO-LAMINATE COMPOSITE PLATE. Hafez Ave, Tehran 15914, Iran

Three views of mechanics

Modelli Clamfim Equazione del Calore Lezione ottobre 2014

Math 217 Fall 2013 Homework 2 Solutions

8 Waves in Uniform Magnetized Media

Relaxation Methods for Iterative Solution to Linear Systems of Equations

SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)

Physics 111. CQ1: springs. con t. Aristocrat at a fixed angle. Wednesday, 8-9 pm in NSC 118/119 Sunday, 6:30-8 pm in CCLIR 468.

Bezier curves. Michael S. Floater. August 25, These notes provide an introduction to Bezier curves. i=0

Polymer Chains. Ju Li. GEM4 Summer School 2006 Cell and Molecular Mechanics in BioMedicine August 7 18, 2006, MIT, Cambridge, MA, USA

A NUMERICAL MODELING OF MAGNETIC FIELD PERTURBATED BY THE PRESENCE OF SCHIP S HULL

MEM 355 Performance Enhancement of Dynamical Systems

Representation theory and quantum mechanics tutorial Representation theory and quantum conservation laws

CHAPTER 9 LINEAR MOMENTUM, IMPULSE AND COLLISIONS

STABILITY OF DGC S QUADRATIC FUNCTIONAL EQUATION IN QUASI-BANACH ALGEBRAS: DIRECT AND FIXED POINT METHODS

SIMULATION OF WAVE PROPAGATION IN AN HETEROGENEOUS ELASTIC ROD

Salmon: Lectures on partial differential equations. Consider the general linear, second-order PDE in the form. ,x 2

UNIT 7. THE FUNDAMENTAL EQUATIONS OF HYPERSURFACE THEORY

Buckling analysis of piezoelectric composite plates using NURBSbased isogeometric finite elements and higher-order shear deformation theory

Uniqueness of Weak Solutions to the 3D Ginzburg- Landau Model for Superconductivity

Continuous Time Markov Chain

Scattering cross section (scattering width)

READ T H E DATE ON LABEL A blue m a r k a r o u n d this notice will call y o u r attention to y o u r LOWELL. MICHIGAN, THURSDAY, AUGUST 29.

ON MECHANICS WITH VARIABLE NONCOMMUTATIVITY

Portfolios with Trading Constraints and Payout Restrictions

Transcription:

Varable Structure Control ~ Bac Harry G. Kwatny Department of Mechancal Engneerng & Mechanc Drexel Unverty

Outlne A prelmnary example VS ytem, ldng mode, reachng Bac of dcontnuou ytem Example: underea vehcle Degn baed on normal form

Example 1 2 x = ax bu, a, b > 0 u = 2 1 α x x> 0 = cx + x =, α x1 x 1 < 0 α, c > 0 1 1 1 2 ldng mode: = cx + x 0 + cx = 0 1 2 2 2 condton for extence: < 0

Setup Sytem: = f( xu, ) n m x R, u R, f mooth Control: u dcontnuou acro wtchng urface ( x) = 0 + u ( x), ( x) > 0 u ( x) =, = 1,, m u ( x), ( x) < 0 + u ( x), u ( x), mooth

Bac of Dcontnuou Sytem ~ 1 = f(,) xt f mooth n x( C k, k> 0) for each t except on m codmenon-one urface defned by ( x) = 0, = 1,, m What a oluton?

Bac of Dcontnuou Sytem ~ 2 If there a moton n the wtchng urface, t called a ldng moton. How t defned?

Bac: The Flppov Soluton dx() t dt F( xt, t) : = conv f( S( δ, xt ) Λ( δ, xt ), t) δ > 0 { y R y }} n S( δ, x) : = x < δ Λ( δ, x) : ubet of meaure zero on whch f not defned

Lyapunov Ung mooth Lyapunov functon wth dcontnuou vector feld. V V x C V V ( xt ) ξ ξ F ( xt, t) x Reult 1 ρ < 0 > 0 on P Λ V ρ < 1 ( V ρ ) 0 0 on ( V ρ > ) Reult 2 V ρ ( x), ρ > 0on P Λ V ρ ( x), ρ > 0 on P P

Sldng Doman { n } D M = x R x = 0 a ldng doman f: 1. trajectore begnnng n a δ -vcnty of D reman n an ε -vcnty untl reachng D 2. D doe not contan entre trajectore of the m 2 aocated contnuou ytem.

Propoton Lyapunov verfcaton of a ldng doman. 0 f ( x) 0 1 = = V( x) C, V( x): = > 0 otherwe D D an open, connected ubet of R V ρ x < 0 on D M D a ldng doman n

Propoton Fnte tme reachng of ldng doman. 2 V ( x) = σ x, σ > 0on a δ -vcnty of D D an open, connected ubet of R V ρ x < 0 on D M trajectore begnnng n a δ -vcnty of D n fnte tme D n D reach

VSC Degn va Sldng Mode: Setup Sytem: Control: = f( xu, ) n m x R, u R, f mooth u dcontnuou acro wtchng urface ( x) = 0 + u ( x), ( x) > 0 u ( x) =, = 1,, m u ( x), ( x) < 0 + u ( x), u ( x), mooth

VSC Degn va Sldng Mode: Strategy ( x) ( x) 1. Chooe wtchng urface,, o that ldng mode ha dered dynamc. ( x) ± 2. Chooe control functon, u, o that ldng mode reached n fnte tme. Approach: 1. How doe choce of equvalent control method ( x) affect ldng behavor? ± 2. How can we chooe u to nure fnte tme reachng? Lyapunov method

Reachng Chooe T V x = x x = x 2 T V ( x) = 2 ( x) f ( x, u) x T Suppoe 2 x x f xu, < ρ x on D M where D an open et contanng D M D a ldng doman and t reached n fnte tme from any ntal pont n D.

Example ~ Lnear SISO f x, u = Ax + bu, x = cx 2 V = x V = 2() x cax + 2 x cbu We can only affect the econd term. Chooe, u = k x gn x cb, k x > 0 x V = 2 ( x) cax cbk ( x) gn ( x) cb x provded cbk x cax ρ, x k x = ρ + cax / cb Th nure that x ρ a global ldng doman.

Equvalent Control ~ 1 + u tx x = f txu,,, u = u ( tx) ( x) Suppoe a ldng doman, > 0 { n } M = x R x =, < 0 0 contan

Equvalent Control ~ 2 ( x) = f( txu,, ) eq 0 x f a oluton ext for u, then on = 0, 0 and ( (, )) eq eq = f txu,, tx dynamc n ldng

Equvalent Control Specal Cae Sytem 'lnear n control' = + f x G x u x = S x f x + S x G x u 1 det SG 0 ueq = S x G x S x f x 1 = I G x S x G x S x f x Lnear Sytem 1 = Ax + Bu, x = Cx u = CB CAx (aumng det CB 0) eq 1 = I B CB C Ax eq 0

Geometry A ubet S of the lnear pace (over feld ) X a lnear ubpace of X f: x1, x2 S and c, c, cx + cx S 1 2 1 1 2 { r r, } { } If x X ( = 1,, k), then pan x,, x a ubpace of X. R,S X then R + S = + R S { x S } R S = xx R& x Two ubpace R,S are ndependent f R S = 0 1 For our purpoe thnk Eucldean pace k n R

Geometry 2 If R, = 1,, k are ndependent ubpace, then the um R = R + + R 1 called an ndrect um and may be wrtten R = R R 1 k k The ymbol preupoe ndependence. Let X = R S. For each x X, there are unque r R, S o that x= r+. Th mple a unque functon r called the projecton on R along S.

Geometry 3 The projecton a lnear map Q : X X, uch that Im Q= R and ker Q= S, and Q ( I Q) ( I Q) 0 2 X = X X =R S Note that the projecton on S along R. Thu, Q I Q = Q = Q Converly, for any map : X X uch that = X = Im Q ker Q 2 Q Q Q.e., Q the projecton on Im Q along ker Q.

Geometry 4 Recall 1 = I B CB C Ax 1 Q = B CB C 1 ( 1 ) 2 1 1 1 Q = B CB CB CB C = B CB C ImQ = Im B ker Q = ker C X = Im B ker C B CB C the projecton on Im B along ker C I B CB C the projecton on ker C along Im B

Lnear Example ~ 1 x = cx, 0 0 [ ] 1 n 1 c = cax + cbu : = 0 u = cb cax eq 1 = I b cb c Ax Sldng dynamc Defne a matrx V whoe column pan ker c,.e., V = v v, cv = 0 Notce that b ker c and X = Imb ker c. Defne a tate tranformaton x w, z x = Vw + bz, eq 1 n 1 w R, z R 1 Vw + bz = I b cb c A Vw + bz

Lnear Example ~ 2 w w z z 1 [ V b] = I b( cb) c A[ V b] 1 U UV Ub In 1 0 1 [ V b] = d ( cb) c d dv db = 0 1 = w U 1 w U w I b( cb) c AV [ b] AV [ b] z = = d z 0 z note: d I 1 c 0 b cb = w UAV UAb w z = 0 0 z ldng: w = [ ] UAV w

Degnng the Sldng Surface Conder the ytem = f x + G x u rank G x = m atfe controllablty rank condton Tranform to regular form: = f x x (, ) (, ) (, ) 1 1 1 2 = f x x + G x x u 2 1 1 2 2 1 2 x R, x R,det G 0 around x n m m 1 2 2 0 around x Strategy: 0 1) chooe x = x o that 2 0 1 (, ) = f x x 1 1 1 0 1 ha dered behavor, 2) chooe u to enforce ldng on (, ) x x = x + x 1 2 0 1 2

Lnear Cae = Ax + Bu, rank B = m, A, B controllable reorder tate to obtan B1 m m B=, wth B2 R,det B2 0 B 2 tranform to regular form: 1 In m BB 1 2 z = Tx, T = 1 0 B2 A A 0 11 12 z = z u A11 A12 A21 A + 22 I the par, controllable

Lnear Cae 2 To hape ldng dynamc, 2 1 1 11 12 1 Chooe Now, by any mean, pole placement, LQG, etc. 1 2 To degn the control u take 1 2 1 T T V ( z) = ( z) = ( z) Q ( z), Q = Q > 0 Q 2 2 T T T V z = Q= z K I Q K I Az+ Qu u z = Kz z = A + A K z K z = Kz + z T [- m] [- m] * * = κ ( z) gn, ( z) = Q ( z), κ T T > [- ] [- ] z z K I Q K I Az m m

Example: Underwater Vehcle [ ] mx + cxx = u, mc, uncertan, u UU, = v c 1 v = vv+ u m m Chooe a ldng urface: = v+ λx Why? Becaue 0 = λx ( v = λx tablze frt eq) V xv = = T 2 Chooe control baed on,, v 1 U V 2[ λ 1] c > 0 = + 2 u u = vv m U < 0 m

Control Baed on Normal Form ξ = F( ξ, zu, ) z = Az + E[ αξ (, z) + ρξ (, z) u] y = Cz Chooe x uch that x = 0 Kz x = 0 + u ( x) ( x) > 0 u ( x) = u ( x) ( x) < 0 Recall Brunovky tructure of A,E

Sldng Dynamc Note : ame a feedback lnearzng control ( x) = 0 Kz( x) = 0 Kz = KAz + KE α( x) + ρ( x) ueq = 0 KE = I 1 1 ueq = ρ x KAz x ρ x α x z = I EK Az, Kz t = 0 [ ] 0 Sldng Dynamc

Choong K One choce: r1 k1 0 0 K =, k = a,1 ar, 1 1 r m 0 0 k m Sldng egenvalue Egenvalue of (A+EK) are: mare 0 and r mare 0 1 0, 1,, m λ = 0 0 1 a,1 a,2 a r, 1

Reachng Conder the potve defnte quadratc form n V ( x) = T Q Upon dfferentaton we obtan d dt V T T T [ KAz + α] QKz 2u ρ QKz T = 2 Q = 2 + If the control are bounded, u U > 0 ( 0 > U mn, u U max, > 0 ) then chooe u = R S * U x T mn, max, * U x a f a f > 0 < 0, = 1,, m, * T x = ρ ( x ) QKz ( x )

VSC Summary