Control Systems. Root Locus & Pole Assignment. L. Lanari

Similar documents
Control Systems I. Lecture 7: Feedback and the Root Locus method. Readings: Guzzella 9.1-3, Emilio Frazzoli

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

Analysis of SISO Control Loops

Systems Analysis and Control

Systems Analysis and Control

Essence of the Root Locus Technique

School of Mechanical Engineering Purdue University. DC Motor Position Control The block diagram for position control of the servo table is given by:

Example on Root Locus Sketching and Control Design

ECE 486 Control Systems

Course roadmap. ME451: Control Systems. What is Root Locus? (Review) Characteristic equation & root locus. Lecture 18 Root locus: Sketch of proofs

EECE 460 : Control System Design

Alireza Mousavi Brunel University

EE302 - Feedback Systems Spring Lecture KG(s)H(s) = KG(s)

Chapter 2. Classical Control System Design. Dutch Institute of Systems and Control

Automatic Control (TSRT15): Lecture 4

SECTION 5: ROOT LOCUS ANALYSIS

ECE 345 / ME 380 Introduction to Control Systems Lecture Notes 8

7.4 STEP BY STEP PROCEDURE TO DRAW THE ROOT LOCUS DIAGRAM

Root Locus. Motivation Sketching Root Locus Examples. School of Mechanical Engineering Purdue University. ME375 Root Locus - 1

ECEN 605 LINEAR SYSTEMS. Lecture 20 Characteristics of Feedback Control Systems II Feedback and Stability 1/27

Lecture 1 Root Locus

Module 07 Control Systems Design & Analysis via Root-Locus Method

Bangladesh University of Engineering and Technology. EEE 402: Control System I Laboratory

100 (s + 10) (s + 100) e 0.5s. s 100 (s + 10) (s + 100). G(s) =

MAS107 Control Theory Exam Solutions 2008

VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur

(b) A unity feedback system is characterized by the transfer function. Design a suitable compensator to meet the following specifications:

Module 3F2: Systems and Control EXAMPLES PAPER 2 ROOT-LOCUS. Solutions

Outline. Classical Control. Lecture 5

6.302 Feedback Systems Recitation 7: Root Locus Prof. Joel L. Dawson

Control of Electromechanical Systems

(Continued on next page)

Control Systems. Internal Stability - LTI systems. L. Lanari

a. Closed-loop system; b. equivalent transfer function Then the CLTF () T is s the poles of () T are s from a contribution of a

Compensation 8. f4 that separate these regions of stability and instability. The characteristic S 0 L U T I 0 N S

Control Systems I. Lecture 9: The Nyquist condition

Root Locus. Signals and Systems: 3C1 Control Systems Handout 3 Dr. David Corrigan Electronic and Electrical Engineering

Control Systems. Internal Stability - LTI systems. L. Lanari

Systems Analysis and Control

ROOT LOCUS. Consider the system. Root locus presents the poles of the closed-loop system when the gain K changes from 0 to. H(s) H ( s) = ( s)

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

Systems Analysis and Control

Prüfung Regelungstechnik I (Control Systems I) Übersetzungshilfe / Translation aid (English) To be returned at the end of the exam!

1 (s + 3)(s + 2)(s + a) G(s) = C(s) = K P + K I

Digital Control Systems

Andrea Zanchettin Automatic Control AUTOMATIC CONTROL. Andrea M. Zanchettin, PhD Spring Semester, Linear systems (frequency domain)

ELECTRONICS & COMMUNICATIONS DEP. 3rd YEAR, 2010/2011 CONTROL ENGINEERING SHEET 5 Lead-Lag Compensation Techniques

Lecture 13: Internal Model Principle and Repetitive Control

DESIGN USING TRANSFORMATION TECHNIQUE CLASSICAL METHOD

Root locus Analysis. P.S. Gandhi Mechanical Engineering IIT Bombay. Acknowledgements: Mr Chaitanya, SYSCON 07

Feedback Control of Linear SISO systems. Process Dynamics and Control

Control Systems. Frequency Method Nyquist Analysis.

r + - FINAL June 12, 2012 MAE 143B Linear Control Prof. M. Krstic

Design Methods for Control Systems

Methods for analysis and control of. Lecture 4: The root locus design method

ECE 380: Control Systems

Compensator Design to Improve Transient Performance Using Root Locus

Raktim Bhattacharya. . AERO 422: Active Controls for Aerospace Vehicles. Basic Feedback Analysis & Design

EE402 - Discrete Time Systems Spring Lecture 10

