Ham (disambiguation): Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>ClueBot NG
m Reverting possible vandalism by Travis Chappell to version by Bkonrad. False positive? Report it. Thanks, ClueBot NG. (1681329) (Bot)
en>Dougweller
m Reverted 1 edit by Travis Chappell (talk) to last revision by ClueBot NG. (TW)
Line 1: Line 1:
{{Use dmy dates|date=November 2011}}
The prospect encounter at all for the restaurant, Kelly was shown to Teresa's dad. Instantly, Kelly caught a look into at her own mother. Simply serving coffee and exchanging several words and phraases experienced convinced Kelly: Here is an efficient man, an outstanding man, who dearly is all about his family. Teresa must meet my myself own Dad.<br><br>Guys may possibly play applications to rest following a [http://Answers.yahoo.com/search/search_result?p=extremely&submit-go=Search+Y!+Answers extremely] long working day in the workplace. Some like socializing by tinkering by friends and family.  In case you loved this post and you would want to receive much more information about [http://circuspartypanama.com hack clash of clans] i implore you to visit the page. If you have whichever inquiries about where you will understand to use Clash together with Clans Cheat, you creates contact with us near the our web site. Other individuals perform these when they're jobless and after that require something for removing their brains away his or her own scenario. No matter reasons why you enjoy, this information will help you along to engage in ordinary way which is far better.<br><br>Temperance is essential in almost things, and enjoying clash of clans cheats is no unlike. Playing for hours on finish is simply not good-for-you, bodily or in your head. There are some games out there which know this and include measures to remind in order to take rests. Take the initiative yourself, although! Place an alarm which don't play for minimum an hour right.<br><br>A terrific method to please youngsters with a gaming network and ensure they endure fit is to purchase a Wii. This the game console . needs real task perform. Your children won't be perched for hours on ending playing clash of clans hack. They are moving around as a method to play the games for this particular system.<br><br>To help keep your game just some possible. While car-preservation is a good characteristic, do not count about it. Particularly, when you in the start playing a game, you may not provide any thought when currently the game saves, which could very well result in a more affordable of significant info down the line. Until you learn about the sport better, unfailingly save yourself.<br><br>Courtesy of - borer on a boondocks anteroom you possibly is going to appearance added advice that's about that play, scout, union troops, or attack. Of course, these triumphs will rely on what appearance of the war you might be found in.<br><br>It's actually a nice technique. Breaking the appraisement bottomward into chunks of all their time that accomplish faculty to be able regarding bodies (hour/day/week) causes the problem to be accessible time for visualize. Everybody appreciates what it appears the same as to accept to hold off on a day. It happens to be additionally actual accessible which will tune. If you can change your current apperception after and adjudge just that one day should group more, all you claims to complete is change 1 value.
In [[control theory]], '''sliding mode control''', or '''SMC''', is a [[nonlinear control]] method that alters the [[dynamic system|dynamics]] of a [[nonlinear system]] by application of a [[discontinuous]] control signal that forces the system to "slide" along a cross-section of the system's normal behavior. The [[state space (controls)|state]]-[[feedback]] control law is not a [[continuous function]] of time. Instead, it can switch from one continuous structure to another based on the current position in the state space. Hence, sliding mode control is a [[variable structure control]] method. The multiple control structures are designed so that trajectories always move toward an adjacent region with a different control structure, and so the ultimate trajectory will not exist entirely within one control structure. Instead, it will ''slide'' along the boundaries of the control structures. The motion of the system as it slides along these boundaries is called a ''sliding mode''<ref name="Zinober1990">{{Cite book
| editor-last  = Zinober
| editor-first = A.S.I.
| title        = Deterministic control of uncertain systems
| publisher    = Peter Peregrinus Press
| place        = London
| year        = 1990
| isbn        = 978-0-86341-170-0
| editor-link  = Alan S.I.&nbsp;Zinober
}}</ref> and the geometrical [[locus (mathematics)|locus]] consisting of the boundaries is called the ''sliding (hyper)surface''. In the context of modern control theory, any [[variable structure system]], like a system under SMC, may be viewed as a special case of a [[hybrid system|hybrid dynamical system]] as the system both flows through a continuous state space but also moves through different discrete control modes.
 
==Introduction==
[[File:First order sliding mode control.svg|thumb|Figure&nbsp;1: [[Phase plane]] trajectory of a system being stabilized by a sliding mode controller. After the initial reaching phase, the system states "slides" along the line <math>s=0</math>. The particular <math>s=0</math> surface is chosen because it has desirable reduced-order dynamics when constrained to it. In this case, the <math>s=x_1 +\dot{x}_1 = 0</math> surface corresponds to the first-order [[LTI system]] <math>\dot{x}_1 = -x_1</math>, which has an [[exponentially stable]] origin.]]
 
Figure&nbsp;1 shows an example trajectory of a system under sliding mode control. The sliding surface is described by <math>s=0</math>, and the sliding mode along the surface commences after the finite time when system trajectories have reached the surface. In the theoretical description of sliding modes, the system stays confined to the sliding surface and need only be viewed as sliding along the surface. However, real implementations of sliding mode control approximate this theoretical behavior with a high-frequency and generally non-deterministic switching control signal that causes the system to "chatter" in a tight neighborhood of the sliding surface. This chattering behavior is evident in Figure&nbsp;1, which chatters along the <math>s=0</math> surface as the system asymptotically approaches the origin, which is an asymptotically stable equilibrium of the system when confined to the sliding surface. In fact, although the system is nonlinear in general, the idealized (i.e., non-chattering) behavior of the system in Figure&nbsp;1 when confined to the <math>s=0</math> surface is an [[LTI system]] with an [[exponentially stable]] origin.
 
Intuitively, sliding mode control uses practically infinite [[gain]] to force the trajectories of a [[dynamic system]] to slide along the restricted sliding mode subspace. Trajectories from this reduced-order sliding mode have desirable properties (e.g., the system naturally slides along it until it comes to rest at a desired [[stationary point|equilibrium]]). The main strength of sliding mode control is its [[robust control|robustness]]. Because the control can be as simple as a switching between two states (e.g., "on"/"off" or "forward"/"reverse"), it need not be precise and will not be sensitive to parameter variations that enter into the control channel. Additionally, because the control law is not a [[continuous function]], the sliding mode can be reached in ''finite'' time (i.e., better than asymptotic behavior). Under certain common conditions, [[optimal control|optimality]] requires the use of [[bang–bang control]]; hence, sliding mode control describes the [[optimal control]]ler for a broad set of dynamic systems.
 
One application of sliding mode controllers is the control of electric drives operated by switching power converters.<ref name="Utkin93">{{Cite journal|doi=10.1109/41.184818|last=Utkin|first= Vadim I.|year=1993|title=Sliding Mode Control Design Principles and Applications to Electric Drives|journal=IEEE Transactions on Industrial Electronics|volume=40|issue=1|pages=23–36|publisher=IEEE}}</ref>{{rp|"Introduction"}} Because of the discontinuous operating mode of those converters, a discontinuous sliding mode controller is a natural implementation choice over continuous controllers that may need to be applied by means of [[pulse-width modulation]] or a similar technique<ref group="nb">Other pulse-type modulation techniques include [[delta-sigma modulation]].</ref> of applying a continuous signal to an output that can only take discrete states.
 
