REGLERTEKNIK AUTOMATIC CONTROL LINKÖPING

Similar documents
Modeling of Dynamic Systems: Notes on Bond Graphs Version 1.0 Copyright Diane L. Peters, Ph.D., P.E.

ENGI9496 Modeling and Simulation of Dynamic Systems Bond Graphs

Electrical and Magnetic Modelling of a Power Transformer: A Bond Graph Approach

REGLERTEKNIK AUTOMATIC CONTROL LINKÖPING

Residual Bond Graph Sinks for Numerical Evaluation of Analytical Redundancy Relations in Model Based Single Fault Detection and Isolation

Abstract. 1 Introduction. 2 Tearing TEARING IN BOND GRAPHS WITH DEPENDENT STORAGE ELEMENTS

Alternative Causality Assignment Procedures in Bond Graph for Mechanical Systems

A relaxation of the strangeness index

EFFICIENT SIMULATION OF HYBRID SYSTEMS: AN APPLICATION TO ELECTRICAL POWER DISTRIBUTION SYSTEMS

MAS601 Design, Modeling & Simulation. Day 2

ENGI9496 Lecture Notes State-Space Equation Generation

REGLERTEKNIK AUTOMATIC CONTROL LINKÖPING

CONSTITUTIVE HYBRID PROCESSES

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 6 Mathematical Representation of Physical Systems II 1/67

ECE2262 Electric Circuit

7.3 State Space Averaging!

LS.1 Review of Linear Algebra

Aircraft Pitch Attitude Control Using Backstepping


3.4 Elementary Matrices and Matrix Inverse

An efficient implementation of gradient and Hessian calculations of the coefficients of the characteristic polynomial of I XY

Basic RL and RC Circuits R-L TRANSIENTS: STORAGE CYCLE. Engineering Collage Electrical Engineering Dep. Dr. Ibrahim Aljubouri

7.6 The Inverse of a Square Matrix

Chapter 2 Notes, Linear Algebra 5e Lay

2005 AP PHYSICS C: ELECTRICITY AND MAGNETISM FREE-RESPONSE QUESTIONS

Qualitative Dynamic Behavior of Physical System Models With Algebraic Loops

Model reduction in the physical domain

MAT 1332: CALCULUS FOR LIFE SCIENCES. Contents. 1. Review: Linear Algebra II Vectors and matrices Definition. 1.2.

REGLERTEKNIK AUTOMATIC CONTROL LINKÖPING

Lecture 9: Elementary Matrices

Matrix Algebra. Learning Objectives. Size of Matrix

PARAMETERIZATION OF STATE FEEDBACK GAINS FOR POLE PLACEMENT

MasteringPhysics: Assignment Print View. Problem 30.50

Linear Regression and Its Applications

(amperes) = (coulombs) (3.1) (seconds) Time varying current. (volts) =

From Electrical Switched Networks to Hybrid Automata. Alessandro Cimatti 1, Sergio Mover 2, Mirko Sessa 1,3

MA 138 Calculus 2 with Life Science Applications Matrices (Section 9.2)

Hybrid Simulation of Qualitative Bond Graph Model

Conceptual Questions for Review

Chapter 27. Circuits

AC&ST AUTOMATIC CONTROL AND SYSTEM THEORY SYSTEMS AND MODELS. Claudio Melchiorri

A Software of Generating a Symbolic Circuit Model with Computers for Wireless Power Transmission System

Backstepping Designs for Aircraft Control What is there to gain?

Analysis of the regularity, pointwise completeness and pointwise generacy of descriptor linear electrical circuits

Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 3 : Analytical Solutions of Linear ODE-IVPs

AP Physics C. Electric Circuits III.C

Matrix Arithmetic. (Multidimensional Math) Institute for Advanced Analytics. Shaina Race, PhD

output H = 2*H+P H=2*(H-P)

Circuit theory for unusual inductor behaviour

Knowledge Discovery and Data Mining 1 (VO) ( )

REGLERTEKNIK AUTOMATIC CONTROL LINKÖPING

REGLERTEKNIK AUTOMATIC CONTROL LINKÖPING

Bond Graphs. Peter Breedveld University of Twente, EWI/CE, P.O. Box 217, 7500 AE Enschede, Netherlands,

Factorization of singular integer matrices

