Presentation is loading. Please wait.

Presentation is loading. Please wait.

The root locus technique 1.Obtain closed-loop TF and char eq d(s) = 0 2.Rearrange d(s) by grouping terms proportional to parameter of interest, and those.

Similar presentations


Presentation on theme: "The root locus technique 1.Obtain closed-loop TF and char eq d(s) = 0 2.Rearrange d(s) by grouping terms proportional to parameter of interest, and those."— Presentation transcript:

1 The root locus technique 1.Obtain closed-loop TF and char eq d(s) = 0 2.Rearrange d(s) by grouping terms proportional to parameter of interest, and those not; then divide by group not proportional to para. to get this is called the root locus equation 3.Roots of n1(s) are called open-loop zeros, mark them with “o” in s-plane; Roots of d1(s) are called open-loop poles, mark them with “x” in s-plane

2 4.The “o” and “x” marks divide the real axis into several segments. If a segment has an odd total number of marks to its right, it is part of the root locus. High light it. If a segment has an even total number of marks, then it’s not part of root locus. For the high lighted segments, mark out going arrows near a pole (“x”), and incoming arrows near a zero (“o”).

3 5.Asymptotes: #asymptotes = system order - # finite zeros = # poles - # finite zeros = n - m Meeting place on the real axis at:

4 6.Imaginary axis crossing point: –From d(s) = 0 –Form Routh Table –Set one row = 0 –Solve for K –Use the row above to form aux eq A(s)=0 –Solution gives imag. axis crossing point +-j  –System oscillates at frequency  when K is equal to the value obtained above

5 7.When two branches meet and split, you have breakaway points. They are double roots. d(s)=0 and d’(s) =0 also. Use this to solve for s and k.

6 8.Departure angles at complex pole p:  p Arrival angles  at complex zero z:  z m is multiplicity of pole or zero Matlab can construct root locus for you Let num = n1(s)’s coeff vector Let den = d1(s)’s coeff vector rlocus(num,den) draws locus for the root locus equation But you need to first get to K*n1(s)/d1(s) +1 =0 form

7 Char. poly. num: s+3,zeros: -3 den: s(s+5)(s 2 +2s+2)(s+6), poles:0, -5,-6,-1±j1 Asymptotes:#: n – m = 4 angles: ±45º, ±135º

8

9 Two branches coming out of -5 and -6 are heading to each other, and will and break away. Without actually calculating, we know the breakaway point is somewhere between -5 and -6. Since there are more dominant poles (poles that are closer to the jw axis), we don’t need to be bothered with computing the actual numbers for the break away point. Departure angle at p = -1+j is angle(-1+j+3)-angle(-1+j+0)-angle(-1+j+5)-angle(-1+j+4)+pi/2 ans = -0.8885 rad = -50.9061 deg

10 Hand sketch is close but departure angle is wrong! Also notice how I used “conv”. rlocus([1 3], conv([1 2 2 0],[1 11 30]))

11 Example: motor control The closed-loop T.F. from θ r to θ is:

12 What is the open-loop T.F.? The o.l. T.F. of the system is: But for root locus, it depends on which parameter we are varying. 1.If K P varies, K D fixed, from char. poly.

13 The o.l. T.F. for K P -root-locus is the system o.l. T.F. In general, this is the case whenever the parameter is multiplicative in the forward loop. 2.If K D is parameter, K P is fixed From

14 The root locus technique 1.Obtain closed-loop TF and char eq d(s) = 0 2.Re-arrange to get 3.Mark zeros with “o” and poles with “x” 4.High light segments of x-axis and put arrows 5.Decide #asymptotes, their angles, and x-axis meeting place: 6.Determine jw-axis crossing using Routh table 7.Compute breakaway: 8.Departure/arrival angle:

15 More examples 1. No finite zeros, o.l. poles: 0,-1,-2 Real axis: are on R.L. Asymp: #: 3

16 -axis crossing: char. poly:

17 >> rlocus(1,[1 3 2 0]) >> grid >> axis equal

18 Example: Real axis: (-2,0) seg. is on R.L.

19 For

20 Break away point:

21 -axis crossing: char. poly:

22 >> rlocus(1, conv([1 2 0], [1 2 2])) >> axis equal >> sgrid

23 Example: in prev. ex., change s+2 to s+3

24

25 -axis crossing: char. poly:

26 >> rlocus(1, conv([1 3 0], [1 2 2])) >> axis equal >> sgrid


Download ppt "The root locus technique 1.Obtain closed-loop TF and char eq d(s) = 0 2.Rearrange d(s) by grouping terms proportional to parameter of interest, and those."

Similar presentations


Ads by Google