state space representation

Slides:



Advertisements
Similar presentations
Feedback loop (CV changes input) SP Controller Gc Plant Gp Sensor Gs E MV (Manipulated Variable CV Controlled Variable +-+- S.
Advertisements

Lecture On Signal Flow Graph
In The Name of Allah The Most Beneficent The Most Merciful 1.
2.7 Signal-Flow Graph models (信号流图模型) Why SFG? Block Diagrams are adequate for representation, but cumbersome. SFG provides the relation between system.
CS2420: Lecture 40 Vladimir Kulyukin Computer Science Department Utah State University.
Taylor Expansion Diagrams (TED): Verification EC667: Synthesis and Verification of Digital Systems Spring 2011 Presented by: Sudhan.
1 Section 8.4 Connectivity. 2 Paths In an undirected graph, a path of length n from u to v, where n is a positive integer, is a sequence of edges e 1,
Modeling & Simulation of Dynamic Systems
Modeling & Simulation of Dynamic Systems
Chapter 4 Graphs.
Block diagrams & Signal flow graphs
Introduction to Block Diagrams
A Complexity Measure THOMAS J. McCABE Presented by Sarochapol Rattanasopinswat.
Lect.5 Reduction of Multiple Subsystems Basil Hamed
1 Chapter 2 We need to write differential equations representing the system or subsystem. Then write the Laplace transform of the system. Then we will.
Chapter 5 Reduction of Multiple Systems Reduction of Multiple Systems.
7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.
Feedback Control Systems (FCS)
Control Engineering Lecture #2 Lecture #2 9 th Sep, th Sep,2009.
Reduction of Multiple Subsystems
Lec 4 . Graphical System Representations and Simplifications
Basic Notions on Graphs. The House-and-Utilities Problem.
State-Space Models Date: 24 th July 2008 Prepared by: Megat Syahirul Amin bin Megat Ali
Automatic Control Theory School of Automation NWPU Teaching Group of Automatic Control Theory.
Chapter 5 Graphs  the puzzle of the seven bridge in the Königsberg,  on the Pregel.
An Introduction to Graph Theory
CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.
2.Mathematical Foundation 2.1 The transfer function concept  From the mathematical standpoint, algebraic and differential or difference equations can.
Biomedical Control Systems (BCS)
 Quotient graph  Definition 13: Suppose G(V,E) is a graph and R is a equivalence relation on the set V. We construct the quotient graph G R in the follow.
Chapter 7 Steady State Error <<<4.1>>>
Figure 5. 1 The space shuttle consists of multiple subsystems
1 Teaching Innovation - Entrepreneurial - Global The Centre for Technology Enabled Teaching & Learning, MGI, India DTEL DTEL (Department for Technology.
Three basic forms G1G1 G2G2 G2G2 G1G1 G1G1 G2G2 G1G1 G2G2 G1G1 G2G2 G1G1 G1G1 G2G2 1+ cascade parallelfeedback.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
Signal Flow Graphs Lect # 06.
Modern Control System EKT 308 Transfer Function Poles and Zeros.
Lecture 3: System Representation
Data Structures & Algorithm Analysis lec(8):Graph T. Souad alonazi
CONTROL SYSTEM ENGINEERING
Teknik kendali.
Chapter 9 (Part 2): Graphs
CSE 373, Copyright S. Tanimoto, 2001 Graphs 1 -
Lec 4 . Graphical System Representations
IC6501 CONTROL SYSTEMS Class : III EEE / V SEMESTER
2. Transfer Function of Closed Loop Control Systems
2. Transfer Function of Closed Loop Control Systems
MASON’S GAIN RULE Summary Motivation Definitions Examples References
SIGNAL FLOW GRAPHS SUBMITTED BY: Mrs. RAMANDEEP KAUR
Reduction of Multiple Subsystems Stability Steady-State Errors
Graph Theory.
Biomedical Control Systems (BCS)
CSE 373, Copyright S. Tanimoto, 2002 Graphs 1 -
Summary 3 Discrete Probability (sections )
Relations vs. Functions Function Notation, & Evaluation
Illustrations In this chapter we describe a general process for designing a control system. A control system consisting of interconnected components is.
SIGNAL FLOW GRAPHS SUBMITTED BY: Mrs. SANDEEP KAUR ASST. PROFESSOR-EEE.
2. Transfer function of closed loop system
SIGNAL FLOW GRAPH.
Homework 1: Electrical System
Control Systems (CS) Signal Flow Graphs Abdul Qadir Ansari, PhD
DiGraph Definitions Adjacency Matrix Adjacency List
Supplement material: Signal-Flow Graphs (SFGs)
Graphs G = (V, E) V are the vertices; E are the edges.
Chapter 1: Introduction to Control Systems
Definition 8: Graphs that have a number assigned to each edge or each vertex are called weighted graphs weighted digraphs.
. Modeling OBJECTIVE Revision on Laplace transform
2. Transfer Function of Closed Loop Control Systems
GRAPHS.
Control System and Transfer Function
Presentation transcript:

state space representation Block Diagrams state space representation transfer function representation Assume that we are only interested in the input-output relation: transfer function Then, a system can be represented by a block with an input and output. One can represent a large system as an interconnection of block diagrams of subsystems. ... gives an insight both in analysis and synthesis.

- + -/+ - + -/+ +

+ - -/+ + + + + -

Reduction Rules of Block Diagrams + + - + + + + -

+ + + + + + - -

+ + + + - -

+ + - -

- + + + + + Find the transfer function by reducing the block diagram!

A block diagram of a circuit is given A block diagram of a circuit is given. Find the transfer function for each block and obtain the transfer function of the block diagram Vd3/Vk!

Signal-Flow Diagram A diagram equivalent to block diagrams. Suitable to apply Mason’s rule – a formula that gives the transfer function. The signal-flow diagram is a directed graph (digraph) set of vertices set of edges with weights on edges, which represent gains (transfer functions) between components inputs and outputs.

Reduction of Signal-Flow Diagrams x1 x2 a x1 x2 a1 x3 a2 x1 x3 a1 a2 x1 x2 a b x1 x2 a+b x3 x4 c x2 a x1 b x4 x2 a x1 ac bc

x1 x2 a x3 b c x1 x3 x1 ab x3 bc x1 a x4 x2 x3 d b c e x1 a x4 x2 x3 e

Block Diagrams vs. Signal-Flow Diagrams G(s) R(s) C(s) R(s) C(s) G(s) R(s) E(s) 1 C(s) G(s) -1 G(s) R(s) C(s) E(s) + - Mason’s Rule Aim: To find the transfer function directly from the diagram without any reduction.

Definitions: Path: A subgraph GP of the graph G is called a path if it contains n edges and n+1 vertices, one can label its edges as e1, e2, ...,en and its vertices as v1,v2, ....,vn+1 such that the edge ek points from vk to vk+1. Path gain: The product of gains along a path. Loop: A subgraph GL of the graph G is called a loop if it contains n edges and n vertices, one can label its edges as e1, e2, ...,en and its vertices as v1,v2, ....,vn such that the edge ek points from vk to vk+1(mod n). Loop gain: The product of gains along a loop. Determinant of a (sub)graph: loop gains products of loop gains for disjoint loop pairs products of loop gains for disjoint loop triples

Mason’s Rule For a signal-flow diagram the transfer function between the input and output vertices is given by Gain of the k. path Determinant of the subgraph obtained by deleting the k. path Determinant of the whole diagram