Professional Documents
Culture Documents
Control Theory
Control Theory
.
1 Objectives
Class
Agenda 4 Electrical Systems
5 Electro-Mechanical Systems
Part 1
State Space Modeling
Part 2
Block Diagram Reduction
Block Diagram
➢ Cascaded form
➢ Parallel form
➢ Feedback form
Part 3
Signal Flow Graphs
Outline
➢ Introduction to Signal Flow Graphs
✓ Definitions
✓ Terminologies
✓ Examples
➢ Mason’s Gain Formula
✓ Examples
➢ Signal Flow Graph from Block Diagrams
➢ Design Examples
Introduction
➢ Alternative method to block diagram representation,
developed by Samuel Jefferson Mason.
a y
x
𝑅1 (𝑠) 𝑌1 (𝑠)
𝑅2 (𝑠) 𝑌2 (𝑠)
a11 x1 + a12 x2 + r1 x1
a21 x1 + a22 x2 + r2 x2
𝑟1 𝑥1
𝑟2 𝑥2
x2 = dx1 + ex3
c
x0 x1 x2 g x3 x4
a d h
x3 = fx0 + gx2
x4 = hx 3 b e
Terminologies
• An input node or source contain only the outgoing branches. i.e., X1
• An output node or sink contain only the incoming branches. i.e., X4
• A path is a continuous, unidirectional succession of branches along
which no node is passed more than ones. i.e.,
X1 to X2 to X3 to X4 X1 to X2 to X4 X2 to X3 to X4
• A forward path is a path from the input node to the output node. i.e.,
X1 to X2 to X3 to X4 , and X1 to X2 to X4 , are forward paths.
• A feedback path or feedback loop is a path which originates and
terminates on the same node. i.e.; X2 to X3 and back to X2 is a
feedback path.
• Two loops, paths, or loop and a path are said to be non-touching if they have no
nodes in common.
a) Input node.
b) Output node.
c) Forward paths.
d) Feedback paths (loops).
e) Determine the loop gains of the feedback loops.
f) Determine the path gains of the forward paths.
g) Non-touching loops
Consider the signal flow graph below and identify the following
Consider the signal flow graph below and identify the following
a) Input node.
b) Output node.
c) Forward paths.
d) Feedback paths (loops).
e) Determine the loop gains of
the feedback loops.
f) Determine the path gains of
the forward paths.
g) Non-touching loops
Consider the signal flow graph below and identify the following
a) Input node.
b) Output node.
c) Forward paths.
d) Feedback paths.
e) Self loop.
f) Determine the loop gains of the feedback loops.
g) Determine the path gains of the forward paths.
Consider the signal flow graph below and identify the following
a) Input node.
b) Output node.
c) Forward paths.
d) Feedback paths.
e) Self loop.
f) Determine the loop gains of the
feedback loops.
g) Determine the path gains of the
forward paths.
a) Input node
b) Output node
Consider the signal flow graph below and identify the following
Consider the signal flow graph below and identify the following X5 to X6 to X7 to X5
Consider the signal flow graph below and identify the following
Consider the signal flow graph below and identify the following
Consider the signal flow graph below and identify the following
Consider the signal flow graph below and identify the following
Consider the signal flow graph below and identify the following
Consider the signal flow graph below and identify the following
Mason’s Rule
n
Pi i
C( s ) i =1
=
R( s )
∆ = 1- (sum of all individual loop gains) + (sum of the
products of the gains of all possible two loops that do
not touch each other) – (sum of the products of the
gains of all possible three loops that do not touch each
other) + … and so forth with sums of higher number of
non-touching loop gains
Systematic approach
Example#1:
Apply Mason’s Rule to calculate the transfer function of the
system represented by following Signal Flow Graph
Therefore, C P11 + P2 2
=
R
Example#1:
Apply Mason’s Rule to calculate the transfer function of the
system represented by following Signal Flow Graph
Example#1:
Apply Mason’s Rule to calculate the transfer function of the
system represented by following Signal Flow Graph
Example#1:
Apply Mason’s Rule to calculate the transfer function of the
system represented by following Signal Flow Graph
Example#2:
Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph
P1
P2
Example#2:
4. Consider three non-touching loops.
None.
= 1 − (L1 + L2 + L3 + L4 ) + (L1 L3 + L1 L4 + L2 L3 + L2 L4 )
= 1 − (G2 H 2 + H 3G3 + G6 H 6 + G7 H 7 ) +
(G2 H 2G6 H 6 + G2 H 2G7 H 7 + H 3G3G6 H 6 + H 3G3G7 H 7 )
Example#2:
Eliminate forward path-1
1 = 1 − (L3 + L4 )
1 = 1 − (G6 H 6 + G7 H 7 )
Eliminate forward path-2
2 = 1 − (L1 + L2 )
2 = 1 − (G2 H 2 + G3 H 3 )
Y ( s ) P11 + P2 2
=
R( s )
Y (s) G1G2G3G4 1 − (G6 H 6 + G7 H 7 ) + G5G6G7 G8 1 − (G2 H 2 + G3 H 3 )
=
R( s ) 1 − (G2 H 2 + H 3G3 + G6 H 6 + G7 H 7 ) + (G2 H 2G6 H 6 + G2 H 2G7 H 7 + H 3G3G6 H 6 + H 3G3G7 H 7 )
Dr. Mamon Horoub
Copyright © 2020 by Mamon Horoub. All rights reserved.
Example#3:
Find the transfer function, C(s)/R(s), for the signal-
flow graph in figure below.
Example#3:
There is only one forward Path.
Example#3:
There are four feedback loops.
Example#3:
Non-touching loops taken two at a time.
Example#3:
Non-touching loops taken three at a time.
Example#3:
Example#4:
Apply Mason’s Rule to calculate the transfer function of the system
represented by following Signal Flow Graph
Example#4:
Forward Paths
P1 = A32 A43 A54 A65 A76 P2 = A72 P3 = A42 A54 A65 A76
Example#4:
Loop Gains of the Feedback Loops
Example#4:
Loop Gains of the Feedback Loops
Example#4:
two non-touching loops
L1 L3 L2 L4 L3 L5 L4 L6 L5 L7 L7 L8
L1 L4 L2 L5 L3 L6 L4 L7
L1 L5 L2 L6
L1 L6 L2 L8
L1 L8 Dr. Mamon Horoub
Copyright © 2020 by Mamon Horoub. All rights reserved.
Example#4:
Three non-touching loops
H3
-H1
R(s) 1 E(s) G1 X1 G2 X2 G3 X3 G4 C(s)
-H2
-H3
Dr. Mamon Horoub
Copyright © 2020 by Mamon Horoub. All rights reserved.
Example#5:
From Block Diagram to Signal-Flow Graph Models
-H1
R(s) 1 E(s) G1 X1 G2 X2 G3 G4 X3 1 C(s)
-H2
-H3
C ( s) G1G2G3G4
G= =
R( s ) 1 + G1G2G3G4 H 3 + G2G3 H 2 + G3G4 H 1
Dr. Mamon Horoub
Copyright © 2020 by Mamon Horoub. All rights reserved.
Example#6:
From Block Diagram to Signal-Flow Graph Models
-
- X1 Y1
G1
+ + C(s)
R(s) E(s)
- +
- X
2
G2
- Y2
-1
X1 G1 Y1
-1
-1
1
R(s) 1 E(s) C(s)
1 1 1
X2 G2 Y2
-1
-1
Dr. Mamon Horoub
Copyright © 2020 by Mamon Horoub. All rights reserved.
Example#6:
-1
From Block Diagram to Signal-Flow Graph Models
X1 G1 Y1
-1 1
R(s) 1 E(s) -1 C(s)
1 1 Y2 1
X2 G2
-1 -1
7 loops:
3 ‘2 non-touching loops’ :
-1 -1
Then:
Δ = 1 + 2G2 + 4G1G2
p1 = ( − 1) G1 1 Δ1 = 1 + G2
4 forward paths:
p2 = ( − 1) G1 ( − 1) G2 1 Δ2 = 1
p3 = 1 G 2 1 Δ3 = 1 + G1
p4 = 1 G2 1 G1 1 Δ4 = 1
Dr. Mamon Horoub
Copyright © 2020 by Mamon Horoub. All rights reserved.
Example#6:
-1
From Block Diagram to Signal-Flow Graph Models
X1 G1 Y1
-1 1
R(s) 1 E(s) -1 C(s)
1 1 Y2 1
X2 G2
-1 -1
Then:
Δ = 1 + 2G2 + 4G1G2
p1 = ( − 1) G1 1 Δ1 = 1 + G2
4 forward paths:
We have
C( s ) pk k
p2 = ( − 1) G1 ( − 1) G2 1 Δ2 = 1 R( s )
=
p3 = 1 G 2 1 Δ3 = 1 + G1 G − G1 + 2G1G2
= 2
1 + 2G2 + 4G1G2
p4 = 1 G2 1 G1 1 Δ4 = 1
Dr. Mamon Horoub
Copyright © 2020 by Mamon Horoub. All rights reserved.
Example#7:
Determine the transfer function C/R for the block diagram
below by signal flow graph techniques.
• The signal flow graph of the above block diagram is shown below.
• Because the loops touch the nodes of • Hence the control ratio T = C/R is
P1, hence
1
V1 ( s ) = I1 ( s ) + I1 ( s ) R
Cs
CsV1 ( s ) − CsV2 ( s ) = I1 ( s )
V2 ( s ) = I 1 ( s ) R
−Cs
Cs R
V1 (s ) I1 (s ) V2 (s )
Dr. Mamon Horoub
Copyright © 2020 by Mamon Horoub. All rights reserved.
Design Example#2
F = M 1s 2 X 1 + k1 ( X 1 − X 2 ) 0 = M 2 s 2 X 2 + k1 ( X 2 − X 1 ) + k 2 X 2
References
1. Dorf, R. C. and Bishop, R. H. (2008). Modern Control Systems (Eleventh Edition)
Pearson Education.
2. Ogata, K. (2010). Modern Control Engineering (Fifth Edition) Pearson Education.
3. Nise, N. S. (2011). Control Systems Engineering (Sixth Edition) John Wiley and Sons.
4. Tony Lecture Notes PMU