Super Twisting Algorithm-Based Step-By-S
Super Twisting Algorithm-Based Step-By-S
This paper highlights the interest of step-by-step higher order sliding mode observers for MIMO
nonlinear systems with unknown inputs. A structural matching condition, stating on the possibility
to design such observers and to reconstruct the unknown inputs, is derived. A finite time sliding
mode observer, based on the hierarchical use of the super twisting algorithm, is developed. Then, it
is shown that this observer is of interest in the field of hybrid systems and systems with observability
singularities. Lastly, it is shown through an example how to relax the usual matching condition by
the means of this type of finite time sliding mode observer.
Keywords: Nonlinear systems, unknown inputs, sliding mode observers, super twisting algorithm,
matching condition.
1 Introduction
? Corresponding author
c
International Journal of Systems Science ISSN 0020-7721 print/ ISSN 1464-5319 online °2005 Taylor & Francis Ltd
http://www.tandf.co.uk/journals
DOI: 10.1080/00207720xxxxxxxxxxxxx
2 Step-by-step sliding mode observers for nonlinear systems with unknown inputs
Other works rely on the use of discontinuous observers and sliding mode
methodology (see Utkin 1992, Edwards and Spurgeon 1998 or Perruquetti and
Barbot 2002 for further information on sliding mode control and observation).
The system trajectories are constrained to reach and stay, after a finite time,
on a given sliding manifold for which the output error is zero. The sliding
motion provides an estimation of the system state, asymptotically (see e.g.
Walcott and Żak 1987, Slotine et al. 1987, Utkin 1992, Edwards and Spurgeon
1994, Tan and Edwards 2001, Poznyak 2003, Shtessel et al. 2003) or in finite
time (for instance, one can refer to the works of Drakunov 1992, Drakunov
and Utkin 1995, Barbot et al. 1996, Haskara et al. 1998, Utkin et al. 1999 for
design methods based on first order sliding mode algorithms and the works of
Levant 1998, Bartolini et al. 2000, Saadaoui et al. 2006 for second order ones).
Sliding mode observers have been shown to be a robust observation scheme
in robotics (Canudas de Wit and Slotine 1991, Hernandez and Barbot 1996,
Manamanni et al. 2001), electrical engineering (Djemaı̈ et al. 1999, Utkin et al.
1999) or chemical reactors (Martinez-Guerra et al. 2004). Specific applications
of asymptotic and finite time observers for systems with unknown inputs can
be found in a large number of fields such as fault detection and identification
(Edwards et al. 2000, Goh et al. 2002, Tan and Edwards 2003, Floquet et al.
2004), parameter identification (Floret-Pontet and Lamnabhi-Lagarrigue 2001,
Shtessel and Poznyak 2004), cryptography (Barbot et al. 2003), or mechanical
systems with Coulomb friction (Davila et al. 2005, Garrido et al. 2004, Orlov
et al. 2003).
The first part of this paper deals with the possibility to design finite time
sliding mode observers for autonomous MIMO nonlinear systems subject to
unknown inputs. Finite time sliding mode observers, are usually designed un-
der the assumptions that the system can be put in a set of triangular ob-
servable forms, where the unknown inputs act only on the last dynamics of
each triangular form. This assumption is known as the observability matching
condition (it can be seen as the analogue of the well-known matching condi-
tion given in Drazenovic (1969) for a sliding mode controller to be insensitive
to matched perturbations). This condition was explicitly given in the case of
SISO observable linear systems in Perruquetti and Barbot (2002), Chapter 4.
Here, the condition is derived for MIMO nonlinear systems and is expressed
in terms of the observability indices of the system and its relative degrees with
respect to the unknown inputs. Then, a finite time higher order sliding mode
observers, based on the iterative use of the super twisting algorithm (a second
order sliding mode algorithm), is introduced in order to obtain the state and
the unknown inputs in finite time.
The finite time convergence property of sliding mode observers is often de-
sirable in the framework of observation and particularly for the purpose of
observer-based controller design for nonlinear systems. Then, for a large class
T. Floquet and J.-P. Barbot 3
of nonlinear systems, the observer can be designed separately from the con-
troller and the separation principle does not need to be proved. As shown in
many papers, it can also be of paramount importance in applications that
require fast estimations of some unknown inputs like fault detection and iden-
tification or on-line parameter identification. In the second part of this paper,
other relevant applications are described. It is shown that finite time higher
order sliding mode observers can cope with the problem of observability singu-
larities that may occur in nonlinear systems. A straightforward application can
be found in the domain of secure communication and cryptography, where the
confidential information (the unknown inputs) can be hidden in observability
bifurcations. Variable structure observers can also be of high interest to solve
the observation problem of some class of hybrid systems (switched systems).
Lastly, it is shown through an example that the matching conditions com-
monly assumed when designing sliding mode observers can be relaxed using
the given sliding mode observer.
Notations: LX ψ denotes the classical Lie derivative of the function ψ along
the vector field X and dψ is the differential of the function ψ. The codistrib-
ution ∆⊥ stands for the annihilator of the distribution ∆.
p
X
ki = n
i=1
(ii)
dh1 (x)
dLf h1 (x)
..
.
k1 −1
dLf h1 (x)
rank .. =n
.
dh p
..
.
kp −1
dLf hp (x)
Proposition 2.2 Assume the system (1) is locally weakly observable. There
exists a change of coordinates such that (1) is locally transformed into
where
h¡ ¢ iT
T
ξ= ξ 1 . . . (ξ p )T , ξ i ∈ Rki
0 1 0 0 0 0
0 0 1 00 ..
. ..
Ai = .. .. .. ∈ Rki ×ki , Fi (ξ) = .
∈ Rki ,
.. . . . .
0
0 0 0 1 0
ki
Lf hi (x)
0 0 0 0 0
0 0 0
.. .. ..
. . .
Gi (ξ) = ∈ Rki ×m
0 0 0
Lg1 Lkf i −1 hi (x) . . . Lgm Lfki −1 hi (x)
..
.
³ ´
d Lkf i −1 hi (x) m
X
= Lkf i hi (x) + Lgj Lkf i −1 hi (x)wj
dt
j=1
6 Step-by-step sliding mode observers for nonlinear systems with unknown inputs
Thus, the system is described by (2)-(3) in the new coordinates, with Gi (ξ) 6= 0
if and only if ki = ρi . ¤
As a consequence, the system (1), even if it is weakly observable,
Pp can not be
put into the block triangular observable form (2)-(3) if i=1 ρi < n.
Remark 1 The condition ki ≤ ρi can also be stated in terms of codistribution.
Indeed,
ki ≤ ρi ⇐⇒ gj (x) ∈ Ω⊥ 0
i (x) , for all x ∈ V(x ), for all j = 1 : m,
where
n o
Ωi (x) = span dhi (x), dLf hi (x), . . . , dLkf i −2 hi (x) .
Remark 2 For sake of simplicity, the case of nonlinear systems with known
inputs is not discussed here. It is known that observability of nonlinear systems
depends on known control inputs u. However, the result given in Proposition
2.2 can be extended for uniformly observable systems, i.e. systems which are
observable independently of the inputs (see Gauthier and Bornard (1981) for
a work on uniformly observable systems and Barbot et al. (1996) for a sliding
mode observer design for such systems).
Finite time sliding mode observers are usually designed for system in the
form (2)-(3). One can refer to the works Haskara et al. (1998), Utkin et al.
(1999) for linear and linear time varying systems or to Drakunov (1992),
Drakunov and Utkin (1995), Barbot et al. (1996), Xiong and Saif (2001)1
for nonlinear systems. All of them are based on the analyze of the so-called
equivalent output injection (which is the counterpart of the equivalent control
in the design of sliding mode control). The estimation of the state is based
on a procedure using the successive filtered values of equivalent output injec-
tions obtained from recursive first order sliding mode observers. However, the
approximation of the equivalent output injections by low pass filters at each
step may introduce some delays that could lead to inaccurate estimates or to
instability for high order systems2 . To overcome this problem, a second order
sliding mode algorithm can be used in the innovative term of the observer. In
the next part, a super twisting based sliding mode observer is designed for the
finite time estimation of a n-order system in the form (2)-(3).
1 Notethat in Xiong and Saif (2001), a first order sliding mode observer is designed for a system with
asymptotically stable zero dynamics. This results in a partial finite time stabilization of the state.
2 In Haskara and Özgüner (1999), the implementation of such filters was studied and a relation
between the estimation accuracy, the filter time constants and the sampling time was given.
T. Floquet and J.-P. Barbot 7
A robust and finite time exact differentiator based on the super twisting algo-
rithm (a second order sliding mode algorithm (Levant 1993)) was introduced
in Levant (1998) and successfully applied in Garrido et al. (2004) and Pisano
and Usai (2004). This approach was extended to the design of arbitrary or-
der robust exact differentiators with finite time convergence in Levant (2003,
2005) using homogeneity properties and in Bejarano et al. (2006) using some
hierarchical procedure. In Barbot et al. (1996), a so-called step-by-step first
order sliding mode observer for the finite time estimation of the state vari-
ables was developed. Hereafter, a similar observer based on the super twisting
algorithm is given.
½
ẋ1 = x2 , . . . , ẋn−1 = xn
(4)
ẋn = α(x) + β(x)ω
0
|ω(t)| < K1 , |ω̇(t)| < K1 ,
0
|α(t)| < K2 , |α̇(t)| < K2 ,
¯ ¯
¯ ¯ 0
|β(t)| < K3 , ¯β̇(t)¯ < K3 ,
8 Step-by-step sliding mode observers for nonlinear systems with unknown inputs
0
where Ki and Ki are some known positive scalars. Let us design the following
observer:
x̂˙ = x̃2 + λ1 |e1 |1/2 sign(e1 )
˙1
x̃2 = α1 sign(e 1)
˙ h i
x̂ = E x̃ + λ |e |1/2
sign(e )
2 1 3 2 2 2
x̃˙ 3 = E1 αh2 sign(e2 ) i
x̂˙ = E x̃ + λ |e |1/2 sign(e )
3 2 4 3 3 3
..
. (5)
˙
x̃n−1 = En−3 αhn−2 sign(en−2 )
i
x̂˙ n−1 = En−2 x̃n + λn−1 |en−1 |1/2 sign(en−1 )
x̃˙ n = En−2 αn−1 sign(en−1 )
h i
˙ 1/2
x̂
n
= E n−1 θ̃ + λ |e
n n | sign(e n )
˙
θ̃ = En−1 αn sign(en )
h iT h iT
where ei = x̃i − x̂i for i = 1, .., n, with x̃1 = x1 and x̃, θ̃ = x̃1 , x̃2 , ...x̃n , θ̃
is the output of the observer. For i = 1, ..., n − 1, the scalar functions Ei are
defined as
where ε is a small positive constant. The observer gains λi and αi are positive
scalars.
The convergence of the state observation error is obtained in (n − 1) steps
and in finite time.
First step: Assume e1 (0) 6= 0, the error dynamics is given by:
Equations (6)-(7) coincide with the so-called super twisting algorithm and the
remaining dynamics is bounded in finite time. The second time derivative of
T. Floquet and J.-P. Barbot 9
e1 is given by:
1 1
ë1 = x3 − α1 sign (e1 ) − λ1 ė1 |e1 |− 2 .
2
Sufficient conditions for the finite time convergence on the second order sliding
set {e1 = ė1 = 0} are:
α1 > d3 ,
α1 + d3
λ21 > 4d3 ,
α1 − d3
and one can find an upper bound of the convergence time (see Levant 1998,
Davila et al. 2005, Saadaoui et al. 2006). The equivalent dynamics provides
after a finite time T1 a continuous estimation of x2 (without any introduction
of low pass filters): x̃2 = x2 . The functions Ei are introduced so that the ei ’s,
i = 2, ..., n, do not escape two far before the good information on x̂1 and x̃2 is
obtained. Indeed,
except on a finite number of finite time intervals where |e1 | may be less than
ε before the second order sliding set {e1 = ė1 = 0} is reached.
Second step: after a finite time, one has E1 = 1 and the observer dynamics
becomes:
ė1 = 0
ė2 = x3 − x̃3 − λ2 |e2 |1/2 sign(e2 )
x̃˙ 3 = α2 sign(e2 )
h i
ė3 = α2 sign(e2 ) − E2 x̃4 + λ3 |e3 |1/2 sign(e3 )
h i
ėi = Ei−2 αi−1 sign(ei−1 ) − Ei−1 x̃i+1 + λi |ei |1/2 sign(ei ) , i = 4, ..., n − 1
h i
ėn = En−2 αn−1 sign(en−1 ) − En−1 θ̃ + λn |en |1/2 sign(en )
Again, the structure of a super twisting algorithm appears. Thus, the trajecto-
ries converge in finite time onto {e2 = ė2 = 0}. As a consequence, x̃3 provides
an estimation of x3 .
10 Step-by-step sliding mode observers for nonlinear systems with unknown inputs
Following the same scheme till the (n − 1)-th step, an estimation of the
whole state x is obtained in finite time. The finite time estimation of the
unknown inputs can be obtained with the n-th step of the observer.
n-th step: the observer dynamics is given by:
ė1 = . . . = ėn−1 = 0
ėn = α(x) + β(x)ω − θ̃ − λn |en |1/2 sign(en )
θ̃˙ = α sign(e )
n n
and a sliding motion appears after a finite time on the sliding manifold en =
ėn = 0. One has:
1 1
ën = α̇(x) + β̇(x)ω + β(x)ω̇ − αn sign (en ) − λn ėn |en |− 2 .
2
Thus, choosing
0 0 0
αn > K2 + K3 K1 + K3 K1 ,
³ 0 ´ α + K0 + K0 K + K K0
0 0 n 3 1 3 1
λ2n > 4 K2 + K3 K1 + K3 K1 ¡ 20 0 0
¢,
αn − K2 + K3 K1 + K3 K1
a second order sliding motion appears on {en = ėn = 0}. Then, a continuous
approximation ω̃ of the unknown variables, on every subset of Rn where β(x) 6=
0, is:
h i
ω̃ = β −1 (x̃) θ̃ − α(x̃) .
The successive equivalent output injections on the sliding manifolds are ob-
tained in a continuous way (they are all outputs of some integrators and so
they are less affected by the chattering phenomenon) and without any intro-
duction of low pass filters.
2.2.2 MIMO case. Consider a system with p outputs and m unknown in-
puts in the form (2)-(3). It is constituted of p blocks in a triangular observable
form similar to (4). The design of an observer (5) for each block results in the
finite time estimation of the state variables and the following relations:
m
X
Lkf i hi (x) + Lgj Lkf i −1 hi (x)wj = θ̃i , i = 1 : p (9)
j=1
T. Floquet and J.-P. Barbot 11
where θ̃i is the equivalent output injection of the last observer variable of each
block. The relations (9) can be rewritten as:
Lg1 Lkf 1 −1 h1 (x) ... Lgm Lkf 1 −1 h1 (x) θ̃1 − Lkf 1 h1 (x)
.. .. ..
. . w = .
k −1 k −1 k
Lg1 Lf p hp (x) ... Lgm Lf p hp (x) θ̃p − Lf p hp (x)
Let us assume that the distribution span {g1 (x), . . . , gm (x)} is nonsingular for
all x ∈ V(x0 ). Then, the matrix
Lg1 Lkf 1 −1 h1 (x) ... Lgm Lkf 1 −1 h1 (x)
.. ..
Λ(x) = . .
k −1 k −1
Lg1 Lf p hp (x) ... Lgm Lf p hp (x)
has also full column rank. Then, the set of integers {ρ1 , ..., ρp } is exactly the
vector relative degree as it is defined in Isidori (1995), p. 220.
12 Step-by-step sliding mode observers for nonlinear systems with unknown inputs
ẋ1 x2
ẋ2 = −x1 + x2 x3 := f (x) + g(x)m (10)
ẋ3 2 2 3
x3 − (1 + x1 + x2 )x3 + m
y = x1 := h(x) (11)
This system is locally weakly observable because the rank condition given in
Hermann and Krener (1977) is satisfied, i.e.:
dh 1 0 0
dLf h 0 1 0
2 −1
rank dLf3 h = rank
∗
x3 x2
2 2 2
=3
dLf h ∗ −x1 + x2 (1 + 2x3 − 3x3 (1 + x1 + x2 ))
.. .. ..
..
. . . .
where ẽi = x̃i − x̂i , with x̃1 = x1 (i = 1, 2, 3). λ1 , α1 , λ2 , α2 , and K are positive
constant and the functions Ei (i = 1, 2) and Es are given by:
and
Es = 0 if |x̃2 | ≤ ε, else Es = 1.
Provided that the system trajectories evolve outside the manifold of singularity
S, the output of this observer provides a finite time estimation of x and m:
Step 1: From the section 2.2, there exists a time t1 > 0 such that, ∀t > t1 ,
the first exact differentiator gives x̂1 = x1 and x̃2 = x2 .
Step 2: For t > t1 , E1 = 1. Thus ∃t2 > t1 such that ∀t > t2 , the second exact
differentiator gives x̂2 = x̃2 = x2 and υ2 = x2 x3 . If |x2 | > ε, then Es = 1 and
the relation (13) gives x̃3 = x3 . Otherwise, Es = 0 and x̃3 = x̂3 .
Step 3: For t > t2 , E2 = 1. If Es = 1, the observation error dynamics of
e3 = x3 − x̂3 is equal to:
Thus, the observer can be viewed as an “estimator”. The system (15) can
be shown to be stable for sufficiently large x̂3 and, consequently, e3 remains
always bounded.
Since the manifold of observability bifurcation S is not an invariant set
except for the trivial solution m = x1 = x2 = 0 (or very particular m), the
observer will converge in finite time to e3 = 0. Note that for m = x2 = x1 = 0,
both the state x3 and the observed state x̂3 asymptotically converge to 1.
This type of observability singularity have to be overcome in applications
such as bioprocess (Rapaport and Maloum 2000) or induction motor without
mechanical sensor (Canudas de Wit et al. 2000). On another hand, it can be
very useful for particular application such as secure data transmission (Barbot
et al. 2003). Indeed, the confidential message can be hidden in some observabil-
ity singularity and one has to design a variable structure observer to recover
it.
where x ∈ Rn , y ∈ R is the output, fi (x) are smooth vector fields, and hi (x),
σ(x) are smooth functions. The continuous state space Rn is partitioned into
two operating regions by means of the switching surface σ(x) = 0. Let us
denote the switching times t1 , t2 ,... A difficulty arises from the fact that the
observer has to converge in a time less than the evolution duration ti+1 − ti
(before each switching of the system). Here, it is shown that the use of the
step-by-step sliding mode observer can be of high interest for the observation
problem of switched systems.
It is assumed that:
A.1 the system (16) is bounded state in finite time1 and without jump.
1 Theassumption of bounded state must concern the whole system. Indeed, all the subsystems can
be perfectly stable, while the global system can be unstable due to the switching phenomenon.
T. Floquet and J.-P. Barbot 15
A.3 ti+1 − ti > δ for all i. δ is called the dwell time Liberzon (2003).
Assumption A.3 means that systems with Zeno phenomenon are not con-
sidered. Under those assumptions, one can conclude that the global system
(16) is observable if the dynamics of evolution of the system is known. Let us
consider the state transformation defined by:
j
zi+1 = φji+1 (x) = Lifj hj (x) for 0 ≤ i ≤ n − 1, j = 1 : 2.
that Tf < δ, one has the knowledge of the state between each switching of
the system.
A lot of observers for switched systems in the literature assume the
knowledge of the operating regions (i.e. the value of the switching function
σ). Here, under the assumption that gi (x) and ġi (x) are bounded, one
can get the continuous equivalent output injection (in the n-th step of the
convergence of the observer) θ̃ = gj (z1j , z2j , ..., znj ) that can be compared
to each value of gj (z̃1j , z̃2j , ..., z̃nj ), j = 1, 2 in order to know the operating
region where the system evolves (see Boutat et al. 2004 or Chaib et al. 2005
for more details on the geometrical conditions establishing this region).
(ii) In Djemaı̈ et al. (2005), a step-by-step first order sliding mode observer was
mainly employed for the same reasons: the finite time convergence and the
ability to take naturally into account the variable structure of the hy-
brid system. Nevertheless, some difficulties occurred due to the chattering
phenomena. It induced some irrelevant decision of switching between the
subsystems when the trajectory was in the neighborhood of the switching
manifold. This problem was bypassed by using a low pass filter during the
computation of the equivalent vector. However, this solution introduced a
delay in the observed state (asymptotic convergence) and again that could
lead to false information about the discrete state of the system. Thus, the
second order sliding mode observer can be a powerful and efficient tool
to solve this problem of observation because of its ability to provide a
continuous and accurate finite time estimation.
Further work may deal with the design of observers for switched or im-
pact systems with jumps and non autonomous systems which turns out to be
particularly useful in many applications.
put in the form (2)-(3). Let us consider the following nonlinear system:
ẋ1 x2
ẋ2 sin(x1 ) − x4 + m1
= (19)
ẋ3 x4 + m1
ẋ4 cos(x3 ) + m2
µ ¶ µ ¶ µ ¶
y1 h1 x1
= = (20)
y2 h2 x3
where all the states are bounded ∀t ≥ 0 and where m1 , m2 are some bounded
unknown inputs. Figure 1 is a block diagram of (19)-(20).
Sin(x1)
m1
X2 X1 y1
1/p 1/p
x3 y2
1/p
X4
1/p
m2
Cos(x3)
For this system, one has ρ1 = 2 and ρ2 = 1 with respect to the outputs y1 and
y2 . Thus, according to Proposition 2.2, (19)-(20) can not be transformed into
a form similar to (2)-(3), and as a consequence usual sliding mode observers
fail to estimate the state in finite time. Furthermore, the matrix
à ! µ ¶
Lg1 Lρf1 −1 h1 (x) Lg2 Lρf1 −1 h1 (x) 10
Γ(x) = =
Lg1 Lρf2 −1 h2 (x) Lg2 Lρf2 −1 h2 (x) 10
is singular ∀x ∈ R4 and the method developed in Xiong and Saif (2001), that
could eventually lead to the asymptotic estimation of x, can neither be applied.
Let us show that one can even though estimate both state and unknown in-
puts using the finite time sliding mode observer described in Section 2.2. Define
a fictitious output as y3 = y2 − ẏ1 = x3 − x2 . One has ρ1 = 2, ρ2 = 1 and
ρ3 = 2 with respect to the fictitious output ȳ = [y1 , y2 , y3 ]T , while the observ-
ability indices are {1, 1, 2}. The change of coordinates φ(x) = [ξ1 , ξ2 , ξ3 , ξ4 ]T =
[y1 , y2 , y3 , x4 ]T = [x1 , x3 , x3 − x2 , x4 ]T , defined for all x ∈ R4 , transforms the
18 Step-by-step sliding mode observers for nonlinear systems with unknown inputs
system into a set of block triangular observable forms with respect to ȳ:
˙
ξ1 ξ2 − ξ3
ξ˙2 ξ4 + m1
= (21)
ξ˙3 −sin(ξ1 ) + 2ξ4
ξ˙4 cos(ξ2 ) + m2
x1 y1
1/2 1/p
sin(x1 )
x4 x3 y3
m2
1/p 1/p
2
cos(x 2 )
m1 x2 y2
2 1/p
Following the lines of Section 2.2, a state observer can be designed as:
x̂˙ 1 = x̃2 + λ1 |ẽ1 |1/2 sign(ẽ1 )
x̃˙ 2 = α1 sign(ẽ
h 1) i
˙ (22)
ξˆ3 = E1 −sin(y1 ) + 2ξ˜4 + 2λ3 |ẽ3 |1/2 sign(ẽ3 )
˙˜
ξ4 = E1 α3 sign(ẽ3 )
exact differentiator gives ξˆ3 = ξ3 and ξ˜4 = ξ4 . Thus, the full original state
[x1 , x2 , x3 , x4 ]T = [y1 , y2 − ξ3 , y2 , ξ4 ]T has been obtained in finite time.
Now, let us assume that ṁ1 , ṁ2 are bounded. The following observer pro-
vides a finite time estimation of m1 and m2 :
˙
ξˆ2 = Eobs [x̃4 + m̃1 + λm1 |ẽ2 |1/2 sign(ẽ2 )]
m̃˙1 = Eobs αhm1 sign(ẽ2 ) i
˙ (23)
ξˆ4 = Eobs cos(y2 ) + m̃2 + λm2 |ẽ4 |1/2 sign(ẽ4 )
˙
m̃2 = Eobs αm2 sign(ẽ4 )
where
Eobs = 0 if t < t2 ,
else Eobs = 1.
For t > t2 , the first part of the observer has converged, all the state is available
and Eobs = 1. Then, the output of the two exact differentiators in (23) gives
a finite time estimation of m̃1 = m1 and m̃2 = m2 .
The observer design can be represented by the scheme given in Figure 3.
Remark 2 The finite time sliding mode observers designed in Levant (2005)
and in Bejarano et al. (2006) can be also used in this kind of problem.
4 Conclusion
state and unknown inputs have been derived. Then, a finite time sliding mode
observer based on the iterative use of the super twisting algorithm has been
proposed. It was shown that this kind of observer could be a powerful tool
to solve quite difficult problems of observation, like the design of observers
for switched systems. A modified version of the sliding mode observer was
designed for systems with observability singularities. It should be stressed
that few papers are devoted to the problem of sliding mode observer design for
these two promising fields of investigation. Lastly, by the way of an illustrative
example, a finite time observer was designed for a nonlinear system that do
not satisfies the matching condition. Further works aim at generalizing this
idea.
REFERENCES
Springer-Verlag, 1992.
V. I. Utkin, J. Guldner and J. Shi, Sliding mode control in electromechanical
systems, Taylor and Francis, London, 1999.
R. Vidal, A. Chiuso, S. Soatto and S. S. Sastry, “Observability of linear hybrid
systems, in: Hybrid Systems: Computation and Control, Lecture Notes in
Computer Science, Springer Verlag, Vol. 2623, pp. 526–539, 2003.
B. L. Walcott and S. H. Żak, “State observation of nonlinear uncertain dynam-
ical systems”, Transactions on Automatic Control, 32, pp. 88–104, 1987.
Y. Xiong and M. Saif, “Sliding Mode Observer for Nonlinear Uncertain Sys-
tems”, IEEE Transactions on Automatic Control, 46, pp. 2012–2017, 2001.