Control Systems (CS)

Similar documents
SFG and Mason s Rule : A revision

J א א J א א א F א א א א

CHAPTER 5 : REDUCTION OF MULTIPLE SUBSYSTEMS

Control Systems, Lecture 05

Karadeniz Technical University Department of Electrical and Electronics Engineering Trabzon, Turkey

Name: Partners: PreCalculus. Review 5 Version A

1 Locally computable randomized encodings

Polynomial Review Problems


Polynomial Functions

Precalculus Lesson 4.1 Polynomial Functions and Models Mrs. Snow, Instructor

SECTION 2: BLOCK DIAGRAMS & SIGNAL FLOW GRAPHS

Math 2: Algebra 2, Geometry and Statistics Ms. Sheppard-Brick Chapter 4 Test Review

directed weighted graphs as flow networks the Ford-Fulkerson algorithm termination and running time

Physics 7B-1 (A/B) Professor Cebra. Winter 2010 Lecture 2. Simple Circuits. Slide 1 of 20

Using Mason's Rule to Analyze DSP Networks

CONTROL SYSTEMS LECTURE NOTES B.TECH (II YEAR II SEM) ( ) Prepared by: Mrs.P.ANITHA, Associate Professor Mr.V.KIRAN KUMAR, Assistant Professor

Identifying the Graphs of Polynomial Functions

dt 2 The Order of a differential equation is the order of the highest derivative that occurs in the equation. Example The differential equation

Functions and Equations

Partial Fraction Decomposition

MATHEMATICAL MODELING OF DYNAMIC SYSTEMS

EC Control Systems- Question bank

CHAPTER # 9 ROOT LOCUS ANALYSES

IM3H More Final Review. Module Find all solutions in the equation in the interval [0, 2π).

Formulas that must be memorized:

DRAFT - Math 101 Lecture Note - Dr. Said Algarni

R10 JNTUWORLD B 1 M 1 K 2 M 2. f(t) Figure 1

Quartic Equation. By CH vd Westhuizen A unique Solution assuming Complex roots. Ax^4 + Bx^3 + Cx^2 + Dx + E = 0

Unit 2 Rational Functionals Exercises MHF 4UI Page 1

Limits: An Intuitive Approach

6.3 Partial Fractions

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

LECTURE 16 GAUSS QUADRATURE In general for Newton-Cotes (equispaced interpolation points/ data points/ integration points/ nodes).

Announcements. Topics: Homework: - sections , 6.1 (extreme values) * Read these sections and study solved examples in your textbook!

2.004 Dynamics and Control II Spring 2008


Tropical Polynomials

Lecture Notes in Mathematics. Arkansas Tech University Department of Mathematics. The Basics of Linear Algebra

Section 3.5: Implicit Differentiation

11.2 The Quadratic Formula

Mini-Lesson 9. Section 9.1: Relations and Functions. Definitions

x 4 D: (4, ); g( f (x)) = 1

CHAPTER 2 POLYNOMIALS KEY POINTS

CS21 Decidability and Tractability

MTH310 EXAM 2 REVIEW

( 3) ( ) ( ) ( ) ( ) ( )

Use a graphing utility to approximate the real solutions, if any, of the equation rounded to two decimal places. 4) x3-6x + 3 = 0 (-5,5) 4)

f (x) = x 2 Chapter 2 Polynomial Functions Section 4 Polynomial and Rational Functions Shapes of Polynomials Graphs of Polynomials the form n

Control Systems. Frequency Method Nyquist Analysis.

Integration of Rational Functions by Partial Fractions

KINGS COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

Section 4.4 Functions. CS 130 Discrete Structures

MA 109 College Algebra EXAM 3 - REVIEW

CONTROL SYSTEMS. Chapter 2 : Block Diagram & Signal Flow Graphs GATE Objective & Numerical Type Questions

Core Mathematics 3 Algebra

EconS 301. Math Review. Math Concepts

MATH 104: INTRODUCTORY ANALYSIS SPRING 2008/09 PROBLEM SET 8 SOLUTIONS

AP Calculus Chapter 3 Testbank (Mr. Surowski)

Function Junction: Homework Examples from ACE

Lecture Notes on DC Network Theory

Integration of Rational Functions by Partial Fractions

MS 2001: Test 1 B Solutions

, a 1. , a 2. ,..., a n

4.2: What Derivatives Tell Us

f ', the first derivative of a differentiable function, f. Use the

Section 5. Graphing Systems

Fundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved

PreCalculus: Semester 1 Final Exam Review

Chapter 2: Inequalities, Functions, and Linear Functions

What is on today. 1 Linear approximation. MA 123 (Calculus I) Lecture 17: November 2, 2017 Section A2. Professor Jennifer Balakrishnan,

Integer programming: an introduction. Alessandro Astolfi

y = 7x 2 + 2x 7 ( x, f (x)) y = 3x + 6 f (x) = 3( x 3) 2 dy dx = 3 dy dx =14x + 2 dy dy dx = 2x = 6x 18 dx dx = 2ax + b

Control Systems. University Questions

Team Solutions. November 19, qr = (m + 2)(m 2)

