1 of 53

Control Systems

Lect.5 Reduction of Multiple Subsystems Basil Hamed

2 of 53

Chapter Learning Outcomes

After completing this chapter the student will be able to:

  • Reduce a block diagram of multiple subsystems to a single block representing the TF (Sections 5.1-5.2)
  • Analyze and design transient response for a system consisting of multiple subsystems (Section 5.3)
  • Convert block diagrams to signal-flow diagrams (Section 5.4)
  • Find the TF of multiple subsystems using Mason's rule (Section 5.5)
  • Represent state equations as signal-flow graphs (Section 5.6)
  • Perform transformations between similar systems using transformation matrices;State Space and diagonalize a system matrix (Section 5.8)

Basil Hamed

2

3 of 53

5.1 Introduction

  • We have been working with individual subsystems represented by a block with its input and output. More complicated systems, however, are represented by the interconnection of many subsystems.
  • Since the response of a single transfer function can be calculated, we want to represent multiple subsystems as a single transfer function.
  • In this chapter, multiple subsystems are represented in two ways: as block diagrams and as signal-flow graphs.
  • Signal-flow graphs represent transfer functions as lines, and signals as small circular nodes. Summing is implicit.

Basil Hamed

3

4 of 53

5.2 Block Diagrams

As you already know, a subsystem is represented as a block with an input, an output, and a transfer function. Many systems are composed of multiple subsystems, as in Figure below.

Basil Hamed

4

5 of 53

5.2 Block Diagrams

When multiple subsystems are interconnected, a few more schematic elements must be added to the block diagram. These new elements are summing junctions and pickoff points. All component parts of a block diagram for a linear, time-invariant system are shown in Figure below.

Basil Hamed

5

6 of 53

Cascade Form

Basil Hamed

6

7 of 53

Parallel Form

Basil Hamed

7

8 of 53

Feedback Form

The typical feedback system, is shown in Figure (a); a simplified model is shown in Figure (b).

Basil Hamed

8

9 of 53

Feedback Form

Basil Hamed

9

10 of 53

Moving Blocks to Create Familiar Forms

This subsection will discuss basic block moves that can be made in order to establish familiar forms when they almost exist. In particular, it will explain how to move blocks left and right past summing junctions and pickoff points.

Basil Hamed

10

11 of 53

Moving Blocks to Create Familiar Forms

Basil Hamed

11

12 of 53

Example 5.1P.242

PROBLEM: Reduce the block diagram shown to a single T.F.

Basil Hamed

12

13 of 53

Example 5.1P.242

SOLUTION:

Basil Hamed

13

14 of 53

Example 5.2 P.243

PROBLEM: Reduce the system shown to a single T.F.

Basil Hamed

14

15 of 53

Example 5.2 P.243

SOLUTION:

Basil Hamed

15

16 of 53

Example 5.2 P.243

Basil Hamed

16

17 of 53

5.3 Analysis and Design of Feedback�Systems

Consider the system shown, which can model a control system such as the antenna azimuth position control system.

Basil Hamed

17

where K models the amplifier gain, that is, the ratio of the output voltage to the input voltage.

18 of 53

5.3 Analysis and Design of Feedback�Systems

  •  

Basil Hamed

18

 

19 of 53

5.3 Analysis and Design of Feedback�Systems

  •  

Basil Hamed

19

20 of 53

Example 5.3 P. 246

PROBLEM: For the system shown, find the peak time, percent overshoot, and settling time.

Basil Hamed

20

Solution: The closed-loop transfer function found

21 of 53

Example 5.3 P. 246

Basil Hamed

21

22 of 53

Example 5.4 P 246

PROBLEM: Design the value of gain. K, for the feedback control system of Figure below so that the system will respond with a 10% overshoot.

Basil Hamed

22

SOLUTION: The closed-loop transfer function of the system is

23 of 53

Example 5.4 P 246

Basil Hamed

23

A 10% overshoot implies that ξ = 0.591. Substituting this value for the

damping ratio into above Eq. and solving for K yields;

K=17.9

24 of 53

5.4 Signal-Flow Graphs

  • Signal-flow graphs are an alternative to block diagrams.
  • Unlike block diagrams, which consist of blocks, signals, summing junctions, and pickoff points, a signal-flow graph consists only of

branches, which represent systems, and

nodes, which represent signals.

Basil Hamed

24

25 of 53

Example 5.5 P. 249

PROBLEM: Convert the cascaded, parallel, and feedback forms of the block diagrams shown in Figures below, respectively, into signal-flow graphs.

Basil Hamed

25