CHAPTER # 9 ROOT LOCUS ANALYSES

Root Locus Methods. The root locus procedure

Systems Analysis and Control

Controls Problems for Qualifying Exam - Spring 2014

INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad ELECTRICAL AND ELECTRONICS ENGINEERING TUTORIAL QUESTION BANK

EE C128 / ME C134 Fall 2014 HW 6.2 Solutions. HW 6.2 Solutions

Dr Ian R. Manchester Dr Ian R. Manchester AMME 3500 : Review

Methods for analysis and control of dynamical systems Lecture 4: The root locus design method

Chemical Process Dynamics and Control. Aisha Osman Mohamed Ahmed Department of Chemical Engineering Faculty of Engineering, Red Sea University

Linear Control Systems Lecture #3 - Frequency Domain Analysis. Guillaume Drion Academic year

Introduction. Performance and Robustness (Chapter 1) Advanced Control Systems Spring / 31

Loop shaping exercise

2.004 Dynamics and Control II Spring 2008

Plan of the Lecture. Goal: wrap up lead and lag control; start looking at frequency response as an alternative methodology for control systems design.

Lecture 3: The Root Locus Method

Software Engineering 3DX3. Slides 8: Root Locus Techniques

Class 12 Root Locus part II

PD, PI, PID Compensation. M. Sami Fadali Professor of Electrical Engineering University of Nevada

Introduction to Feedback Control

2.010 Fall 2000 Solution of Homework Assignment 8

I What is root locus. I System analysis via root locus. I How to plot root locus. Root locus (RL) I Uses the poles and zeros of the OL TF

Linear State Feedback Controller Design

Automatic Control 2. Loop shaping. Prof. Alberto Bemporad. University of Trento. Academic year

Test 2 SOLUTIONS. ENGI 5821: Control Systems I. March 15, 2010

Control Systems. University Questions

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

Lecture Sketching the root locus

Radar Dish. Armature controlled dc motor. Inside. θ r input. Outside. θ D output. θ m. Gearbox. Control Transmitter. Control. θ D.

Systems Analysis and Control

Välkomna till TSRT15 Reglerteknik Föreläsning 4. Summary of lecture 3 Root locus More specifications Zeros (if there is time)

Root Locus Design Example #3

Chapter 7 : Root Locus Technique

Control Systems I Lecture 10: System Specifications

Laplace Transform Analysis of Signals and Systems

ME 304 CONTROL SYSTEMS Spring 2016 MIDTERM EXAMINATION II

Control Systems. System response. L. Lanari

K(s +2) s +20 K (s + 10)(s +1) 2. (c) KG(s) = K(s + 10)(s +1) (s + 100)(s +5) 3. Solution : (a) KG(s) = s +20 = K s s

EEE 184: Introduction to feedback systems

Control Systems I. Lecture 9: The Nyquist condition

20. The pole diagram and the Laplace transform

Robust Performance Example #1

Transcription:

Control Systems Root Locus & Pole Assignment L. Lanari

Outline root-locus definition main rules for hand plotting root locus as a design tool other use of the root locus pole assignment Lanari: CS - Root Locus 2

Root locus r + - e k F (s) y with gain/zero/pole representation of the loop function L(s) =kf(s) =k N(s) (s D(s) = k zi ) (s pi ) since T (s) = y(s) r(s) = L(s) 1+L(s) = kf(s) 1+kF(s) open-loop monic polynomials the poles of the closed-loop system are the roots of the closed-loop characteristic polynomial 1+k N(s) D(s) = 0 root locus equation 1 + k F (s) = 0 which can be rewritten as D(s)+kN(s) = 0 p (s,k) = 0 F (s) = 1 k if the real gain k varies from - to + the closed-loop poles describe a graph which is defined as the root-locus Lanari: CS - Root Locus 3

we have to learn to visualize how all the poles move simultaneously in the complex plane as k increases see the animation (not available in the PDF file) for the positive root locus of 1+kF(s) =1+k 1 s +1 a point s? belongs to the root locus p (s,k) = 0 (or equivalently s? is a pole of the closed-loop system for some value of k = k? ) if and only if there exists a real value k? such that p (s?,k? ) = 0 Lanari: CS - Root Locus 4

