Observer Design with Reduced Measurement Information

Similar documents
Bernoulli Numbers. n(n+1) = n(n+1)(2n+1) = n(n 1) 2

ANOTHER PROOF FOR FERMAT S LAST THEOREM 1. INTRODUCTION

After the completion of this section the student. V.4.2. Power Series Solution. V.4.3. The Method of Frobenius. V.4.4. Taylor Series Solution

Sx [ ] = x must yield a

ME260W Mid-Term Exam Instructor: Xinyu Huang Date: Mar

Fluids Lecture 2 Notes

Summation Method for Some Special Series Exactly

Principal Component Analysis. Nuno Vasconcelos ECE Department, UCSD

ε > 0 N N n N a n < ε. Now notice that a n = a n.

POWER SERIES METHODS CHAPTER 8 SECTION 8.1 INTRODUCTION AND REVIEW OF POWER SERIES

Computer Science 188 Artificial Intelligence. Introduction to Probability. Probability Ryan Waliany

Société de Calcul Mathématique SA Mathematical Modelling Company, Corp.

Chapter 8 Hypothesis Testing

(8) 1f = f. can be viewed as a real vector space where addition is defined by ( a1+ bi

Class #25 Wednesday, April 19, 2018

4.3 Growth Rates of Solutions to Recurrences

Riemann Integral Oct 31, such that

Digital Signal Processing. Homework 2 Solution. Due Monday 4 October Following the method on page 38, the difference equation

Calculus 2 TAYLOR SERIES CONVERGENCE AND TAYLOR REMAINDER

Principal Component Analysis

6.3 Testing Series With Positive Terms

Chapter 4: Angle Modulation

Explicit and closed formed solution of a differential equation. Closed form: since finite algebraic combination of. converges for x x0

Solutions 3.2-Page 215

Math 155 (Lecture 3)

Optimal Management of the Spare Parts Stock at Their Regular Distribution

Example 2. Find the upper bound for the remainder for the approximation from Example 1.

COMP26120: Introducing Complexity Analysis (2018/19) Lucas Cordeiro

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

What is a Hypothesis? Hypothesis is a statement about a population parameter developed for the purpose of testing.

Basic Probability/Statistical Theory I

Lecture 8. Dirac and Weierstrass

Test One (Answer Key)

Math 113 Exam 3 Practice

6.003: Signals and Systems. Feedback, Poles, and Fundamental Modes

SOME NOTES ON INEQUALITIES

Lyapunov Stability Analysis for Feedback Control Design

4. Optical Resonators

PAPER : IIT-JAM 2010

GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING

Chapter 4. Fourier Series

Lesson 4. Thermomechanical Measurements for Energy Systems (MENR) Measurements for Mechanical Systems and Production (MMER)

Infinite Sequences and Series

REVERSIBLE NON-FLOW PROCESS CONSTANT VOLUME PROCESS (ISOCHORIC PROCESS) In a constant volume process, he working substance is contained in a rigid

Chapter 9 - CD companion 1. A Generic Implementation; The Common-Merge Amplifier. 1 τ is. ω ch. τ io

Mechatronics. Time Response & Frequency Response 2 nd -Order Dynamic System 2-Pole, Low-Pass, Active Filter

State Space Representation

Continuous Functions

Theorem: Let A n n. In this case that A does reduce to I, we search for A 1 as the solution matrix X to the matrix equation A X = I i.e.

Chapter 7: The z-transform. Chih-Wei Liu

Principle Of Superposition

B. Maddah ENMG 622 ENMG /20/09

11.6 Absolute Convergence and the Ratio and Root Tests

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Physics 3 (PHYF144) Chap 8: The Nature of Light and the Laws of Geometric Optics - 1

The beta density, Bayes, Laplace, and Pólya

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

3.2 Properties of Division 3.3 Zeros of Polynomials 3.4 Complex and Rational Zeros of Polynomials

3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,

Chapter 4 : Laplace Transform

NUMERICAL METHODS FOR SOLVING EQUATIONS

Hankel Optimal Model Order Reduction 1

Chapter 6 Overview: Sequences and Numerical Series. For the purposes of AP, this topic is broken into four basic subtopics:

( 1) n (4x + 1) n. n=0

Apply change-of-basis formula to rewrite x as a linear combination of eigenvectors v j.

Chapter 7: Numerical Series

CALCULATION OF FIBONACCI VECTORS

Taylor Series (BC Only)

Principles of Communications Lecture 12: Noise in Modulation Systems. Chih-Wei Liu 劉志尉 National Chiao Tung University

Algorithms. Elementary Sorting. Dong Kyue Kim Hanyang University

In the Name of Allah, the Most Beneficent, the Most Merciful Root Locus Design Techniques II. Due: Monday 02 October 2006.

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b.

Sequences and Series of Functions

Analysis of Algorithms. Introduction. Contents

Learning Stochastically Evolving Networks via Local Probing

Math 475, Problem Set #12: Answers

, then cv V. Differential Equations Elements of Lineaer Algebra Name: Consider the differential equation. and y2 cos( kx)

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

Chandrasekhar Type Algorithms. for the Riccati Equation of Lainiotis Filter

Addition: Property Name Property Description Examples. a+b = b+a. a+(b+c) = (a+b)+c

Appendix: The Laplace Transform

N A N A ( ) We re-arrange and collapse the random variables into a set corresponding to the weighted

ME203 Section 4.1 Forced Vibration Response of Linear System Nov 4, 2002 (1) kx c x& m mg

HE ATOM & APPROXIMATION METHODS MORE GENERAL VARIATIONAL TREATMENT. Examples:

Lesson 10: Limits and Continuity

Carleton College, Winter 2017 Math 121, Practice Final Prof. Jones. Note: the exam will have a section of true-false questions, like the one below.

Math 508 Exam 2 Jerry L. Kazdan December 9, :00 10:20

Exam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)