17 Exponential and Logarithmic Functions

MATHEMATICAL MODELING OF CONTROL SYSTEMS

Composition of Functions

2.6 Logarithmic Functions. Inverse Functions. Question: What is the relationship between f(x) = x 2 and g(x) = x?

1 EM Primer. CS4786/5786: Machine Learning for Data Science, Spring /24/2015: Assignment 3: EM, graphical models

1 Wyner PreCalculus Fall 2013

Lecture 4: Optimization. Maximizing a function of a single variable

CS 373: Theory of Computation. Fall 2010

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. A) 6 B) 14 C) 10 D) Does not exist

Study Guide - Part 2

Mathematics for Business and Economics - I. Chapter 5. Functions (Lecture 9)

. As x gets really large, the last terms drops off and f(x) ½x

Lecture 9 4.1: Derivative Rules MTH 124

Automatic Control Systems (FCS) Lecture- 8 Steady State Error

A quadratic expression is a mathematical expression that can be written in the form 2

Math123 Lecture 1. Dr. Robert C. Busby. Lecturer: Office: Korman 266 Phone :

1. The accumulated net change function or area-so-far function

Calculus I Sample Exam #01

1.5 F15 O Brien. 1.5: Linear Equations and Inequalities

Two Applications of Maximum Flow

Given the table of values, determine the equation

March Algebra 2 Question 1. March Algebra 2 Question 1

Calculus The Mean Value Theorem October 22, 2018

NETWORK THEORY (BEES2211)

Section 1.4 Circles. Objective #1: Writing the Equation of a Circle in Standard Form.

Transcription:

Control Systems (CS) Lecture-0- Signal Flow raphs Dr. Imtiaz ussain Associate Professor Mehran University of Engineering & Technology Jamshoro, Pakistan email: imtiaz.hussain@faculty.muet.edu.pk URL :http://imtiazhussainkalwar.weebly.com/

Outline Introduction to Signal Flow raphs Definitions Terminologies Examples Mason s ain Formula Examples Signal Flow raph from Block Diagrams Design Examples

Introduction Alternative method to block diagram representation, developed by Samuel Jefferson Mason. Advantage: the availability of a flow graph gain formula, also called Mason s gain formula. A signal-flow graph consists of a network in which nodes are connected by directed branches. It depicts the flow of signals from one point of a system to another and gives the relationships among the signals.

Fundamentals of Signal Flow raphs Consider a simple equation below and draw its signal flow graph: y The signal flow graph of the equation is shown below; ax x a y Every variable in a signal flow graph is designed by a Node. Every transmission function in a signal flow graph is designed by a Branch. Branches are always unidirectional. The arrow in the branch denotes the direction of the signal flow. 4

Signal-Flow raph Models Y ( s) ( s) R ( s) ( s) R ( s) Y ( s) ( s) R ( s) ( s) R ( s) 5

Signal-Flow raph Models r and r are inputs and x and x are outputs a x a x r x a x a x r x 6

Signal-Flow raph Models x o is input and x 4 is output x x x x 4 ax dx fx hx 0 0 bx ex gx cx x 0 a b f x c d x g e x h x 4 7

Construct the signal flow graph for the following set of simultaneous equations. There are four variables in the equations (i.e., x,x,x,and x 4 ) 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. Another way to arrange this graph is shown in the figure. 8

Terminologies An input node or source contain only the outgoing branches. i.e., X An output node or sink contain only the incoming branches. i.e., X 4 A path is a continuous, unidirectional succession of branches along which no node is passed more than ones. i.e., X to X to X to X 4 X to X to X 4 X to X to X 4 A forward path is a path from the input node to the output node. i.e., X to X to X to X 4, and X to X to X 4, are forward paths. A feedback path or feedback loop is a path which originates and terminates on the same node. i.e.; X to X and back to X is a feedback path. 9

Terminologies A self-loop is a feedback loop consisting of a single branch. i.e.; A is a self loop. The gain of a branch is the transmission function of that branch. The path gain is the product of branch gains encountered in traversing a path. i.e. the gain of forwards path X to X to X to X 4 is A A A 4 The loop gain is the product of the branch gains of the loop. i.e., the loop gain of the feedback loop from X to X and back to X is A A. Two loops, paths, or loop and a path are said to be non-touching if they have no nodes in common. 0

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 There are two forward path gains;

Consider the signal flow graph below and identify the following There are four loops

Consider the signal flow graph below and identify the following Nontouching loop gains; 4

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. 5

Input and output Nodes a) Input node b) Output node 6

(c) Forward Paths 7

(d) Feedback Paths or Loops 8

(d) Feedback Paths or Loops 9

(d) Feedback Paths or Loops 0

(d) Feedback Paths or Loops

(e) Self Loop(s)

(f) Loop ains of the Feedback Loops

(g) Path ains of the Forward Paths 4

Mason s Rule (Mason, 95) 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. 5

Mason s Rule: The transfer function, C(s)/R(s), of a system represented by a signal-flow graph is; n P i i i C( s) Where R( s) n = number of forward paths. P i = the i th forward-path gain. = Determinant of the system i = Determinant of the i th forward path is called the signal flow graph determinant or characteristic function. Since =0 is the system characteristic equation. 6