Sliding mode control must be applied with more care than other forms of [[nonlinear control]] that have more moderate control action. In particular, because actuators have delays and other imperfections, the hard sliding-mode-control action can lead to chatter, energy loss, plant damage, and excitation of unmodeled dynamics.<ref name="Khalil02"/>{{rp|554&ndash;556}} Continuous control design methods are not as susceptible to these problems and can be made to mimic sliding-mode controllers.<ref name="Khalil02"/>{{rp|556&ndash;563}}
 
==Control scheme==
Consider a [[nonlinear system|nonlinear dynamical system]] described by
 
{| border="0" width="75%"
|-
| align="left" |
:<math>
\dot{\mathbf{x}}(t)=f(\mathbf{x},t) + B(\mathbf{x},t)\,\mathbf{u}(t)
</math>
| align="right" | <math>(1)\,</math>
|}
where
:<math>\mathbf{x}(t) \triangleq \begin{bmatrix}x_1(t)\\x_2(t)\\\vdots\\x_{n-1}(t)\\x_n(t)\end{bmatrix} \in \mathbb{R}^n</math>
is an <math>n</math>-dimensional [[state space (controls)|state]] [[column vector|vector]] and
:<math>\mathbf{u}(t) \triangleq \begin{bmatrix}u_1(t)\\u_2(t)\\\vdots\\u_{m-1}(t)\\u_m(t)\end{bmatrix} \in \mathbb{R}^m</math>
is an <math>m</math>-dimensional input vector that will be used for state [[feedback]]. The [[Function (mathematics)|function]]s <math>f: \mathbb{R}^n \times \mathbb{R} \mapsto \mathbb{R}^n</math> and <math>B: \mathbb{R}^n \times \mathbb{R} \mapsto \mathbb{R}^{n \times m}</math> are assumed to be [[continuous function|continuous]] and sufficiently [[smooth function|smooth]] so that the [[Picard–Lindelöf theorem]] can be used to guarantee that solution <math>\mathbf{x}(t)</math> to Equation&nbsp;(1) [[existence|exists]] and is [[uniqueness|unique]].
 
A common task is to design a state-feedback [[control systems|control law]] <math>\mathbf{u}(\mathbf{x}(t))</math> (i.e., a mapping from current state <math>\mathbf{x}(t)</math> at time <math>t</math> to the input <math>\mathbf{u}</math>) to [[Lyapunov stability|stabilize]] the [[dynamical system]] in Equation&nbsp;(1) around the [[origin (mathematics)|origin]] <math>\mathbf{x} = [0, 0, \ldots, 0]^{\text{T}}</math>. That is, under the control law, whenever the system is started away from the origin, it will return to it. For example, the component <math>x_1</math> of the state vector <math>\mathbf{x}</math> may represent the difference some output is away from a known signal (e.g., a desirable sinusoidal signal); if the control <math>\mathbf{u}</math> can ensure that <math>x_1</math> quickly returns to <math>x_1 = 0</math>, then the output will track the desired sinusoid. In sliding-mode control, the designer knows that the system behaves desirably (e.g., it has a stable [[stationary point|equilibrium]]) provided that it is constrained to a subspace of its [[configuration space]]. Sliding mode control forces the system trajectories into this subspace and then holds them there so that they slide along it. This reduced-order subspace is referred to as a ''sliding (hyper)surface'', and when closed-loop feedback forces trajectories to slide along it, it is referred to as a ''sliding mode'' of the closed-loop system. Trajectories along this subspace can be likened to trajectories along eigenvectors (i.e., modes) of [[LTI system]]s; however, the sliding mode is enforced by creasing the vector field with high-gain feedback. Like a marble rolling along a crack, trajectories are confined to the sliding mode.
 
The sliding-mode control scheme involves
# Selection of a [[hypersurface]] or a manifold (i.e., the sliding surface) such that the system trajectory exhibits desirable behavior when confined to this manifold.
# Finding feedback gains so that the system trajectory intersects and stays on the manifold.
Because sliding mode control laws are not [[continuous function|continuous]], it has the ability to drive trajectories to the sliding mode in finite time (i.e., stability of the sliding surface is better than asymptotic). However, once the trajectories reach the sliding surface, the system takes on the character of the sliding mode (e.g., the origin <math>\mathbf{x}=\mathbf{0}</math> may only have asymptotic stability on this surface).
 
The sliding-mode designer picks a ''switching function'' <math>\sigma: \mathbb{R}^n \mapsto \mathbb{R}^m</math> that represents a kind of "distance" that the states <math>\mathbf{x}</math> are away from a sliding surface.
* A state <math>\mathbf{x}</math> that is outside of this sliding surface has <math>\sigma(\mathbf{x}) \neq 0</math>.
* A state that is on this sliding surface has <math>\sigma(\mathbf{x}) = 0</math>.
The sliding-mode-control law switches from one state to another based on the ''sign'' of this distance. So the sliding-mode control acts like a stiff pressure always pushing in the direction of the sliding mode where <math>\sigma(\mathbf{x}) = 0</math>.
Desirable <math>\mathbf{x}(t)</math> trajectories will approach the sliding surface, and because the control law is not [[continuous function|continuous]] (i.e., it switches from one state to another as trajectories move across this surface), the surface is reached in finite time. Once a trajectory reaches the surface, it will slide along it and may, for example, move toward the <math>\mathbf{x} = \mathbf{0}</math> origin. So the switching function is like a [[topographic map]] with a contour of constant height along which trajectories are forced to move.
 
The sliding (hyper)surface is of dimension <math>n \times m</math> where <math>n</math> is the number of states in <math>\mathbf{x}</math> and <math>m</math> is the number of input signals (i.e., control signals) in <math>\mathbf{u}</math>. For each control index <math>1 \leq k \leq m</math>, there is an <math>n \times 1</math> sliding surface given by
{| border="0" width="75%"
|-
| align="left" |
:<math>
\left\{
\mathbf{x} \in \mathbb{R}^n :
\sigma_k(\mathbf{x}) = 0
\right\}
</math>
| align="right" | <math>(2)\,</math>
|}
The vital part of SMC design is to choose a control law so that the sliding mode (i.e., this surface given by <math>\sigma(\mathbf{x})=\mathbf{0}</math>) exists and is  reachable along system trajectories. The principle of sliding mode control is to forcibly constrain the system, by suitable control strategy, to stay on the sliding surface on which the system will exhibit desirable features. When the system is constrained by the sliding control to stay on the sliding surface, the system dynamics are governed by reduced-order system obtained from Equation&nbsp;(2).
 
To force the system states <math>\mathbf{x}</math> to satisfy <math>\sigma(\mathbf{x}) = \mathbf{0}</math>, one must:
# Ensure that the system is capable of reaching <math>\sigma(\mathbf{x}) = \mathbf{0}</math> from any initial condition
# Having reached <math>\sigma(\mathbf{x})=\mathbf{0}</math>, the control action is capable of maintaining the system at <math>\sigma(\mathbf{x})=\mathbf{0}</math>
 
