Professional Documents
Culture Documents
Chapter 3
Chapter 3
Chapter 3
Learning outcome
Transfer Function
State Space Representation
Block Diagram Representation
Signal Flow Diagram
At the end of this chapter, student should be able to state and apply
the fundamental principle of control system to:-
write the transfer function from block diagram
write state space representation of the systems
represent the systems using block diagram and signal flow graph
Important terminology
State the smallest set of variables (state variables)
state variables the variables making up the smallest set of variables
that determine the state of the dynamic system
State vector If n state variables are needed to completely describe the
behavior of a given system, then these n state variables can be
considered the n components of a vector x.
State space The n-dimensional space whose coordinate axes consist
of the x1 axis, x2 axis, p , xn axis, where x1, x2, p , xn are state variables, is
called a state space.
State-Space Equations
Suppose the system has inputs of u1(t), u2(t),…, ur(t), output of outputs y1(t),
y2(t),…, ym(t) and the state variables: x1(t), x2(t),…, xn(t)
MEC 521 – VIBRATIONS : Dr. Azmi M.Yusof 4
State Space Representation
The system may be described by (state vector - a set of differential
equations)
Solution
The state variables, 𝑥1 = 𝑥; 𝑥2 = 𝑥ሶ ( x is the only output)
The state vectors, 𝑥ሶ 1 = 𝑥ሶ = 𝑥2 ; 𝑥ሶ 2 = 𝑥ሷ = −3𝑥ሶ − 2𝑥 + 𝑢 = −3𝑥2 − 2𝑥1 + 𝑢
𝑥ሶ 0 1 𝑥1 0
Write into matrix form, 1 = + 𝑢
𝑥ሶ 2 −2 −3 𝑥2 1
𝑥1
The output, 𝑦 = 1 0 𝑥 + 0 𝑢
2
𝑥ሶ 3 = 𝑦ሶ 2 = 𝑥4
𝑘 𝑘 1 𝑘 𝑘 1
𝑥ሶ 4 = 𝑦ሷ 2 = − 𝑦 + 𝑦 + 𝑢 =− 𝑥 + 𝑥 + 𝑢
𝑚2 2 𝑚2 1 𝑚2 𝑚2 3 𝑚2 1 𝑚2
𝑉𝐿 = −𝑉𝐶 + 𝑉(𝑡)
Substitute into above equations
𝑑𝑉𝐶 1 𝑑𝑉𝐶 1 1
𝐶 = 𝑖𝐶 = − 𝑉𝐶 + 𝑖𝐿 ; =− 𝑉 + 𝑖𝐿
𝑑𝑡 𝑅 𝑑𝑡 𝑅𝐶 𝐶 𝐶
𝑑𝑖𝐿 𝑑𝑖𝐿 1 1
𝐿 = 𝑉𝐿 = −𝑉𝐶 + 𝑉(𝑡) ; = − 𝑉𝐶 + 𝑉(𝑡)
𝑑𝑡 𝑑𝑡 𝐿 𝐿
1 1
𝑉ሶ𝐶 − 𝑉𝐶 0
𝑅𝐶 𝐶
= + 1 𝑉(𝑡)
𝑖ሶ𝐶 −
1 𝑖
0 𝐿 𝐿
𝐿
The output
1 𝑉𝐶
𝑖𝑅 = 0
𝑅 𝑖𝐿
Output : x3(t)
Taking the ratio between the output [C(s)] and in the input [R(s)],
ℒ[𝑂𝑢𝑡𝑝𝑢𝑡] 𝐶(𝑠)
𝑇𝑟𝑎𝑛𝑠𝑓𝑒𝑟 𝑓𝑢𝑛𝑐𝑡𝑖𝑜𝑛, 𝐺(𝑠) = =
ℒ[𝐼𝑛𝑝𝑢𝑡] 𝑅(𝑠)
𝐶 𝑠 𝐻2 𝑠 𝐻1 𝑠 = 𝑎
𝑅 𝑠 𝐺1 𝑠 ± 𝑎 = 𝐸(𝑠)
𝐶(𝑠)
𝑅 𝑠 𝐺1 𝑠 ± {𝐶 𝑠 𝐻2 𝑠 𝐻1 𝑠 } = 𝐺
2 𝑠 𝐺3 𝑠
𝐶(𝑠) 1
𝑅 𝑠 𝐺1 𝑠 = 𝐺 ± 𝐶 𝑠 𝐻2 𝑠 𝐻1 𝑠 = 𝐶(𝑠) ± 𝐻2 𝑠 𝐻1 𝑠
2 𝑠 𝐺3 𝑠 𝐺2 𝑠 𝐺3 𝑠
𝐶(𝑠) 𝐺2 𝑠 𝐺3 𝑠
𝑅(𝑠)
=
1± 𝐻2 𝑠 𝐻1 𝑠 [𝐺2 𝑠 𝐺3 𝑠 ]
R(s) 𝐺2 𝑠 𝐺3 𝑠 C(s)
1 ± 𝐻2 𝑠 𝐻1 𝑠 [𝐺2 𝑠 𝐺3 𝑠 ]
a)
b)
A. Cascade form
Figure below shows an example of cascaded subsystems
Intermediate signal values are shown at the output of each subsystem.
Each signal is derived from the product of the input times the transfer
function.
𝐺𝑠 (𝑠)𝐺3 (𝑠)
a
−𝐻1 𝑠 + 𝐻2 𝑠 − 𝐻3 (𝑠)
𝐺3 (𝑠)
𝐶(𝑠) = 𝑉4 (𝑠) 1+𝐺3 (𝑠)𝐻3 (𝑠)
𝐺1 𝑠
1 1
𝐺1 𝑠 𝑉4 𝑠 + 𝑉4 (𝑠) = 𝑉
𝐺2 𝑠
1
𝑉4 𝑠 +1 =𝑉
𝐺2 𝑠
K 𝑠
𝑉 𝑠 𝐺1 𝑠 𝐺2 𝑠 = 𝑉4 (𝑠)
𝑉4 𝑠 𝐻1 𝑠 + 𝐻𝐺2 𝑠𝑠 = 𝐾(𝑠)
1
𝑅 𝑠 − 𝐾 𝑠 = 𝑉(𝑠)
𝑅 𝑠 − 𝑉4 𝑠 𝐻1 𝑠 + 𝐻𝐺2 𝑠𝑠 = 𝐺 𝑉4 (𝑠)
1 1 𝑠 𝐺2 𝑠
𝐻1 𝑠 𝐺1 𝑠 +𝐻2 𝑠 1
𝑅 𝑠 = 𝑉4 𝑠 𝐺1 𝑠
+
𝐺1 𝑠 𝐺2 𝑠
𝐺1 𝑠 𝐺2 𝑠
𝑉4 𝑠 = 𝑅(𝑠) 1+𝐺1 𝑠 𝐻1 𝑠 𝐺2 𝑠 +𝐺2 𝑠 𝐻2 𝑠
1 𝐺3 𝑠
𝑉4 𝑠 𝐺2 𝑠
+1
1+𝐺3 𝑠 𝐻3 𝑠
=𝐶 𝑠
𝐺1 𝑠 𝐺2 𝑠
𝑅𝑠 1+𝐺1 𝑠 𝐻1 𝑠 𝐺2 𝑠 +𝐺2 𝑠 𝐻2 𝑠
= 𝑉4 𝑠
𝐺1 𝑠 𝐺2 𝑠 1 𝐺3 𝑠
𝑅𝑠 1+𝐺1 𝑠 𝐻1 𝑠 𝐺2 𝑠 +𝐺2 𝑠 𝐻2 𝑠 𝐺2 𝑠
+1
1+𝐺3 𝑠 𝐻3 𝑠
=𝐶 𝑠
d)
c)
start by drawing the signal nodes for that system. Next interconnect the
signal nodes with system branches
Solution
Solution
b)
𝐶(𝑠) σ𝑘 𝑇𝑘 ∆𝑘
𝐺 𝑠 = =
𝑅(𝑠) ∆
Where :-
k = number of forward paths
Tk = the kth forward-path gain
= 1 –( loop gains) + ( nontouching-loop gains taken two at a time) – (
nontouching-loop gains taken three at a time) + ( nontouching-loop
gainstaken four at a time) -. . .
k = - loop gain terms in that touch the kth forward path: In other words;
k is formed by eliminating from those loop gains that touch the kth forward
path:
form k by eliminating from the loop gains that touch the kth forward
path:
Finally, apply Mason’s formula. Since there is only one forward path,
G(s) consists of only one term, rather than a sum of terms, each coming
from a forward path
𝐶(𝑠) σ𝑘 𝑇𝑘 ∆𝑘 𝑇1 ∆1 𝐺1 (𝑠)𝐺2 (𝑠)𝐺3 (𝑠)𝐺4 (𝑠)𝐺5 (𝑠) [1−𝐺7 (𝑠)𝐻4 (𝑠)]
𝐺 𝑠 = 𝑅(𝑠) =
∆
=
∆
=
∆