Computation of a canonical form for linear differential-algebraic equations

Representation of a general composition of Dirac structures

THERE are numerous number of products powered by

Computing Phase Noise Eigenfunctions Directly from Steady-State Jacobian Matrices

Physics 102 Spring 2006: Final Exam Multiple-Choice Questions

Eects of small delays on stability of singularly perturbed systems

Lectures on Linear Algebra for IT

Math 240 Calculus III

First-order transient

Math Camp Notes: Linear Algebra I

EC Control Systems- Question bank

AC vs. DC Circuits. Constant voltage circuits. The voltage from an outlet is alternating voltage

12. Perturbed Matrices

Kevin James. MTHSC 3110 Section 2.2 Inverses of Matrices

INRIA Rocquencourt, Le Chesnay Cedex (France) y Dept. of Mathematics, North Carolina State University, Raleigh NC USA

Numerical Methods Lecture 2 Simultaneous Equations

The norms can also be characterized in terms of Riccati inequalities.

Lesson 3. Inverse of Matrices by Determinants and Gauss-Jordan Method

Switched Mode Power Conversion Prof. L. Umanand Department of Electronics Systems Engineering Indian Institute of Science, Bangalore

M. C. Escher: Waterfall. 18/9/2015 [tsl425 1/29]

Graphing Linear Inequalities

Physics 212 Midterm 2 Form A

3.3. SYSTEMS OF ODES 1. y 0 " 2y" y 0 + 2y = x1. x2 x3. x = y(t) = c 1 e t + c 2 e t + c 3 e 2t. _x = A x + f; x(0) = x 0.

VII Selected Topics. 28 Matrix Operations

2.004 Dynamics and Control II Spring 2008

Math 2331 Linear Algebra

Vector Space Basics. 1 Abstract Vector Spaces. 1. (commutativity of vector addition) u + v = v + u. 2. (associativity of vector addition)

RC Circuits (32.9) Neil Alberding (SFU Physics) Physics 121: Optics, Electricity & Magnetism Spring / 1

AP Physics C Mechanics Objectives

Total 170. Name. Final Examination M340L-CS

THE USE OF ROBUST OBSERVERS IN THE SIMULATION OF GAS SUPPLY NETWORKS

Gabriel Kron's biography here.

Notes on Dantzig-Wolfe decomposition and column generation

MEM 255 Introduction to Control Systems: Modeling & analyzing systems

ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3

Examples: u = is a vector in 2. is a vector in 5.

Modeling & Simulation 2018 Lecture 12. Simulations

Linear Algebra The Inverse of a Matrix

Linear graph theory. Basic definitions of linear graphs

Version 001 CIRCUITS holland (1290) 1

1. Introduction As is well known, the bosonic string can be described by the two-dimensional quantum gravity coupled with D scalar elds, where D denot

Systems of Linear ODEs

Symmetric matrices and dot products

文件中找不不到关系 ID 为 rid3 的图像部件. Review of LINEAR ALGEBRA I. TA: Yujia Xie CSE 6740 Computational Data Analysis. Georgia Institute of Technology

Chapter 2. Matrix Arithmetic. Chapter 2

Solutions of Linear system, vector and matrix equation

Transcription:

Generating state space equations from a bond graph with dependent storage elements using singular perturbation theory. Krister Edstrom Department of Electrical Engineering Linkoping University, S-58 83 Linkoping, Sweden WWW: http://www.control.isy.liu.se Email: edstrom@isy.liu.se August 25, 998 REGLERTEKNIK AUTOMATIC CONTROL LINKÖPING Report no.: LiTH-ISY-R-25 Submitted to ICBGM'99 Technical reports from the Automatic Control group in Linkoping are available by anonymous ftp at the address ftp.control.isy.liu.se. This report is contained in the compressed postscript le 25.ps.Z.