Let us define L(s) =k m (s z i ) i=1 n (s p j ) m zeroes n poles with m < n n (s p j )+k j=1 j=1 m (s z i )=0 i=1 n (s p j )= k j=1 m (s z i ) complex numbers i=1 k = n s p j j=1 m s z i i=1 magnitude condition n (s p j ) j=1 m (s z i )=π + k +2hπ i=1 h Z n (s p j ) j=1 m (s z i )= i=1 (2h + 1)π for k 0 2hπ for k 0 phase condition Lanari: CS - Root Locus 5

phase condition from 1+k N(s) D(s) =0 positive locus (k positive) negative locus (k negative) N(s) k = ( 1) = (2h + 1)π D(s) N(s) k = (1) = 2hπ D(s) the phase condition is used to draw the locus of the roots: we do not need to solve for the high-order polynomial roots, we just need to verify if a given point of the complex plane satisfies the phase condition and therefore corresponds to a root of 1 + k F (s) = 0 for some real value of k (this value is found by using the magnitude condition) there are however some guidelines for drawing rapidly, by hand, a sketch of the root locus Since the closed-loop system has the same number n of poles as the open-loop, each of n the closed-loop poles will move along a branch of the root locus as k varies from 0 to + (similarly for the negative locus as k varies from - to 0) the positive root locus has n branches (same for negative locus) The coefficients of the root locus equation are real the root locus is symmetric w.r.t. the real axis Lanari: CS - Root Locus 6

Rule 1 The n branches of the positive locus start at the open-loop poles and, if k tends to +, m of the branches tend to the open-loop zeros while (n - m) tend to infinity along (n - m) asymptotes positive locus k = + Im zero pole pole k = + k = 0 k = 0 Re F (s) = s +3 s(s + 2) Rule 1bis Of the n branches of the negative locus, as k varies from - to 0, m start from the m open-loop zeros while the other (n - m) come from infinity along (n - m) asymptotes negative locus Im zero pole pole k = - k = 0 k = 0 Re k = - Lanari: CS - Root Locus 7

Rule 2 Every point on the real axis belongs either to the positive or the negative locus. A point on the real axis that leaves on its right an odd number of poles and zeros counted with their multiplicity belongs to the positive locus. All the other points belong to the negative locus. negative locus Im positive locus Re 6 5 3 1 0 # poles/zeros on the right Lanari: CS - Root Locus 8

Rule 3 The (n - m) asymptotes are centered in s 0 = n m p j j=1 i=1 n m z i and form angles of (2h + 1)π n m 2hπ n m for positive locus for negative locus h = 1, 2,..., n - m example n - m = 3 h = 1 h = 3 Pos Neg h = 1 s0 h = 3 h = 1 h = 2 3¼/3 5¼/3 2¼/3 4¼/3 h = 3 7¼/3 6¼/3 h = 2 h = 2 Lanari: CS - Root Locus 9

we have the following cases positive locus s0 s0 s0 s0 n - m = 1 n - m = 2 n - m = 3 n - m = 4 negative locus s0 s0 s0 s0 N.B. the asymptotes are not necessarily part of the root locus Lanari: CS - Root Locus 10

the points of the locus are either regular points (solutions of p (s,k) = 0) or singular points (or breakaway/break-in points) solutions of being k = p(s, k) =0 p(s, k) s =0 n (s p j ) j=1 m (s z i ) i=1 s n (s p j )+k j=1 m (s z i )=0 i=1 n (s p j )+k s j=1 m (s z i )=0 i=1 from locus equation, substituted in the second gives m (s z i ) s n (s p j ) n (s p j ) s m (s z i )=0 i=1 j=1 j=1 i=1 equation of order n + m - 1 for the candidates singular points (we may have solutions corresponding to complex k which are therefore not points of the root locus) Lanari: CS - Root Locus 11

a candidate singular s* point is a true singular point if the corresponding value k* is real n (s p j ) k = j=1 m (s z i ) the singular point s* will be a solution of the locus equation p (s*,k*) = 0 with multiplicity µ greater equal to 2 i=1 p(s, k )=(s s ) µ p (s, k ) µ 2 We also have some easy to find singular points: every open-loop pole/zero with multiplicity greater than 1 is a singular point of the root locus Proof: from the candidate singular points equation Lanari: CS - Root Locus 12

Rule 4 Let s* be a singular point with multiplicity µ, then 2 µ branches merge in the singular point and are alternatively convergent and divergent. These branches divide the plane in equal parts. If the singular point is a multiple pole or zero of the open-loop system, then the branches also alternate as positive and negative branches. example F (s) = s +3 s(s + 2) + - p(s, k) =s(s + 2) + k(s + 3) = s 2 +(2+k)s +3k p(s, k) =2s +(2+k) s r e k F (s) y candidates (s + 3) s s(s + 2) s(s + 2) s (s + 3) = s2 +6s +6 s1* = -4.73 s2* = -1.27 real values real values of k* singular points Lanari: CS - Root Locus 13

