State Space Analysis Study notes For EE/EC

By Yash Bansal|Updated : May 2nd, 2021

In this article, you will find the study notes on State Space Analysis which will cover the topics such as State, State Equation, Output Equation, Block Diagram Representation of Linear Systems, Transformation from Classical Form to State-Space Representation Closed Loop System, State Transition Matrix, Property of STM Controllability & Observability.

In this article, you will find the study notes on State Space Analysis which will cover the topics such as State, State Equation, Output Equation, Block Diagram Representation of Linear Systems, Transformation from Classical Form to State-Space Representation Closed Loop System, State Transition Matrix, Property of STM Controllability & Observability.

The so-called state-space description provide the dynamics as a set of coupled first-order differential equations in a set of internal variables known as state variables, together with a set of algebraic equations that combine the state variables into physical output variables.

State: The state of a dynamic system refers to a minimum set of variables, known as state variables, that fully describe the system.

  • A mathematical description of the system in terms of a minimum set of variables,xi(t), i = 1,...,n, together with knowledge of those variables at an initial time t0,and the system inputs for time t ≥ t0, are sufficient to predict the future system state and outputs for all time t>t0.

byjusexamprep

  • The dynamic behavior of a state-determined system is completely characterized by the response of the set of n variables Xi(t), where the number n is defined to be the order of the system.
  • The system Shown in the above figure has two inputs u1(t) and u2(t), and four output variables y1(t),...,y4(t). If the system is state-determined, knowledge of its state variables (x1(t0), x2(t0),... xn(t0)) at some initial time t0and the inputs u1(t) and u2(t) for t ≥ t0 is sufficient to determine all future behavior of the system.
  • The state variables are an internal description of the system which completely characterize the system state at any time t, and from which any output variables yi(t) may be computed.

The State Equations

In the standard mathematical form of the system is expressed as a set of n coupled first-order ordinary differential equations, known as the state equations, in which the time derivative of each state variable is expressed in terms of the state variables x1(t),...,xn(t) and the system inputs u1(t),...,ur(t). In the general case the form of the n state equations is:

byjusexamprep

  • where  byjusexamprep= dxi/dt and each of the functions fi (x, u, t), (i = 1,...,n) may be a general nonlinear, time varying function of the state variables, the system inputs, and time.
  • It is common to express the state equations in a vector form, in which the set of n state variables is written as a state vector x(t)=[x1(t), x2(t),...,xn(t)]T, and the set of r inputs is written as an input vector u(t)=[u1(t), u2(t),...,ur(t)]T. Each state variable is a time varying component of the column vector x(t).
  • In vector notation the set of n equations in Equations. (1) may be written

byjusexamprep

       where f (x, u, t) is a vector function with n components fi (x, u, t).     

byjusexamprep

     where the coefficients aij and bij are constants that describe the system.

Last equation can be written in matrix form as below

byjusexamprep

which may be summarized as:

byjusexamprep

  • Where state vector x is a column vector of length n, the input vector u is a column vector of length r, A is an n × n square matrix of the constant coefficients aij , and B is an n × r matrix of the coefficients bij that weight the inputs.

Output Equations

A system output is defined to be any system variable of interest. An arbitrary output variable in a system of order n with r inputs may be written as


y(t) = c1x1 + c2x2 + ... + cnxn + d1u1 + ... + drur

where the ci and di are constants. If a total of m system variables are defined as outputs, then the output equation can also be obtained as State Equation in compact form

y = Cx + Du

  • where y is a column vector of the output variables yi(t), C is an m×n matrix of the constant coefficients cij that weight the state variables, and D is an m × r matrix of the constant coefficients dij that weight the system inputs.
  • For many physical systems the matrix D is the null matrix, and the output equation reduces to a simple weighted combination of the state variable

if D= 0 ; then   Y = Cx

Block Diagram Representation of Linear Systems Described by State Equations

A system of order n has n integrators in its block diagram. The derivatives of the state variables are the inputs to the integrator blocks, and each state equation expresses a derivative as a sum of weighted state variables and inputs. A detailed block diagram representing a system of order n may be constructed directly from the state and output equations as follows:

byjusexamprep

  • Draw n integrator (s−1) blocks, and assign a state variable to the output of each block.
  • At the input to each block (which represents the derivative of its state variable) draw a summing element.
  • Use the state equations to connect the state variables and inputs to the summing elements through scaling operator blocks.
  • Expand the output equations and sum the state variables and inputs through a set of scaling operators to form the components of the output.