26 of 53

Example 5.5 P. 249

SOLUTION: In each case, we start by drawing the signal nodes for that system. Next we interconnect the signal nodes with system branches.

Basil Hamed

26

27 of 53

Example 5.5 P. 249

Basil Hamed

27

28 of 53

Example 5.5 P. 249

Basil Hamed

28

29 of 53

Example 5.6 P 250

PROBLEM: Convert the block diagram shown to a signal-flow graph.

Basil Hamed

29

30 of 53

Example 5.6 P 250

Basil Hamed

30

31 of 53

5.5 Mason's Rule

  • In this section will discuss a technique for reducing signal-flow graphs to single transfer functions that relate the output of a system to its input.
  • The block diagram reduction technique we studied in Section 5.2 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.

Basil Hamed

31

32 of 53

5.5 Mason's Rule

Mason's formula has several components that must be evaluated. First, we must be sure that the definitions of the components are well understood.

Definitions

Input Node(Source): is a node that has only outgoing branches

Output Node (Sink): is a node that has only incoming branches.

Path: is continuous connection of branches from one node to another with arrowhead in the same direction.

Forward Path: is a path connects a source node to a sink node.

Loop: is closed path(originate and terminates on the same node).

Path gain: is the product of T.F of all branches that form path.

Loop Gain: is the product of T.F of all branches that form loop.

Basil Hamed

32

33 of 53

5.5 Mason's Rule

The transfer function, C(s)/R(s), of a system represented by a signal-flow graph is

Basil Hamed

33

 

 

34 of 53

Example 5.7 P 252

PROBLEM: Find the transfer function, C(s)/R(s) for the signal-flow graph shown below

Basil Hamed

34

35 of 53

Example 5.7 P 252

  •  

Basil Hamed

35

Nontouching loops taken two at time

Nontouching loops taken three at time

36 of 53

Example 5.7 P 252

Basil Hamed

36

37 of 53

Example

Basil Hamed

37

Find T.F C(s)/R(s)

38 of 53

Example

Basil Hamed

38

Find T.F y7 /y1

39 of 53

5.6 Signal-Flow Graphs of State Equations

In this section, we draw signal-flow graphs from state equations.

Consider the following state and output equations:

Basil Hamed

39

First, identify three nodes to be the three state variables, X1, X2, and X3; also identify three nodes, placed to the left of each respective state variable, to be the derivatives of the state variables,

40 of 53

5.6 Signal-Flow Graphs of State Equations

Basil Hamed

40

41 of 53

5.7 Alternative Representations in State Space

In Chapter 3, systems were represented in state space in:

Direct Form

Cascade Form

Parallel Form

system modeling in state space can take on many representations. Although each of these models yields the same output for a given input, an engineer may prefer a particular one for several reasons.

Basil Hamed

41

42 of 53

Example

Basil Hamed

42

Find state space model using parallel form for shown system

Solution

 

43 of 53

5.8 Similarity Transformations

  • we saw that systems can be represented with different state variables even though the transfer function relating the output to the input remains the same. These systems are called similar systems.
  • We can make transformations between similar systems from one set of state equations to another without using the transfer function and signal-flow graphs.

A system represented in state space as

Basil Hamed

43

44 of 53

5.8 Similarity Transformations

can be transformed to a similar system,

Basil Hamed

44

where, for 2 space,

and

45 of 53

Example 5.9 P. 267

PROBLEM: Given the system represented in state space by Eqs.

Basil Hamed

45

transform the system to a new set of state variables, z, where the new state variables are related to the original state variables, x, as follows:

46 of 53

Example 5.9 P. 267

SOLUTION:

Basil Hamed

46

Therefore, the transformed system is

47 of 53

Diagonalizing a System Matrix

  •  

Basil Hamed

47

48 of 53

Diagonalizing a System Matrix

  •  

Basil Hamed

48

 

49 of 53

����Example 5.10 P. 269�

PROBLEM: Find the eigenvectors of the matrix

Basil Hamed

49

 

 

50 of 53

Example 5.10 P. 269

Basil Hamed

50

Using Eq

 

 

 

 

 

 

 

 

 

 

51 of 53

Example 5.11 P 270

PROBLEM: Given the system shown, find the diagonal system that is similar.

Basil Hamed

51

SOLUTION: First find the eigenvalues and the eigenvectors. This step was performed in Example 5.10. Next form the transformation matrix P, whose columns consist of the eigenvectors.

 

52 of 53

Example 5.11 P 270

Basil Hamed

52

diagonal system is

53 of 53

Example

  •  

Basil Hamed

53