was it necessary to compute the singular points? after the real axis rule we have one pole needs to go to infinity along the asymptote one pole goes to the zero two poles get out of the open-loop poles Im zero pole pole there must be a singular point Re Im µ = 2 zero pole µ = 2 pole Re at these singular points of multiplicity µ = 2 the entire round angle is divided into 2 x 2 = 4 equal angles of 90 each Lanari: CS - Root Locus 14

an alternative formula to determine the candidates breakaway/break-in (singular) points n j=1 1 s p j m i=1 1 s z i =0 this formula will not give us the singular points corresponding to repeated poles or zeros of the open-loop (obvious singular points) repeated poles and zeros in this formula need to be taken into account in the sum with their multiplicity example F (s) = (s + 1)2 (s + 2) 4 3 Root Locus 4 s +2 2 s +1 = 2s (s + 2)(s + 1) Imaginary Axis 2 1 0 s* = 0 1 2 3 5 4 3 2 1 0 1 2 Real Axis Lanari: CS - Root Locus 15

In order to determine stability (all the poles should be, for the same interval of values of k, in the open left half plane) it may be important to determine for which values of k some branches cross the imaginary axis. This can be achieved by determining for which values of k the elements of the first column of the Routh table become 0 since this is when a first column term changes sign and therefore a pole crosses the imaginary axis (remember that, when the table can be built from the basic definition, the number of sign changes in the first column is equal to the number of roots with positive real part). F (s) = s +1 s(s 2)(s + 4) p(s, k) =s(s 2)(s + 4) + k(s + 1) = s 3 +2s 2 +(k 8)s + k characteristic equation of the closed-loop system for k = 16 p(s, 16) = (s + p)(s 2 + ω 2 ) p = 2! 2 = 8 Imaginary Axis 15 10 5 0 5 Root Locus Routh table 1 k 8 2 k k 16 k 10 15 5 4 3 2 1 0 1 2 3 Real Axis Lanari: CS - Root Locus 16

RL as a design tool the basic idea is based on the positive root locus behavior for high values of the gain k (n - m) branches tend at infinity along (n - m) asymptotes the remaining m branches tend to the m open-loop zeros therefore if the zeros are in the open left half-plane (i.e. have negative real part) and the asymptotes (for the positive root locus) always stay to the left of the imaginary axis then for sufficiently high values of the gain all the poles will be to the left of the imaginary axis that is a high gain will stabilize the system the asymptotes and the open-loop zeros attract the positive branches A system with all its zeros, if any, in the open left half-plane is said to be minimum phase equivalently A system having no zeros with positive or null real part is said to be minimum phase Lanari: CS - Root Locus 17

we can have either the n - m = 1 asymptote (positive locus) s0 center of asymptotes is not important since we look at the high-gain behavior if the open-loop system is minimum phase and has (relative degree) n - m = 1 then for sufficiently high values of k the closed-loop system is asymptotically stable or the n - m = 2 asymptote (positive locus) s0 center of asymptotes has to be negative if the open-loop system is minimum phase and has (relative degree) n - m = 2 with a negative center of asymptotes (positive locus) then for sufficiently high values of k the closed-loop system is asymptotically stable Lanari: CS - Root Locus 18

example F (s) = (s + 1)2 (s 1) 3 nf + = 3 3 poles with positive real part Root Locus Nyquist Diagram 4 1 3 0.8 2 0.6 0.4 Imaginary Axis 1 0 1 Imaginary Axis 0.2 0 0.2 2 0.4 0.6 3 0.8 4 10 8 6 4 2 0 2 Real Axis 1 1 0.5 0 0.5 1 Real Axis positive root locus Nyquist plot Ncc = nf + = 3 verified Lanari: CS - Root Locus 19

example F (s) = (s + 1) 2 (s 1) 2 (s + 10) 2 Nyquist plot of 100 F (s) (to make the plot more visible) Root Locus Nyquist Diagram 50 1 40 0.8 30 0.6 20 0.4 Imaginary Axis 10 0 10 Imaginary Axis 0.2 0 0.2 20 0.4 30 0.6 40 0.8 50 12 10 8 6 4 2 0 2 Real Axis 1 1 0.5 0 0.5 1 Real Axis Ncc = nf + = 2 Lanari: CS - Root Locus 20