Generating state space equations from a bond graph with dependent storage elements using singular perturbation theory. Krister Edstrom (edstrom@isy.liu.se) Dept. of Electrical Engineering Linkopings Universitet SE-58 83 Linkoping, Sweden Introduction It is well known that when allowing derivative causality in a bond graph, the generated mathematical description will be a DAE [5] (Dierential Algebraic Equation) as a mathematical description. For simulation purposes this is in most cases a suitable description. There is however a well developed theory for ODE:s (Ordinary Dierential Equations) in state space form. The ODE:s can be used to, e.g., analyze, or construct a controller for, the system. When generating a state space description from a bond graph without any derivative causality [5], algebraic loops or causal loops, the states have clear physical interpretations. For an I-element in the mechanical domain, the state is the momentum of the mass, and for a C-element in the electrical domain, the state is the charge of the capacitor. When generating a state space description from a bond graph with derivative causality, there should still be a physical interpretation. When the derivative causality is generated by two masses that are stiy connected, the state variable in a generated state space description should be the total momentum of the two masses. In this paper we will consider the derivative causality as a consequence of simplifying the model by neglecting energy dissipation. If the energy dissipation is small enough, it is a natural model simplication to remove it from the model. To allow generation of a state space description from a bond graph with connected storage elements, we will rst add the energy dissipation in the bond graph using a linear R-element. The dissipation will then be removed from the mathematical description by letting the value of the parameter in the constitutive relation of the R-element tend to zero. There exist methods for generating a state space description from a bond graph [4]. The method presented here have two properties that make it interesting: First there is a physical interpretation of the generated states, and second it relies on an interpretation of the dependency of the storage elements as the connection between the storage elements containing energy dissipation that tends to zero.

2 Singular perturbations In a singular perturbation framework [3] it is possible to study a system where the dynamics have two dierent time scales. A linear systems that is singularly perturbed can be expressed in the following form: _(t) _x(t) A () A 2 () A 2 () A 22 () (t) x(t) () When the value of the parameter becomes very small, the states in will have a signicantly smaller time constant than the states in x. By letting go to zero, the time constant of will go to zero. When looking at the step response of the system, will reach its steady state before x changes value, assuming that is very small. The singular perturbed model is in standard form if det A () 6. If the system is in standard form it can for be rewritten as: A () A 2 () _x(t) A 2 () A 22 () x(t) ) (2) (t) (t) _x(t) x(t)?a? ()A 2() A 22 ()? A 2 ()A? ()A 2() By assigning, the state space is reduced, and we get a DAE description of the system. As seen in Equation (2) it is possible to rewrite the equations in state space form with as an output variable if det A () 6. 3 Generating the state space description The generation of a state space description is done in ve steps as shown below. The described procedure handles one C-element with derivative causality, denoted by s, but the method can be extended to hold for I-elements, and for multiple elements with derivative causality. The bond graph is assumed to be nice, meaning that it should include no other storage elements with derivative causality, no algebraic loops and no causal loops.. Start with the bond graph with dependent storage elements. Add an R-element to relax the derivative causality. If s is connected to a -junction it is necessary to add a -junction as well. When the derivative causality is relaxed, the number of states increases with one. Let the value of the parameter in the linear constitutive relation of the R-element be. 2. Derive a state space description using SCAP [2]. _x Ax + Bu This is possible due to our assumption about a nice bond graph, since this assumptions implies that there are no zero-order causal paths (paths between storage elements or between R-elements or causal loops) or elements with derivative causality in the bond graph [5]. 3. Generate a transformation matrix T from the bond graph with derivative causality: T x T is found using a standard bond graph equation generation algorithm along the causal paths between the storage element with derivative causality and other storage elements. The generation of the transformation matrix is described more in detail in Section 4.. 2

4. Perform the change of basis of the state space description: where _ A + Bu A T AT? ; B T B Multiply the rst row by. The resulting state space description will have the following form where A; is invertible, see Section 4: A; + A ; A; A ; A; + B B u 5. Let!. _ A; A ; A; + B u Since A; is invertible we can according to Equation (2) replace with in the last n? equations: _ A; + B u (3) The resulting state space equations describe the dynamics of the bond graph with derivative causality. 4 Details and proofs In this section some details in the algorithm are explored. A theorem and a lemma stating some the results are formulated, but the proofs are left out and can be found in []. 4. Generation of a transformation matrix Here we will take a closer look at step 3 in the algorithm in Section 3. To generate the T matrix, we will use the bond graph in which the dependent storage elements are, i.e., the bond graph without the additional R-element. We will assume that the number of storage elements in the bond graph is n. An algorithm for generating T will look like this:. Propagate causality in the bond graph. 2. Find all storage elements that are connected to the storage element with derivative causality, s, by causal paths. Assume that there are l such storage elements, s included. Consider only the part of the bond graph connecting these elements. 3. Derive an equation x a 2 x 2 + : : : + a l x l, where x is the state variable in the constitutive relation for s and x 2 ; : : : ; x l are state variables belonging to constitutive relations for the other storage elements. Use a standard bond graph equation generation algorithm. Rewrite the equation as: x? a 2 x 2? : : :? a l x l (4) 3

