|
|
| Line 1: |
Line 1: |
| {{No footnotes|date=May 2009}}
| |
| In [[control engineering]], a '''state space representation''' is a mathematical model of a physical system as a set of input, output and state variables related by first-order [[differential equation]]s. To abstract from the number of inputs, outputs and states, the variables are expressed as vectors. Additionally, if the [[dynamical system]] is linear and time invariant, the differential and algebraic equations may be written in matrix form. The state space representation (also known as the "time-domain approach") provides a convenient and compact way to model and analyze systems with multiple inputs and outputs. With <math>p</math> inputs and <math>q</math> outputs, we would otherwise have to write down <math>q \times p</math> [[Laplace transform]]s to encode all the information about a system. Unlike the frequency domain approach, the use of the state space representation is not limited to systems with linear components and zero initial conditions. "State space" refers to the space whose axes are the state variables. The state of the system can be represented as a vector within that space.
| |
|
| |
|
| == State variables ==
| |
| [[Image:Typical State Space model.png|framed|Block diagram representation of the state space equations]]
| |
|
| |
|
| The internal [[state variable]]s are the smallest possible subset of system variables that can represent the entire state of the system at any given time {{Citation needed|date=December 2013}}. The minimum number of state variables required to represent a given system, <math>n</math>, is usually equal to the order of the system's defining differential equation. If the system is represented in transfer function form, the minimum number of state variables is equal to the order of the transfer function's denominator after it has been reduced to a proper fraction. It is important to understand that converting a state space realization to a transfer function form may lose some internal information about the system, and may provide a description of a system which is stable, when the state-space realization is unstable at certain points. In electric circuits, the number of state variables is often, though not always, the same as the number of energy storage elements in the circuit such as [[capacitor]]s and [[inductor]]s. The state variables defined must be linearly independent; no state variable can be written as a linear combination of the other state variables or the system will not be able to be solved.
| | Games can give you a universe of experience, relaxation and exhilaration. One might learn, get a practical sense of success or mainly enjoy beating down specific bad-guy. No challenege show up form of video gaming you are into, include the helpful tips in this excellent post to give one self more fun whenever you and your family play your next video game title Website.<br><br>Video games are fun to have fun with your kids. Assists you learn much more details about your kid's interests. Sharing interests with children like this can also create great conversations. It also gives an opportunity to monitor increase of their skills.<br><br>Business inside your games when you find yourself done playing them. Numerous retailers provide discount rates or credit score to your next buy whenever you business your clash of clans sur pc tlcharger for. You can obtain the next online title you would like due to the affordable price shortly after you try this. All things considered, most people don't need the [http://www.Thefreedictionary.com/graphics graphics] games as soon since you defeat them.<br><br>There are no outcome in the least to attacking other players on top of that losing, so just onset and savor it. Win or lose, anybody may lose the a lot of troops you have in the the attack since they'll are only beneficial to assist you to one mission, nevertheless, an individual can steal more techniques with the enemy hamlet than it cost and make the troops. And you just build more troops within your barracks. It''s an important good idea to invest in them queued up until now you decide to onset and that means for you are rebuilding your soldiers through the battle.<br><br>Golf season is here and also going strong, and similar many fans we incredibly long for Sunday afternoon when the games begin. If you have trialled and liked Soul Caliber, you will love this particular game. The best is the Food Cell which will aimlessly fill in some sqs. Defeating players like that by any translates to necessary can be currently the reason that pushes them to use Words with Friends Cheat. If you liked this posting and you would like to obtain far more information with regards to [http://circuspartypanama.com hack clash of clans no survey] kindly visit our webpage. The app requires you to assist you to answer 40 questions among varying degrees of obstacles.<br><br>Ought to you are the proud possessor of an ANY easily portable device that runs forward iOS or android whenever a touchscreen tablet computing device or a smart phone, then you definitely definitely have already been very careful of the revolution finding place right now associated with world of mobile computer game "The Clash In Clans", and you would expect to be in demand having to do with conflict of families totally free of charge jewels compromise because more gems, elixir and valuable metal are needed seriously toward acquire every battle.<br><br>Video game titles are some of you see, the finest kinds of excitement around. They is also probably the the vast majority of pricey types of entertainment, with console games which often range from $50 at $60, and consoles on their own inside my 100s. It is often possible to spend less on clash of clans hack and console purchases, and you can find out about them present in the following paragraphs. |
| | |
| == Linear systems ==
| |
| The most general state-space representation of a linear system with <math>p</math> inputs, <math>q</math> outputs and <math>n</math> state variables is written in the following form {{Citation needed|date=July 2013}}:
| |
| : <math>\dot{\mathbf{x}}(t) = A(t) \mathbf{x}(t) + B(t) \mathbf{u}(t)</math>
| |
| : <math>\mathbf{y}(t) = C(t) \mathbf{x}(t) + D(t) \mathbf{u}(t)</math>
| |
| where:
| |
| :<math>\mathbf{x}(\cdot)</math> is called the "state vector", <math>\mathbf{x}(t) \in \mathbb{R}^n</math>;
| |
| :<math>\mathbf{y}(\cdot)</math> is called the "output vector", <math>\mathbf{y}(t) \in \mathbb{R}^q</math>;
| |
| :<math>\mathbf{u}(\cdot)</math> is called the "input (or control) vector", <math>\mathbf{u}(t) \in \mathbb{R}^p</math>;
| |
| :<math>A(\cdot)</math> is the "state (or system) matrix", <math>\operatorname{dim}[A(\cdot)] = n \times n</math>,
| |
| :<math>B(\cdot)</math> is the "input matrix", <math>\operatorname{dim}[B(\cdot)] = n \times p</math>,
| |
| :<math>C(\cdot)</math> is the "output matrix", <math>\operatorname{dim}[C(\cdot)] = q \times n</math>,
| |
| :<math>D(\cdot)</math> is the "feedthrough (or feedforward) matrix" (in cases where the system model does not have a direct feedthrough, <math>D(\cdot)</math> is the zero matrix), <math>\operatorname{dim}[D(\cdot)] = q \times p</math>,
| |
| : <math>\dot{\mathbf{x}}(t) := \frac{\operatorname{d}}{\operatorname{d}t} \mathbf{x}(t)</math>.
| |
| | |
| In this general formulation, all matrices are allowed to be time-variant (i.e. their elements can depend on time); however, in the common [[LTI system|LTI]] case, matrices will be time invariant. The time variable <math>t</math> can be continuous (e.g. <math>t \in \mathbb{R}</math>) or discrete (e.g. <math>t \in \mathbb{Z}</math>). In the latter case, the time variable <math>k</math> is usually used instead of <math>t</math>. [[Hybrid system]]s allow for time domains that have both continuous and discrete parts. Depending on the assumptions taken, the state-space model representation can assume the following forms:
| |
| {| cellpadding="4"
| |
| |- valign="top"
| |
| |'''System type''' || '''State-space model'''
| |
| |- valign="top"
| |
| |Continuous time-invariant || <math>\dot{\mathbf{x}}(t) = A \mathbf{x}(t) + B \mathbf{u}(t)</math><BR /><math>\mathbf{y}(t) = C \mathbf{x}(t) + D \mathbf{u}(t)</math>
| |
| |- valign="top"
| |
| |Continuous time-variant || <math>\dot{\mathbf{x}}(t) = \mathbf{A}(t) \mathbf{x}(t) + \mathbf{B}(t) \mathbf{u}(t)</math><BR /><math>\mathbf{y}(t) = \mathbf{C}(t) \mathbf{x}(t) + \mathbf{D}(t) \mathbf{u}(t)</math>
| |
| |- valign="top"
| |
| |Explicit discrete time-invariant || <math>\mathbf{x}(k+1) = A \mathbf{x}(k) + B \mathbf{u}(k)</math><BR /><math>\mathbf{y}(k) = C \mathbf{x}(k) + D \mathbf{u}(k)</math>
| |
| |- valign="top"
| |
| |Explicit discrete time-variant || <math>\mathbf{x}(k+1) = \mathbf{A}(k) \mathbf{x}(k) + \mathbf{B}(k) \mathbf{u}(k)</math><BR /><math>\mathbf{y}(k) = \mathbf{C}(k) \mathbf{x}(k) + \mathbf{D}(k) \mathbf{u}(k)</math>
| |
| |- valign="top"
| |
| |[[Laplace domain]] of<BR />continuous time-invariant || <math>s \mathbf{X}(s) = A \mathbf{X}(s) + B \mathbf{U}(s)</math><BR /><math>\mathbf{Y}(s) = C \mathbf{X}(s) + D \mathbf{U}(s)</math>
| |
| |- valign="top"
| |
| |[[Z-domain]] of<BR />discrete time-invariant || <math>z \mathbf{X}(z) = A \mathbf{X}(z) + B \mathbf{U}(z)</math><BR /><math>\mathbf{Y}(z) = C \mathbf{X}(z) + D \mathbf{U}(z)</math>
| |
| |}
| |
| | |
| === Example: Continuous-time LTI case ===
| |
| | |
| Stability and natural response characteristics of a continuous-time [[LTI system]] (i.e., linear with matrices that are constant with respect to time) can be studied from the [[eigenvalue]]s of the matrix '''A'''. The stability of a time-invariant state-space model can be determined by looking at the system's [[transfer function]] in factored form. It will then look something like this:
| |
| :<math> \textbf{G}(s) = k \frac{ (s - z_{1})(s - z_{2})(s - z_{3})
| |
| }{ (s - p_{1})(s - p_{2})(s - p_{3})(s - p_{4})
| |
| }. \,</math>
| |
| | |
| The denominator of the transfer function is equal to the [[characteristic polynomial]] found by taking the [[determinant]] of <math>sI - A</math>,
| |
| : <math>\mathbf{\lambda}(s) = |sI - A|. \,</math>
| |
| The roots of this polynomial (the [[eigenvalue]]s) are the system transfer function's [[complex pole|pole]]s (i.e., the [[Mathematical singularity|singularities]] where the transfer function's magnitude is unbounded). These poles can be used to analyze whether the system is [[exponential stability|asymptotically stable]] or [[marginal stability|marginally stable]]. An alternative approach to determining stability, which does not involve calculating eigenvalues, is to analyze the system's [[Lyapunov stability]].
| |
| | |
| The zeros found in the numerator of <math>\textbf{G}(s)</math> can similarly be used to determine whether the system is [[minimum phase]].
| |
| | |
| The system may still be '''input–output stable''' (see [[BIBO stability|BIBO stable]]) even though it is not internally stable. This may be the case if unstable poles are canceled out by zeros (i.e., if those singularities in the transfer function are [[removable singularity|removable]]).
| |
| | |
| === Controllability ===
| |
| {{Main| Controllability}}
| |
| | |
| Thus, state controllability condition implies that it is possible – by admissible inputs – to steer the states from any initial value to any final value within some finite time window. A continuous time-invariant linear state-space model is '''controllable''' [[iff|if and only if]]
| |
| :<math>\operatorname{rank}\begin{bmatrix}B& AB& A^{2}B& ...& A^{n-1}B\end{bmatrix} = n. \,</math>
| |
| Where [[rank (linear algebra)|rank]] is the number of linearly independent rows in a matrix.
| |
| | |
| === Observability ===
| |
| {{Main| Observability}}
| |
| | |
| Observability is a measure for how well internal states of a system can be inferred by knowledge of its external outputs. The observability and controllability of a system are mathematical duals (i.e., as controllability provides that an input is available that brings any initial state to any desired final state, observability provides that knowing an output trajectory provides enough information to predict the initial state of the system).
| |
| | |
| A continuous time-invariant linear state-space model is '''observable''' if and only if
| |
| :<math>\operatorname{rank}\begin{bmatrix}C\\ CA\\ ...\\ CA^{n-1}\end{bmatrix} = n. \,</math>
| |
| | |
| === Transfer function ===
| |
| The "[[transfer function]]" of a continuous time-invariant linear state-space model can be derived in the following way:
| |
| | |
| First, taking the [[Laplace transform]] of
| |
| :<math>\dot{\mathbf{x}}(t) = A \mathbf{x}(t) + B \mathbf{u}(t)</math>
| |
| yields
| |
| :<math>s\mathbf{X}(s) = A \mathbf{X}(s) + B \mathbf{U}(s). \,</math>
| |
| Next, we simplify for <math>\mathbf{X}(s)</math>, giving
| |
| :<math>(s\mathbf{I} - A)\mathbf{X}(s) = B\mathbf{U}(s), \,</math>
| |
| and thus
| |
| :<math>\mathbf{X}(s) = (s\mathbf{I} - A)^{-1}B\mathbf{U}(s). \,</math>
| |
| | |
| Substituting for <math>\mathbf{X}(s)</math> in the output equation
| |
| | |
| :<math>\mathbf{Y}(s) = C\mathbf{X}(s) + D\mathbf{U}(s),</math> giving
| |
| :<math>\mathbf{Y}(s) = C((s\mathbf{I} - A)^{-1}B\mathbf{U}(s)) + D\mathbf{U}(s). \,</math>
| |
| | |
| Because the [[transfer function]] <math>\mathbf{G}(s)</math> is defined as the ratio of the output to the input of a system, we take
| |
| :<math>\mathbf{G}(s) = \mathbf{Y}(s) / \mathbf{U}(s)</math>
| |
| and substitute the previous expression for <math>\mathbf{Y}(s)</math> with respect to <math>\mathbf{U}(s)</math>, giving
| |
| :<math>\mathbf{G}(s) = C(s\mathbf{I} - A)^{-1}B + D. \,</math>
| |
| Clearly <math>\mathbf{G}(s)</math> must have <math>q</math> by <math>p</math> dimensionality, and thus has a total of <math>qp</math> elements.
| |
| So for every input there are <math>q</math> transfer functions with one for each output.
| |
| This is why the state-space representation can easily be the preferred choice for multiple-input, multiple-output (MIMO) systems.
| |
| | |
| === Canonical realizations ===
| |
| {{main|Realization (systems)}}
| |
| Any given transfer function which is [[strictly proper]] can easily be transferred into state-space by the following approach (this example is for a 4-dimensional, single-input, single-output system):
| |
| | |
| Given a transfer function, expand it to reveal all coefficients in both the numerator and denominator. This should result in the following form:
| |
| :<math> \textbf{G}(s) = \frac{n_{1}s^{3} + n_{2}s^{2} + n_{3}s + n_{4}}{s^{4} + d_{1}s^{3} + d_{2}s^{2} + d_{3}s + d_{4}}.\,</math>
| |
| | |
| The coefficients can now be inserted directly into the state-space model by the following approach:
| |
| :<math>\dot{\textbf{x}}(t) = \begin{bmatrix}
| |
| -d_{1}& -d_{2}& -d_{3}& -d_{4}\\
| |
| 1& 0& 0& 0\\
| |
| 0& 1& 0& 0\\
| |
| 0& 0& 1& 0
| |
| \end{bmatrix}\textbf{x}(t) +
| |
| \begin{bmatrix} 1\\ 0\\ 0\\ 0\\ \end{bmatrix}\textbf{u}(t)</math>
| |
| | |
| :<math> \textbf{y}(t) = \begin{bmatrix} n_{1}& n_{2}& n_{3}& n_{4} \end{bmatrix}\textbf{x}(t). \,</math>
| |
| | |
| This state-space realization is called '''controllable canonical form''' because the resulting model is guaranteed to be controllable (i.e., because the control enters a chain of integrators, it has the ability to move every state).
| |
| | |
| The transfer function coefficients can also be used to construct another type of canonical form
| |
| :<math>\dot{\textbf{x}}(t) = \begin{bmatrix}
| |
| -d_{1}& 1& 0& 0\\
| |
| -d_{2}& 0& 1& 0\\
| |
| -d_{3}& 0& 0& 1\\
| |
| -d_{4}& 0& 0& 0
| |
| \end{bmatrix}\textbf{x}(t) +
| |
| \begin{bmatrix} n_{1}\\ n_{2}\\ n_{3}\\ n_{4} \end{bmatrix}\textbf{u}(t)</math>
| |
| | |
| :<math> \textbf{y}(t) = \begin{bmatrix} 1& 0& 0& 0 \end{bmatrix}\textbf{x}(t). \,</math>
| |
| | |
| This state-space realization is called '''observable canonical form''' because the resulting model is guaranteed to be observable (i.e., because the output exits from a chain of integrators, every state has an effect on the output).
| |
| | |
| === Proper transfer functions ===
| |
| Transfer functions which are only [[proper transfer function|proper]] (and not [[strictly proper]]) can also be realised quite easily. The trick here is to separate the transfer function into two parts: a strictly proper part and a constant.
| |
| :<math> \textbf{G}(s) = \textbf{G}_\mathrm{SP}(s) + \textbf{G}(\infty). \,</math>
| |
| The strictly proper transfer function can then be transformed into a canonical state space realization using techniques shown above. The state space realization of the constant is trivially <math>\textbf{y}(t) = \textbf{G}(\infty)\textbf{u}(t)</math>. Together we then get a state space realization with matrices ''A'',''B'' and ''C'' determined by the strictly proper part, and matrix ''D'' determined by the constant.
| |
| | |
| Here is an example to clear things up a bit:
| |
| :<math> \textbf{G}(s) = \frac{s^{2} + 3s + 3}{s^{2} + 2s + 1}
| |
| = \frac{s + 2}{s^{2} + 2s + 1} + 1</math>
| |
| which yields the following controllable realization
| |
| :<math>\dot{\textbf{x}}(t) = \begin{bmatrix}
| |
| -2& -1\\
| |
| 1& 0\\
| |
| \end{bmatrix}\textbf{x}(t) +
| |
| \begin{bmatrix} 1\\ 0\end{bmatrix}\textbf{u}(t)</math>
| |
| | |
| :<math> \textbf{y}(t) = \begin{bmatrix} 1& 2\end{bmatrix}\textbf{x}(t) + \begin{bmatrix} 1\end{bmatrix}\textbf{u}(t)</math>
| |
| Notice how the output also depends directly on the input. This is due to the <math>\textbf{G}(\infty)</math> constant in the transfer function.
| |
| | |
| === Feedback ===
| |
| [[Image:Typical State Space model with feedback.png|framed|Typical state space model with feedback]]
| |
| A common method for feedback is to multiply the output by a matrix ''K'' and setting this as the input to the system: <math>\mathbf{u}(t) = K \mathbf{y}(t)</math>.
| |
| Since the values of ''K'' are unrestricted the values can easily be negated for [[negative feedback]].
| |
| The presence of a negative sign (the common notation) is merely a notational one and its absence has no impact on the end results. | |
| | |
| : <math>\dot{\mathbf{x}}(t) = A \mathbf{x}(t) + B \mathbf{u}(t)</math>
| |
| : <math>\mathbf{y}(t) = C \mathbf{x}(t) + D \mathbf{u}(t)</math>
| |
| | |
| becomes
| |
| | |
| : <math>\dot{\mathbf{x}}(t) = A \mathbf{x}(t) + B K \mathbf{y}(t)</math>
| |
| : <math>\mathbf{y}(t) = C \mathbf{x}(t) + D K \mathbf{y}(t)</math>
| |
| | |
| solving the output equation for <math>\mathbf{y}(t)</math> and substituting in the state equation results in
| |
| | |
| : <math>\dot{\mathbf{x}}(t) = \left(A + B K \left(I - D K\right)^{-1} C \right) \mathbf{x}(t)</math>
| |
| : <math>\mathbf{y}(t) = \left(I - D K\right)^{-1} C \mathbf{x}(t)</math>
| |
| | |
| The advantage of this is that the [[eigenvalues]] of ''A'' can be controlled by setting ''K'' appropriately through eigendecomposition of <math>\left(A + B K \left(I - D K\right)^{-1} C \right)</math>.
| |
| This assumes that the closed-loop system is [[controllability|controllable]] or that the unstable eigenvalues of ''A'' can be made stable through appropriate choice of ''K''.
| |
| | |
| ==== Example ====
| |
| For a strictly proper system ''D'' equals zero. Another fairly common situation is when all states are outputs, i.e. ''y'' = ''x'', which yields ''C'' = ''I'', the [[Identity matrix]]. This would then result in the simpler equations
| |
| | |
| : <math>\dot{\mathbf{x}}(t) = \left(A + B K \right) \mathbf{x}(t)</math>
| |
| : <math>\mathbf{y}(t) = \mathbf{x}(t)</math>
| |
| | |
| This reduces the necessary eigendecomposition to just <math>A + B K</math>.
| |
| | |
| === Feedback with setpoint (reference) input ===
| |
| [[Image:Typical State Space model with feedback and input.png|framed|Output feedback with set point]]
| |
| | |
| In addition to feedback, an input, <math>r(t)</math>, can be added such that <math>\mathbf{u}(t) = -K \mathbf{y}(t) + \mathbf{r}(t)</math>.
| |
| | |
| : <math>\dot{\mathbf{x}}(t) = A \mathbf{x}(t) + B \mathbf{u}(t)</math>
| |
| : <math>\mathbf{y}(t) = C \mathbf{x}(t) + D \mathbf{u}(t)</math>
| |
| | |
| becomes
| |
| | |
| : <math>\dot{\mathbf{x}}(t) = A \mathbf{x}(t) - B K \mathbf{y}(t) + B \mathbf{r}(t)</math>
| |
| : <math>\mathbf{y}(t) = C \mathbf{x}(t) - D K \mathbf{y}(t) + D \mathbf{r}(t)</math>
| |
| | |
| solving the output equation for <math>\mathbf{y}(t)</math> and substituting in the state equation
| |
| results in
| |
| | |
| : <math>\dot{\mathbf{x}}(t) = \left(A - B K \left(I + D K\right)^{-1} C \right) \mathbf{x}(t) + B \left(I - K \left(I + D K\right)^{-1}D \right) \mathbf{r}(t)</math>
| |
| : <math>\mathbf{y}(t) = \left(I + D K\right)^{-1} C \mathbf{x}(t) + \left(I + D K\right)^{-1} D \mathbf{r}(t)</math>
| |
| | |
| One fairly common simplification to this system is removing ''D'', which reduces the equations to
| |
| | |
| : <math>\dot{\mathbf{x}}(t) = \left(A - B K C \right) \mathbf{x}(t) + B \mathbf{r}(t)</math>
| |
| : <math>\mathbf{y}(t) = C \mathbf{x}(t)</math>
| |
| | |
| === Moving object example ===
| |
| A classical linear system is that of one-dimensional movement of an object.
| |
| The [[Newton's laws of motion]] for an object moving horizontally on a plane and attached to a wall with a spring
| |
| | |
| :<math>m \ddot{y}(t) = u(t) - k_1\dot{y}(t) - k_2 y(t)</math>
| |
| | |
| where
| |
| *<math>y(t)</math> is position; <math>\dot y(t)</math> is velocity; <math>\ddot{y}(t)</math> is acceleration
| |
| *<math>u(t)</math> is an applied force
| |
| *<math>k_1</math> is the viscous friction coefficient
| |
| *<math>k_2</math> is the spring constant
| |
| *<math>m</math> is the mass of the object
| |
| | |
| The state equation would then become
| |
| | |
| :<math>\left[ \begin{matrix} \mathbf{\dot{x}_1}(t) \\ \mathbf{\dot{x}_2}(t) \end{matrix} \right] = \left[ \begin{matrix} 0 & 1 \\ -\frac{k_2}{m} & -\frac{k_1}{m} \end{matrix} \right] \left[ \begin{matrix} \mathbf{x_1}(t) \\ \mathbf{x_2}(t) \end{matrix} \right] + \left[ \begin{matrix} 0 \\ \frac{1}{m} \end{matrix} \right] \mathbf{u}(t)</math>
| |
| :<math>\mathbf{y}(t) = \left[ \begin{matrix} 1 & 0 \end{matrix} \right] \left[ \begin{matrix} \mathbf{x_1}(t) \\ \mathbf{x_2}(t) \end{matrix} \right]</math>
| |
| | |
| where
| |
| *<math>x_1(t)</math> represents the position of the object
| |
| *<math>x_2(t) = \dot{x}_1(t)</math> is the velocity of the object
| |
| *<math>\dot{x}_2(t) = \ddot{x}_1(t)</math> is the acceleration of the object
| |
| *the output <math>\mathbf{y}(t)</math> is the position of the object
| |
| | |
| The [[controllability]] test is then
| |
| | |
| :<math>\left[ \begin{matrix} B & AB \end{matrix} \right] = \left[ \begin{matrix} \left[ \begin{matrix} 0 \\ \frac{1}{m} \end{matrix} \right] & \left[ \begin{matrix} 0 & 1 \\ -\frac{k_2}{m} & -\frac{k_1}{m} \end{matrix} \right] \left[ \begin{matrix} 0 \\ \frac{1}{m} \end{matrix} \right] \end{matrix} \right] = \left[ \begin{matrix} 0 & \frac{1}{m} \\ \frac{1}{m} & -\frac{k_1}{m^2} \end{matrix} \right]</math>
| |
| | |
| which has full rank for all <math>k_1</math> and <math>m</math>.
| |
| | |
| The [[observability]] test is then
| |
| | |
| :<math>\left[ \begin{matrix} C \\ CA \end{matrix} \right] = \left[ \begin{matrix} \left[ \begin{matrix} 1 & 0 \end{matrix} \right] \\ \left[ \begin{matrix} 1 & 0 \end{matrix} \right] \left[ \begin{matrix} 0 & 1 \\ -\frac{k_2}{m} & -\frac{k_1}{m} \end{matrix} \right] \end{matrix} \right] = \left[ \begin{matrix} 1 & 0 \\ 0 & 1 \end{matrix} \right]</math>
| |
| | |
| which also has full rank.
| |
| Therefore, this system is both controllable and observable.
| |
| | |
| == Nonlinear systems ==
| |
| The more general form of a state space model can be written as two functions.
| |
| | |
| :<math>\mathbf{\dot{x}}(t) = \mathbf{f}(t, x(t), u(t))</math>
| |
| :<math>\mathbf{y}(t) = \mathbf{h}(t, x(t), u(t))</math>
| |
| | |
| The first is the state equation and the latter is the output equation.
| |
| If the function <math>f(\cdot,\cdot,\cdot)</math> is a linear combination of states and inputs then the equations can be written in matrix notation like above.
| |
| The <math>u(t)</math> argument to the functions can be dropped if the system is unforced (i.e., it has no inputs).
| |
| | |
| === Pendulum example ===
| |
| A classic nonlinear system is a simple unforced [[pendulum]]
| |
| | |
| :<math>ml^2\ddot\theta(t)= - mlg\sin\theta(t) - kl\dot\theta(t)</math>
| |
| | |
| where
| |
| *<math>\theta(t)</math> is the angle of the pendulum with respect to the direction of gravity
| |
| *<math>m</math> is the mass of the pendulum (pendulum rod's mass is assumed to be zero)
| |
| *<math>g</math> is the gravitational acceleration
| |
| *<math>k</math> is coefficient of friction at the pivot point
| |
| *<math>l</math> is the radius of the pendulum (to the center of gravity of the mass <math>m</math>)
| |
| The state equations are then
| |
| | |
| :<math>\dot{x_1}(t) = x_2(t)</math>
| |
| :<math>\dot{x_2}(t) = - \frac{g}{l}\sin{x_1}(t) - \frac{k}{ml}{x_2}(t)</math>
| |
| | |
| where
| |
| *<math>x_1(t) = \theta(t)</math> is the angle of the pendulum
| |
| *<math>x_2(t) = \dot{x_1}(t)</math> is the rotational velocity of the pendulum
| |
| *<math>\dot{x_2} = \ddot{x_1}</math> is the rotational acceleration of the pendulum
| |
| | |
| Instead, the state equation can be written in the general form
| |
| | |
| :<math>\dot{\mathbf{x}}(t) = \left( \begin{matrix} \dot{x_1}(t) \\ \dot{x_2}(t) \end{matrix} \right) = \mathbf{f}(t, x(t)) = \left( \begin{matrix} x_2(t) \\ - \frac{g}{l}\sin{x_1}(t) - \frac{k}{ml}{x_2}(t) \end{matrix} \right).</math>
| |
| | |
| The [[Mechanical equilibrium|equilibrium]]/[[stationary point]]s of a system are when <math>\dot{x} = 0</math> and so the equilibrium points of a pendulum are those that satisfy
| |
| | |
| :<math>\left( \begin{matrix} x_1 \\ x_2 \end{matrix} \right) = \left( \begin{matrix} n\pi \\ 0 \end{matrix} \right)</math>
| |
| | |
| for integers ''n''.
| |
| | |
| == See also ==
| |
| * [[Control engineering]]
| |
| * [[Control theory]]
| |
| * [[State observer]]
| |
| * [[Observability]]
| |
| * [[Controllability]]
| |
| * [[Discretization]] of state space models
| |
| * [[Phase space]] for information about phase state (like state space) in physics and mathematics.
| |
| * [[State space]] for information about state space with discrete states in computer science.
| |
| * [[State space (physics)]] for information about state space in physics.
| |
| | |
| == Further reading ==
| |
| {{refbegin}}
| |
| * {{cite book|last1=Antsaklis |first1=P. J. |last2=Michel |first2=A. N. |year=2007 |title=A Linear Systems Primer |publisher=Birkhauser |isbn=978-0-8176-4460-4}}
| |
| * {{cite book|last1=Chen |first1=Chi-Tsong |year=1999 |title=Linear System Theory and Design |edition=3rd |publisher=Oxford University Press |isbn=0-19-511777-8}}
| |
| * {{cite book|last1=Khalil |first1=Hassan K. |year=2001 |title=Nonlinear Systems |edition=3rd |publisher=Prentice Hall |isbn=0-13-067389-7}}
| |
| * {{cite book|last1=Nise |first1=Norman S. |year=2004 |title=Control Systems Engineering |edition=4th |publisher=John Wiley & Sons, Inc. |isbn=0-471-44577-0}}
| |
| * {{cite book|last1=Hinrichsen |first1=Diederich |last2=Pritchard |first2=Anthony J. |year=2005 |title=Mathematical Systems Theory I, Modelling, State Space Analysis, Stability and Robustness |publisher=Springer |isbn=978-3-540-44125-0}}
| |
| * {{cite book|last1=Sontag |first1=Eduardo D. |year=1999 |title=Mathematical Control Theory: Deterministic Finite Dimensional Systems |edition=2nd |publisher=Springer |isbn=0-387-98489-5 |url=http://www.math.rutgers.edu/~sontag/FTP_DIR/sontag_mathematical_control_theory_springer98.pdf |format=pdf |accessdate=June 28, 2012}}
| |
| * {{cite book|last1=Friedland |first1=Bernard |year=2005| title=Control System Design: An Introduction to State Space Methods |publisher=Dover |isbn=0-486-44278-0}}
| |
| * {{cite book|last1=Zadeh |first1=Lotfi A. |last2=Desoer |first2=Charles A. |year=1979 |title=Linear System Theory |publisher=Krieger Pub Co. |isbn=978-0-88275-809-1}}
| |
| | |
| ;On the applications of state space models in econometrics:
| |
| | |
| * {{cite book|last1=Durbin |first1=J. |first2=S. |last2=Koopman |year=2001 |title=Time series analysis by state space methods |publisher=Oxford University Press |location=Oxford, UK |isbn=978-0198523543}}
| |
| {{refend}}
| |
| | |
| [[Category:Control theory]]
| |
| [[Category:Time domain analysis]]
| |
| [[Category:Time series models]]
| |
| [[Category:Econometric models]]
| |