what if n - m = 2 but the center of asymptotes is non-negative? Let us assume we have F (s) with n - m = 2 and center of asymptotes s0 (non-negative) and see the effect of adding a zero/pole pair (za, pa) both negative s z F (s) a the new center of asymptotes is given by (with n - m = 2) s p a za < 0 pa < 0 s 0 = new center of asymptotes n p j + p a j=1 n m m z i z a i=1 = s 0 + p a z a n m old center of asymptotes center of asymptotes variation since n - m remains 2, we can choose the additional negative pole pa and zero za such that the new center of asymptotes becomes negative once we have made the center of asymptotes negative with the addition of a pole and a zero, everything we said before applies NB for the variation to be negative the pole needs to be to the left of the zero Lanari: CS - Root Locus 21

note that s z a s p a with pa < za < 0 can be rewritten as s z a = z a s s p a p a s = z a (1 s/z a ) p a (1 s/p a ) 0 < z a p a < 1 and therefore, being the cutoff frequency of the zero smaller than the one of the pole, the particular pole/zero pair is equivalent to a positive gain smaller than 1 x a lead compensator but the final controller will require also the choice of a sufficiently high gain k* > kcrit so the controller will be C (s) = Gain x Lead compensator Lanari: CS - Root Locus 22

what if n - m > 2 and the system is minimum phase? The idea is: turn the n - m > 2 case into a n - m = 2 one by adding zeros (s - zk) to the controller solve the stabilization problem if necessary introduce high frequency dynamics (1 + hs) to make the controller at least proper. The following result guarantees that if properly chosen these dynamics do not alter the closed-loop stability Th. Consider an open-loop system F (s) which results in an asymptotically stable unit feedback closed-loop system. Then there exists a sufficiently small h > 0 such that the closed-loop system having as open-loop remains asymptotically stable. 1 F (s) 1+τ h s Lanari: CS - Root Locus 23

if the closed-loop system + - F (s) then the closed-loop system + - 1 1+τ h s F (s) is asymptotically stable note that 1/(1 + hs) does not change the gain of the open-loop represents some high-frequency dynamics is also asymptotically stable provided h > 0 is sufficiently small high frequency modification! = 0 - Im informal proof 1 1+τ h s alters the Bode plots only at high frequency alters the Nyquist plot only at high frequency -1! = +! = - Re no effect on closed-loop stability! = 0 + Lanari: CS - Root Locus 24

Case n - m = 3 & minimum phase system: possible algorithm 1) add a negative zero (s - zk) so to obtain n - m = 2. a) if s0 < 0 then choose k* > kcrit to guarantee asymptotic stability of the closedloop system. Go to point 2) b) if s0 > 0 then choose a pole/zero pair pa < za < 0 to make the new center of the asymptotes s0 negative. Go to case a) 2) if the resulting controller is improper, add a high frequency dynamics term (1 + hs) where the time constant h can be chosen applying the Routh criterion in order to guarantee that the overall closed-loop system is asymptotically stable Note that step 2) may not be necessary since we may apply this result once the static specifications have been met i.e. we may just need to stabilize the extended plant ˆP (s) and therefore the controller may already have an excess of poles w.r.t. the number of zeros Lanari: CS - Root Locus 25

other use of the RL Mass-Spring-Damper: we want to explore the influence of some parameters on the system s dynamics represented by the following characteristic polynomial ms 2 + µs + k spring stiffness k [0, + ) p(s, k) =(ms + µ)s + k = D(s)+kN(s) Im k = 0 no spring, poles in (0, -µ/m) singular point - µ/m 0 Re p(s, k) s =2ms + µ =0 s* = -µ/2m at k = (ms + µ)s = µ2 4m i.e. µ =2 k m as k increases (spring more and more stiff) poles are complex with constant real part while imaginary part becomes larger k2 > k1 k1 0 5 10 0 5 10 normalized plots (the steady-state value changes with k) Lanari: CS - Root Locus 26

damping µ [0, + ) p(s, µ) =ms 2 + k + µs = D(s)+µN(s) the MSD poles move, as µ increases, as the positive root locus of µ = 0 no damper, pure imaginary poles µ N(s) D(s) = µ s ms 2 + k same singular point as before Root locus Bode note how, as µ increases and the poles become real, how a dominant (slow) dynamics arises Imaginary axis magnitude (db) Real axis frequency (rad/sec) Step fucntion amplitude time Lanari: CS - Root Locus 27