Mason s Rule: n P C( s) i i R( s) = - (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 = if there are no non-touching loops to the i-th path.) i 7

Systematic approach. Calculate forward path gain P i for each forward path i.. Calculate all loop transfer functions. Consider non-touching loops at a time 4. Consider non-touching loops at a time 5. etc 6. Calculate Δ from steps,,4 and 5 7. Calculate Δ i as portion of Δ not touching forward path i 8

Example#: Apply Mason s Rule to calculate the transfer function of the system represented by following Signal Flow raph Therefore, There are three feedback loops C R P P L 4, L 4, L 4 9

Example#: Apply Mason s Rule to calculate the transfer function of the system represented by following Signal Flow raph There are no non-touching loops, therefore = - (sum of all individual loop gains) L L L 4 4 4 0

Example#: Apply Mason s Rule to calculate the transfer function of the system represented by following Signal Flow raph Eliminate forward path- = - (sum of all individual loop gains)+... = Eliminate forward path- = - (sum of all individual loop gains)+... =

Example#: Continue

Example#: Apply Mason s Rule to calculate the transfer function of the system represented by following Signal Flow raph P P. Calculate forward path gains for each forward path. P (path ) and P 567 8 4 (path ). Calculate all loop gains. L, L, L, 6 6 4 77 L. Consider two non-touching loops. L L L L 4 L L 4 L L

4. Consider three non-touching loops. None. 5. Calculate Δ from steps,,4. 4 4 4 L L L L L L L L L L L L 4 7 7 6 6 7 7 6 6 7 7 6 6 Example#: continue

5 Example#: continue Eliminate forward path- 4 L L L L Eliminate forward path- 7 7 6 6

P P s R s Y ) ( ) ( 6 Example#: continue 7 7 6 6 7 7 6 6 7 7 6 6 8 7 6 5 7 7 6 6 4 s R s Y ) ( ) (

Example# Find the transfer function, C(s)/R(s), for the signal-flow graph in figure below. 7

Example# There is only one forward Path. P ( s) ( s) ( s) 4( s) 5( s) 8

Example# There are four feedback loops. 9

Example# Non-touching loops taken two at a time. 40

Example# Non-touching loops taken three at a time. 4

Example# Eliminate forward path- 4

Example#4: Apply Mason s Rule to calculate the transfer function of the system represented by following Signal Flow raph P P P P s R s C i i i ) ( ) ( There are three forward paths, therefore n=. 4

Example#4: Forward Paths P A A A 4 54 65A76 P A A A A 4 54 65A76 P A 7 44

Example#4: Loop ains of the Feedback Loops L A A A4A4 L L A 54A45 L A 4 65A56 L A 5 76A67 L6 A 77 L A A 7 4 4A L A A 8 65 76A67 L L 9 A7A57A45A4A 0 A7A67A56A45A4A 45

Example#4: two non-touching loops L L L L 4 L L 5 L L 6 L L 4 L L 5 L L 6 L L 8 L L 5 L 4 L 6 7 L L 6 L 4 L 7 L 5 L L 7 L 8 L L 8 46

Example#4: Three non-touching loops L L L L 4 L L 5 L L 6 L L 4 L L 5 L L 6 L L 8 L L 5 L 4 L 6 7 L L 6 L 4 L 7 L 5 L L 7 L 8 L L 8 47

From Block Diagram to Signal-Flow raph Models Example#5 R(s) E(s) X - X - X - 4 C(s) R(s) - E(s) X X X 4 C(s) - - 48

; ) ( 4 4 4 P 4 4 4 ) ( ) ( s R s C R(s) - 4 C(s) - - X X X E(s) From Block Diagram to Signal-Flow raph Models Example#5 49

Example#6 R(s) - E(s) - - + - - X X Y + Y + C(s) X - - R(s) E(s) C(s) X Y - Y - - 50

Example#6 - - R(s) E(s) C(s) X Y 7 loops: X - - - Y non-touching loops : 5

Example#6 X - - R(s) E(s) C(s) X Y - - - Y Then: Δ 4 4 forward paths: p ( ) p ( ) ( ) Δ p Δ p4 Δ4 Δ 5

Example#6 We have C( s) R( s) pk k 4 5

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. There are two forward paths. The path gains are The three feedback loop gains are No loops are non-touching, hence Because the loops touch the nodes of P, hence ence the control ratio T = C/R is Since no loops touch the nodes of P, therefore 54

Example-6: Find the control ratio C/R for the system given below. The signal flow graph is shown in the figure. The two forward path gains are The five feedback loop gains are There are no non-touching loops, hence All feedback loops touches the two forward paths, hence ence the control ratio T = 55

Design Example# V ( s) I( s) I( s) R Cs V s) I ( s) R ( CsV ( s) CsV( s) I( s) Cs Cs R V (s) (s) I V (s) 56

Design Example# F Ms X k( X X ) 0 M s X k( X X) k X 57

Design Example# 58

Design Example# 59

To download this lecture visit http://imtiazhussainkalwar.weebly.com/ END OF LECTURES-0-60