4. Derive l? equations relating the rates of the state variables: _x ; : : : ; _x l : _x j j _x ; j 2; : : : ; l (5) This is also done with a standard bond graph equation generation algorithm. Rewrite the equations as _x j? j _x ; j 2; : : : ; l (6) and integrate: x j? j x ; j 2; : : : ; l (7) 5. Let the coecients in left hand sides of Equations (4) and (8) form a matrix T : T B @ a 2 a 3 : : : a l? : : :? 2 : : :.......? l : : : C A (8) 6. Extend T with an identity matrix to get a matrix T of dimension n, the number of storage elements in the bond graph: T T (9) I To show that T is of full rank we have the following lemma: Lemma If the bond graph has no algebraic loops, no causal loops and one storage element with derivative causality that is dependent of one or several other storage elements, then the following statement holds: T is invertible if we assume that at each C-element the energy half-arrow points towards the C-element. Proof: See []. 4.2 A state space form after the change of basis After the change of basis with the transformation matrix it will be clear that the system is a singular perturbed system in standard form. Theorem Let the bond graph have no algebraic loops, no causal loops and one storage element with derivative causality that is dependent of one or several other storage elements. Derive the state space description from the bond graph with the added R-element. _x Ax + Bu () Derive the matrix T from the bond graph without the R-element. Perform the change of basis to get a new state space description: _ A + Bu; where T x () 4

Hence A T AT? ; and B T B (2) If multiplying the rst row in Equation (), the structure of the matrices A; + A A ; A; A ; A; and B A and B will be the following: B B u (3) where A; 6. Proof: See []. Since A; 6 it is clear that the system is singular perturbed and in standard form. 5 Example We will derive a state space description from the bond graph in Figure. R C Se C 2 Figure : A bond graph example. The rst step is to introduce an R-element according to Figure 2. Its constitutive relation is assumed to be linear with parameter. R C Se C 2 R 2 Figure 2: The bond graph with causality relaxed by an R-element. Derive a state space description from the bond graph in Figure 2 using SCAP: _x _x 2? +r rc? c x x 2 + r x and x 2 are the states in the constitutive relations for the two C-elements and u is the eort given by the Se -element. u 5

Derive equations in both directions along the causal path between the two C-elements in Figure. x 2 c 2 c x _x? _x 2 Introduce two new state variables using the derived equations. c 2 c x? x 2 2 x + x 2 The transformation matrix is then: T c? Change the basis, and multiply the rst row with : A? c 2 2 + 2 r+2cr+ r c(c+)r c(c+)r?? (c+)r (c+)r! ; B cr r Let! : _ 2? c+ c?? (c+)r (c+)r + u 2 r The state space description is thus _ 2? 2 + u (c + c 2 )r r There is a physical interpretation of the new state variable. If the bond graph models an electrical circuit, the causal path between the two C-elements shows that there are two capacitors connected in parallel. The two capacitors will behave as one with capacitance c + c 2 and with a state variable that describes the sum of the charges. This is exactly the structure of the state space equation above. References [] K. Edstrom. Singular perturbation analysis of a mode initialization algorithm for simulating mode switching system, long version. Technical report, Linkopings Universitet, 998. [2] D.C. Karnopp, D.L. Margolis, and R.C. Rosenberg. System dynamics, A unied approach. Wiley Interscience, 99. [3] P. Kokotovic, H.K. Khalil, and J. O'Reilly. Singular perturbation methods in control: Analysis and design. Academic Press, 986. [4] A. Rahmani and G. Dauphin-Tangui. Symbolic determination of state matrices from bond graph model with derivative causality. In Proc. of Computational Engineering in System Applications. IMACS, 998. [5] J. van Dijk. On the role of bond graph causality in modelling mechatronic systems. PhD thesis, University of Twente, 994. 6