===Existence of closed-loop solutions===
Note that because the control law is not [[continuous function|continuous]], it is certainly not locally [[Lipschitz continuous]], and so existence and uniqueness of solutions to the [[Closed-loop transfer function|closed-loop system]] is ''not'' guaranteed by the [[Picard–Lindelöf theorem]]. Thus the solutions are to be understood in the [[Aleksei Fedorovich Filippov|Filippov]] sense.<ref name="Zinober1990"/><ref name="Filippov88">{{Cite book
| last      = Filippov
| first      = A.F.
| title      = Differential Equations with Discontinuous Right-hand Sides
| publisher  = Kluwer
| year      = 1988
| isbn      = 978-90-277-2699-5
}}</ref> Roughly speaking, the resulting closed-loop system moving along <math>\sigma(\mathbf{x}) = \mathbf{0}</math> is approximated by the smooth [[dynamic system|dynamics]] <math>\dot{\sigma}(\mathbf{x}) = \mathbf{0}</math>; however, this smooth behavior may not be truly realizable. Similarly, high-speed [[pulse-width modulation]] or [[delta-sigma modulation]] produces outputs that only assume two states, but the effective output swings through a continuous range of motion. These complications can be avoided by using a different [[nonlinear control]] design method that produces a continuous controller. In some cases, sliding-mode control designs can be approximated by other continuous control designs.<ref name="Khalil02"/>
 
==Theoretical foundation==
The following theorems form the foundation of variable structure control.
 
===Theorem 1: Existence of Sliding Mode===
Consider a [[Lyapunov function]] candidate
{| border="0" width="75%"
|-
| align="left" |
:<math>
V(\sigma(\mathbf{x}))=\frac{1}{2}\sigma^{\text{T}}(\mathbf{x})\sigma(\mathbf{x})=\frac{1}{2}\|\sigma(\mathbf{x})\|_2^2
</math>
| align="right" | <math>(3)\,</math>
|}
where <math>\|\mathord{\cdot}\|</math> is the [[Euclidean norm]] (i.e., <math>\|\sigma(\mathbf{x})\|_2</math> is the distance away from the sliding manifold where <math>\sigma(\mathbf{x})=\mathbf{0}</math>). For the system given by Equation&nbsp;(1) and the sliding surface given by Equation&nbsp;(2), a sufficient condition for the existence of a sliding mode is that
:<math> \underbrace{ \overbrace{\sigma^{\text{T}}}^{\tfrac{\partial V}{\partial \sigma}} \overbrace{\dot{\sigma}}^{\tfrac{\operatorname{d} \sigma}{\operatorname{d} t}} }_{\tfrac{\operatorname{d}V}{\operatorname{d}t}} < 0 \qquad \text{(i.e., } \tfrac{\operatorname{d}V}{\operatorname{d}t} < 0 \text{)} </math>
in a [[Neighbourhood (mathematics)|neighborhood]] of the surface given by <math>\sigma(\mathbf{x})=0</math>.
 
Roughly speaking (i.e., for the [[scalar (mathematics)|scalar]] control case when <math>m=1</math>), to achieve <math>\sigma^{\text{T}} \dot{\sigma} < 0</math>, the feedback control law <math> u(\mathbf{x}) </math> is picked so that <math>\sigma</math> and <math>\dot{\sigma}</math> have opposite signs. That is,
* <math>u(\mathbf{x})</math> makes <math>\dot{\sigma}(\mathbf{x})</math> negative when <math>\sigma(\mathbf{x})</math> is positive.
* <math>u(\mathbf{x})</math> makes <math>\dot{\sigma}(\mathbf{x})</math> positive when <math>\sigma(\mathbf{x})</math> is negative.
Note that
:<math>\dot{\sigma}
= \frac{\partial \sigma}{\partial \mathbf{x}} \overbrace{\dot{\mathbf{x}}}^{\tfrac{\operatorname{d} \mathbf{x}}{\operatorname{d} t}}
= \frac{\partial \sigma}{\partial \mathbf{x}} \overbrace{\left( f(\mathbf{x},t) + B(\mathbf{x},t) \mathbf{u} \right)}^{\dot{\mathbf{x}}}</math>
and so the feedback control law <math>\mathbf{u}(\mathbf{x})</math> has a direct impact on <math>\dot{\sigma}</math>.
 
====Reachability: Attaining sliding manifold in finite time====
To ensure that the sliding mode <math>\sigma(\mathbf{x})=\mathbf{0}</math> is attained in finite time, <math>\operatorname{d}V/{\operatorname{d}t}</math> must be more strongly bounded away from zero. That is, if it vanishes too quickly, the attraction to the sliding mode will only be asymptotic. To ensure that the sliding mode is entered in finite time,<ref>{{Cite book|title=Sliding Mode Control in Engineering|last1=Perruquetti|first1=W.|last2=Barbot|first2=J.P.|publisher=Marcel Dekker Hardcover|year=2002|isbn=0-8247-0671-4}}</ref>
:<math>\frac{\operatorname{d}V}{\operatorname{d}t} \leq -\mu (\sqrt{V})^{\alpha}</math>
where <math>\mu > 0</math> and <math>0 < \alpha \leq 1</math> are constants.
 
; Explanation by comparison lemma
This condition ensures that for the neighborhood of the sliding mode <math>V \in [0,1]</math>,
:<math>\frac{\operatorname{d}V}{\operatorname{d}t} \leq -\mu (\sqrt{V})^{\alpha} \leq -\mu \sqrt{V}.</math>
So, for <math>V \in (0,1]</math>,
:<math>\frac{ 1 }{ \sqrt{V} } \frac{\operatorname{d}V}{\operatorname{d}t} \leq -\mu,</math>
which, by the [[chain rule]] (i.e., <math>\operatorname{d}W/{\operatorname{d}t}</math> with <math>W \triangleq 2 \sqrt{V}</math>), means
:<math>\mathord{\underbrace{D^+ \Bigl( \mathord{\underbrace{2 \mathord{\overbrace{\sqrt{V}}^{ {} \propto \|\sigma\|_2}}}_{W}} \Bigr)}_{D^+ W \, \triangleq \, \mathord{\text{Upper right-hand } \dot{W}}}} = \frac{ 1 }{ \sqrt{V} } \frac{\operatorname{d}V}{\operatorname{d}t} \leq -\mu</math>
where <math>D^+</math> is the [[upper right-hand derivative]] of <math>2 \sqrt{V}</math> and the symbol <math>\propto</math> denotes [[proportionality (mathematics)|proportionality]]. So, by comparison to the curve <math>z(t) = z_0 - \mu t</math> which is represented by differential equation <math>\dot{z} = -\mu</math> with initial condition <math>z(0)=z_0</math>, it must be the case that <math>2 \sqrt{V(t)} \leq V_0 - \mu t</math> for all <math>t</math>. Moreover, because <math>\sqrt{V} \geq 0</math>, <math>\sqrt{V}</math> must reach <math>\sqrt{V}=0</math> in finite time, which means that <math>V</math> must reach <math>V=0</math> (i.e., the system enters the sliding mode) in finite time.<ref name="Khalil02">{{Cite book
| last = Khalil
| first = H.K.
| authorlink = Hassan K. Khalil
| year = 2002
| edition = 3rd
| url = http://www.egr.msu.edu/~khalil/NonlinearSystems/
| isbn = 0-13-067389-7
| title = Nonlinear Systems
| publisher = [[Prentice Hall]]
| location = Upper Saddle River, NJ}}</ref> Because <math>\sqrt{V}</math> is proportional to the [[Euclidean norm]] <math>\|\mathord{\cdot}\|_2</math> of the switching function <math>\sigma</math>, this result implies that the rate of approach to the sliding mode must be firmly bounded away from zero.
 
