EE611 Deterministic Systems Multiple-Input Multiple-Output (MIMO) Feedback Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.

Slides:



Advertisements
Similar presentations
State Feedback Controller Design
Advertisements

Properties of State Variables
Section 5.1 Eigenvectors and Eigenvalues. Eigenvectors and Eigenvalues Useful throughout pure and applied mathematics. Used to study difference equations.
Matrix Theory Background
Some useful linear algebra. Linearly independent vectors span(V): span of vector space V is all linear combinations of vectors v i, i.e.
5.II. Similarity 5.II.1. Definition and Examples
Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues
Control Systems and Adaptive Process. Design, and control methods and strategies 1.
化工應用數學 授課教師: 郭修伯 Lecture 9 Matrices
Boyce/DiPrima 9th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
Linear Algebra/Eigenvalues and eigenvectors. One mathematical tool, which has applications not only for Linear Algebra but for differential equations,
 Row and Reduced Row Echelon  Elementary Matrices.
Row Reduction Method Lesson 6.4.
Chapter 2 Simultaneous Linear Equations (cont.)
Eigenvalues and Eigenvectors
4 4.4 © 2012 Pearson Education, Inc. Vector Spaces COORDINATE SYSTEMS.
Matrices CHAPTER 8.1 ~ 8.8. Ch _2 Contents  8.1 Matrix Algebra 8.1 Matrix Algebra  8.2 Systems of Linear Algebra Equations 8.2 Systems of Linear.
Computing Eigen Information for Small Matrices The eigen equation can be rearranged as follows: Ax = x  Ax = I n x  Ax - I n x = 0  (A - I n )x = 0.
Chapter 5 Eigenvalues and Eigenvectors 大葉大學 資訊工程系 黃鈴玲 Linear Algebra.
Chap. 4 Vector Spaces 4.1 Vectors in Rn 4.2 Vector Spaces
Elementary Linear Algebra Anton & Rorres, 9 th Edition Lecture Set – 07 Chapter 7: Eigenvalues, Eigenvectors.
Meeting 19 System of Linear Equations. Linear Equations A solution of a linear equation in n variables is a sequence of n real numbers s 1, s 2,..., s.
2.2 The Inverse of a Matrix. Example: REVIEW Invertible (Nonsingular)
Matrices and Matrix Operations. Matrices An m×n matrix A is a rectangular array of mn real numbers arranged in m horizontal rows and n vertical columns.
Lecture 14: Pole placement (Regulator Problem) 1.
(COEN507) LECTURE III SLIDES By M. Abdullahi
Lesson 7 Controllability & Observability Linear system 1. Analysis.
DESIGN OF CONTROLLERS WITH ARBITRARY POLE PLACEMENT AND STATE OBSERVERS Dr. C. Vivekanandan Professor and Vice Principal Dept. of EEE Jan. 9, 20161SNSCE.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
Chapter 61 Chapter 7 Review of Matrix Methods Including: Eigen Vectors, Eigen Values, Principle Components, Singular Value Decomposition.
Boot Camp in Linear Algebra TIM 209 Prof. Ram Akella.
Reduced echelon form Matrix equations Null space Range Determinant Invertibility Similar matrices Eigenvalues Eigenvectors Diagonabilty Power.
Basic search for design of control system and disturbance observer
Eigenvalues, Zeros and Poles
EE611 Deterministic Systems Controllability and Observability of Continuous-time Systems Kevin D. Donohue Electrical and Computer Engineering University.
EE611 Deterministic Systems Controllability and Observability Discrete Systems Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Lecture XXVII. Orthonormal Bases and Projections Suppose that a set of vectors {x 1,…,x r } for a basis for some space S in R m space such that r  m.
Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.
EE611 Deterministic Systems State Observers Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
EE611 Deterministic Systems System Descriptions, State, Convolution Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
EE611 Deterministic Systems Vector Spaces and Basis Changes Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Chapter 12 Design via State Space <<<4.1>>>
Elementary Linear Algebra Anton & Rorres, 9th Edition
5 Systems of Linear Equations and Matrices
Section 4.1 Eigenvalues and Eigenvectors
Pole Placement and Decoupling by State Feedback
EE611 Deterministic Systems
Pole Placement and Decoupling by State Feedback
Systems of First Order Linear Equations
Eigenvalues and Eigenvectors
4.2 State Feedback for Multivariable Systems
Chapter 4 Systems of Linear Equations; Matrices
Boyce/DiPrima 10th ed, Ch 7.3: Systems of Linear Equations, Linear Independence, Eigenvalues Elementary Differential Equations and Boundary Value Problems,
§2-3 Observability of Linear Dynamical Equations
Static Output Feedback and Estimators
8. Stability, controllability and observability
Eigenvalues and Eigenvectors
Equivalent State Equations
Chapter 3 Canonical Form and Irreducible Realization of Linear Time-invariant Systems.
Note Please review 組合矩陣理論筆記(4) 1-3 about
Warmup Open Loop System Closed Loop System
Homework 3: Transfer Function to State Space
EIGENVECTORS AND EIGENVALUES
Chapter 4 Systems of Linear Equations; Matrices
3.IV. Change of Basis 3.IV.1. Changing Representations of Vectors
Homework 3: Transfer Function to State Space
Eigenvalues and Eigenvectors
Linear Algebra: Matrix Eigenvalue Problems – Part 2
Vector Spaces COORDINATE SYSTEMS © 2012 Pearson Education, Inc.
Presentation transcript:

EE611 Deterministic Systems Multiple-Input Multiple-Output (MIMO) Feedback Kevin D. Donohue Electrical and Computer Engineering University of Kentucky

MIMO State Feedback Consider designing state feedback for a MIMO system Feedback design results in matrix K and the feedback compensated system becomes:

Design by Converting to Single Input System Matrix A is cyclic iff its characteristic polynomial is equal to its minimal polynomial (i.e. one and only one Jordan block for each eigenvalue) Theorem: If {A, B} is controllable and A is cyclic, then for almost any px1 real vector v the single input pair {A, Bv } is controllable. “Almost” means rows of Bv corresponding to the last row of each Jordan block are not zero.

Creating Cyclic with Feedback Theorem: If {A, B} is controllable, then for almost any pxn real constant matrix K, all the eigenvalues of A–BK are distinct and consequently (A-BK) is cyclic. Theorem: If {A, B} is controllable, then by state feedback of the form u = r - Kx where K is a pxn real constant matrix, the eigenvalues of A-BK can be arbitrarily assigned. Feedback design process follows the proof... If A not cyclic, make it cyclic with an arbitrary feedback matrix, then design another feedback matrix/vector to place eigenvalues at desired positions.

Example Convert Problem to single input system to design a feedback matrix K to place eigenvalues at -2, -1.5  j1.5, -1  j2 For reduction vector v = [1 1] T, show

Design Using Controllable Canonical Form Given controllable {A, B} with Create initial controllability matrix: where is the rank of B. Obtain a non-singular square matrix M by finding the l.i. columns from left to right of M' and rearrange to group together columns of B: where  i are the controllability indices associated with each l.i. column of B. Take inverse of M and partition rows according to blocks associated with each b i :

Design Using Controllable Canonical Form Use last rows of each partition in M-1 to create P matrix for transformation to controllable canonical form:

MIMO Controllable Canonical Form where x implies any number

Example Convert the MIMO system below to a controllable canonical form:

Example Design a feedback matrix K so that resulting eigenvalues are at -1, -2  j, and -1  j2

Lyapunov Method MIMO Find equivalence transformation such that desired K vector satisfies: where F is a matrix with desired eigenvalues distinct from A (i.e. the eigenvalues of the feedback system). Terms can be rearranged to show: Therefore, can be chosen almost arbitrarily, and similarity transform matrix T solved for to obtain

Lyapunov Method MIMO If A and F have no eigenvalues in common, then a solution for T exists in and is nonsingular iff (A, B ) is controllable and (F, ) observable. Procedure: 1. Select n x n matrix F with desired eigenvalues. 2. Select arbitrary p x n vector such that (F, ) controllable. 3. Solve for T in the Lyapunov equation 4. Compute feedback gain matrix

State Observer/Estimators The extension from SISO to MIMO systems for state observers is trivial for the Lyapunov method. Extend single row vector c to C, and observer gain vector l to L. For the reduced state estimator, the observer can be reduced to a dimension of n -  (C).