Lecture 6 Chi Square Distribution (χ 2 ) and Least Squares Fitting

CHAPTER 10 INFINITE SEQUENCES AND SERIES

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

Mathematical Induction

Section 1.1. Calculus: Areas And Tangents. Difference Equations to Differential Equations

Mass Transfer Chapter 3. Diffusion in Concentrated Solutions

Math 113, Calculus II Winter 2007 Final Exam Solutions

1 Last time: similar and diagonalizable matrices

Nonparametric Goodness-of-Fit Tests for Discrete, Grouped or Censored Data 1

Math 113 Exam 4 Practice

Millennium Relativity Acceleration Composition. The Relativistic Relationship between Acceleration and Uniform Motion

Controlo Em Espaço de Estados. First Test

Transcription:

Observer Desig with Redued Measuremet Iformatio I pratie all the states aot be measured so that SVF aot be used Istead oly a redued set of measuremets give by y = x + Du p is available where y( R We assume that the diret feed matrix D is zero though the followig developmet a be modified if it is ot We would like to build a dyamial system kow as a observer that a estimate the iteral state x( give kowledge of the otrol iputs u( ad the outputs y( his a be aomplished usig the sheme show i the figure u (t ) x (t ) y (t ) Plat Dyamis L ~ y ( t ) Dyamial Observer x ˆ ( t ) yˆ ( t ) Full-Order Observer ( he figure shows the plat dyamis with iteral state x ( iput u ( ad output y ( lso show is a proposed "dyamial observer" that has two portios: - a exat model of the plat dyamis () - ad a error orretig part L( y( yˆ( ) whih should take are of all the errors determied by iorret iitial iformatio o the states of the system he p matrix L is alled the observer gai he observer has iteral states x ˆ( ad two m p iputs u( R ad y( R First we will show that x ˆ( provides a estimate of the full state x ( if L is orretly hose he we make the output of the observer to be the state estimate x ˆ( 1

he equatio of the observer is = + u + L( y yˆ) or x ˆ = ( L) + u + Ly his is a -th order dyamial system with iitial state ˆx (0) equal to the iitial estimate of the state he quatity ~ y( = y( yˆ( t ) is alled the output estimatio error How to hoose L? he observer gai matrix L must be seleted so that eve though the iitial estimate ˆx (0) is ot equal to the atual iitial state x (0) as time passes the state estimate x ˆ( overges to the atual state x ( hus we defie the state estimatio error ~ x( = x( ( t ) ad write its dyamis as ~ x = x = x + u ( + u + L( y yˆ)) = ( x ) + L( y yˆ) or ~ x = ( L) ~ x o~ x Note that the otrol iput does ot appear sie it aels out his is beause the iput is fed diretly ito the observer through the matrix his equatio is kow as the error dyamis From this equatio easy to see that as log as we selet the observer gai L so that the losed-loop observer matrix o = L is asymptotially stable the estimatio error ~ x ( t ) will go to zero asymptotially whatever the iitial estimatio error ~ x(0) = x(0) x ˆ(0) happes to be It is ot diffiult to selet L so that ( L) is asymptotially stable ompare this problem to that of seletig the SVF gai K so that = K is S I the observer desig problem the desig matrix L is o the left while i the SVF problem the desig matrix K is o the right Now we a make the former look like the latter by matrix traspositio: = ( L) = L o Now this looks the same as the SVF problem sie the desig matrix L is o the right Note however that SVF desig used () while observer desig uses () I fat the two problems are the same if oe equates ( K) i SVF desig with ( L ) i observer desig 2

herefore to desig a stabilizig observer oe may proeed as follows: 1 Reame ( ) to ( ) 2 Use ay SVF desig tehique you wish to determie a stabilizig gai K (eg kerma s formula) [Note: We will disuss i the ext leture a method whih allows alulatio of a state feedbak gai suh that a ost futio quadrati with respet to the values of the states ad the otrol iput is miimized ie LQR] 3 Reame K to L kerma Desig for Observers Whe there is oly oe output so that p = 1 oe may use kerma's formula hus selet the desired observer polyomial (s od ) ad replae ( ) i K = e U ( ) od by ( ) the set L = K We a maipulate this equatio ito its dual form usig matrix traspositio to write L = e ( V ) od ( ) or L = od ( ) V e whih is kerma's formula for observer desig We have speifially writte the desired observer polyomial as (s od ) (whih depeds o L ) to distiguish it from the desired losed-loop plat polyomial (s D ) (whih depeds o K ) Notie that i this ase the plae of the otrollability matrix U is take by the observability matrix V hus if the system is observable the the observability matrix V is osigular ad the observer poles a be plaed aywhere oe desires whe p = 1 usig kerma's formula he L is a good eough gai for the observer system whih will produe estimates of the states of the system whih (as time passes) will ome lose to the real values of the states of the system Notie that the amout of time required for overgee of the estimated state to the real state of the system depeds o the values of the poles of the observer system ie the values of the eigevalues of the matrix = L o t this poit oe woders: - If we desire to otrol our system usig a state feedbak otroller - but we a ot diretly measure all the states that we osidered i the state spae represetatio hose for our system - ad we deide to itrodue ad desig a state estimator - suh that we a use the estimated state istead of the measured state i the implemetatio of our state feedbak tehique he - what sort of relatio should we have betwee the dyamis of the otroller give by the eigevalues of -K ad the dyamis of the state estimator give by the eigevalues of -L? 3

Oe sees ow that this questio is i fat askig: How should we hoose (s od ) with respet to ()(whih we have previously hose)? he aswer is as you have expeted he observer poles should be seleted muh faster (about 10 times faster) tha the desired losed-loop poles of ( K) he the effets of iaurately kow iitial states will die out quikly ad ot iterplay with the iput/output dyamis D s Dyami Regulator Desig (state variable feedbak based o the estimated state) he followig blok diagram provides a dyami regulator for the plat based o the estimated state v( u ( x (t ) y (t ) Plat Dyamis K L ~ y ( t ) x ˆ ( t ) yˆ ( t ) Dyamial Observer ( Dyami Feedbak Regulator he losed-loop system is desribed by the equatios PLN OSERVER ONROL x = x + u x ˆ = ( L) + u + Ly u = K + v herefore the regulator has dyamis provided by the observer plus a feedbak gai portio from the SVF he regulator is formally speified by the pair of matries ( K L) he proposed regulator oly eeds to kow the iputs u ( ad the measured outputs y ( ot the full state vetor x ( he feedbak used here is alled state estimate feedbak 4

he losed-loop dyamis of the overall feedbak system are give by x = x K + v = ( K) x + Kx ~ + v (isertig the otrol i the plat dyamis) ~ x = ( L ) ~ x (estimatio error dyamis) Defie the augmeted system state as x x whih has 2 ompoets he the losed-loop dyamis may be writte as d x K K x v dt ~ + x = L x 0 ~ 0 x y = [ 0 ] ~ x his otais the dyamis of the plat plus the observer Note that the observer dyamis is writte i terms of the estimatio error for oveiee i the upomig developmet he losed-loop harateristi polyomial is give by K K si ( K) K ( s) = si 2 0 L = 0 si ( L) where I is the idetity matrix Sie this is a blok triagular matrix the determiat is the produt of the determiats of the diagoal matries herefore ( s) = si ( K) si ( L) his shows that the 2 losed-loop poles usig the regulator desiged based o the observer are the uio of the poles assumig full state feedbak ad the observer poles his is kow as the Separatio Priiple he separatio priiple implies the followig two-step desig proedure for dyami regulators: Use ay tehique to selet a feedbak matrix K assumig that full state feedbak a be used Desig a observer L he dyami regulator is the give i the figure above ordig to the augmeted dyamis the losed-loop trasfer futio is give by or H ( s) = si ( K) K ( L) 0 [ 0] H ( s) = ( si ( K)) 0 si his ovies us that the losed-loop trasfer futio is the same as if full SVF had bee used meaig that the observer dyamis do ot appear i the iput-output ouplig of the losed-loop system 5