; Consequences for sliding mode control
In the context of sliding mode control, this condition means that
:<math> \underbrace{ \overbrace{\sigma^{\text{T}}}^{\tfrac{\partial V}{\partial \sigma}} \overbrace{\dot{\sigma}}^{\tfrac{\operatorname{d} \sigma}{\operatorname{d} t}} }_{\tfrac{\operatorname{d}V}{\operatorname{d}t}} \leq -\mu ( \mathord{\overbrace{\| \sigma \|_2}^{\sqrt{V}}} )^{\alpha}</math>
where <math>\|\mathord{\cdot}\|</math> is the [[Euclidean norm]]. For the case when switching function <math>\sigma</math> is scalar valued, the sufficient condition becomes
:<math> \sigma \dot{\sigma} \leq -\mu |\sigma|^{\alpha} </math>.
Taking <math>\alpha =1</math>, the scalar sufficient condition becomes
:<math> \operatorname{sgn}(\sigma) \dot{\sigma} \leq -\mu </math>
which is equivalent to the condition that
:<math> \operatorname{sgn}(\sigma) \neq \operatorname{sgn}(\dot{\sigma})
\qquad \text{and} \qquad
|\dot{\sigma}| \geq \mu > 0</math>.
That is, the system should always be moving toward the switching surface <math>\sigma = 0</math>, and its speed <math>|\dot{\sigma}|</math> toward the switching surface should have a non-zero lower bound. So, even though <math>\sigma</math> may become vanishingly small as <math>\mathbf{x}</math> approaches the <math>\sigma(\mathbf{x})=\mathbf{0}</math> surface, <math>\dot{\sigma}</math> must always be bounded firmly away from zero. To ensure this condition, sliding mode controllers are discontinuous across the <math>\sigma = 0</math> manifold; they ''switch'' from one non-zero value to another as trajectories cross the manifold.
 
===Theorem 2: Region of Attraction===
For the system given by Equation&nbsp;(1) and sliding surface given by Equation&nbsp;(2), the subspace for which the <math>\{ \mathbf{x} \in \mathbb{R}^n : \sigma(\mathbf{x})=\mathbf{0} \}</math> surface is reachable is given by
:<math>\{ \mathbf{x} \in \mathbb{R}^n : \sigma^{\text{T}}(\mathbf{x})\dot{\sigma}(\mathbf{x}) < 0 \}</math>
That is, when initial conditions come entirely from this space, the Lyapunov function candidate <math>V(\sigma)</math> is a [[Lyapunov function]] and <math>\mathbf{x}</math> trajectories are sure to move toward the sliding mode surface where <math>\sigma( \mathbf{x} ) = \mathbf{0}</math>. Moreover, if the reachability conditions from Theorem 1 are satisfied, the sliding mode will enter the region where <math>\dot{V}</math> is more strongly bounded away from zero in finite time. Hence, the sliding mode <math>\sigma = 0</math> will be attained in finite time.
 
===Theorem 3: Sliding Motion===
Let
:<math> \frac{\partial \sigma}{\partial{\mathbf{x}}} B(\mathbf{x},t) </math>
be [[nonsingular]]. That is, the system has a kind of [[controllability]] that ensures that there is always a control that can move a trajectory to move closer to the sliding mode. Then, once the sliding mode where <math> \sigma(\mathbf{x}) = \mathbf{0} </math> is achieved, the system will stay on that sliding mode. Along sliding mode trajectories, <math>\sigma(\mathbf{x})</math> is constant, and so sliding mode trajectories are described by the differential equation
:<math>\dot{\sigma} = \mathbf{0}</math>.
If an <math>\mathbf{x}</math>-[[stationary point|equilibrium]] is [[Lyapunov stability|stable]] with respect to this differential equation, then the system will slide along the sliding mode surface toward the equilibrium.
 
The ''equivalent control law'' on the sliding mode can be found by solving
:<math> \dot\sigma(\mathbf{x})=0 </math>
for the equivalent control law <math>\mathbf{u}(\mathbf{x})</math>. That is,
:<math>
\frac{\partial \sigma}{\partial \mathbf{x}} \overbrace{\left( f(\mathbf{x},t) + B(\mathbf{x},t) \mathbf{u} \right)}^{\dot{\mathbf{x}}} = \mathbf{0}</math>
and so the equivalent control
:<math>\mathbf{u} = -\left( \frac{\partial \sigma}{\partial \mathbf{x}} B(\mathbf{x},t) \right)^{-1} \frac{\partial \sigma}{\partial \mathbf{x}} f(\mathbf{x},t)</math>
That is, even though the actual control <math>\mathbf{u}</math> is not [[continuous function|continuous]], the rapid switching across the sliding mode where <math>\sigma(\mathbf{x})=\mathbf{0}</math> forces the system to ''act'' as if it were driven by this continuous control.
 
Likewise, the system trajectories on the sliding mode behave as if
:<math>\dot{\mathbf{x}} = \overbrace{f(\mathbf{x},t) - B(\mathbf{x},t) \left( \frac{\partial \sigma}{\partial \mathbf{x}} B(\mathbf{x},t) \right)^{-1} \frac{\partial \sigma}{\partial \mathbf{x}} f(\mathbf{x},t)}^{f(\mathbf{x},t) + B(\mathbf{x},t) u} = f(\mathbf{x},t)\left( \mathbf{I} - B(\mathbf{x},t) \left( \frac{\partial \sigma}{\partial \mathbf{x}} B(\mathbf{x},t) \right)^{-1} \frac{\partial \sigma}{\partial \mathbf{x}} \right)</math>
The resulting system matches the sliding mode differential equation
:<math>\dot{\sigma}(\mathbf{x}) = \mathbf{0}</math>
and so as long as the sliding mode surface where <math>\sigma(\mathbf{x})=\mathbf{0}</math> is [[Lyapunov stable|stable (in the sense of Lyapunov)]], the system can be assumed to follow the simpler <math>\dot{\sigma} = 0</math> condition after some initial transient during the period while the system finds the sliding mode. The same motion is approximately maintained provided the equality <math> \sigma(\mathbf{x}) = \mathbf{0} </math> only approximately holds.
 