Pole assignment r (t) y (t) + - C (s) P (s) plant P (s) = N P (s) D P (s) = b ms m + b m 1 s m 1 + + b 1 s + b 0 s n + a n 1 s n 1 + + a 1 s + a 0 strictly proper monic (coefficient = 1) controller C(s) = N C(s) D C (s) = d rs r + d r 1 s r 1 + + d 1 s + d 0 s r + c r 1 s r 1 + + c 1 s + c 0 proper monic {d r, d r 1,...,d 1, d 0, c r 1,...,c 1, c 0 } unknowns Lanari: CS - Root Locus 28

closed-loop characteristic polynomial d CL (s) =D P (s)d C (s)+n P (s)n C (s) degree n r m r also monic degree n + r we want to assign all the closed-loop poles to be p 1, p 2,...,p n+r desired closed-loop poles which can be seen as the solutions of an n + r order polynomial d CL(s) =(s p 1)(s p 2)...(s p n+r) The problem can be stated as: we need to determine the 2r - 1 unknowns ci and dj (i = 1,..., r - 1; j = 1,..., r) such that D P (s)d C (s) + N P (s)n C (s) = d CL(s) Diophantine equation Lanari: CS - Root Locus 29

Result if NP (s) and DP (s) are coprime and r = n - 1 we can always solve and have a unique solution Remarks we can arbitrarily assign the 2n - 1 closed-loop poles closed-loop system zeros: the zeros depend upon where we consider the input entering in the control system and which output we decide to monitor. For example in a unit feedback system, the output disturbance to controlled output transfer function S (s) and the reference to controlled output one T (s) will have the same poles (in there are no hidden dynamics in the open loop system) but different zeros the closed-loop zeros coincide with the open-loop ones when the open-loop system has no hidden dynamics T (s) = N T (s) D T (s) = F (s) 1+F (s) = N F (s) D F (s)+n F (s) N F (s) =N C (s)n P (s) Lanari: CS - Root Locus 30

since the choice of the controller C (s) is uniquely determined by the previous algorithm, the controller zeros are a consequence of the pole assignment technique and so are the closed-loop zeros note that if we choose as desired closed-loop poles some open-loop zeros then at closedloop we have a cancellation. Moreover a closed-loop cancellation (for finite values of the open loop gain) can be originated only by an open-loop cancellation, which being NP (s) and DP (s) coprime, is generated by the series interconnection plant/controller. Therefore if we choose as desired closed-loop poles some open-loop zeros these will necessarily be also poles of the controller from the above comment it is clear that we are not going to choose a desired closed-loop pole coincident with a non-minimum phase zero of the open-loop. Lanari: CS - Root Locus 31

example plant P (s) = (s 1) s(s 2) n = 2 C(s) = as + b s + c d CL(s) =(s + 1) 3 = s 3 +3s 2 +3s +1 desired closed-loop poles: 3 in -1 d CL (s) =s(s 2)(s + c)+(s 1)(as + b) =s 3 +(c 2+a)s 2 +(b a 2c)s b equating a + c 2 = 3 a + b 2c = 3 b = 1 a = 14 b = 1 c = 9 14 ) C(s) = 14s 1 s 9 = 14(s 1 (s 9) closed-loop complementary sensitivity T (s) = C(s)P (s) 1+C(s)P (s) = 14(s 1)(s 1 14 ) (s + 1) 3 Lanari: CS - Root Locus 32

the plant has a real positive pole so the open-loop loop shaping technique cannot be used the plant has a real positive zero (so it is non-minimum phase) and therefore the high-gain principle seen in the root locus cannot be applied the resulting controller, in this example, is unstable and non-minimum phase: we have no control over the final structure of the fixed dimension (r = n - 1) controller root locus of F (s) = (s 1 14 ) (s 9) (s 1) s(s 2) 3 Root Locus for k = 14 we obtain the three closed-loop poles at the desired location Imaginary Axis 2 1 0 1 2 3 2 0 2 4 6 8 10 Real Axis Lanari: CS - Root Locus 33

note that using the basic tracing rules we can also have the following compatible positive root locus Im not compatible with the extra knowledge that the closed-loop system is asymptotically stable Re closed-loop system stable for some values of the gain but not compatible with the extra knowledge that the closed-loop system has all three poles in -1 for some value of k Im Re Lanari: CS - Root Locus 34

Vocabulary English root locus singular point (breakaway/break-in) locus branch minimum phase center of asymptotes Italiano luogo delle radici punto singolare ramo del luogo a fase minima centro degli asintoti Lanari: CS - Root Locus 35