p
ho
Control Law and Controller Design
ks
or
using LSVF
W
n
ai
M
T
0K
T1
T. K. Ghoshal
Honorary Emeritus Professor, Electrical Engineering,
CT
2014
M
N
Units
Unit 9.1: LSVF for pole positioning-I
p
ho
ks
Unit 9.2: More on LSVF
or
W
n
ai
M
T
0K
T1
CT
EI
M
N
p
ho
Unit Level Discussions
ks
or
W
n
ai
M
T
0K
T1
CT
EI
M
N
p
ho
Concept of Pole Positioning
ks
or
Concept of LSVF
W
LSVF as cascade or Multi-loop control
n
Pole positioning for Single Input Systems,
ai
M
Controllability requirement
T
Pole positioning for Multi- Input Systems
0K
T1
CT
EI
M
N
n
ai
M
T
0K
T1
CT
EI
M
N
Pole Placement
X = AX + Bu
p
u = KX , K = [k1 k 2 k3 ]
ho
ks
or
We may recall that if the above system is
W
controllable then one can place the closed loop
n
ai
poles at arbitrary locations.
M
T
If the location of the desired poles are known,
0K
the only unknown is the feedback matrix K.
T1
p
ho
not allow us to specify all poles in systems of
ks
order higher than 2 because they do not allow
or
W
for a sufficient number of unknown parameters
n
to place all of the closed-loop poles uniquely.
ai
M
One gain to adjust, or compensator pole and zero to
T
select, does not yield a sufficient number of
0K
parameters to place all the closed-loop poles at
T1
desired locations.
CT
attractive.
T10KT December 2014 CKBS, Jadavpur University, Kolkata 7
7
Pole Placement-3
Because LSFB is being used, the system order does
p
ho
not change. However, the users may not be interested
ks
in pole locations and keeping the system order frozen.
or
They would need robustness, accuracy, low sensitivity, etc,
W
which pole locations do not guarantee.
n
In the case of single input system the K-matrix is
ai
M
unique and the designer does not have any freedom
T
once the desired pole locations are frozen.
0K
One may of course tinker with the locations of non-dominant
T1
p
ho
similar to the root-locus based design
ks
or
method in that we place closed-loop
W
poles at desired locations
n
ai
In the root-locus design we generally
M
T
place only the dominant closed loop poles
0K
at the desired locations and
T1
CT
locations
N
p
ho
closed-loop poles at desired locations.
ks
or
Because to relocate n closed loop poles n
W
parameters are necessary which is
n
ai
possible by a full state feedback
M
However, LSVF methods allow only a
T
0K
limited degree of freedom to assign
T1
CT
p
ho
often not available for measurement
ks
Only some state variables or their linear
or
W
combinations are available as measurements
n
ai
In that situation designer has to estimate the
M
state from the measurements (often noisy)
T
0K
Estimators are the solution in that situation.
T1
Deterministic estimators e.g. Luenberger Observer
CT
p
ho
feedback for development of controller
ks
or
The estimator and controller work in
W
collaboration and some kind of work
n
ai
sharing.
M
T
It may be shown that, with a perfect
0K
T1
observer, the pole shifting gain matrix
CT
p
ho
maintain a set point of fixed value (may be
ks
zero)
or
W
The well known technique of compensator design
n
using pole placement with full state feedback falls
ai
under this category
M
Tracking Problem, or, Servo Problem: where a
T
0K
time varying desired state trajectory has to be
T1
p
ho
no additional reference input apart from
ks
or
the full state feedback the problem is
W
known as regulator problem where the
n
ai
objective is to drive the initial condition to
M
zero from a non zero value in a specified
T
0K
manner.
T1
p
ho
which SV feedback controller is to be designed
ks
must be controllable
or
From the definition of Controllability is has been well
W
understood that the closed loop poles cannot be
n
relocated using state feedback when system is
ai
uncontrollable
M
For computation of feedback gain the system
T
0K
model is to be expressed in controllable
T1
canonical form
CT
transformation
N
X = AX + Bu
p
ho
ks
or
The control vector u is designed
W
in the following state feedback form
n
ai
u = KX
M
T
0K
This leads to the following closed loop system
T1
X = ( A BK )X = A X
CT
CL
EI
where ACL = ( A BK )
M
N
u
B +
C
y
p
ho
A
ks
or
(a)
W
X
+ + X
n
B C
ai
r + y
M
T
0K A
T1
K
CT
(b)
EI
p
ho
The gain matrix K is designed
ks
or
in such a way that
W
sI ( A BK ) = (s 1 ) (s 2 ) (s n )
n
ai
M
where 1 , , n are the desired pole locations
T
0K
and n denotes the order of the system
T1
CT
EI
M
N
p
ho
u = KX , K = [k1 k 2 k3 ]
ks
or
W
0
n
1 0 0 0
ai
M
0 0 1 0 0
T
A=
0K
T1
0 0 0 0 0 1
CT
a
n an 1 an 2 a2 a1
EI
M
p
ho
0 1 0 0 0 0 0 0 0 0
ks
0 0 1 0 0 0 0 0 0 0
or
ACL =
W
0
0 0 0 0 1 0 0 0 0 0 0
n
a
a1 k1 k n
ai
n an 1 an 2 a2 k2 k3 k n 1
M
T
0 1 0K0 0 0
T1
0 0 1 0 0
ACL =
CT
0 0 0 0 1
EI
(a + k ) (a + k ) (a + k )
(a2 + k n 1 ) (a1 + k n )
M
n 1 n 1 2 n2 3
N
p
ho
characteristic polynomial is given by
ks
(s 1 ) (s 2 ) (s n ) = s n + 1s n1 + 2 s n2 + + n
or
W
This characteristic polynomial will lead to
n
ai
the closed loop system matrix as
M
T
0 1 0K 0 0 0
0 0 1 0 0
T1
ACL =
CT
0 1
EI
0 0 0
M
n n 1 n2 2 1
N
p
ho
an + k1 n k1 n an
ks
or
an 1 + k 2 n 1 k 2 n 1 an 1
W
= =
ai
a +k k a
M
1 n 1 n 1 1
T
0K
If the open loop system is not in companion
T1
p
ho
form, then we need to transform the state vector as X=T Z
ks
T = Transformation matrix, T = MW
or
where M is the controllability matrix = B [ AB An-1 B ]
W
an 1 an 2 a1 1
ai
an 2 an 3 1 0
M
Given, the characteristic equation :
W =
T
0K sI A = s n + a1s n 1 + + an 1s + an
a1 1 0 0
T1
1
0 0 0
CT
( ) ( )
Z = T -1 AT Z + T -1 B u
M
y = (CT )Z
N
p
ho
order system.
ks
Computation of feedback gain is difficult for
or
W
higher order system
n
ai
Ackermanns formula is useful in such situation
M
and usually followed in Matlab for pole
T
placement 0K
T1
p
ho
~ ~
sI A = s + 1s + 2 s + + n ; A = A BK
n n 1 n2
ks
or
W
By Cayley Hamilton theorem
()
~ ~n ~ n 1 ~ n2
n
A = A + 1 A + 2 A + + n = 0
ai
M
~
Substituting the value of A and using
T
0K
( A) = An + 1 An 1 + 2 An 2 + + n 0 we have for n = 3
T1
~ ~
2 K + 1 KA + KA 2
CT
( A) = [B AB ]
~
1 K + KA
EI
2
A B
M
K
T10KT December 2014 CKBS, Jadavpur University, Kolkata
25
Ackermanns Formula -3
~ ~
2 K + 1 KA + KA 2
p
ho
[
( A) = B AB A2 B ]
1 K + KA
~
ks
or
K
W
~ ~
2 K + 1 KA + KA 2
n
[ ]
ai
B AB A2 B ( A) =
1 ~
1 K + KA
T
K
0K
[
[0 0 1] B AB A B ( A) = K ]
1
T1
2
CT
K = [0 0 1] B [ AB An 1 B ( A) ]
1
N
p
ho
away from the open loop poles, otherwise
ks
or
it will demand high control gain (effort)
W
You thought gains come free with the
n
ai
controller? What price high gain?
M
Do not choose the closed loop poles very
T
0K
negative,
T1
p
ho
closed loop poles are shifted by the feedback
ks
Substantial control effort are needed for the
or
W
pole nearer to the zero of the system
n
ai
The pole placement strategy should aim to
M
Fix only unwanted aspects of the open loop system
T
0K
Avoid large increase in bandwidth
T1
p
ho
approximated second order behavior of the
ks
system
or
W
For a system with 2 lightly damped pole pairs
n
with high frequency and low frequency:
ai
M
One can design choosing both frequency and the
T
damping ratio as desired for low frequency mode
0K
Select the other poles to provide damping for high
T1
p
ho
ks
or
W
n
ai
M
T
0K
T1
CT
EI
M
N
p
ho
xinputs
= Ax + Bu
ks
or
The control vector u is a pth order vector. u is designed
W
in the following state feedback form
n
ai
u = Kx
M
This leads to the following closed loop system
T
0K
x = ( A BK )x = ACL x
T1
where ACL = ( A BK )
CT
p
ho
different approaches [Chen1999]:
ks
Cyclic Design by converting multi input problem into
or
W
a single input problem
n
Lyapunov Equation method
ai
M
Canonical Form method
T
Direct algorithm for pole placement by state-
0K
derivative feedback for multi-input linear systems by
T1
[Abdelaziz2005]
CT
p
ho
single input problem and gain is obtained using:
ks
Theorem1: If the n-dimensional p-input pair
or
(A,B) is controllable and if A is cyclic, then for
W
almost any pth order vector v, the single input
n
ai
pair (A, Bv) is controllable.
M
A is cyclic iff the Jordon form of A has one and only
T
0K
one Jordan block associated with each distinct
eigen value.
T1
consequently, cyclic.
T10KT December 2014 CKBS, Jadavpur University, Kolkata
33
Cyclic Design-2
Illustration:
p
ho
A is the system matrix of a 5th system controlled by 2
ks
inputs. Input matrix is B. (A, Bv) is single input pair.
or
W
2 1 0 0 0 0 1 v2
n
0 2 1 0 0 0 0 0
ai
1
v
A = 0 0 2 0 0 B = 1 2 Bv = B = v1 + 2v2
M
v2
0 0 0 1 1 4 3 4v1 + 3v2
T
1 0 v
0 0 0 0 1
0K
1
T1
( A, B ) is controllable as the 3rd and the 5th row of B are non zero
CT
Hence, ( A, Bv ) is controllable
N
p
ho
When A is not cyclic , introduce u = w K 1 x
ks
such that A = A BK 1 is cyclic
or
W
x = Ax + Bu x = ( A BK 1 )x + Bw
n
x = A x + Bw
ai
( A, B ) is controllable, so is (A , B ). Thus there exists a p th order vector v
M
T
for which (A , Bv ) is controllable
0K
T1
Hence, u = K 1 x K 2 x = (K 1 + K 2 )x
N
p
ho
ks
K2
or
W
K1
n
ai
x
M
r =0 w u + x
B C
T
+ + 0K
+
T1
A
CT
EI
M
N
p
ho
canonical form.
ks
We present the method for a 6th order system with 2
or
inputs. We first search linearly independent column of
W
the controllability matrix in order from left to right.
n
ai
It is assumed that controllability indices are 1=4 , 2=2
M
After transforming into controllable canonical form :
T
111
112 113 0K
114 121 122
T1
1 0 0 0 0 0
0 1 0 0 0 0
0 0 0 0 0
T
CT
1
A= 0 0 1 0 0 0 ; B =
b12 0 0 0 1 0
EI
211 212 213 214 221 222
M
0 0 0 0 1 0
p
(s )( )
ho
4
+ 111s 3 + 112 s 2 + 113 s + 114 s 2 + 221s + 222
ks
Let us select gain K as
or
K=
W
1 b12 (111 111 ) (112 112 ) (113 113 ) (114 114 )
1
121 122
0 1 ( 211 211 ) ( 212 212 ) ( 213 213 ) ( 214 214 ) ( 221 221 ) ( 222 222 )
ai
M
T
111 112 113 114 00K 0
1 0 0 0 0 0
T1
0 1 0 0 0 0
CT
A BK = 0 0 1 0 0 0
EI
0 0 0 0 1 0
T10KT December 2014 CKBS, Jadavpur University, Kolkata
38
p
ho
ks
Thank you
or
W
for
n
ai
M
Your kind Attention T
0K
T1
CT
EI
M
N