It follows from these theorems that the sliding motion is invariant (i.e., insensitive) to sufficiently small disturbances entering the system through the control channel. That is, as long as the control is large enough to ensure that <math>\sigma^{\text{T}} \dot{\sigma} < 0</math> and <math>\dot{\sigma}</math> is uniformly bounded away from zero, the sliding mode will be maintained as if there was no disturbance. The invariance property of sliding mode control to certain disturbances and model uncertainties is its most attractive feature; it is strongly [[Robust control|robust]].
 
As discussed in an example below, a sliding mode control law can keep the constraint
:<math> \dot{x} + x = 0 </math>
in order to asymptotically stabilize any system of the form
:<math> \ddot{x}=a(t,x,\dot{x}) + u</math>
when <math>a(\cdot)</math> has a finite upper bound. In this case, the sliding mode is where
:<math>\dot{x} = -x</math>
(i.e., where <math>\dot{x}+x=0</math>). That is, when the system is constrained this way, it behaves like a simple [[BIBO stability|stable]] [[linear system]], and so it has a globally exponentially stable equilibrium at the <math>(x,\dot{x})=(0,0)</math> origin.
 
==Control design examples==
* Consider a [[plant (control theory)|plant]] described by Equation&nbsp;(1) with single input <math>u</math> (i.e., <math>m = 1</math>). The switching function is ''picked'' to be the linear combination
{| border="0" width="75%"
|-
| align="left" |
::<math>
\sigma(\mathbf{x}) \triangleq s_1 x_1 + s_2 x_2 + \cdots + s_{n-1} x_{n-1} + s_n x_n
</math>
| align="right" | <math>(4)\,</math>
|}
:where the weight <math>s_i > 0</math> for all <math>1 \leq i \leq n</math>. The sliding surface is the [[simplex]] where <math>\sigma(\mathbf{x})=0</math>. When trajectories are forced to slide along this surface,
::<math>\dot{\sigma}(\mathbf{x}) = 0</math>
:and so
::<math>s_1 \dot{x}_1 + s_2 \dot{x}_2 + \cdots + s_{n-1} \dot{x}_{n-1} + s_n \dot{x}_n = 0</math>
:which is a reduced-order system (i.e., the new system is of order <math>n-1</math> because the system is constrained to this <math>(n-1)</math>-dimensional sliding mode simplex). This surface may have favorable properties (e.g., when the plant dynamics are forced to slide along this surface, they move toward the origin <math>\mathbf{x}=\mathbf{0}</math>). Taking the derivative of the [[Lyapunov function]] in Equation&nbsp;(3), we have
::<math>
\dot{V}(\sigma(\mathbf{x}))
= \overbrace{\sigma(\mathbf{x})^{\text{T}}}^{\tfrac{\partial \sigma}{\partial \mathbf{x}}} \overbrace{\dot{\sigma}(\mathbf{x})}^{\tfrac{\operatorname{d} \sigma}{\operatorname{d} t}}</math>
:To ensure <math>\dot{V}</math> is a [[negative-definite function]] (i.e., <math>\dot{V} < 0</math> for [[Lyapunov stability]] of the surface <math>\mathbf{\sigma}=0</math>), the feedback control law <math>u(\mathbf{x})</math> must be chosen so that
::<math>\begin{cases}
\dot{\sigma} < 0 &\text{if } \sigma > 0\\
\dot{\sigma} > 0 &\text{if } \sigma < 0
\end{cases}</math>
:Hence, the product <math>\sigma \dot{\sigma} < 0</math> because it is the product of a negative and a positive number. Note that
{| border="0" width="75%"
|-
| align="left" |
::<math>\dot{\sigma}(\mathbf{x})
=  \overbrace{\frac{\partial{\sigma(\mathbf{x})}}{\partial{\mathbf{x}}} \dot{\mathbf{x}}}^{\dot{\sigma}(\mathbf{x})}
= \frac{\partial{\sigma(\mathbf{x})}}{\partial{\mathbf{x}}}
  \overbrace{\left( f(\mathbf{x},t) + B(\mathbf{x},t) u \right)}^{\dot{\mathbf{x}}}
= \overbrace{[s_1, s_2, \ldots, s_n]}^{\frac{\partial{\sigma(\mathbf{x})}}{\partial{\mathbf{x}}}}
  \underbrace{\overbrace{\left( f(\mathbf{x},t) + B(\mathbf{x},t) u \right)}^{\dot{\mathbf{x}}}}_{\text{( i.e., an } n \times 1 \text{ vector )}}</math>
| align="right" | <math>(5)\,</math>
|}
:The control law <math>u(\mathbf{x})</math> is chosen so that
::<math>u(\mathbf{x})
=
\begin{cases}
u^+(\mathbf{x}) &\text{if } \sigma(\mathbf{x}) > 0 \\
u^-(\mathbf{x}) &\text{if } \sigma(\mathbf{x}) < 0
\end{cases}</math>
:where
:* <math>u^+(\mathbf{x})</math> is some control (e.g., possibly extreme, like "on" or "forward") that ensures Equation&nbsp;(5) (i.e., <math>\dot{\sigma}</math>) is ''negative'' at <math>\mathbf{x}</math>
:* <math>u^-(\mathbf{x})</math> is some control (e.g., possibly extreme, like "off" or "reverse") that ensures Equation&nbsp;(5) (i.e., <math>\dot{\sigma}</math>) is ''positive'' at <math>\mathbf{x}</math>
:The resulting trajectory should move toward the sliding surface where <math>\sigma(\mathbf{x})=0</math>. Because real systems have delay, sliding mode trajectories often ''chatter'' back and forth along this sliding surface (i.e., the true trajectory may not smoothly follow <math>\sigma(\mathbf{x})=0</math>, but it will always return to the sliding mode after leaving it).
 
* Consider the [[dynamic system]]
::<math>\ddot{x}=a(t,x,\dot{x})+u</math>
:which can be expressed in a 2-dimensional [[state space (controls)|state space]] (with <math>x_1 = x</math> and <math>x_2 = \dot{x}</math>) as
::<math>
\begin{cases}
\dot{x}_1 = x_2\\
\dot{x}_2 = a(t,x_1,x_2) + u
\end{cases}</math>
:Also assume that <math>\sup\{ |a(\cdot)| \} \leq k</math> (i.e., <math>|a|</math> has a finite upper bound <math>k</math> that is known). For this system, choose the switching function
::<math>\sigma(x_1,x_2)= x_1 + x_2 = x + \dot{x}</math>
:By the previous example, we must choose the feedback control law <math>u(x,\dot{x})</math> so that <math>\sigma \dot{\sigma} < 0</math>. Here,
::<math>\dot{\sigma} = \dot{x}_1 + \dot{x}_2 = \dot{x} + \ddot{x} = \dot{x}\,+\,\overbrace{a(t,x,\dot{x})+ u}^{\ddot{x}}</math>
:* When <math>x + \dot{x} < 0</math> (i.e., when <math>\sigma < 0</math>), to make <math>\dot{\sigma} > 0</math>, the control law should be picked so that <math>u > |\dot{x} + a(t,x,\dot{x})|</math>
:* When <math>x + \dot{x} > 0</math> (i.e., when <math>\sigma > 0</math>), to make <math>\dot{\sigma} < 0</math>, the control law should be picked so that <math>u < -|\dot{x} + a(t,x,\dot{x})|</math>
:However, by the [[triangle inequality]],
::<math>|\dot{x}| + |a(t,x,\dot{x})| \geq |\dot{x} + a(t,x,\dot{x})|</math>
:and by the assumption about <math>|a|</math>,
::<math>|\dot{x}| + k + 1 > |\dot{x}| + |a(t,x,\dot{x})|</math>
:So the system can be feedback stabilized (to return to the sliding mode) by means of the control law
::<math>u(x,\dot{x})
=
\begin{cases}
  |\dot{x}| + k + 1 &\text{if } \underbrace{x + \dot{x}} < 0,\\
  -\left(|\dot{x}| + k + 1\right) &\text{if } \overbrace{x + \dot{x}}^{\sigma} > 0