Example: Draw a block diagram for the general second-order, single-input single-output system

byjusexamprep

block diagram shown below is drawn using the four steps described above

byjusexamprep

Transformation from Classical Form to State-Space Representation

Let the differential equation representing the system be of order n, and without loss of generality assume that the order of the polynomial operators on both sides is the same.

(ansn + an−1sn−1+ ··· + a0)Y(s) = (bnsn + bn−1sn−1 + ··· + b0)U(s)

  • We may multiply both sides of the equation by s−n to ensure that all differential operators have been eliminated


an+ an−1s−1 + ··· + a1s−(n−1) + a0s−nY(s) =bn+bn−1s−1 + ··· + b1s−(n−1)+ ··· + b0s−nU(s)

from which the output may be specified in terms of a transfer function. If we define a dummy variable Z(s), and split into two parts

byjusexamprep

Eq. of Z(s) can ne be solved for U(s)

U(s) = (an + an−1s−1 + ··· + a1s−(n−1) + a0s−nX(s)

 

State-Space and Transfer Function

The state equation form

 byjusexamprep 

 can be transformed into transfer function.

Tanking the Laplace transform and neglect initial condition then

sX(s)- X(0) = AX(s)+BU(s)

y(s) = CX(s) + DU(s)

then  sX(s)-AX(s)= X(0)+BU(s)

By Neglecting Initial Conditions 

(sI-A)X(s) = BU(s)

X(s) = (sI-A)-1 BU(s)

Then Put the value of X(s) for  Y(s)...

then Y(s) = C(sI-A)-1BU(s)+ DU(s)

 Y(s)/U(s) = G(s) = C(sI-A)-1B+D

State-Transition Matrix

The state-transition matrix is defined as a matrix that satisfies the linear homogeneous state
equation:

 byjusexamprep

Let ϕ(t) be the n × n matrix that represents the state-transition matrix; then it must satisfy the
equation:

byjusexamprep

Furthermore, let x(0) denote the initial state at t = 0; then ϕ(t) is also defined by the matrix
equation:

byjusexamprep

which is the solution of the homogeneous state equation for t ≥ 0. One way of determining ϕ(t)
is by taking the Laplace transform on both sides of Eq. (i); we have

byjusexamprep

Solving for X(s) from Eq. (v). we get

byjusexamprep

where it is assumed that the matrix (sI – A)-1 is non-singular. Taking the inverse Laplace
transform on both sides of Eq. (v) yields

byjusexamprep

By comparing Eq.(iv) with Eq. (v), the state-transition matrix is identified to be

byjusexamprep

An alternative way of solving the homogeneous state equation is to assume a solution, as in
the classical method of solving linear differential equations. We let the solution to be

byjusexamprep

for t ≥ 0, where eAt represents the following power series of the matrix At, and

byjusexamprep

Properties of State-Transition Matrices.

byjusexamprep

Controllability & Observability

Controllability: Controllability can be define in order to be able to do whatever we want with the given dynamic system under control input, the system must be controllable. A system is said to be controllable at time t0 if it is possible by means of an unconstrained control vector to transfer the system from any initial state to any other state in a finite interval of time.

Condition for Controllability;

 If the rank of CB  = [ B : AB : ..... An-1B is equal to n ] ,  then the system is controllable.

Observability: In order to see what is going on inside the system under observation, the system must be observable. A system is said to be observable at time t0 if, with the system in state X(t0),it is possible to determine this state from the observation of the output over a finite interval of time.

Condition for Observability;

 If the rank of OB  = [ CT : ATCT : ..... AT)n-1CT is equal to n] ,  then the system is sail to be Observable.

If you aiming to crack GATE & ESE, Other PSU Exams then you must try Online Classroom Program to get unlimited access to all the live structured courses and unlimited mock tests from the following links:

ESE and GATE EC Online Classroom Program (24+ LIVE Courses and 150+ Mock Tests)

ESE and GATE EE Online Classroom Program (24+ LIVE Courses and 193+ Mock Tests)

Click on the Links Below to Avail Test Series:

Click Here Avail GATE/ESE EC Test Series !!! (150+ Mock Tests)

Click Here Avail GATE/ESE EE Test Series !!! (193+ Mock Tests)

Thanks

 

Download BYJU'S Exam Prep, Best gate exam app for Preparation

Comments

write a comment

Follow us for latest updates