Digital Control Systems Controllability&Observability.

Slides:



Advertisements
Similar presentations
Goodwin, Graebe, Salgado ©, Prentice Hall 2000 Chapter 17 Linear State Space Models.
Advertisements

Chapter 5 Analysis of CCS.
Properties of State Variables
Similarity Transformation. Basic Sets Use a new basis set for state space. Obtain the state-space matrices for the new basis set. Similarity transformation.
A Review on Controllability of Dynamical Systems Presented to : Academic Weekly Sessions of Bagher Menhaj Students 2010, Nov 22 Presented by: S. M. Dibaji,
Multivariable Control Systems
Digital Control Systems STATE OBSERVERS. State Observers.
Digital Control Systems
Control Systems and Adaptive Process. Design, and control methods and strategies 1.
Digital Control Systems Vector-Matrix Analysis. Definitions.
Digital Control Systems
1 數位控制(十). 2 Continuous time SS equations 3 Discretization of continuous time SS equations.
Input image Output image Transform equation All pixels Transform equation.
Chapter 3 The Inverse. 3.1 Introduction Definition 1: The inverse of an n  n matrix A is an n  n matrix B having the property that AB = BA = I B is.
Section 8.3 – Systems of Linear Equations - Determinants Using Determinants to Solve Systems of Equations A determinant is a value that is obtained from.
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
Controllability and Observability
Introduction to the Hankel -based model order reduction for linear systems D.Vasilyev Massachusetts Institute of Technology, 2004.
1 In this lecture we will compare two linearizing controller for a single-link robot: Linearization via Taylor Series Expansion Feedback Linearization.
Solving Polynomial Equations – Factoring Method A special property is needed to solve polynomial equations by the method of factoring. If a ∙ b = 0 then.
Linear Equations in Two Variables A Linear Equation in Two Variables is any equation that can be written in the form where A and B are not both zero.
Linear Time-Invariant Systems
Robotics Research Laboratory 1 Chapter 7 Multivariable and Optimal Control.
Professor Walter W. Olson Department of Mechanical, Industrial and Manufacturing Engineering University of Toledo Observers/Estimators …  bnbn b n-1 b2b2.
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
CONTROL OF MULTIVARIABLE SYSTEM BY MULTIRATE FAST OUTPUT SAMPLING TECHNIQUE B. Bandyopadhyay and Jignesh Solanki Indian Institute of Technology Mumbai,
Table of Contents Solving Polynomial Equations – Factoring Method A special property is needed to solve polynomial equations by the method of factoring.
2.1 – Linear and Quadratic Equations Linear Equations.
Lecture 14: Pole placement (Regulator Problem) 1.
1 Convergence of Fourier Series Can we get Fourier Series representation for all periodic signals. I.e. are the coefficients from eqn 3.39 finite or in.
2.5 – Determinants and Multiplicative Inverses of Matrices.
Lesson 7 Controllability & Observability Linear system 1. Analysis.
3/18/20161 Linear Time Invariant Systems Definitions A linear system may be defined as one which obeys the Principle of Superposition, which may be stated.
1 Computing the output response of LTI Systems. By breaking or decomposing and representing the input signal to the LTI system into terms of a linear combination.
Chapter 2 The z-transform and Fourier Transforms The Z Transform The Inverse of Z Transform The Prosperity of Z Transform System Function System Function.
Chapter 4 Structures for Discrete-Time System Introduction The block diagram representation of the difference equation Basic structures for IIR system.
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.
EE611 Deterministic Systems Multiple-Input Multiple-Output (MIMO) Feedback Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
EE611 Deterministic Systems State Observers Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
EE611 Deterministic Systems Examples and Discrete Systems Descriptions 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.
Analogue and digital techniques in closed loop regulation applications
ELG5377 Adaptive Signal Processing
§2-3 Observability of Linear Dynamical Equations
Solving Matrix equations
A quadratic equation is written in the Standard Form,
DETERMINANT definition and origin.
§2-3 Observability of Linear Dynamical Equations
Static Output Feedback and Estimators
Digital Control Systems
§1-3 Solution of a Dynamical Equation
§3-2 Realization of single variable systems
Solving Quadratic Equations by Factoring
8. Stability, controllability and observability
§2-2 Controllability of Linear Dynamical Equations
Equivalent State Equations
Chapter 3 Canonical Form and Irreducible Realization of Linear Time-invariant Systems.
Warmup Open Loop System Closed Loop System
§2-2 Controllability of Linear Dynamical Equations
Linear State Space Models
§3-2 Realization of single variable systems
Concept of frequency in Discrete Signals & Introduction to LTI Systems
Signals and Systems Lecture 18: FIR Filters.
Digital Signal Processing
Goodwin, Graebe, Salgado ©, Prentice Hall 2000 Chapter 17 Linear State Space Models.
Matrices - Operations INVERSE OF A MATRIX
2.3 Properties of Linear Time-Invariant Systems
Convolution sum & Integral
Presentation transcript:

Digital Control Systems Controllability&Observability

CONTROLLABILITY Complete State Controllability for a Linear Time Invariant Discrete-Time Control System

CONTROLLABILITY Complete State Controllability for a Linear Time Invariant Discrete-Time Control System Controllability matrix

CONTROLLABILITY Complete State Controllability for a Linear Time Invariant Discrete-Time Control System

CONTROLLABILITY Complete State Controllability for a Linear Time Invariant Discrete-Time Control System Condition for complete state controllability

CONTROLLABILITY Complete State Controllability for a Linear Time Invariant Discrete-Time Control System Condition for complete state controllability

CONTROLLABILITY Complete State Controllability for a Linear Time Invariant Discrete-Time Control System Condition for complete state controllability Example:

CONTROLLABILITY Complete State Controllability for a Linear Time Invariant Discrete-Time Control System Condition for complete state controllability Example:

CONTROLLABILITY Determination of Control Sequence to Bring the Initial State to a Desired State

CONTROLLABILITY Condition for Complete State Controllability in the z-Plane Example:

CONTROLLABILITY Complete Output Controllability

CONTROLLABILITY Complete Output Controllability

CONTROLLABILITY Complete Output Controllability

CONTROLLABILITY Controllability from the origin : controllability : reachability

OBSERVABILITY

Complete Observability of Discrete-Time Systems

OBSERVABILITY Complete Observability of Discrete-Time Systems

OBSERVABILITY Complete Observability of Discrete-Time Systems Observability matrix

OBSERVABILITY Complete Observability of Discrete-Time Systems

OBSERVABILITY Complete Observability of Discrete-Time Systems Example:

OBSERVABILITY Complete Observability of Discrete-Time Systems Example:

OBSERVABILITY Popov-Belevitch-Hautus (PBH) Tests for Controllability/Observability S D LTI is observable iff S D LTI is constructible iff S D LTI is controllable/reachable/controllable from the origin iff S D LTI is controllable to zero iff

OBSERVABILITY Popov-Belevitch-Hautus (PBH) Tests for Controllability/Observability S D LTI is observable iff S D LTI is constructible iff S D LTI is controllable/reachable/controllable from the origin iff S D LTI is controllable to zero iff

OBSERVABILITY Condition for Complete Observability in the z-Plane Example: Since, det ( ), rank ( ) is less than 3. Note: A square matrix A n×n is non-singular only if its rank is equal to n.

OBSERVABILITY Condition for Complete Observability in the z-Plane Example: Since, det ( )=0, rank ( ) is less than 3.

OBSERVABILITY Principle of Duality S1:S1: S2:S2:

OBSERVABILITY Principle of Duality

OBSERVABILITY Principle of Duality S 1 is completely state controllabe S 2 is completely observable. S 1 is completely observable S 2 is completely state controllable.

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Transforming State-Space Equations Into Canonical forms:

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Transforming State-Space Equations Into Canonical forms:

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Transforming State-Space Equations Into Canonical forms:

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Transforming State-Space Equations Into Canonical forms:

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Transforming State-Space Equations Into Canonical forms:

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Transforming State-Space Equations Into Canonical forms:

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Invariance Property of the Rank Conditions for the Controllability Matrix and Observability Matrix

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Kalman’s Controllability Decomposition Kalman Decomposition:

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Kalman Decomposition Kalman Decomposition:

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Kalman’s Controllability Decomposition

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Kalman’s Controllability Decomposition Partition the transformed into

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Kalman’s Controllability Decomposition Example: x(k+1)= x(k) + u(k)

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Kalman’s Observability Decomposition

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Kalman’s Controllability and Observability Decomposition

USEFUL TRANSFORMATION IN STATE-SPACE ANALYSIS AND DESIGN Kalman’s Controllability and Observability Decomposition