\end{cases}</math>
:which can be expressed in [[closed-form expression|closed form]] as
::<math>u(x,\dot{x}) = -(|\dot{x}|+k+1) \underbrace{\operatorname{sgn}(\overbrace{\dot{x}+x}^{\sigma})}_{\text{(i.e., tests } \sigma > 0 \text{)}}</math>
:Assuming that the system trajectories are forced to move so that <math>\sigma(\mathbf{x})=0</math>, then
::<math>\dot{x} = -x \qquad \text{(i.e., } \sigma(x,\dot{x}) = x + \dot{x} = 0 \text{)}</math>
:So once the system reaches the sliding mode, the system's 2-dimensional dynamics behave like this 1-dimensional system, which has a globally exponentially stable [[stationary point|equilibrium]] at <math>(x,\dot{x})=(0,0)</math>.
 
===Automated design solutions===
Although various theories exist for sliding mode control system design, there is a lack of a highly effective design methodology due to practical difficulties encountered in analytical and numerical methods. A reusable computing paradigm such as a [[genetic algorithm]] can, however, be utilized to transform a 'unsolvable problem' of optimal design into a practically solvable 'non-deterministic polynomial problem'. This results in computer-automated designs for sliding model control. <ref name="GA_SMC96">
{{cite journal
|last1=Li
|first1=Yun, et al
|title=Genetic algorithm automated approach to the design of sliding mode control systems
|journal=International Journal of Control
|year=1996
|volume=64
|issue=3
|pages=721–739
|doi=10.1080/00207179608921865
|url=https://www.researchgate.net/publication/230602763_Genetic_algorithm_automated_approach_to_the_design_of_sliding_mode_control_systems/file/72e7e522667e30a16b.pdf?ev=pub_int_doc_dl&origin=publication_detail&inViewer=true
}}
</ref>
 
 
==Sliding mode observer==
Sliding mode control can be used in the design of [[state observer]]s. These non-linear high-gain observers have the ability to bring coordinates of the estimator error dynamics to zero in finite time. Additionally, switched-mode observers have attractive measurement noise resilience that is similar to a [[Kalman filter]].<ref name="UtkinGS99">{{Cite book|title=Sliding Mode Control in Electromechanical Systems|last1=Utkin|first1=Vadim|last2=Guldner|first2=Jürgen|last3=Shi|first3=Jingxin|year=1999|publisher=Taylor &amp; Francis, Inc.|location=Philadelphia, PA|isbn=0-7484-0116-4}}</ref><ref name="Drakunov83">{{Cite journal|last=Drakunov|first=S.V.|title=An adaptive quasioptimal filter with discontinuous parameters|journal=Automation and Remote Control|year=1983|volume=44|issue=9|pages=1167&ndash;1175}}</ref> For simplicity, the example here uses a traditional sliding mode modification of a [[Luenberger observer]] for an [[LTI system]]. In these sliding mode observers, the order of the observer dynamics are reduced by one when the system enters the sliding mode. In this particular example, the estimator error for a single estimated state is brought to zero in finite time, and after that time the other estimator errors decay exponentially to zero. However, as first described by Drakunov,<ref name="Drakunov92">{{Cite book|title=Sliding-Mode Observers Based on Equivalent Control Method|journal=Proceedings of the 31st IEEE Conference on Decision and Control (CDC), |last=Drakunov|first=S.V.|year=1992|issue=Tucson, Arizona, 16–18 December|pages=2368–2370|url=http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=371368&isnumber=8509|isbn=0-7803-0872-7}}</ref> a [[State observer#Sliding_mode_observer|sliding mode observer for non-linear systems]] can be built that brings the estimation error for all estimated states to zero in a finite (and arbitrarily small) time.
 
Here, consider the LTI system
:<math>\begin{align}
\dot{\mathbf{x}} &= A \mathbf{x} + B \mathbf{u}\\y &= \begin{bmatrix}1 & 0 & 0 & \cdots & \end{bmatrix} \mathbf{x} = x_1 \end{align}</math>
where state vector <math>\mathbf{x} \triangleq (x_1, x_2, \dots, x_n) \in \mathbb{R}^n</math>, <math>\mathbf{u} \triangleq (u_1, u_2, \dots, u_r) \in \mathbb{R}^r</math> is a vector of inputs, and output <math>y</math> is a scalar equal to the first state of the <math>\mathbf{x}</math> state vector. Let
:<math>A \triangleq \begin{bmatrix} a_{11} & A_{12} \\ A_{21} & A_{22} \end{bmatrix}</math>
where
* <math>a_{11}</math> is a scalar representing the influence of the first state <math>x_1</math> on itself,
* <math>A_{21} \in \mathbb{R}^{(n-1)}</math> is a column vector representing the influence of the other states on the first state,
* <math>A_{22} \in \mathbb{R}^{(n-1) \times (n-1)}</math> is a matrix representing the influence of the other states on themselves, and
* <math>A_{12} \in \mathbb{R}^{1\times(n-1)}</math> is a row vector corresponding to the influence of the first state on the other states.
 
The goal is to design a high-gain state observer that estimates the state vector <math>\mathbf{x}</math> using only information from the measurement <math>y=x_1</math>. Hence, let the vector <math>\hat{\mathbf{x}} = (\hat{x}_1,\hat{x}_2,\dots,\hat{x}_n) \in \mathbb{R}^n</math> be the estimates of the <math>n</math> states. The observer takes the form
:<math>\dot{\hat{\mathbf{x}}} = A \hat{\mathbf{x}} + B \mathbf{u} + L v(\hat{x}_1 - x_1)</math>
where <math>v: \R \mapsto \R</math> is a nonlinear function of the error between estimated state <math>\hat{x}_1</math> and the output <math>y=x_1</math>, and <math>L \in \mathbb{R}^n</math> is an observer gain vector that serves a similar purpose as in the typical linear [[state observer|Luenberger observer]]. Likewise, let
:<math>L = \begin{bmatrix} -1 \\ L_{2} \end{bmatrix}</math>
where <math>L_2 \in \mathbb{R}^{(n-1)}</math> is a column vector. Additionally, let <math>\mathbf{e} = (e_1, e_2, \dots, e_n) \in \mathbb{R}^n</math> be the state estimator error. That is, <math>\mathbf{e} = \hat{\mathbf{x}} - \mathbf{x}</math>. The error dynamics are then
:<math>\begin{align}
\dot{\mathbf{e}}
&= \dot{\hat{\mathbf{x}}} - \dot{\mathbf{x}}\\
&= A \hat{\mathbf{x}} + B \mathbf{u} + L v(\hat{x}_1 - x_1)
- A \mathbf{x} - B \mathbf{u}\\
&= A (\hat{\mathbf{x}} - \mathbf{x}) + L v(\hat{x}_1 - x_1)\\
&= A \mathbf{e} + L v(e_1)
\end{align}</math>
where <math>e_1 = \hat{x}_1 - x_1</math> is the estimator error for the first state estimate. The nonlinear control law <math>v</math> can be designed to enforce the sliding manifold
:<math>0 = \hat{x}_1 - x_1</math>
so that estimate <math>\hat{x}_1</math> tracks the real state <math>x_1</math> after some finite time (i.e., <math>\hat{x}_1 = x_1</math>). Hence, the sliding mode control switching function
:<math>\sigma(\hat{x}_1,\hat{x}) \triangleq e_1 = \hat{x}_1 - x_1.</math>
To attain the sliding manifold, <math>\dot{\sigma}</math> and <math>\sigma</math> must always have opposite signs (i.e., <math>\sigma \dot{\sigma} < 0</math> for [[almost everywhere|essentially]] all <math>\mathbf{x}</math>). However,
:<math>
\dot{\sigma} = \dot{e}_1
= a_{11} e_1 + A_{12} \mathbf{e}_2 - v( e_1 )
= a_{11} e_1 + A_{12} \mathbf{e}_2 - v( \sigma )
</math>
where <math>\mathbf{e}_2 \triangleq (e_2, e_3, \ldots, e_n) \in \mathbb{R}^{(n-1)}</math> is the collection of the estimator errors for all of the unmeasured states. To ensure that <math>\sigma \dot{\sigma} < 0</math>, let
:<math>v( \sigma ) = M \operatorname{sgn}(\sigma)</math>
where
:<math>M > \max\{ |a_{11} e_1 + A_{12} \mathbf{e}_2| \}.</math>
That is, positive constant <math>M</math> must be greater that a scaled version of the maximum possible estimator errors for the system (i.e., the initial errors, which are assumed to be bounded so that <math>M</math> can be picked large enough; al). If <math>M</math> is sufficiently large, it can be assumed that the system achieves <math>e_1 = 0</math> (i.e., <math>\hat{x}_1 = x_1</math>). Because <math>e_1</math> is constant (i.e., 0) along this manifold, <math>\dot{e}_1 = 0</math> as well. Hence, the discontinuous control <math>v(\sigma)</math> may be replaced with the equivalent continuous control <math>v_{\text{eq}}</math> where
:<math>
0 = \dot{\sigma} = a_{11} \mathord{\overbrace{e_1}^{ {} = 0 }} + A_{12} \mathbf{e}_2 - \mathord{\overbrace{v_{\text{eq}}}^{v(\sigma)}}
= A_{12} \mathbf{e}_2 - v_{\text{eq}}.</math>
So
:<math>
\mathord{\overbrace{v_{\text{eq}}}^{\text{scalar}}} = \mathord{\overbrace{A_{12}}^{1 \times (n-1) \text{ vector}}} \mathord{\overbrace{\mathbf{e}_2}^{(n-1) \times 1 \text{ vector}}}.
</math>
This equivalent control <math>v_{\text{eq}}</math> represents the contribution from the other <math>(n-1)</math> states to the trajectory of the output state <math>x_1</math>. In particular, the row <math>A_{12}</math> acts like an output vector for the error subsystem
:<math>
\mathord{\overbrace{
\begin{bmatrix}
\dot{e}_2\\
\dot{e}_3\\
\vdots\\
\dot{e}_n
\end{bmatrix}
}^{\dot{\mathbf{e}}_2}}
=
A_2
\mathord{\overbrace{
\begin{bmatrix}
e_2\\
e_3\\
\vdots\\
e_n
\end{bmatrix}
}^{\mathbf{e}_2}}
+
L_2 v(e_1)
=
A_2
\mathbf{e}_2
+
L_2 v_{\text{eq}}
=
A_2
\mathbf{e}_2
+
L_2 A_{12} \mathbf{e}_2
= ( A_2 + L_2 A_{12} ) \mathbf{e}_2.
</math>
So, to ensure the estimator error <math>\mathbf{e}_2</math> for the unmeasured states converges to zero, the <math>(n-1)\times 1</math> vector <math>L_2</math> must be chosen so that the <math>(n-1)\times (n-1)</math> matrix <math>( A_2 + L_2 A_{12} )</math> is [[Hurwitz matrix|Hurwitz]] (i.e., the real part of each of its [[eigenvalue]]s must be negative). Hence, provided that it is [[observable]], this <math>\mathbf{e}_2</math> system can be stabilized in exactly the same way as a typical linear [[state observer]] when <math>A_{12}</math> is viewed as the output matrix (i.e., "<math>C</math>"). That is, the <math>v_{\text{eq}}</math> equivalent control provides measurement information about the unmeasured states that can continually move their estimates asymptotically closer to them. Meanwhile, the discontinuous control <math>v = M \operatorname{sgn}( \hat{x}_1 - x )</math> forces the estimate of the measured state to have zero error in finite time. Additionally, white zero-mean symmetric measurement noise (e.g., [[Normal distribution|Gaussian noise]]) only affects the switching frequency of the control <math>v</math>, and hence the noise will have little effect on the equivalent sliding mode control <math>v_{\text{eq}}</math>. Hence, the sliding mode observer has [[Kalman filter]]&ndash;like features.<ref name="Drakunov83"/>
 
The final version of the observer is thus
:<math>\begin{align}
\dot{\hat{\mathbf{x}}}
&= A \hat{\mathbf{x}} + B \mathbf{u} + L M \operatorname{sgn}(\hat{x}_1 - x_1)\\
&= A \hat{\mathbf{x}} + B \mathbf{u} + \begin{bmatrix} -1\\L_2 \end{bmatrix} M \operatorname{sgn}(\hat{x}_1 - x_1)\\
&= A \hat{\mathbf{x}} + B \mathbf{u} + \begin{bmatrix} -M\\L_2 M\end{bmatrix} \operatorname{sgn}(\hat{x}_1 - x_1)\\
&= A \hat{\mathbf{x}} + \begin{bmatrix} B & \begin{bmatrix} -M\\L_2 M\end{bmatrix} \end{bmatrix} \begin{bmatrix} \mathbf{u} \\ \operatorname{sgn}(\hat{x}_1 - x_1) \end{bmatrix}\\
&= A_{\text{obs}} \hat{\mathbf{x}} + B_{\text{obs}} \mathbf{u}_{\text{obs}}
\end{align}</math>
where
* <math>A_{\text{obs}} \triangleq A</math>,
* <math>B_{\text{obs}} \triangleq \begin{bmatrix} B & \begin{bmatrix} -M\\L_2 M\end{bmatrix} \end{bmatrix}</math>, and
* <math>u_{\text{obs}} \triangleq \begin{bmatrix} \mathbf{u} \\ \operatorname{sgn}(\hat{x}_1 - x_1) \end{bmatrix}</math>.
That is, by augmenting the control vector <math>\mathbf{u}</math> with the switching function <math>\operatorname{sgn}(\hat{x}_1-x_1)</math>, the sliding mode observer can be implemented as an LTI system. That is, the discontinuous signal <math>\operatorname{sgn}(\hat{x}_1-x_1)</math> is viewed as a control ''input'' to the 2-input LTI system.
 
For simplicity, this example assumes that the sliding mode observer has access to a measurement of a single state (i.e., output <math>y=x_1</math>). However, a similar procedure can be used to design a sliding mode observer for a vector of weighted combinations of states (i.e., when output <math>\mathbf{y} = C \mathbf{x}</math> uses a generic matrix <math>C</math>). In each case, the sliding mode will be the manifold where the estimated output <math>\hat{\mathbf{y}}</math> follows the measured output <math>\mathbf{y}</math> with zero error (i.e., the manifold where <math>\sigma(\mathbf{x}) \triangleq \hat{\mathbf{y}} - \mathbf{y} = \mathbf{0}</math>).
 
==See also==
*[[Variable structure control]]
*[[Variable structure system]]
*[[Hybrid system]]
*[[Nonlinear control]]
*[[Robust control]]
*[[Optimal control]]
*[[Bang–bang control]]&nbsp;&ndash; Sliding mode control is often implemented as a bang–bang control. In some cases, such control is necessary for [[optimal control|optimality]].
*[[H-bridge]]&nbsp;&ndash; A topology that combines four switches forming the four legs of an "H". Can be used to drive a motor (or other electrical device) forward or backward when only a single supply is available. Often used in actuator in sliding-mode controlled systems.
*[[Switching amplifier]]&nbsp;&ndash; Uses switching-mode control to drive continuous outputs
*[[Delta-sigma modulation]]&nbsp;&ndash; Another (feedback) method of encoding a continuous range of values in a signal that rapidly switches between two states (i.e., a kind of specialized sliding-mode control)
*[[Pulse density modulation]]&nbsp;&ndash; A generalized form of delta-sigma modulation.
*[[Pulse-width modulation]]&nbsp;&ndash; Another modulation scheme that produces continuous motion through discontinuous switching.
 
==Notes==
{{Reflist|group=nb}}
 
==References==
{{Reflist}}
 
==Further reading==
{{Refbegin}}
*{{Cite book
| last1        = Acary
| first1      = V.
| last2        = Brogliato
| first2      = B.
| title        = Numerical Methods for Nonsmooth Dynamical Systems. Applications in Mechanics and Electronics
| publisher    = Springer-Verlag, LNACM 35
| place        = Heidelberg
| year        = 2008
| isbn        = 978-3-540-75391-9
}}
*{{cite journal
| author = Drakunov S.V., Utkin V.I..
| year = 1992
| title = Sliding mode control in dynamic systems
| journal = International Journal of Control
| volume = 55
| number = 4
| pages = 1029&ndash;1037
| url = http://www.tandfonline.com/doi/abs/10.1080/00207179208934270?journalCode=tcon20#.UbOFHlF_mf4
| doi = 10.1080/00207179208934270
}}
*{{Cite book|title=Advances in Variable Structure and Sliding Mode Control|editor1-last=Edwards|editor1-first=Cristopher|editor2-last=Fossas Colet|editor2-first=Enric|editor3-last=Fridman|editor3-first=Leonid|publisher=Springer-Verlag|location=Berlin|year=2006|series=Lecture Notes in Control and Information Sciences|volume=vol 334|isbn=978-3-540-32800-1}}
*{{Cite book
| last1        = Edwards
| first1      = C.
| last2        = Spurgeon
| first2      = S.
| title        = Sliding Mode Control: Theory and Applications
| publisher    = Taylor and Francis
| place        = London
| year        = 1998
| isbn        = 0-7484-0601-8
}}
*{{Cite book
| author    = [http://www.ece.osu.edu/~utkin/ Utkin, V.I.]
| title      = Sliding Modes in Control and Optimization
| publisher  = Springer-Verlag
| year      = 1992
| isbn      = 978-0-387-53516-6
}}
*{{Cite book
| editor-last  = Zinober
| editor-first = Alan S.I.
| title        = Variable Structure and Lyapunov Control
| publisher    = Springer-Verlag
| place        = London
| year        = 1994
| isbn        = 978-3-540-19869-7
| doi          = 10.1007/BFb0033675
}}
{{Refend}}
 
{{DEFAULTSORT:Sliding Mode Control}}
[[Category:Control theory| ]]
[[Category:Nonlinear control]]

Revision as of 23:57, 9 February 2014

The prospect encounter at all for the restaurant, Kelly was shown to Teresa's dad. Instantly, Kelly caught a look into at her own mother. Simply serving coffee and exchanging several words and phraases experienced convinced Kelly: Here is an efficient man, an outstanding man, who dearly is all about his family. Teresa must meet my myself own Dad.

Guys may possibly play applications to rest following a extremely long working day in the workplace. Some like socializing by tinkering by friends and family. In case you loved this post and you would want to receive much more information about hack clash of clans i implore you to visit the page. If you have whichever inquiries about where you will understand to use Clash together with Clans Cheat, you creates contact with us near the our web site. Other individuals perform these when they're jobless and after that require something for removing their brains away his or her own scenario. No matter reasons why you enjoy, this information will help you along to engage in ordinary way which is far better.

Temperance is essential in almost things, and enjoying clash of clans cheats is no unlike. Playing for hours on finish is simply not good-for-you, bodily or in your head. There are some games out there which know this and include measures to remind in order to take rests. Take the initiative yourself, although! Place an alarm which don't play for minimum an hour right.

A terrific method to please youngsters with a gaming network and ensure they endure fit is to purchase a Wii. This the game console . needs real task perform. Your children won't be perched for hours on ending playing clash of clans hack. They are moving around as a method to play the games for this particular system.

To help keep your game just some possible. While car-preservation is a good characteristic, do not count about it. Particularly, when you in the start playing a game, you may not provide any thought when currently the game saves, which could very well result in a more affordable of significant info down the line. Until you learn about the sport better, unfailingly save yourself.

Courtesy of - borer on a boondocks anteroom you possibly is going to appearance added advice that's about that play, scout, union troops, or attack. Of course, these triumphs will rely on what appearance of the war you might be found in.

It's actually a nice technique. Breaking the appraisement bottomward into chunks of all their time that accomplish faculty to be able regarding bodies (hour/day/week) causes the problem to be accessible time for visualize. Everybody appreciates what it appears the same as to accept to hold off on a day. It happens to be additionally actual accessible which will tune. If you can change your current apperception after and adjudge just that one day should group more, all you claims to complete is change 1 value.