Control Systems Unit 1
Control Systems Unit 1
Course Synopsis
• Provides a background of control
principles in various engineering
applications.
• Basic mathematical tools such as
1. Laplace transform,
2. mathematical modeling of dynamic
systems
3.block diagram signal flow graph,
4)Time response analysis, Root
locus ,Stability of linear transfer
function,
5)Frequency domain analysis
• 6) Lead , Lag and Lag-Lead
compensation techniques and
• 7) State Space Techniques are discussed
Course Outcomes:
CO1
Ability to apply various mathematical
principles (from calculus and linear
algebra) to solve control system
problems.
CO2
Ability to obtain mathematical models
for such mechanical, electrical and
electromechanical systems.
CO3
Ability to derive equivalent differential
equation, transfer function and state
space model for a given system.
CO4
The ability to perform system’s time
and frequency-domain analysis with
response to test inputs. Analysis
includes the determination of the
system stability.
• A system is an arrangement , set, or
collection of things are related in
such a manner as to form an entirety
or whole.
• A system is an arrangement of
physical components connected or
related in such a manner as to form
an entirety or whole.
• The word “Control” usually is taken to
mean regulate ,direct or command
1 April 2017
55
Classification of control systems
Energy supply
Outpu
Input Heating t
(Desired Timer Bread
Colour) elements (Actua
l
colour)
Disturbance
• Traffic control system – The traffic is controlled as
per the adjusted time irrespective of the density of
the traffic.
CONTROL SYSTEMS
d
x y
dt
Introduction
• The operations of addition and subtraction have a special
representation.
• The block becomes a small circle, called a summing point, with the
appropriate plus or minus sign associated with the arrows entering
the circle.
• Any number of inputs may enter a summing point.
• The output is the algebraic sum of the inputs.
• Some books put a cross in the circle.
Components of a Block Diagram for a
Linear Time Invariant System
• System components are alternatively called elements of
the system.
• Block diagram has four components:
▫ Signals
▫ System/ block
▫ Summing junction
▫ Pick-up/ Take-off point
• In order to have the same signal or variable be an input to more than
one block or summing point, a takeoff point is used.
• Distributes the input signal, undiminished, to several output points.
• This permits the signal to proceed unaltered along several different
paths to several destinations.
Example-1
• Consider the following equations in which x1, x2, x3, are variables, and
a1, a2 are general coefficients or mathematical operators.
x3 a1 x1 a 2 x 2 5
Example-1
• Consider the following equations in which x1, x2, x3, are variables, and
a1, a2 are general coefficients or mathematical operators.
x3 a1 x1 a 2 x 2 5
Example-2
• Consider the following equations in which x 1, x2,. . . , xn, are variables,
and a1, a2,. . . , an , are general coefficients or mathematical operators.
x n a1 x1 a 2 x 2 a n 1 x n 1
Example-3
• Draw the Block Diagrams of the following equations.
dx1 1
(1) x 2 a1 x1dt
dt b
d 2 x2 dx1
(2 ) x3 a1 3 bx1
dt 2 dt
Topologies
• We will now examine some common topologies for
interconnecting subsystems and derive the single
transfer function representation for each of them.
• These common topologies will form the basis for
reducing more complicated systems to a single block.
CASCADE
• Any finite number of blocks in series may be
algebraically combined by multiplication of transfer
functions.
• That is, n components or blocks with transfer functions
G1 , G2, . . . , Gn, connected in cascade are equivalent to a
single element G with a transfer function given by
Example
Figure:
a) Cascaded Subsystems.
b) Equivalent Transfer Function.
Figure:
a) Parallel Subsystems.
b) Equivalent Transfer Function.
The system is said to have negative feedback if the sign at the summing junction is
negative and positive feedback if the sign is positive.
Feedback Form:
Figure:
a)Feedback Control System.
b)Simplified Model or Canonical Form.
c) Equivalent Transfer Function.
C (s ) G(s )
R( s ) 1 G(s )H (s )
1 G(s )H (s ) 0
Canonical Form of a Feedback Control System
The system is said to have negative feedback if the sign at the summing junction is negative and
positive feedback if the sign is positive.
B(s )
1. Open loop transfer function G(s )H (s )
E (s )
C (s )
G( s )
2. Feed Forward Transfer function E (s )
C (s ) G( s ) G(s )
3. control ratio R(s ) 1 G(s )H (s )
B(s ) G(s )H (s )
4. feedback ratio R(s ) 1 G(s )H (s )
E (s ) 1 H (s )
5. error ratio R( s ) 1 G(s )H (s )
C (s ) G(s )
6. closed loop transfer function R( s ) 1 G(s )H (s )
1 G(s )H (s ) 0
7. characteristic equation
G1 G2 G1G2
G1
G1 G2
G2
Reduction techniques
3. Moving a summing point behind a block
G G
Reduction techniques
3. Moving a summing point ahead of a block
G G
1
G
G G
G G
Reduction techniques
6. Eliminating a feedback loop
G
G
1 GH
H
G
G
1 G
H 1
A B B A
Block Diagram Transformation Theorems
The letter P is used to represent any transfer function, and W, X , Y, Z denote any
transformed signals.
Transformation Theorems Continue:
Transformation Theorems Continue:
Reduction of Complicated Block Diagrams:
Example-4: Reduce the Block Diagram to Canonical Form.
Example-4: Continue.
K
s 1
Example-8: Continue
K
s 1
K
G s 1
1 GH K
1 s
s 1
Example-8: Continue
B( s )
1. Open loop transfer function G(s )H (s )
E (s )
C (s )
G( s )
2. Feed Forward Transfer function E (s )
C (s ) G( s ) G(s )
3. control ratio R(s ) 1 G(s )H (s )
B( s ) G(s )H (s )
4. feedback ratio R( s ) 1 G(s )H (s )
E (s ) 1 H (s )
5. error ratio R( s ) 1 G(s )H (s )
C (s ) G(s )
6. closed loop transfer function R( s ) 1 G(s )H (s )
1 G(s )H (s ) 0
7. characteristic equation
H2
R _ C
+ _ + G1 + G2 G3
+
H1
Example-12:
H2
G1
R _ C
+ _ + + G1 G2 G3
+
H1
Example-12:
H2
G1
R _ C
+ _ + + G1G2 G3
+
H1
Example-12:
H2
G1
R _ C
+ _ + + G1G2 G3
+
H1
Example-12:
H2
G1
R _ G1G2 C
+ _ + G3
1 G1G2 H 1
Example-12:
H2
G1
R _ G1G2G3 C
+ _ +
1 G1G2 H 1
Example-12:
R G1G2G3 C
+ _ 1 G1G2 H 1 G2G3 H 2
Example-12:
R G1G2G3 C
1 G1G2 H 1 G2G3 H 2 G1G2G3
Example 13: Find the transfer function of the following block
diagrams.
R (s ) Y (s )
G1 G2
H1 H2
H3
Solution:
1. Eliminate loop I
R (s ) I Y (s )
A B
G1 G2
H1 H2
H3
G2
2. Moving pickoff point A behind block
1 G2 H 2
R (s ) A G2 B
Y (s )
G1
1 G2 H 2
1 G2 H 2 II
H1 1 G2 H 2
G2 H 3 H1 ( )
G2
H3 Not a feedback loop
3. Eliminate loop II
R (s ) G1G2 Y (s )
1 G2 H 2
H 1 (1 G2 H 2 )
H3
G2
Y (s ) G1G2
R(s ) 1 G2 H 2 G1G2 H 3 G1 H 1 G1G2 H 1 H 2
CONTROL SYSTEMS
163
Outline
• Advantage: the availability of a flow graph gain formula, also called Mason’s
gain formula.
• It depicts the flow of signals from one point of a system to another and gives
the relationships among the signals.
165
Fundamentals of Signal Flow Graphs
• Consider a simple equation below and draw its signal flow graph:
y ax
a y
x
a11x1 a12x2 r1 x1
a21x1 a22x2 r2 x2
Signal-Flow Graph Models
x1 ax0 bx1 cx 2 f
c
x 2 dx1 ex 3 x0 x1 x2 g x3 x4
a d h
x 3 fx0 gx 2
x4 hx 3 b e
Construct the signal flow graph for the following set of simultaneous equations.
• There are four variables in the equations (i.e., x1,x2,x3,and x4) therefore four nodes are required to construct the signal flow
graph.
• Arrange these four nodes from left to right and connect them with the associated branches.
• 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
• Two loops, paths, or loop and a path are said to be non-touching if they have no nodes in common.
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.
Input and output Nodes
a) Input node
b) Output node
(c) Forward Paths
(d) Feedback Paths or Loops
(d) Feedback Paths or Loops
(d) Feedback Paths or Loops
(d) Feedback Paths or Loops
(e) Self Loop(s)
(f) Loop Gains of the Feedback Loops
(g) Path Gains of the Forward Paths
Mason’s Rule (Mason, 1953)
• The block diagram reduction technique requires successive application of fundamental
relationships in order to arrive at the system transfer function.
• On the other hand, Mason’s rule for reducing a signal-flow graph to a single transfer
function requires the application of one formula.
• The formula was derived by S. J. Mason when he related the signal-flow graph to the
simultaneous equations that can be written from the graph.
Mason’s Rule:
• The transfer function, C(s)/R(s), of a system represented by a signal-flow graph is;
n
Pi i
C (s )
i 1
R(s )
Where
• ∆ is called the signal flow graph determinant or characteristic function. Since ∆=0 is the system
characteristic equation.
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
∆i = value of Δ for the part of the block diagram that does not touch the i-th forward path (Δ i = 1 if
there are no non-touching loops to the i-th path.)
Systematic approach
190
Example#1: Apply Mason’s Rule to calculate the transfer function of the system represented by
following Signal Flow Graph
Therefore, C P P2 2
1 1
R
There are three feedback loops
1 L1 L2 L3
P1
P2
195
Example#2: continue
1 G2 H 2 H 3G3 G6 H 6 G7 H 7
G2 H 2 G6 H 6 G2 H 2 G7 H 7 H 3G3G6 H 6 H 3G3G7 H 7
196
Example#2: continue
Eliminate forward path-1
1 1 L3 L4
1 1 G6 H 6 G7 H 7
2 1 L1 L2
2 1 G2 H 2 G3 H 3
197
Example#2: continue
Y (s ) P11 P2 2
R( s )
198
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.
3
Pi i
C (s ) P P2 2 P3 3
i 1 1 1
R(s )
Example#4: Forward Paths
L1 A32 A23
L5 A76 A67
L2 A43 A34 L9 A72 A57 A45 A34 A23
L6 A77
L3 A54 A45 L10 A72 A67 A56 A45 A34 A23
L7 A42 A34 A23
L4 A65 A56
L8 A65 A76 A67
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
Example#4: Three non-touching loops
From Block Diagram to Signal-Flow Graph Models
Example#5
H1
H3
- H1
R(s) 1 E(s) G1 X1 G2 X2 G3 X3 G4 C(s)
- H2
- H3
From Block Diagram to Signal-Flow Graph Models
Example#5
- 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
Example#6
-
- X1 G1 Y1
R(s) + + C(s)
E(s)
- - +
X2 G2
- Y2
-1
X1 G1 Y1
-1
-1 1
R(s) 1 E(s) C(s)
1 1 1
X2 G2 Y2
-1
-1
Example#6
-1
X1 G1 Y1
-1 1
R(s) 1 E(s) -1 C(s)
1 X2 1 Y2 1
G2
-1 -1
7 loops:
3 ‘2 non-touching loops’ :
Example#6
-1
X1 G1 Y1
-1 1
R(s) 1 E(s) -1 C(s)
1 X2 1 Y2 1
G2
-1 -1
Then: Δ 1 2G 2 4G1G 2
4 forward paths:
p1 ( 1) G1 1 Δ1 1 G 2
p2 ( 1) G1 ( 1) G 2 1 Δ2 1
p3 1 G 2 1 Δ3 1 G1
p4 1 G 2 1 G1 1 Δ4 1
Example#6
We have
C (s ) pk k
R( s )
G2 G1 2G1G2
1 2G2 4G1G2
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 P1, hence • Hence the control ratio T = C/R is