AUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Spring Semester, Introduction to Automatic Control & Linear systems (time domain)
|
|
- Walter Owen
- 5 years ago
- Views:
Transcription
1 1 AUTOMATIC CONTROL Andrea M. Zanchettin, PhD Spring Semester, 2018 Introduction to Automatic Control & Linear systems (time domain)
2 2 What is automatic control? From Wikipedia Control theory is an interdisciplinary branch of engineering and mathematics that deals with the behavior of dynamical systems with inputs, and how their behavior is modified by feedback. The definition is challenging to be fully understood (as for now), however we notice relevant concepts dynamical systems (their) behaviour (which is) modified by feedback Dynamical systems are usually addressed in course dealing with System Theory. In the first lectures, we are going to recall few concepts regarding those systems and their behaviour.
3 3 A very simple example Reservoir (tank) for public water supply. Objective: maintain the level (bottom pressure) as much as possible close to a reference value regardless the users request. How does the system work? Very much like your bank account! If (income > outflow) then level increases Using some simple math
4 4 A very simple example cont d The local company for water management has monitored the behaviour of the users request during a week. The outcome is as follows (during 24 hours) Nominal behaviour Users demand (m 3 ) Daily average Time (hrs)
5 5 A simple example cont d Let s try to inject a constant flow equal to the daily average consumption. Actual level Water level (m) Desired level Time (hrs) Remarkable fluctuations are present, they might be tollerated, however
6 6 A simple example cont d what if the users demand increases? Water level (m) and users demand (m 3 ) Actual demand Time (hrs) The new situation cannot be tollerated anymore
7 7 A simple example cont d So far we tried to command the pump to inject the average amount of requested water, i.e. We are completely neglecting our objective (i.e. maintaining the level constant). How about injecting a quantity proportional to the difference between the actual level and the desired one (error)? Let s see what happens
8 8 A simple example cont d This simple law seems to be promising. Our objective has been reached. The level seems now to be under control no matter the bad estimation of the users demand. Water level (m) and users demand (m 3 ) Actual demand Time (hrs)
9 9 Closed-loop vs. open-loop We have seen two different solutions to our problem (tank level): open-loop: no measurement is taken from the plant, our algorithm decides the injected flow idependently; closed-loop: the quantity of water to be injected is derived from level measurements (as compared to their desired value). The open-loop solution does extremely depend on the quality of the model we have of the system we want to control. It is therefore very sensitive to i) uncertainties, ii) disturbances, etc. In turn, the closed-loop solution does not require an accurate model of the system to be controlled whilst guarantee better performance. It clearly requires additional hardware to be in place (sensors!).
10 10 Basic notions What is a dynamical system? A mathematical description consists of: State variables, their domain and initial values, x Inputs and their domain, u Outputs and their domain, y Time (usually positive), t or k Two functions Usually, function Φ is not given explicitly, but somehow expressed using other functions (e.g. differential equations).
11 11 Basic notions cont d A very simple (non-exhaustive) classification: Time: continous (real) or discrete (integer) State values: finite set (automata) or not State dimension: finite or infinite (distributed parameters) Among all possible combinations, we will focus on Continuous time with finite dimension (n = order) Discrete time with finite dimension (n = order)
12 12 Continuous time systems A continuous time system is usually (implicitly) defined by means of a differential equation. Example: RL circuit y R u x L
13 13 Continuous time systems cont d A further example: the simple pendulum (no input) order of the system?
14 14 Continuous time systems cont d Continuous time systems defined by differential equations. How about their solutions? Under suitable assumption (e.g. Lipschitz-continuity of the function, and others) the problem has a unique solution the solution depends continuosly on the initial condition
15 15 Continuous time systems cont d How does the system behave? Notice that we only need to know how the state evolves w.r.t. time. We are actually looking for the solution of the Cauchy s initial value problem The (usually unique) solution is referred to as (state) motion. Example: back to the RL circuit y R u x continuous dipendency on initial condition(s) L
16 16 Continuous time systems cont d
17 17 Stability (definition) Consider a time-invariant system, a corresponding initial condition and input function Let be the corresponding motion. What if we (slightly) change the initial condition? Is the corresponding motion similar to? A different initial condition, say, might, in general, generate a different motion. Definition: a motion is called stable iff such that Definition: otherwise, it is called unstable.
18 18 Stability (definition) cont d
19 19 Stability (definition) Stability means that a bounded perturbation on the initial condition (with respect to the nominal motion), causes a bounded perturbation on the corresponding motion. Should we look for something more? Definition: a motion is called asymptotically stable iff stable and The perturbed motion tends to reach the nominal one as time goes on.
20 20 Equilibrium Equilibrium is a particular (steady) motion characterized by, hence As other motions, we can wonder whether an equilibrium is stable or not.
21 21 Take home message Focus on the motivating example (water reservoir) and take some time to think about how we modify the bahaviour of the system (for the same input) Think about further examples of dynamical systems and try to identify input outputs objective of their control system For example: temperature of your apartment input: heating power (boiler) output: temperature objective: maintaining the temperature at desired level
22 22 Linear systems A linear time invariant (LTI) system is such that functions are linear with respect to their inputs without explicit dependency on time, hence and Matrices are constant (with respect to time). Linear systems are relevant tools to describe a variety of systems as well as a generic system in the neighborhood of a working condition (linearization).
23 23 Linear systems cont d Example: with no particular physical meaning #states = order, n = 2 #inputs = 1 #outputs = 1
24 24 Linear systems cont d Another example: mass with friction u m
25 25 Change of variables It is sometime useful to study the same system from a different point of view. The same phenomenon, as be seen from different reference systems, has a different mathematical formulation. Apple falls vertically Apple falls inclined
26 26 Change of variables cont d More formally, consider a change of variables how does the (LTI) system in terms of the new variables?
27 27 Change of variables cont d Therefore and similarly for the output equations
28 28 Change of variables cont d Example: RLC circuit u L C x 2 z 2 x 1 = z 1 R y
29 29 Change of variables cont d With the new state variables, we obtain Verify that
30 Lagrange s formula 30 Joseph-Louis Lagrange (Turin Paris 1813) Given a LTI system can we say something about its motion? In other words, are we able to solve the Cauchy initial value problem? The answer is the Lagrange s formula what is this?
31 31 Lagrange s formula cont d What is the exponential of a matrix? We shall try to recall first what the exponential of a number is! According to Taylor s formula Similarly, for a matrix we can define
32 32 Lagrange s formula cont d Notice that in general it wrong to compute the exponential of each entry in the matrix, except for the particular case of a diagonal one, in fact
33 33 Lagrange s formula cont d We can exploit this fact through the diagonalization process. Definition: given a generic square matrix A, it is call diagonalizable iff with D diagonal (real). Moreover, D contains the eigenvalues of A, while the columns of T -1 are the corresponding (ordered) eigenvectors.
34 34 Lagrange s formula cont d Back to the matrix esponential, assume A is diagonalizable, then therefore can be rewritten (+) as (+) notice that
35 35 Lagrange s formula cont d Recap on Lagrange s formula: the formula contains the matrix exponential its computation is easy if the matrix is diagonal(izable) How do we use these results? Let s try to verify the formula which solves the initial value problem
36 36 Lagrange s formula cont d Time derivative of the matrix exponential Therefore if u(t) = 0 the motion of systems is (Lagrange) In fact
37 37 Lagrange s formula cont d If u(t) 0, assume x 0 = 0, then the motion of the system is (Lagrange) Applying some math (+) (+) notice that
38 38 Superposition principle Back on the Lagrange s formula we notice that it is the sum of two terms it is linear with respect to the input u(t) Does not depend on input, only on initial condition (free motion) Depends on input only (forced motion)
39 39 Superposition principle cont d The linearity with respect to the input allows to ease the study in case The resulting motion is
40 40 Superposition principle cont d The linearity with respect to the initial condition allows to ease the study in case The resulting (free) motion is
41 41 Superposition principle cont d More in general, consider two motions if we combine the initials state and inputs as the combined motion we obtain is as follows
42 42 Stability of LTI systems Let s focus on a generic LTI system (output equation omitted) and on the Lagrange s formula Notice: no matter what the input u() is, the behaviour of the system (both in terms of free and force motion) depends on the exponential of matrix A. When we introduced the concept of stability we formally characterized the behaviour of the system subject to a perturbed initial condition.
43 43 Stability of LTI systems cont d Forced motion does not depend on the initial condition, however effect of perturbed initial condition Is the effect of this perturbation limited? Does it tend to zero as times goes on? Recalling the definition of stability, we are wondering whether the motion is (asymptotically) stable or not. If so, how big is the perturbation on initial condition we can tollerate?
44 44 Stability of LTI systems cont d Let s tackle the problem starting from a simple example, consider the first order system Applying the Lagrange s formula, the perturbation is. Therefore if the effect of perturbation vanishes (asymptotically stable) if the effect of perturbation is as big as the perturbation itself, still bounded (stable) otherwise, i.e., the effect of perturbation diverges (unstable)
45 45 Stability of LTI systems cont d Consider now the more general case where matrix A is diagonal(izable), i.e.. The effect of the perturbation is
46 46 Stability of LTI systems cont d Therefore, if all d s are negative, then the motion is asymptotically stable for each perturbation. Recall: those numbers are called eigenvalues. They always exist (even when the matrix is not diagonalizable). Result: if all eigenvalues negative, then the motion is asymptotically stable if at least one eigenvalue is positive, then the motion in unstable
47 47 Stability of LTI systems cont d Even more general case: what if the matrix A is not diagonalizable? Eigenvalues are possibly complex (and conjugate) numbers and solution of which is called characteristic equation (the LHS part is called characteristic polynomial). General result: if the motion is asymptotically stable if the motion is unstable otherwise, it is a bit tricky
48 48 Stability of LTI systems cont d We have a case which is still unclear: the case of null eigenvalue(s). Focus on the following examples: In both cases we have null eigenvalues. The first example is stable, the second is unstable! To distinguish we need two concepts: algebraic and geometric multiplicity.
49 49 Stability of LTI systems cont d Eigenvectors are solution of. Back to the example: (with algebraic multiplicity = 2) Two different eigenvectors Only one eigenvector In the former case (stable) we have the same algebraic and geometric multiplicity, in the latter algebraic and geometric multiplicity are different.
50 50 Results on stability of LTI systems Consider an LTI system: General result: if if the motion is asymptotically stable the motion is unstable if and those such that are simple roots (i.e. same algebraic and geometric multiplicity), the motion is stable (but not asymptotically), otherwise it is unstable
51 51 System vs. motion stability So far, we have introduced the notion of stability related to perturbed motion, due to a perturbed initial condition. Recall the perturbed (free) motion as obtained using the Lagrange s formula As the perturbation on the initial state appears linearly, and the perturbed motion is additive, i.e. We can conclude that infer that stability, at least for LTI systems, does not depend on how big the perturbation is as well as on the particular motion we are studying.
52 52 System vs. motion stability cont d For a generic LTI system General result: if one motion is stable (asymptotically stable), then all motions are stable (asymptotically stable) In this case (stable or asymptotically stable LTI systems) we can say that the system is stable, and we can talk about system stability. Notice: this is not true for generic dynamical systems!
53 53 Invariance of stability Consider, again, an LTI system Apply the following change of variables already seen we obtain the following system. As we have Is the new system stable? Note that and have the same eigenvalues. General result: the stability property of an LTI system is invariant with respect to a change of variables
54 Routh s criterion 54 Edward John Routh (Quebec Cambridge 1907) The stability property of an LTI system depends on the eigenvalues of matrix, are we always able to compute them? They are solution of is a polynomial, then, and we know that the LHS for first order polynomials the solution is for second order polynomials are the solutions for higher order polynomials do not have such formulas, we
55 55 Routh s criterion cont d Consider a generic characteristic polynomial As (asymptotic) stability is concerned, we are interesting in verifying that all eigenvalues are such that without being able to explicitly compute them! A generic result (necessary and sufficient condition) exists, and can be formulated in terms of the coefficients of the characteristic polynomial.
56 56 Routh s criterion cont d Definition: the Routh table has n+1 rows, the first two rows contain the the coefficient of the characteristic polynomial Coefficients of the characteristic polynomial (pair on the first row, odd on the second) All other rows can be computed from the first two
57 57 Routh s criterion cont d Coefficient of row are computed using the two previous rows. First column of previous rows Next column of previous rows In case positions of previous rows are missing, fill them with zeros.
58 58 Routh s criterion cont d General result: an LTI system is asymptotically stable if and only if the elements of the first column have all the same sign (positive vs. negative). Notice: the table is called undefined if some element of the first column is zero (and the full table cannot be computed). In this case the elements does not have the same sign! Comment: Routh criterion allows to discuss stability of an LTI system without explicitly computing its eigenvalue. Nowadays several tools (like Matlab) are available to compute eigenvalues numerically. Still, Routh s criterion is usefull in case the matrix is parametric.
59 59 Routh s criterion cont d Example: consider the following matrix Compute the characteristic polynomial The system has one positive eigenvalue (triangular matrix, eigenvalues are diagonal terms), it is therefore unstable. At least two coefficients have different sign
60 60 LTI systems with inputs Consider a generic asymptotically stable LTI system: General results: an a.s. LTI system has the following properties for constant input, i.e. the equilibrium is unique after long time, the motion depends only on the input, as the free motion vanishes if the input tends to a constant value, then the system tends to the corresponding equilibrium (stability of the motion) a bounded input produces a bounded output (BIBO stability)
61 61 Stability of nonlinear systems We are wondering whether the same results can be applied to generic (nonlinear) dynamic systems. Example: consider the pendulum (with damping) Focus on equilibria only
62 62 Stability of nonlinear systems cont d Therefore, pendulum has two equilibria in Intuitively, the downward equilibrium is stable, whilst the upward one is unstable. Notice: we have a clear example that when nonlinear systems are concerned, stability is no longer a property of the system!
63 63 Linearization We are able to study the stability of a linear system, can we exploit this for nonlinear systems? The answer is yes, through linearization. Idea: to study the stability of an equilibrium of a nonlinear system, let s zoom on its neighbour. Almost linear behaviour
64 64 Linearization cont d Consider a generic nonlinear system assume the input is constant equilibrium state, i.e. and that there exists an We can then approximate the system bahaviour in the neighborhood of the equilibrium with a linear system
65 65 Linearization cont d The system is now linear Where Does the linear(ized) system reflect the stability property of the original (nonlinear) one? Let s try first to linearize the pendulum equations.
66 66 Linearization cont d Example: linearized pendulum We obtain
67 67 Linearization cont d For the downward equilibrium we obtain The corresponding Routh table is Then, the linearized system is asymptotically stable.
68 68 Linearization cont d For the upward equilibrium we obtain The corresponding Routh table is Then, the linearized system is unstable.
69 69 Linearization and stability We can generalized these achievements as follows. General results: given the equilibrium of a nonlinear system if the corresponding linearized system has all eigenvalues with strictly negative real part, then it is asymptotically stable if the corresponding linearized system has at least one eigenvalue with strictly positive real part, then it is unstable Notice: nothing can be said in other situations. Moreover, the stability property of a nonlinear system is strictly related to a particular equilibrium, rather than to the whole system.
70 70 Reachability and observability We have address the stability problem for LTI system. For control purposes, however, we are also interested in the following problems: how much can we change the state (and consequently the output) of a system acting on its inputs? how much information can we infer about the state of a system from its outputs? Those are inportant questions we need to address, especially for control purposes (as we aim at changing the behaviour of a system).
71 71 Reachability Before we can answer those questions, we need a formal definition of the properties we are looking for. Reachability relates to the capability of changing the state of a system acting on its inputs. The bahaviour of the state depending on the input is implicitly defined in the following equation Definition: an LTI system is said reachable if, for any initial condition, there exists an input able to steer the state to the origin in finite time
72 Reachability cont d 72 Rudolf E. Kalman (Budapest ) We have now formalized the concept of reachability as the possibility to change the state of the system. This is very important for control purposes as it guarantees we can change the state of a system acting on its inputs (which is indeed the final aim of a control system!). Property (Kalman s reachability test): the system is reachable iff the reachability matrix has full rank.
73 73 Reachability cont d Result: the reachability property is invariant with respect to a particuar choice of state variables, in other words it is a structural property (like stability) and it is not affected by a change of variables. Proof: consider the reachability matrix and perform the following change of variables The corresponding reachability matrix is as follows which has the same rank of the original one, since is non singular.
74 74 Reachability cont d Example: consider the following circuit u x 1 x 2 y R L L Rows are linear dependent (cannot be full rank). The system is not reachable.
75 75 Reachability cont d The explaination is simple: by acting on the input, the currents on the two inductors (state variables) cannot be set independently. u x 1 x 2 R L L In order to look more deeply in this property let s apply the following change of variables
76 76 Reachability cont d The new matrices become clearly showing that the input (which influences z 1 ) cannot influence the second state variable, neither directly nor inderectly through z 1. u z 1 R L/2 Comment: the equivalent system (as seen from the input) has only one inductor (and is equivalent to a first order system!)
77 77 Observability In many realistic control problems, it is not possible to measure directly the state of the system. We can usually access a limited set of variables (by sensors), that we call outputs. The bahaviour of the outputs depending on the states is implicitly defined in the following equations We are trying to figuring out how much we can infer on the state of a system by observing its output.
78 Observability cont d 78 Rudolf E. Kalman (Budapest 1930) Definition: an LTI system is said observable if, for any non null initial condition, the free motion of the outputs differs, within any time horizon, from the zero output. In other words, if we observe a zero output in some, we are sure that the state is zero in the corresponding time interval. Property (Kalman s observability test): the system is observable iff the observability matrix has full rank.
79 79 Observability cont d Result: the observability property is invariant with respect to a particuar choice of state variables. Proof: similar to the reachability property. Back to the example: considering The observability matrix is rank deficient, then the system is not observable. Notice that the change of variables clearly shows us that the output is only influenced by the first state variable!
80 80 Kalman s decomposition In the examples, we introduced a (suitable) change of variable able to highlight how: the input did not influence (neither directly nor inderectly) one of the state variables the output was not influenced (neither directly nor indirectly) by one of the state variables We ask ourself whether it is always possible to find out such a change of variables
81 81 Kalman s decomposition cont d You will not find any path from the input to a non reachable part, as well as you will not find any path from a non observable part to the output. Not reachable Not observable Reachable Not observable Not reachable Observable Reachable Observable
Andrea Zanchettin Automatic Control AUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Spring Semester, Linear systems (frequency domain)
1 AUTOMATIC CONTROL Andrea M. Zanchettin, PhD Spring Semester, 2018 Linear systems (frequency domain) 2 Motivations Consider an LTI system Thanks to the Lagrange s formula we can compute the motion of
More informationAutomatic Control Systems theory overview (discrete time systems)
Automatic Control Systems theory overview (discrete time systems) Prof. Luca Bascetta (luca.bascetta@polimi.it) Politecnico di Milano Dipartimento di Elettronica, Informazione e Bioingegneria Motivations
More informationControl Systems. Internal Stability - LTI systems. L. Lanari
Control Systems Internal Stability - LTI systems L. Lanari outline LTI systems: definitions conditions South stability criterion equilibrium points Nonlinear systems: equilibrium points examples stable
More information(Refer Slide Time: 00:32)
Nonlinear Dynamical Systems Prof. Madhu. N. Belur and Prof. Harish. K. Pillai Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 12 Scilab simulation of Lotka Volterra
More informationMAT 1302B Mathematical Methods II
MAT 1302B Mathematical Methods II Alistair Savage Mathematics and Statistics University of Ottawa Winter 2015 Lecture 19 Alistair Savage (uottawa) MAT 1302B Mathematical Methods II Winter 2015 Lecture
More informationAndrea Zanchettin Automatic Control 1 AUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Spring Semester, Discrete time linear systems
Andrea Zanchettin Automatic Control 1 AUTOMATIC CONTROL Andrea M. Zanchettin, PhD Spring Semester, 2018 Discrete time linear systems Andrea Zanchettin Automatic Control 2 Discrete time linear systems Modern
More informationMath 3191 Applied Linear Algebra
Math 9 Applied Linear Algebra Lecture 9: Diagonalization Stephen Billups University of Colorado at Denver Math 9Applied Linear Algebra p./9 Section. Diagonalization The goal here is to develop a useful
More informationModule 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 3 : Analytical Solutions of Linear ODE-IVPs
Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 3 : Analytical Solutions of Linear ODE-IVPs 3 Analytical Solutions of Linear ODE-IVPs Before developing numerical
More informationAutonomous Systems and Stability
LECTURE 8 Autonomous Systems and Stability An autonomous system is a system of ordinary differential equations of the form 1 1 ( 1 ) 2 2 ( 1 ). ( 1 ) or, in vector notation, x 0 F (x) That is to say, an
More informationRemark By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 6 Eigenvalues and Eigenvectors Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called an eigenvalue of A if there is a nontrivial
More informationECE504: Lecture 8. D. Richard Brown III. Worcester Polytechnic Institute. 28-Oct-2008
ECE504: Lecture 8 D. Richard Brown III Worcester Polytechnic Institute 28-Oct-2008 Worcester Polytechnic Institute D. Richard Brown III 28-Oct-2008 1 / 30 Lecture 8 Major Topics ECE504: Lecture 8 We are
More informationControl Systems. Internal Stability - LTI systems. L. Lanari
Control Systems Internal Stability - LTI systems L. Lanari definitions (AS) - A system S is said to be asymptotically stable if its state zeroinput response converges to the origin for any initial condition
More informationLinear Algebra Practice Problems
Math 7, Professor Ramras Linear Algebra Practice Problems () Consider the following system of linear equations in the variables x, y, and z, in which the constants a and b are real numbers. x y + z = a
More informationAMS10 HW7 Solutions. All credit is given for effort. (-5 pts for any missing sections) Problem 1 (20 pts) Consider the following matrix 2 A =
AMS1 HW Solutions All credit is given for effort. (- pts for any missing sections) Problem 1 ( pts) Consider the following matrix 1 1 9 a. Calculate the eigenvalues of A. Eigenvalues are 1 1.1, 9.81,.1
More informationComputationally, diagonal matrices are the easiest to work with. With this idea in mind, we introduce similarity:
Diagonalization We have seen that diagonal and triangular matrices are much easier to work with than are most matrices For example, determinants and eigenvalues are easy to compute, and multiplication
More informationMAT1302F Mathematical Methods II Lecture 19
MAT302F Mathematical Methods II Lecture 9 Aaron Christie 2 April 205 Eigenvectors, Eigenvalues, and Diagonalization Now that the basic theory of eigenvalues and eigenvectors is in place most importantly
More informationMATH SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER Given vector spaces V and W, V W is the vector space given by
MATH 110 - SOLUTIONS TO PRACTICE MIDTERM LECTURE 1, SUMMER 2009 GSI: SANTIAGO CAÑEZ 1. Given vector spaces V and W, V W is the vector space given by V W = {(v, w) v V and w W }, with addition and scalar
More informationIn these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation.
1 2 Linear Systems In these chapter 2A notes write vectors in boldface to reduce the ambiguity of the notation 21 Matrix ODEs Let and is a scalar A linear function satisfies Linear superposition ) Linear
More informationsc Control Systems Design Q.1, Sem.1, Ac. Yr. 2010/11
sc46 - Control Systems Design Q Sem Ac Yr / Mock Exam originally given November 5 9 Notes: Please be reminded that only an A4 paper with formulas may be used during the exam no other material is to be
More informationDefinition (T -invariant subspace) Example. Example
Eigenvalues, Eigenvectors, Similarity, and Diagonalization We now turn our attention to linear transformations of the form T : V V. To better understand the effect of T on the vector space V, we begin
More informationECE317 : Feedback and Control
ECE317 : Feedback and Control Lecture : Stability Routh-Hurwitz stability criterion Dr. Richard Tymerski Dept. of Electrical and Computer Engineering Portland State University 1 Course roadmap Modeling
More informationControl Systems I. Lecture 7: Feedback and the Root Locus method. Readings: Jacopo Tani. Institute for Dynamic Systems and Control D-MAVT ETH Zürich
Control Systems I Lecture 7: Feedback and the Root Locus method Readings: Jacopo Tani Institute for Dynamic Systems and Control D-MAVT ETH Zürich November 2, 2018 J. Tani, E. Frazzoli (ETH) Lecture 7:
More informationRemark 1 By definition, an eigenvector must be a nonzero vector, but eigenvalue could be zero.
Sec 5 Eigenvectors and Eigenvalues In this chapter, vector means column vector Definition An eigenvector of an n n matrix A is a nonzero vector x such that A x λ x for some scalar λ A scalar λ is called
More informationECE317 : Feedback and Control
ECE317 : Feedback and Control Lecture : Routh-Hurwitz stability criterion Examples Dr. Richard Tymerski Dept. of Electrical and Computer Engineering Portland State University 1 Course roadmap Modeling
More informationRepresent this system in terms of a block diagram consisting only of. g From Newton s law: 2 : θ sin θ 9 θ ` T
Exercise (Block diagram decomposition). Consider a system P that maps each input to the solutions of 9 4 ` 3 9 Represent this system in terms of a block diagram consisting only of integrator systems, represented
More informationEE16B, Spring 2018 UC Berkeley EECS. Maharbiz and Roychowdhury. Lectures 4B & 5A: Overview Slides. Linearization and Stability
EE16B, Spring 2018 UC Berkeley EECS Maharbiz and Roychowdhury Lectures 4B & 5A: Overview Slides Linearization and Stability Slide 1 Linearization Approximate a nonlinear system by a linear one (unless
More informationDiagonalization. MATH 322, Linear Algebra I. J. Robert Buchanan. Spring Department of Mathematics
Diagonalization MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Motivation Today we consider two fundamental questions: Given an n n matrix A, does there exist a basis
More informationModeling and Analysis of Dynamic Systems
Modeling and Analysis of Dynamic Systems by Dr. Guillaume Ducard Fall 2016 Institute for Dynamic Systems and Control ETH Zurich, Switzerland based on script from: Prof. Dr. Lino Guzzella 1/33 Outline 1
More informationMath 115 Spring 11 Written Homework 10 Solutions
Math 5 Spring Written Homework 0 Solutions. For following its, state what indeterminate form the its are in and evaluate the its. (a) 3x 4x 4 x x 8 Solution: This is in indeterminate form 0. Algebraically,
More informationA = 3 1. We conclude that the algebraic multiplicity of the eigenvalues are both one, that is,
65 Diagonalizable Matrices It is useful to introduce few more concepts, that are common in the literature Definition 65 The characteristic polynomial of an n n matrix A is the function p(λ) det(a λi) Example
More informationEconomics 205, Fall 2002: Final Examination, Possible Answers
Economics 05, Fall 00: Final Examination, Possible Answers Comments on the Exam Grades: 43 possible; high: 413; median: 34; low: 36 I was generally happy with the answers to questions 3-8, satisfied with
More informationLINEAR ALGEBRA 1, 2012-I PARTIAL EXAM 3 SOLUTIONS TO PRACTICE PROBLEMS
LINEAR ALGEBRA, -I PARTIAL EXAM SOLUTIONS TO PRACTICE PROBLEMS Problem (a) For each of the two matrices below, (i) determine whether it is diagonalizable, (ii) determine whether it is orthogonally diagonalizable,
More informationStochastic processes. MAS275 Probability Modelling. Introduction and Markov chains. Continuous time. Markov property
Chapter 1: and Markov chains Stochastic processes We study stochastic processes, which are families of random variables describing the evolution of a quantity with time. In some situations, we can treat
More informationNPTEL NATIONAL PROGRAMME ON TECHNOLOGY ENHANCED LEARNING IIT BOMBAY CDEEP IIT BOMBAY ADVANCE PROCESS CONTROL. Prof.
NPTEL NATIONAL PROGRAMME ON TECHNOLOGY ENHANCED LEARNING IIT BOMBAY CDEEP IIT BOMBAY ADVANCE PROCESS CONTROL Prof. Sachin Patwardhan Department of Chemical Engineering, IIT Bombay Lecture No. 13 Stability
More information2 Eigenvectors and Eigenvalues in abstract spaces.
MA322 Sathaye Notes on Eigenvalues Spring 27 Introduction In these notes, we start with the definition of eigenvectors in abstract vector spaces and follow with the more common definition of eigenvectors
More informationLinear Algebra- Final Exam Review
Linear Algebra- Final Exam Review. Let A be invertible. Show that, if v, v, v 3 are linearly independent vectors, so are Av, Av, Av 3. NOTE: It should be clear from your answer that you know the definition.
More informationControl Systems I. Lecture 2: Modeling. Suggested Readings: Åström & Murray Ch. 2-3, Guzzella Ch Emilio Frazzoli
Control Systems I Lecture 2: Modeling Suggested Readings: Åström & Murray Ch. 2-3, Guzzella Ch. 2-3 Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich September 29, 2017 E. Frazzoli
More informationFundamentals of Dynamical Systems / Discrete-Time Models. Dr. Dylan McNamara people.uncw.edu/ mcnamarad
Fundamentals of Dynamical Systems / Discrete-Time Models Dr. Dylan McNamara people.uncw.edu/ mcnamarad Dynamical systems theory Considers how systems autonomously change along time Ranges from Newtonian
More informationc 1 v 1 + c 2 v 2 = 0 c 1 λ 1 v 1 + c 2 λ 1 v 2 = 0
LECTURE LECTURE 2 0. Distinct eigenvalues I haven t gotten around to stating the following important theorem: Theorem: A matrix with n distinct eigenvalues is diagonalizable. Proof (Sketch) Suppose n =
More informationThe value of a problem is not so much coming up with the answer as in the ideas and attempted ideas it forces on the would be solver I.N.
Math 410 Homework Problems In the following pages you will find all of the homework problems for the semester. Homework should be written out neatly and stapled and turned in at the beginning of class
More informationReal Analysis Prof. S.H. Kulkarni Department of Mathematics Indian Institute of Technology, Madras. Lecture - 13 Conditional Convergence
Real Analysis Prof. S.H. Kulkarni Department of Mathematics Indian Institute of Technology, Madras Lecture - 13 Conditional Convergence Now, there are a few things that are remaining in the discussion
More informationConceptual Questions for Review
Conceptual Questions for Review Chapter 1 1.1 Which vectors are linear combinations of v = (3, 1) and w = (4, 3)? 1.2 Compare the dot product of v = (3, 1) and w = (4, 3) to the product of their lengths.
More informationHere represents the impulse (or delta) function. is an diagonal matrix of intensities, and is an diagonal matrix of intensities.
19 KALMAN FILTER 19.1 Introduction In the previous section, we derived the linear quadratic regulator as an optimal solution for the fullstate feedback control problem. The inherent assumption was that
More information[Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty.]
Math 43 Review Notes [Disclaimer: This is not a complete list of everything you need to know, just some of the topics that gave people difficulty Dot Product If v (v, v, v 3 and w (w, w, w 3, then the
More informationMath 307 Learning Goals. March 23, 2010
Math 307 Learning Goals March 23, 2010 Course Description The course presents core concepts of linear algebra by focusing on applications in Science and Engineering. Examples of applications from recent
More information7 Planar systems of linear ODE
7 Planar systems of linear ODE Here I restrict my attention to a very special class of autonomous ODE: linear ODE with constant coefficients This is arguably the only class of ODE for which explicit solution
More informationChapter 6. Second order differential equations
Chapter 6. Second order differential equations A second order differential equation is of the form y = f(t, y, y ) where y = y(t). We shall often think of t as parametrizing time, y position. In this case
More informationStability lectures. Stability of Linear Systems. Stability of Linear Systems. Stability of Continuous Systems. EECE 571M/491M, Spring 2008 Lecture 5
EECE 571M/491M, Spring 2008 Lecture 5 Stability of Continuous Systems http://courses.ece.ubc.ca/491m moishi@ece.ubc.ca Dr. Meeko Oishi Electrical and Computer Engineering University of British Columbia,
More informationMath Matrix Algebra
Math 44 - Matrix Algebra Review notes - 4 (Alberto Bressan, Spring 27) Review of complex numbers In this chapter we shall need to work with complex numbers z C These can be written in the form z = a+ib,
More informationControl of Mobile Robots
Control of Mobile Robots Regulation and trajectory tracking Prof. Luca Bascetta (luca.bascetta@polimi.it) Politecnico di Milano Dipartimento di Elettronica, Informazione e Bioingegneria Organization and
More informationLecture: Modeling graphs with electrical networks
Stat260/CS294: Spectral Graph Methods Lecture 16-03/17/2015 Lecture: Modeling graphs with electrical networks Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.
More informationDiscrete and continuous dynamic systems
Discrete and continuous dynamic systems Bounded input bounded output (BIBO) and asymptotic stability Continuous and discrete time linear time-invariant systems Katalin Hangos University of Pannonia Faculty
More informationApplied Linear Algebra in Geoscience Using MATLAB
Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in
More informationDissipativity. Outline. Motivation. Dissipative Systems. M. Sami Fadali EBME Dept., UNR
Dissipativity M. Sami Fadali EBME Dept., UNR 1 Outline Differential storage functions. QSR Dissipativity. Algebraic conditions for dissipativity. Stability of dissipative systems. Feedback Interconnections
More informationEigenvalues in Applications
Eigenvalues in Applications Abstract We look at the role of eigenvalues and eigenvectors in various applications. Specifically, we consider differential equations, Markov chains, population growth, and
More informationLecture 15, 16: Diagonalization
Lecture 15, 16: Diagonalization Motivation: Eigenvalues and Eigenvectors are easy to compute for diagonal matrices. Hence, we would like (if possible) to convert matrix A into a diagonal matrix. Suppose
More informationAppendix A. Vector addition: - The sum of two vectors is another vector that also lie in the space:
Tor Kjellsson Stockholm University Appendix A A.1 Q. Consider the ordinary vectors in 3 dimensions (a x î+a y ĵ+a zˆk), with complex components. Do the following subsets constitute a vector space? If so,
More information1. Select the unique answer (choice) for each problem. Write only the answer.
MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +
More information(v, w) = arccos( < v, w >
MA322 Sathaye Notes on Inner Products Notes on Chapter 6 Inner product. Given a real vector space V, an inner product is defined to be a bilinear map F : V V R such that the following holds: For all v
More informationMath 1553, Introduction to Linear Algebra
Learning goals articulate what students are expected to be able to do in a course that can be measured. This course has course-level learning goals that pertain to the entire course, and section-level
More informationTMA Calculus 3. Lecture 21, April 3. Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013
TMA4115 - Calculus 3 Lecture 21, April 3 Toke Meier Carlsen Norwegian University of Science and Technology Spring 2013 www.ntnu.no TMA4115 - Calculus 3, Lecture 21 Review of last week s lecture Last week
More informationModule 07 Controllability and Controller Design of Dynamical LTI Systems
Module 07 Controllability and Controller Design of Dynamical LTI Systems Ahmad F. Taha EE 5143: Linear Systems and Control Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ataha October
More informationSwitched Mode Power Conversion Prof. L. Umanand Department of Electronics Systems Engineering Indian Institute of Science, Bangalore
Switched Mode Power Conversion Prof. L. Umanand Department of Electronics Systems Engineering Indian Institute of Science, Bangalore Lecture - 19 Modeling DC-DC convertors Good day to all of you. Today,
More informationMatrices and Vectors. Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A =
30 MATHEMATICS REVIEW G A.1.1 Matrices and Vectors Definition of Matrix. An MxN matrix A is a two-dimensional array of numbers A = a 11 a 12... a 1N a 21 a 22... a 2N...... a M1 a M2... a MN A matrix can
More informationẋ n = f n (x 1,...,x n,u 1,...,u m ) (5) y 1 = g 1 (x 1,...,x n,u 1,...,u m ) (6) y p = g p (x 1,...,x n,u 1,...,u m ) (7)
EEE582 Topical Outline A.A. Rodriguez Fall 2007 GWC 352, 965-3712 The following represents a detailed topical outline of the course. It attempts to highlight most of the key concepts to be covered and
More informationEN Nonlinear Control and Planning in Robotics Lecture 3: Stability February 4, 2015
EN530.678 Nonlinear Control and Planning in Robotics Lecture 3: Stability February 4, 2015 Prof: Marin Kobilarov 0.1 Model prerequisites Consider ẋ = f(t, x). We will make the following basic assumptions
More informationPreviously Monte Carlo Integration
Previously Simulation, sampling Monte Carlo Simulations Inverse cdf method Rejection sampling Today: sampling cont., Bayesian inference via sampling Eigenvalues and Eigenvectors Markov processes, PageRank
More informationControl Systems I. Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback. Readings: Emilio Frazzoli
Control Systems I Lecture 4: Diagonalization, Modal Analysis, Intro to Feedback Readings: Emilio Frazzoli Institute for Dynamic Systems and Control D-MAVT ETH Zürich October 13, 2017 E. Frazzoli (ETH)
More informationName Solutions Linear Algebra; Test 3. Throughout the test simplify all answers except where stated otherwise.
Name Solutions Linear Algebra; Test 3 Throughout the test simplify all answers except where stated otherwise. 1) Find the following: (10 points) ( ) Or note that so the rows are linearly independent, so
More informationMath 2J Lecture 16-11/02/12
Math 2J Lecture 16-11/02/12 William Holmes Markov Chain Recap The population of a town is 100000. Each person is either independent, democrat, or republican. In any given year, each person can choose to
More informationContents. 1 State-Space Linear Systems 5. 2 Linearization Causality, Time Invariance, and Linearity 31
Contents Preamble xiii Linear Systems I Basic Concepts 1 I System Representation 3 1 State-Space Linear Systems 5 1.1 State-Space Linear Systems 5 1.2 Block Diagrams 7 1.3 Exercises 11 2 Linearization
More informationMath 504 (Fall 2011) 1. (*) Consider the matrices
Math 504 (Fall 2011) Instructor: Emre Mengi Study Guide for Weeks 11-14 This homework concerns the following topics. Basic definitions and facts about eigenvalues and eigenvectors (Trefethen&Bau, Lecture
More informationFull-State Feedback Design for a Multi-Input System
Full-State Feedback Design for a Multi-Input System A. Introduction The open-loop system is described by the following state space model. x(t) = Ax(t)+Bu(t), y(t) =Cx(t)+Du(t) () 4 8.5 A =, B =.5.5, C
More informationLECTURE 10: REVIEW OF POWER SERIES. 1. Motivation
LECTURE 10: REVIEW OF POWER SERIES By definition, a power series centered at x 0 is a series of the form where a 0, a 1,... and x 0 are constants. For convenience, we shall mostly be concerned with the
More informationEE16B, Spring 2018 UC Berkeley EECS. Maharbiz and Roychowdhury. Lecture 5B: Open QA Session
EE16B, Spring 2018 UC Berkeley EECS Maharbiz and Roychowdhury Lecture 5B: Open QA Session EE16B, Spring 2018, Open Q/A Session (Roychowdhury) Slide 1 Today: Open Q/A Session primarily on state space r.
More informationChapter #4 EEE8086-EEE8115. Robust and Adaptive Control Systems
Chapter #4 Robust and Adaptive Control Systems Nonlinear Dynamics.... Linear Combination.... Equilibrium points... 3 3. Linearisation... 5 4. Limit cycles... 3 5. Bifurcations... 4 6. Stability... 6 7.
More informationCDS 101 Precourse Phase Plane Analysis and Stability
CDS 101 Precourse Phase Plane Analysis and Stability Melvin Leok Control and Dynamical Systems California Institute of Technology Pasadena, CA, 26 September, 2002. mleok@cds.caltech.edu http://www.cds.caltech.edu/
More informationEigenvalues and Eigenvectors: An Introduction
Eigenvalues and Eigenvectors: An Introduction The eigenvalue problem is a problem of considerable theoretical interest and wide-ranging application. For example, this problem is crucial in solving systems
More informationModule 03 Linear Systems Theory: Necessary Background
Module 03 Linear Systems Theory: Necessary Background Ahmad F. Taha EE 5243: Introduction to Cyber-Physical Systems Email: ahmad.taha@utsa.edu Webpage: http://engineering.utsa.edu/ taha/index.html September
More informationRemember that : Definition :
Stability This lecture we will concentrate on How to determine the stability of a system represented as a transfer function How to determine the stability of a system represented in state-space How to
More informationChaos and Liapunov exponents
PHYS347 INTRODUCTION TO NONLINEAR PHYSICS - 2/22 Chaos and Liapunov exponents Definition of chaos In the lectures we followed Strogatz and defined chaos as aperiodic long-term behaviour in a deterministic
More informationStudy Guide for Linear Algebra Exam 2
Study Guide for Linear Algebra Exam 2 Term Vector Space Definition A Vector Space is a nonempty set V of objects, on which are defined two operations, called addition and multiplication by scalars (real
More informationMaths for Signals and Systems Linear Algebra in Engineering
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 15, Tuesday 8 th and Friday 11 th November 016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE
More informationMATH 320, WEEK 7: Matrices, Matrix Operations
MATH 320, WEEK 7: Matrices, Matrix Operations 1 Matrices We have introduced ourselves to the notion of the grid-like coefficient matrix as a short-hand coefficient place-keeper for performing Gaussian
More informationLinear Algebra, part 3 QR and SVD
Linear Algebra, part 3 QR and SVD Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2012 Going back to least squares (Section 1.4 from Strang, now also see section 5.2). We
More information1 Continuous-time Systems
Observability Completely controllable systems can be restructured by means of state feedback to have many desirable properties. But what if the state is not available for feedback? What if only the output
More informationMATH 310, REVIEW SHEET 2
MATH 310, REVIEW SHEET 2 These notes are a very short summary of the key topics in the book (and follow the book pretty closely). You should be familiar with everything on here, but it s not comprehensive,
More informationBare-bones outline of eigenvalue theory and the Jordan canonical form
Bare-bones outline of eigenvalue theory and the Jordan canonical form April 3, 2007 N.B.: You should also consult the text/class notes for worked examples. Let F be a field, let V be a finite-dimensional
More informationEEE 184: Introduction to feedback systems
EEE 84: Introduction to feedback systems Summary 6 8 8 x 7 7 6 Level() 6 5 4 4 5 5 time(s) 4 6 8 Time (seconds) Fig.. Illustration of BIBO stability: stable system (the input is a unit step) Fig.. step)
More informationMTH Linear Algebra. Study Guide. Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education
MTH 3 Linear Algebra Study Guide Dr. Tony Yee Department of Mathematics and Information Technology The Hong Kong Institute of Education June 3, ii Contents Table of Contents iii Matrix Algebra. Real Life
More informationspring, math 204 (mitchell) list of theorems 1 Linear Systems Linear Transformations Matrix Algebra
spring, 2016. math 204 (mitchell) list of theorems 1 Linear Systems THEOREM 1.0.1 (Theorem 1.1). Uniqueness of Reduced Row-Echelon Form THEOREM 1.0.2 (Theorem 1.2). Existence and Uniqueness Theorem THEOREM
More informationMath 315: Linear Algebra Solutions to Assignment 7
Math 5: Linear Algebra s to Assignment 7 # Find the eigenvalues of the following matrices. (a.) 4 0 0 0 (b.) 0 0 9 5 4. (a.) The characteristic polynomial det(λi A) = (λ )(λ )(λ ), so the eigenvalues are
More informationOn the problem of control and observation: a general overview
On the problem of control and observation: a general overview Krishna Kumar Busawon* Abstract This note is dedicated to undergraduate students who wish to enroll in the control engineering program. Some
More informationCDS 101/110: Lecture 3.1 Linear Systems
CDS /: Lecture 3. Linear Systems Goals for Today: Describe and motivate linear system models: Summarize properties, examples, and tools Joel Burdick (substituting for Richard Murray) jwb@robotics.caltech.edu,
More informationControl Systems I. Lecture 2: Modeling and Linearization. Suggested Readings: Åström & Murray Ch Jacopo Tani
Control Systems I Lecture 2: Modeling and Linearization Suggested Readings: Åström & Murray Ch. 2-3 Jacopo Tani Institute for Dynamic Systems and Control D-MAVT ETH Zürich September 28, 2018 J. Tani, E.
More informationDynamical Systems and Chaos Part I: Theoretical Techniques. Lecture 4: Discrete systems + Chaos. Ilya Potapov Mathematics Department, TUT Room TD325
Dynamical Systems and Chaos Part I: Theoretical Techniques Lecture 4: Discrete systems + Chaos Ilya Potapov Mathematics Department, TUT Room TD325 Discrete maps x n+1 = f(x n ) Discrete time steps. x 0
More informationMathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur. Lecture 1 Real Numbers
Mathematics-I Prof. S.K. Ray Department of Mathematics and Statistics Indian Institute of Technology, Kanpur Lecture 1 Real Numbers In these lectures, we are going to study a branch of mathematics called
More informationReview of Controllability Results of Dynamical System
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 13, Issue 4 Ver. II (Jul. Aug. 2017), PP 01-05 www.iosrjournals.org Review of Controllability Results of Dynamical System
More informationChapter 4 & 5: Vector Spaces & Linear Transformations
Chapter 4 & 5: Vector Spaces & Linear Transformations Philip Gressman University of Pennsylvania Philip Gressman Math 240 002 2014C: Chapters 4 & 5 1 / 40 Objective The purpose of Chapter 4 is to think
More informationMath 205, Summer I, Week 4b: Continued. Chapter 5, Section 8
Math 205, Summer I, 2016 Week 4b: Continued Chapter 5, Section 8 2 5.8 Diagonalization [reprint, week04: Eigenvalues and Eigenvectors] + diagonaliization 1. 5.8 Eigenspaces, Diagonalization A vector v
More information