Question: Consider the ( scalar ) transfer function T ( s ) = pmsm + pm 1 sm 1 + + p 1 s + p
Consider the scalar transfer function
Ts pmsm pmsmpsp
sn qnsnqsq
with pm and m n The coefficients pi and qi are real and m denotes the degree of the numerator polynomial rather than the number of inputs The relative degree r of a transfer function is defined as the integer r n m
a Let A B C be a realization of T s with the matrix pair A B controllable. Show that T s has relative degree r if and only if
CAiB for all i in r and CArB Hint. Exploit the controllability canonical form and recall Theorem
In the remainder of this problem, we assume r n and let A B C be the realization of T s in controllability canonical form. Denote, as usual, the corresponding linear system by
where yk is the kthorder time derivative of y ie ykt dkyt
dtk
c Derive the dynamics directly from the transfer function
x t Axt But yt Cxt
b Show that the dynamics can be written as the higherorder differential equation
ynt qnynt qyt qyt put
Hint. You may use the fact that the Laplace transform is injective, ie Lf Lf implies f f
We would like to solve a tracking control problem in which the output y asymptotically tracks a given reference trajectory yref : infty R ie
lim yt yref t tinfty
To do so we define the tracking error et yt yref t
Now, assuming that yref is sufficiently differentiable and taking p for simplicity, consider
a controller of the form
k
Then, the tracking problem can more formally be stated as: find a matrix
Ff f fn
such that, for each initial condition x in Rn the dynamics with x x and input
satisfy
d Define the state z as
n n
ut ynt X qkykt X fkekt
ref ref k
z e ze
z
zn en
and show that the dynamics with the controller can be written as
z t A BF zt et Czt
e Using the result from d prove that holds for any initial condition x if and only if sigma A BF C
Hint. For the only if part, first show that the matrix pair A BF C is observable. Then, take some inspiration from the proof of Theorem
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
