Control Systems Presentation - 2
Control Systems Presentation - 2
Control Systems Presentation - 2
The control systems can be represented with a set of mathematical equations known
as mathematical model.
These models are useful for analysis and design of control systems.
Analysis of control system means finding the output when we know the input and
mathematical model.
Design of control system means finding the mathematical model when we know the
input and the output.
The following mathematical models are mostly used.:
The coefficients a0, a1, a2 . . . , an-1 and b0, b1, b2 . . . , bm are real constants.
To taken the Laplace transform on both sides of the above equation and assume zero
initial conditions.
s n an -1s n -1 a2 s a1s a0 0
(M s2
2
B2 s B12 s K12 )( M1s 2 B1s B12 s K12 K1 ) ( B12 s K12 )2 X 2 ( s )
Here, F(s) is the input and X2(s) is the output of the mechanical system, then the
transfer function is
1
i1 (t ) [vi (t ) v1 (t )] (1)
R1
1
v1 (t ) i1 (t ) i2 (t ) dt (2)
C1 Fig. 3 : A electrical circuit.
1
i2 (t ) v1 (t ) vo (t ) (3)
R2
1
(4)
C2
vo (t ) i2 (t ) dt
Taking the Laplace transform of equations with all initial conditions are zero, then
1 1
I1 ( s) Vi ( s) V1 ( s) (5) V1 ( s) I1 ( s) I 2 ( s) (6)
R1 C1s
1 1
I 2 ( s) V1 ( s) Vo (s ) (7) Vo ( s ) I 2 ( s) (8)
R2 C2 s
The block diagram representation of this four equations (11) to (13) are shown in Fig.
5(a), (b), (c), and (d) respectively.
1
I1 ( s ) Vi ( s) V1 ( s ) (5)
R1
1
V1 ( s ) I1 ( s) I 2 ( s) (6)
C1s
1
I 2 ( s) V1 ( s) Vo ( s) (7)
R2
1
Vo ( s ) I 2 ( s) (8)
C2 s
Solution :
The the transfer function of the electrical system is
Example 2: Consider the system shown below, simplify this diagram and find the overall
transfer function using block diagram algebra.
Solution :
The transfer function of the system is
Y(s) G1G2G3
R(s) 1 G1G2H1 G2G3H2 G1G2G3
Signal Flow Graphs (SFG)
The signal flow graph is the case and effect graphical representation of linear
systems that are modeled by algebraic equations.
Signal flow graph is a graphical representation of algebraic equations.
1. Node
2. Branch
3. Forward Path
4. Forward Path Gain
5. Loop
6. Loop Gain
7. Non-touching Loops
8. Over all gain
1. Node
Node is a point which represents either a variable or a signal.
There are three types of nodes
1. input node,
2. output node and
3. mixed node.
1. Input Node − It is a node, which has only outgoing branches.
2. Output Node − It is a node, which has only incoming branches.
3. Mixed Node − It is a node, which has both incoming and outgoing branches.
3. Forward Path: A forward path is a path from an input node to an output node that does
not cross any nodes more than once.
4. Forward Path Gain: The forward path gain is the product of the branch transmittances
of a forward path.
5. Loop: A loop is a closed path which originates and terminates at the same node.
6. Loop Gain: The loop gain is the product of the branch transmittances of a loop.
7. Non-touching Loops: Loops are non-touching if they do not possess any common
nodes.
8. Overall Gain : Overall gain means the transfer function of the total system.
Construction of Signal Flow Graph
Let us construct a signal flow graph by considering the following algebraic equations
y2 a12 y1 a42 y4
y3 a23 y2 a53 y5
y4 a34 y3
y5 a45 y4 a35 y3
y6 a56 y5
There will be six nodes and eight branches in this signal flow graph.
The nodes are y1, y2, y3, y4, y5 and y6.
The gains of the branches are a12, a23, a34, a45, a56, a42, a53 and a35.
To get the overall signal flow graph, draw the signal flow graph for each equation, then
combine all these signal flow graphs and then follow the steps given below :
Step 1 : Signal flow graph for y2 = a13y1 + a24y4 is shown in the following figure.
Step 2 : Signal flow graph for y3 = a23y2 + a53y5y5 is shown in the following figure.
Step 3 : Signal flow graph for y4 = a34y3 is shown in the following figure.
Step 4 : Signal flow graph for y5 = a45y4 + a35y3 is shown in the following figure.
Step 5 : Signal flow graph for y6 = a56y5 is shown in the following figure.
Step 6 : Signal flow graph of overall system is shown in the following figure.
Follow these steps for converting a block diagram into its equivalent signal flow graph.
Represent all the signals, variables, summing points and take-off points of block
diagram as nodes in signal flow graph.
Represent the blocks of block diagram as branches in signal flow graph.
Represent the transfer functions inside the blocks of block diagram as gains of the
branches in signal flow graph.
Connect the nodes as per the block diagram. If there is connection between two nodes
(but there is no block in between), then represent the gain of the branch as one.
For example, between summing points, between summing point and takeoff point,
between input and summing point, between take-off point and output.
Example
Let us convert the following block diagram into its equivalent signal flow graph
The relationship between an input variable and output variable of a signal flow graph is
given by the net gain between the input and the output nodes is known as the overall
gain of the system.
Mason’s gain formula for the determination of the overall system gain is given below:
k
Pk Δ k
M(s) Δ
k 1
Loop L1 does not touch loop L3 , then the non touching loop gain is
L1 L3 G1H1G3 H 3
The determinant ∆ is given by
1 L1 L2 L3 L4 L1L3
1 G1H1 G2 H 2 G3 H 3 G4 H 3 H 2 H1 G1H1G3 H 3
The forward path cofactors are
1 1, and 2 1 L2 1 G2 H 2
The closed-loop transfer function Y(s)/R(s) is given by
Y ( s) P1 P2 (1 L2 )
R( s) 1 ( L1 L2 L3 L4 ) L1L3
G1G2G3 G4 G2 H 2G4
1 G1H1 G2 H 2 G3 H 3 G4 H 3 H 2 H1 G1H1G3 H 3
Example 2 : Draw the signal flow graph and find the overall transfer function from the
following block diagram as shown in figure.
Solution: The signal flow graph of the block diagram is shown below:
Solution:
The forward path gains are
P1 G1G3G5 P2 G2G4G6 P3 G1G7G6 P4 G2G8G5
P5 G1G7 H 2G8G5 P6 G2G8 H1G7G6
L1 G3 H1 L2 G4 H 2 L3 G7 H 2G8 H1
The non touching loop gain is
L1L2 G3 H1G4 H 2
The determinant ∆ is given by
1 ( L1 L2 L3 ) L1L2
1 1- L2 , 2 1- L1 , 3 1, 4 1, 5 1 and 6 1
Y (s) P1 (1 L2 ) P2 (1 L1 ) P3 P4 P5 P6
R( s) 1 ( L1 L2 L3 ) L1L2
G1G3G5 (1 G4 H 2 ) G2G4G6 (1 G3 H1 ) G1G7G6 G2G8G5 G1G7G8G5 H 2 G2G8G7G6 H1
1 G3 H1 G4 H 2 G7 H 2G8 H1 G3G4 H1H 2