Next Article in Journal
zPasteurAIzer: An AI-Enabled Solution for Product Quality Monitoring in Tunnel Pasteurization Machines
Next Article in Special Issue
Adaptive Sliding Mode Feedback Control Algorithm for a Nonlinear Knee Extension Model
Previous Article in Journal
Integrated Adhesion Coefficient Estimation of 3D Road Surfaces Based on Dimensionless Data-Driven Tire Model
Previous Article in Special Issue
Design of Fuzzy PID Controller Based on Sparse Fuzzy Rule Base for CNC Machine Tools
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A High-Gain Observer for Embedded Polynomial Dynamical Systems

Institute of Control Theory, Faculty of Electrical and Computer Engineering, Technische Universität Dresden, 01062 Dresden, Germany
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Machines 2023, 11(2), 190; https://doi.org/10.3390/machines11020190
Submission received: 31 December 2022 / Revised: 22 January 2023 / Accepted: 24 January 2023 / Published: 1 February 2023
(This article belongs to the Special Issue Nonlinear Control Applications and New Perspectives)

Abstract

:
This article deals with the construction of high-gain observers for autonomous polynomial dynamical systems. In contrast to the usual approach, the system’s state is embedded into a higher dimensional Euclidean space. The observer state will be contained in said Euclidean space, which has usually higher dimension than the system’s state space. Due to this embedding it is possible to avoid singularities in the observation matrix. For some systems this even allows constructing global observers in a structured way, which would not be possible in the lower-dimensional case. Finally, the state estimate in the original coordinates can be obtained by a projection. The proposed method is applied on some example systems.

1. Introduction

In many cases the complete system’s state cannot be measured directly. This is sometimes not a problem if one wishes to stabilize or control the system and it is output-feedback controllable. However, state feedback control requires the knowledge of the systems state. In addition, one may want to estimate the non directly measurable state of a dynamical system even in absence of a control. This state estimation is done using observers.
There are many different approaches to design and implement these observers. For linear systems, the probably most well-known is the Luenberger observer [1,2]. Very similar to the Luenberger observer is the Kalman–Bucy filter [3,4], designed for stochastic systems. There is even a counterpart to the linear-quadratic regulator, the deterministic Kalman filter [5].
As expected, observer design for nonlinear systems is usually more challenging. One approach is to transform the system into a suitable normal form. If the system can be transformed into observer normal form, a straight-forward design results in exactly linear error dynamics [6,7]. However, not all systems possess this property. It may be necessary to immerse the system into a higher dimensional space [8,9,10].
An alternative procedure is to transform the system into its observability normal form. This approach is subject to weaker conditions. If the observability matrix is regular, a high-gain observer [11,12,13] can be designed. This typically results in large observer gains, which is why these are called high-gain observers. Recently, there are approaches to mitigate the undesirable high observer gain while relying on the same normal form [14,15,16]. All these approaches assume that the vector field in the normal form is Lipschitz continuous [17]. However, the convergence of the observer may be subject to additional structural conditions [18,19].
This article addresses systems, where the observability matrix is not required to be regular at every point in the state space, i.e., the observability map is not a diffeomorphism. Thus, those systems cannot be immersed into the observability normal form, where the observer design becomes trivial [20]. Nonetheless, there exists an embedding into a higher-dimensional space due to the observability map, such that this map is (locally) invertible [10,21]. By possibly increasing the dimension of the image of this embedding, the vector field in the normal form may be locally Lipschitz continuous. This allows us to construct a high-gain observer for the embedded system. Finally, the observer state can in return be projected to the original state space. Thus, this contribution makes use of a topological embedding of the systems state, contrary to an immersion.
This article is structured as follows: First, the system class considered in the article as well as the observability map, which plays a crucial role, is introduced in Section 2. A short introduction to polynomial ideals and real varieties follows, as the used observability criterion as well as the construction of the observer is based on these concepts. Said observability criterion is recapped and the observability normal form as well as its construction is shown in Section 3. Finally, in Section 4, the high-gain observer, which will be used to observe the embedded state, and the projection to the original state space are discussed. Said observer is constructed for four example systems with different properties and the results are discussed.

2. Preliminaries

2.1. Dynamical Systems and the Observability Map

Consider a real-smooth manifold M R n and an autonomous system of the form
x ˙ = f ( x )
y i = h i ( x ) , i = 1 , , m
with real-analytic vector field f : M T M and output maps h i : M R . The general solution φ t x 0 of (1a) is locally analytic as well. Thus, the output trajectories y i ( t ) for some initial state x 0 M can be expanded into its Lie series
y i ( t ) = k = 0 t k k ! L f k h i x 0 ,
which is at least locally convergent. This means that the output trajectories are (locally) uniquely determined by the series coefficients, i.e., the Lie derivatives L f k h . Here, L f k h denotes the k-th Lie derivative, which is defined recursively [22] by
L f k h = L f L f k 1 h , L f h ( x ) = L f 1 h ( x ) = h x ( x ) f ( x ) , L f 0 h = h .
All these Lie derivatives form the observability map
q ( x ) = h 1 ( x ) h m ( x ) L f h 1 ( x ) L f h m ( x ) L f 2 h 1 ( x ) .
In the following, we will restrict the vector fields f as well as the output maps h i to polynomials in the state variables x, i.e., f R [ x ] n and h i R [ x ] . In addition, the manifold M is the real variety of a polynomial ideal M x R [ x ] .

2.2. Polynomial Ideals and Real Varieties

A polynomial ideal is a special subset of a polynomial ring. To this end, here only the ring R [ x ] over the reals in the variables x = ( x 1 , , x n ) is considered. A polynomial ideal I R [ x ] must have the following properties:
  • 0 I ,
  • a , b I a + b I ,
  • a I , c R [ x ] a c I .
Apart from the trivial ideal 0 , which consists only of the zero polynomial, ideals contain in general an infinite numbers of elements. However, ideals over Noetherian rings are finitely generated. This is known as Hilbert’s basis theorem [23], p. 76. Thus, for any polynomial ideal I R [ x ] there exists a finite set G = g 1 , , g s R [ x ] such that I can be written as
I = a 1 g 1 + + a s g s | a 1 , , a s R [ x ] ,
which is also denoted by
I = g 1 , , g s .
The set G is called a generating set or basis for the ideal I. There might be different generating sets, possibly with a different number of elements, that generate the same ideal.
In the multivariable case the reduction of a polynomial w.r.t. another polynomial or a set of those is not unique. This makes the decision of the ideal membership problem a little more complicated as in the univariable case. One addresses this problem by fixing a monomial ordering and computes a special basis, the Gröbner basis, which has the property that the leading term of every polynomial in the ideal is a multiple of the leading term of some of its generators. This ensures that every polynomial that is contained in the ideal will reduce to zero by reduction with the polynomials in the Gröbner basis. There are different Gröbner bases for the same ideal. However, for a fixed monomial ordering there is a unique reduced Gröber basis.
The real variety V = var R ( I ) R n of an ideal I R [ x 1 , , x n ] is the common real zero set of all polynomials in the ideal. This equals the common zero set of all generators of some basis. There are different ideals with the same real variety, e.g., consider the ideal
I = x 2 ( 1 + x 2 ) R [ x ]
over the univariable ring. The polynomial generating the ideal has a double root at zero and a pair of purely imaginary roots. Therefore, the real variety equals
var R ( I ) = 0 R .
However, this is also the real variety of a greater ideal x . Therefore, the inverse operation Id that assigns the largest ideal I = Id ( V ) to the variety V with var R ( I ) = V is introduced. The ideal Id ( var R ( I ) ) = rad R ( I ) is called the real radical of the ideal I. An ideal I for that rad R ( I ) = I holds is called real. Between real ideals and real varieties there is a one-to-one correspondence by the operations var R and Id, which allows studying the varieties by algebraic means.
Using this one-to-one correspondence, geometric operations on the varieties have an algebraic counterpart for the corresponding ideals: The intersection var R ( I ) var R ( J ) of two varieties is the variety of the ideal sum I + J , which is the union of the ideals, i.e., the ideal that contains all polynomials in I or J. Conversely, the union var R ( I ) var R ( J ) of the varieties is the variety of the ideal intersection I J , i.e., the ideal that contains the polynomials in both I and J.
The difference set W = var R ( I ) \ var R ( J ) of two varieties is in general not a variety. However, the Zariski closure W ¯ , which is the smallest variety containing W, has an algebraic counterpart, namely the saturation ideal I : J .
Similarly, the projection of a real variety var R ( I ) , I R [ x , z ] , onto a coordinate subspace, say the subspace spanned by variables x, corresponds to the elimination ideal I R [ x ] . This elimination ideal contains only those polynomials independent of the variables z. In the context of polynomial dynamical systems the elimination ideal is often used to eliminate state variables in order to obtain an input-output relation [24,25].

3. Observability

Observability of nonlinear system is based on the concept of distinguishability [26]. Two states x , x ¯ M of the system (1a) and (1b) are called indistinguishable if the output trajectories h i x ( t ) , i = 1 , , m with initial conditions x and x ¯ , respectively, are identical on some interval [ 0 , T ] t . Since the output trajectories can be expanded into their Lie series (2), the states x and x ¯ are indistinguishable if
q ( x ) = q ( x ¯ )
holds. We write
I = ( x , x ¯ ) M 2 | q ( x ) = q ( x ¯ )
for the set of indistinguishable pairs and
E = ( x , x ¯ ) M 2 | x = x ¯
for the set of equal pairs.
A system of the form (1a) and (1b) is locally observable at x 0 M , if there is a neighbourhood U x 0 M of x 0 such that
I U x 0 2 = E U x 0 2 .
This definition follows [27,28] and differs from that given in [26]. The system is called locally observable, if it is locally observable at each point x 0 M . The system is called globally observable, if
I = E .
As the sets I and E are real varieties, the system’s observability can be tested by algebraic means. In addition, the not locally observable points also form a real variety N M as can be seen in the following section.

3.1. Observability Criteria

The observability properties can be decided for polynomial systems [29,30,31,32], and the basic concept is recalled: Consider the real variety I N M 2 given by
q N ( x ) = q N ( x ¯ ) , x , x ¯ M ,
where q N is the truncated observability map including only the first N Lie derivatives up to order N 1 of the output map h. With increasing N these varieties form a descending chain
I 1 I 2 I 3 .
These are the varieties of the ideals
I k = M x + M x ¯ + h ( x ) h ( x ¯ ) , , L f k 1 h ( x ) L f k 1 h ( x ¯ )
in the ring R [ x , x ¯ ] , where the ideal M x R [ x , x ¯ ] contains the equations that govern x M and M x ¯ likewise. The ideals I k form an ascending chain, which stabilizes by the ascending chain condition [23], p. 80. The same holds for the chain
rad R ( I 1 ) rad R ( I 2 )
formed by the real radicals, which eventually stabilizes with some number N of Lie derivatives included. At this point the set I of indistinguishable pairs equals I N . Thus, the global observability of the system can be decided by comparison with the variety (3), or, algebraically, by comparing the ideals rad R ( I N ) with
Id ( E ) = E = M x + x 1 x ¯ 1 , , x n x ¯ n .
Similarly, those points where the system is not locally observable can be identified by comparing the varieties I and E locally. As equal states are also indistinguishable, i.e., E I , the difference set I \ E contains points in any neighbourhood of copies x 0 , x 0 of not locally observable points x 0 . This means that the Zariski closure of the difference set contains these pairs x 0 , x 0 . Thus, the not locally observable points are precisely the real variety
N = proj x I \ E ¯ + E
projected onto the state space M . The reader is referred to [32,33] for a more detailed explanation including the proof.
One may also construct a descending chain for the set of not locally observable points using the varieties
N k = proj x I k \ E ¯ + E .
This chain will stabilize with the not locally observable points.

3.2. Observability Normal Form

First consider a system (1a) and (1b) with scalar output y R that is locally observable somewhere. For this system we have the corresponding truncated observability map
q N ( x ) = h ( x ) L f h ( x ) L f 2 h ( x ) L f N 1 h ( x ) .
If N is chosen sufficiently large, the map q N is locally invertible in a neighbourhood of every locally observable point. Thus, q N induces a local change of coordinates z = q N ( x ) . From Section 3.1 we know a minimum value for the number N of Lie derivatives required. As the map q N is (locally) invertible, the spaces M and Z N = q N ( M ) must have equal dimension for each point x M \ N and q N ( x ) , respectively. (Note that, although M is a real manifold, q N ( M ) is not necessarily, as can be seen in the example M = R , q N ( x ) = x 2 .) Thus, the coordinates obey some algebraic equations, which can be obtained by eliminating the state variables x from the ideal
M x + z 1 h ( x ) , z 2 L f h ( x ) , , z N L f N 1 h ( x ) .
The real variety of the elimination ideal is the Zariski closure of Z N .
The coordinates z obey the differential equation
z ˙ 1 = z 2 z ˙ N 1 = z N z ˙ N = L f N h ( x ) = L f N h q N 1 ( z ) = α ( z ) ,
which is the observability normal form, possibly including more output derivatives as the state dimension. The function α : q N ( M ) R is not necessarily local Lipschitz continuous as can be seen from the following example:
Example 1. 
Consider the system
x ˙ = 1 , x R , y = h ( x ) = x 3 .
The output map can be directly inverted to obtain the systems state, thus the system is globally observable, and we may set N = 1 . The polynomial equations
z 1 = L f 0 h ( x ) = x 3 z ˙ 1 = L f 1 h ( x ) = 3 x 3
generate an ideal over the ring R [ x , z 1 , z ˙ 1 ] , where z 1 and z ˙ 1 are treated as independent variables. The elimination of x yields the differential equation
z ˙ 1 3 27 z 1 2 = 0 ,
which could be solved for
z ˙ 1 = 3 z 1 2 3 = α ( z 1 ) ,
where the inverse of the odd power function is extended for negative real arguments in such a way that z 1 n = ( z ) 1 n . However, α is not Lipschitz continuous at z 1 = 0 . Indeed, for the initial condition z 1 = 0 one has two solutions
z 1 ( t ) = 0 z 1 ( t ) = t 3
while only the second one equals q 1 ( x ( t ) ) .
The unboundedness of the derivative of α is undesirable for observer design. One can, however, mitigate this problem by embedding the transformed state z into an even higher-dimensional space by considering a larger number N of Lie derivatives in the observability map.
Example 1 
(continued). If we set N = 3 instead, one obtains the map
z 1 = x 3 , z 2 = 3 x 2 , z 3 = 6 x .
These (redundant) coordinates follow the differential equation
z ˙ 1 = z 2 z ˙ 2 = z 3 z ˙ 3 = 6 = α ( z ) .
Obviously, the function α is now Lipschitz continuous. Since we have embedded a one-dimensional state into a three-dimensional space R 3 , the redundant coordinates z must obey the equations
216 z 1 z 3 3 = 0 , 12 z 2 z 3 2 = 0
obtained from the elimination ideal
z 1 x 3 , z 2 3 x 2 , z 3 6 x R [ z ] .
Consider the elimination ideals
F k = M x + z 1 h ( x ) , z 2 L f h ( x ) , , z k L f k 1 h ( x ) R [ z 1 , , z k ]
that define the algebraic equations for the embedded state variables z for k N . Clearly, F k F k + 1 , considering both in the ring R [ z 1 , , z k + 1 ] . Since z ˙ k = z k + 1 for k < N , and for any polynomial g ( z ) F k also
d d t g ( z ) = i = 1 k g z i ( z ) z ˙ i = 0
holds, the polynomial is contained in F k + 1 :
i = 1 k g z i ( z ) z i + 1 F k + 1 .
In general, the function α can be found in the following way: One computes a reduced Gröbner basis of the ideal F N + 1 for any block ordering where x > w > z with w = z N + 1 and z = z 1 , , z N . All polynomials in the basis that are independent of the state variables x generate the elimination ideal
F N + 1 R [ z , w ] .
Further eliminating w results in the ideal defining the Zariski closure of Z N . Consider the polynomials in the reduced Gröbner basis that explicitly depend on w. Without loss of generality, it is assumed that the degree of these polynomials in the variable w is exactly one. Otherwise, increasing N will reduce the degree due to the inclusion (8). Then the equations in the elimination ideal (9) can be solved for the variable w, which is in general a fractional expression in the variables z. The exception to this property are those values of z that are in the real variety of the ideal generated by the leading coefficients (the coefficients of w) of the polynomials with degree one in w. The function α : z w is not defined at these points.
With increasing N the variety with the problematic points decreases. However, in contrast to the observability problem, we do not know a bound or a termination criterion for the number of Lie derivatives to consider, where no further singularities are removed, yet. Still, if the leading coefficient is constant, from the (sole) polynomial including w in F N + 1 the polynomial function α can be obtained directly, which is locally Lipschitzian and defined everywhere in Z N .

4. The Embedding Observer

4.1. The High-Gain Observer

For a system in observability normal form (6) with the state z Z N = q N M R N and a local Lipschitz continuous function α : R N R the high-gain observer reads [11]
z ^ ˙ 1 = z ^ 2 + θ 1 0 y y ^ z ^ ˙ N 1 = z ^ N + θ N 1 N 2 y y ^ z ^ ˙ N = α z ^ + θ N N 1 y y ^ y ^ = z ^ 1 ,
where the observer state z ^ R N is not restricted to the subspace Z N like the systems state z. The coefficients l 0 , , l N 1 are the coefficients of a Hurwitz polynomial
s N + l N 1 s N 1 + + l 0
and θ is a scaling parameter, which must take a minimum value dependent on the Lipschitz constant of the function α : R N R .
For the systems discussed herein, the vector fields are polynomials, which are in general not global Lipschitzian. Still, we are able to show local convergence of the observer, if the (redundant) systems state z is contained in a compact, positively invariant set Ω :
Let further the observer error z ˜ = z z ^ be contained in a compact set Γ . Then, the map α is Lipschitzian in the sense of
z Ω , z ˜ Γ : α ( z ) α ( z z ˜ ) γ z ˜ 2
with Lipschitz constant γ . Dependent on this Lipschitz constant, there is a sufficiently large value θ such that the observer error dynamic is asymptotically stable [11]. However, the observer error must lie in a subset of Γ whose size deceases very rapidly with increasing Θ , even faster for higher dimensions N of the observer state space. As this is undesirable, one may follow the approach already proposed in [11]: The function α restricted to a ball Ω defined by
Ω = z R N : z R ,
where · is a norm of the form
z = z T P z , P 0 ,
is extended smoothly to the whole R N such that the resulting function is globally Lipschitzian. This can be accomplished by introducing a smooth scaling function, e.g.,
s b x = 1 x 1 exp 1 x b exp 1 x b + exp 1 1 x 1 < x < b 0 x b
and using the function
α ¯ ( z ) = s ρ 2 z 2 / R 2 α ( z )
instead. Note that α ¯ has a compact support, namely the domain given by z ρ R such that an upper bound for the global Lipschitz constant can be easily computed. If the nonlinearity is scaled this way, the observer will converge globally for sufficiently large gain θ .
A different approach to compute a suitable observer gain is presented in [19]. Given a bound for the Lipschitz constant, a linear matrix inequality has to be solved, which yields the observer gain. Using this approach, one can expect to get a smaller stabilizing gain.
It is noted that a large observer gain results in a large transient response, which is undesirable. For practical applications the gain cannot be arbitrary high, as measurement noise is amplified as well. This so called peaking phenomenon gets more impact with increasing embedding dimension N. There are, however, approaches to address this problem [15,16].
In general, once the system has be transformed to its observability normal form (6), any observer for the system (6) can be put to use. This includes, but is not limited to, advanced high-gain observers.

4.2. Projection to the Original State Space

To this end, the observer was designed in the embedded state space. It remains to obtain an estimate x ^ for the systems state x given an estimate z ^ for q N ( x ) . Since q N is in general not a diffeomorphism, the observer cannot be simply formulated in the original coordinates. Furthermore, the inverse mapping q N 1 : Z N M cannot be directly applied as the observer state is contained in a higher-dimensional space R N .
One approach is to use a projection onto the subspace Z N by solving the minimum problem
x ^ = arg   min x z ^ q N ( x ) .
Given an initial estimate x ^ ( 0 ) one would like to initialize the embedding observer with state q N x ^ ( 0 ) . Thus, an initial guess x ^ ( 0 ) for the projection is already known. Although the initial observer state z ^ ( 0 ) is contained in the subspace Z N , which is the image of q N , the distance z ^ q N ( x ^ ) will nonetheless diverge from zero if there is an initial observer error. This may cause the projection x ^ to be discontinuous. If, however, the observer error is comparably small, a gradient descent method will be able to keep track of the projection.
Another very interesting approach is that in [34], pp. 465–467. This gives an explicit formula for solving (12), at least if the system is globally observable and M = R n . If the original system is also embedded, i.e., M R n , one can still use this approach to project the observer state to a lower-dimensional space R n in the first place.
In general there is a problem if the state passes through a not locally observable point. This means that there are multiple state trajectories starting from such a point, which yield the same output trajectories. Consequently, the observer cannot distinguish them and the minimum problem (12) is ill conditioned.

5. Examples

5.1. The Duffing Oscillator

We consider a particular instance of the undamped and unexcited Duffing oscillator [35]
x ˙ 1 = x 2 x ˙ 2 = x 1 x 1 3 y = x 2 ,
whose trajectories in the phase space can be seen in Figure 1. The chain (5) of radical ideals stabilizes after including the third Lie derivative of the residuum map. The same number of Lie derivatives are required if no radicals are computed. One computes an empty set N of not locally observable points showing local observability. However, since
I 4 = I = E x 1 + 1 , x ¯ 1 + 1 , x 2 , x ¯ 2 x 1 1 , x ¯ 1 + 1 , x 2 , x ¯ 2 x 1 + 1 , x ¯ 1 + 1 , x 2 , x ¯ 2 x 1 1 , x ¯ 1 + 1 , x 2 , x ¯ 2 x 1 + 1 , x ¯ 1 1 , x 2 , x ¯ 2 x 1 + 1 , x ¯ 1 1 , x 2 , x ¯ 2
is different from E = Id ( E ) , the system is not globally observable. From this prime decomposition one identifies the three equilibria ( 1 , 0 ) , ( 0 , 0 ) , ( 1 , 0 ) of the system, where pairs of these cannot be distinguished. This is precisely what is encoded in the six prime components apart from E .
As the chain has stabilized after including four Lie derivatives, we will have to embed the observers state in a space of dimension at least four using the observability map
z = z 1 z 2 z 3 z 4 = q 4 ( x ) = x 2 x 1 x 1 3 x 2 3 x 1 2 x 2 x 1 4 x 1 3 + 3 x 1 5 6 x 1 x 2 2 .
These dependencies are computed using the ideal F 4 in (7). Of the first three components of z one gets
z 3 3 + 3 z 1 z 3 2 + 27 z 1 3 z 2 2 4 z 1 3 = 0 .
There are six further equations
  z 4 3 + 3 z 2 z 4 2 36 z 1 4 z 4 + 36 z 1 2 z 2 z 3 2 + 54 z 1 z 2 3 z 3 + 36 z 1 3 z 2 z 3 + 27 z 2 5 4 z 2 3 216 z 1 6 z 2 36 z 1 4 z 2 = 0
z 3 z 4 2 + 3 z 2 z 3 z 4 + 12 z 1 3 z 3 2 4 3 z 1 z 3 2 + 36 z 1 2 z 2 2 z 3 12 z 1 4 z 3 4 3 z 1 2 z 3 + 27 z 1 z 2 4 18 z 1 3 z 2 2 4 z 1 z 2 2 + 8 3 z 1 3 = 0
z 1 z 4 2 z 2 z 3 z 4 + 4 3 z 1 z 3 2 + 12 z 1 4 z 3 + 4 3 z 1 2 z 3 +   18 z 1 3 z 2 2 12 z 1 5 8 3 z 1 3 = 0
z 3 2 z 4 4 z 1 2 z 4 + 3 z 2 z 3 2 + 18 z 1 3 z 2 z 3 + 4 z 1 z 2 z 3 +         27 z 1 2 z 2 3 36 z 1 4 z 2 4 z 1 2 z 2 = 0
ʠ z 1 z 3 z 4 + 2 z 1 2 z 4 z 2 z 3 2 2 z 1 z 2 z 3 + 18 z 1 4 z 2 = 0
        z 1 z 2 z 4 2 3 z 1 z 3 2 z 2 2 z 3 2 3 z 1 2 z 3 + 4 3 z 1 3 = 0
obtained from the reduced Gröbner basis using lexicographical ordering. Although there are altogether seven equations, these still describe a two-dimensional subspace in R 4 .
In order to get a differential equation for z 4 , the last component of the integrator chain, the ideal F 5 is considered (with z ˙ 4 = z 5 ). Again computing a reduced Gröbner basis w.r.t. lexicographical ordering gives Equations (14a)–(14g) as well as
z 4 z 5 + 7 z 3 z 4 + 6 z 1 3 z 4 + 10 z 1 z 4 + 54 z 1 2 z 2 z 3 6 z 2 z 3 + 81 z 1 z 2 3 + 54 z 1 3 z 2 12 z 1 z 2 = 0
  z 3 z 5 + 7 z 3 2 + 6 z 1 3 z 3 + 4 z 1 z 3 + 81 z 1 2 z 2 2 12 z 1 2 = 0
    z 2 z 5 3 z 3 z 4 6 z 1 z 4 + 4 z 2 z 3 48 z 1 3 z 2 + 4 z 1 z 2 = 0
z 1 z 5 3 z 3 2 2 z 1 z 3 + 6 z 1 4 + 4 z 1 2 = 0
depending on z 5 . As can be seen, the leading terms already have degree one in z 5 . However, none of these equations can be (uniquely) solved for z 5 , if z 1 to z 4 equal zero (The value of z 5 is well-defined for z 1 , , z 4 0 and z = q 4 ( x ) for some x. This is still not useful for the observer to be designed). Indeed, the three equilibria map to z = ( 0 , 0 , 0 , 0 ) under q 4 .
If the state z is embedded in a space of even higher dimension, one finally arrives at
z 7 + 9 z 5 + 126 z 1 2 z 3 + 6 z 3 + 441 z 1 z 2 2 6 z 1 3 16 z 1 F 7 .
The leading coefficient, namely that of z 7 , is constant. This means that for z = q 6 ( x ) one has the differential equations
z ˙ 1 = z 2 z ˙ 5 = z 6 z ˙ 6 = 9 z 5 126 z 1 2 z 3 6 z 3 441 z 1 z 2 2 + 6 z 1 3 + 16 z 1 ,
which are well-defined and locally Lipschitz everywhere in R 6 .
The trajectories for the embedded state can be seen in Figure 2. These were computed as the image of the solution of (13) under the observability map q 6 .
For the observer the nonlinear function α is scaled as in (11), such that the observer can only be applied to bounded orbits. The domain was chosen as the orbit that passes through the point ( 1.5 , 0 ) and its interior. A very conservative bound for the embedded state is given by z 2 = z T P z 1 with
P = diag 0.8 , 0.145 , 0.103 , 0.0158 , 4.07 · 10 3 , 5.26 · 10 4 .
The smooth transition is between 1 z 2 , i.e., R = 1 and ρ = 2 . As can be seen, the observer converges, if a sufficiently large gain, i.e., a sufficiently small value θ is chosen, see Figure 3. Here, all eigenvalues of the linear error dynamics were placed at 1 and a gain of 10, i.e., θ 0.1 seems to be required.
For this system, there are different state trajectories dependent on the initial condition: Initial values with sufficient distance from the origin let the state trace out a handle-shaped path around the origin, which contains all equilibria in its interior. For initial values near the equilibria ( ± 1 , 0 ) one gets solutions encircling them, respectively. As the distance of the initial value to the equilibria decreases, the output trajectories look more and more similar. In the limit, the output trajectories cannot be distinguished. Therefore, due to the symmetry of this system, a particularly adverse initialization for the observer is z ^ ( 0 ) = q 6 ( ( 0 , 0 ) ) , while the state is near one of the other two equilibria. This scenario was chosen for the simulation, whose result is shown as the orange (light) curve in Figure 2. As can be seen, the observer converges nonetheless. The projection (Figure 4) possesses some discontinuities. These arise from an ill conditioned local minimum problem at these points. Note that with the current implementation it is only guaranteed that the observer converges to the embedded state, and no assertions can be made on the projection, yet.

5.2. An Oscillator with Nonlinear Output Map

Consider the system
x ˙ 1 = x 2 x ˙ 2 = x 1 y = x 1 2 + x 1
from [36]. In order to prove global observability, the first four Lie derivatives of the output map are required, as was already shown in [37]. Thus, the system has to be embedded in a space of dimension at least four. The ideal F 5 is generated by the polynomials
z 5 2 3 z 4 2 16 3 z 2 z 4 + 7 z 3 32 3 z 2 2 + 6 z 1 , z 4 3 9 2 z 3 z 4 48 z 2 2 z 4 45 z 1 z 4 45 4 z 4 + 36 z 2 z 3 128 z 2 3 72 z 1 z 2 45 4 z 2 , z 3 z 4 2 + 8 z 2 z 3 z 4 + 3 2 z 2 z 4 9 2 z 3 2 + 16 z 2 2 z 3 18 z 1 z 3 9 2 z 3 + 2 1 2 z 2 2 18 z 1 2 9 2 z 1 , z 2 z 4 2 + 8 z 2 2 z 4 + 3 z 1 z 4 + 3 4 z 4 9 2 z 2 z 3 + 16 z 2 3 + 3 z 1 z 2 + 3 4 z 2 , z 1 z 4 2 + 1 4 z 4 2 + 24 z 1 z 3 2 + 6 z 3 2 12 z 2 2 z 3 + 96 z 1 2 z 3 + 48 z 1 z 3 + 6 z 3 40 z 1 z 2 2 49 4 z 2 2 + 96 z 1 3 + 48 z 1 2 + 6 z 1 , z 1 z 3 z 4 + 1 4 z 3 z 4 1 2 z 2 2 z 4 + 7 z 1 z 2 z 3 + 7 4 z 2 z 3 7 2 z 2 3 + 6 z 1 2 z 2 + 3 2 z 1 z 2 , z 2 3 z 4 6 z 1 z 3 3 3 2 z 3 3 + 3 z 2 2 z 3 2 24 z 1 z 2 2 z 3 6 z 2 2 z 3 + 72 z 1 3 z 3 + 60 z 1 2 z 3 + 3 3 2 z 1 z 3 + 3 2 z 3 + 13 z 2 4 60 z 1 2 z 2 2 27 z 1 z 2 2 3 z 2 2 + 96 z 1 4 + 72 z 1 3 + 18 z 1 2 + 3 2 z 1 , z 1 z 2 z 4 + 1 4 z 2 z 4 3 z 1 z 3 2 3 4 z 3 2 + 3 2 z 2 2 z 3 12 z 1 2 z 3 6 z 1 z 3 3 4 z 3 + 7 z 1 z 2 2 + 7 4 z 2 2 12 z 1 3 6 z 1 2 3 4 z 1 , z 1 2 z 4 + 1 2 z 1 z 4 + 1 16 z 4 3 2 z 1 z 2 z 3 3 8 z 2 z 3 + 3 4 z 2 3 + z 1 2 z 2 + 1 2 z 1 z 2 + 1 16 z 2 , z 1 2 z 3 2 + 1 2 z 1 z 3 2 + 1 16 z 3 2 z 1 z 2 2 z 3 1 4 z 2 2 z 3 + 4 z 1 3 z 3 + 3 z 1 2 z 3 + 3 4 z 1 z 3 + 1 16 z 3 + 1 4 z 2 4 2 z 1 2 z 2 2 z 1 z 2 2 1 8 z 2 2 + 4 z 1 4 + 3 z 1 3 + 3 4 z 1 2 + 1 16 z 1
forming a reduced Gröbner basis w.r.t. lexicographical order. The first of these as they are listed has a constant coefficient as a polynomial in z 5 . Thus, the observability normal form has a locally Lipschitz continuous vector field
z ˙ 1 = z 2 z ˙ 2 = z 3 z ˙ 3 = z 4 z ˙ 4 = 2 3 z 4 2 + 16 3 z 2 z 4 7 z 3 + 32 3 z 2 2 6 z 1
even embedded in R 4 .
A nice property of this system is that the observability map
q 4 ( x ) = x 1 2 + x 1 2 x 1 x 2 + x 2 2 x 2 2 2 x 1 2 x 1 8 x 1 x 2 x 2
can be inverted using the globally defined map Z 4 R 2
x = q 4 1 ( z ) = 2 9 z 4 2 16 9 z 2 z 4 32 9 z 2 2 + z 3 + 2 z 1 4 3 z 2 + 1 3 z 4 .
The preimage of this inverse map can be extended to the whole R 4 , resulting in a projection to the original state space.
In Figure 5, the trajectories of the embedded state as well as the observer state are shown. As initial condition for the systems state the point x ( 0 ) = ( 1 2 , 0 ) has been chosen, which results in the most flat output trajectory. Albeit the relative small initial observer error ( 0.2 , 0 ) , relatively large deviations result in the first place. This is due to the low sensitivity of the output w.r.t. the error at this state, such that a much larger error can accumulate. However, the observer converges finally.
For this simulation the embedded state was measured using
P = diag 0.594 , 0.421 , 0.266 , 0.153
such that the sought system trajectory lies definitely within the ellipsoid given by the inequality z = z T P z 1 . This bound was obtained using x 0.7 . Again, all poles were placed at 1 and a gain parameter θ = 0.3 was chosen. As soon as the linear dynamics dominates, the observer error decreases with about this slope (see Figure 6).
The projection of the observer state using the numerical solution of the optimization problem (12) can be seen in Figure 7. Again, this projection possesses some discontinuities.

5.3. The Lorenz Attractor

The Lorenz Attractor [38] given by the differential equations
x ˙ 1 = σ x 2 x 1 x ˙ 2 = ρ x 1 x 2 x 1 x 3 x ˙ 3 = x 1 x 2 β x 3
is chaotic for the parameter set ( σ , ρ , β ) = ( 10 , 28 , 8 3 ) , but possesses well-known bounded positively invariant sets [39,40,41,42]. We consider the system with output map y = h ( x ) = x 1 . In this case the system can be shown to be locally observable everywhere except at the x 3 -axis. In order to distinguish all points not on the x 3 -axis, output derivatives including order three are required, i.e., the truncated observability map
q 4 ( x ) = x 1 10 x 1 + 10 x 2 10 x 1 x 3 + 380 x 1 110 x 2 10 x 1 2 x 2 + 710 3 x 1 x 3 100 x 2 x 3 6880 x 1 + 3910 x 2
is locally invertible at all locally observable points. It can indeed be easily seen from the system dynamics (16) that the x 3 -axis is an invariant set, which maps to the constant trajectory y ( t ) = 0 .
In order to compute the observability normal form, we start with the ideal F 5 , whose reduced Gröbner basis reads
z 2 z 5 z 3 z 4 + 49 3 z 2 z 4 41 3 z 3 2 + 328 9 z 2 z 3 10 z 1 3 z 3 + 720 z 1 z 3 + 3 z 1 z 2 3 + 128 3 z 1 2 z 2 2 12256 9 z 2 2 + 80 3 z 1 3 z 2 1920 z 1 z 2 , z 1 z 5 z 3 2 + 16 3 z 2 z 3 + z 1 3 z 3 1417 9 z 1 z 3 + 3 z 1 2 z 2 2 + 539 3 z 2 2 + 79 3 z 1 3 z 2 16568 9 z 1 z 2 410 3 z 1 4 + 9840 z 1 2 , z 1 z 4 z 2 z 3 + 41 3 z 1 z 3 11 z 2 2 + z 1 3 z 2 + 88 3 z 1 z 2 + 10 z 1 4 720 z 1 2 .
The first two of these polynomials already have degree one in the highest variable z 5 . However, the coefficients are not constant. This unpleasant behaviour seems to persist, even if the state is embedded in a space of higher dimension. At least did we not succeed in finding a sufficient dimension and had to abort the search due to the increasing computational effort.
To solve the equations for z 5 = z ˙ 4 in a way such that the resulting field is smoothly embedded in R 4 , the first two generators of F 5 can be multiplied by z 2 and z 1 , respectively. The leading coefficient of their sum does not vanish, except at the not locally observable points. Thus, we compute
z ˙ 4 = α ( z ) = 1 z 1 2 + z 2 2 ( z 2 z 3 z 4 + 49 3 z 2 2 z 4 41 3 z 2 z 3 2 z 1 z 3 2 + 328 9 z 2 2 z 3 10 z 1 3 z 2 z 3 + 2176 3 z 1 z 2 z 3 + z 1 4 z 3 1417 9 z 1 2 z 3 + 3 z 1 z 2 4 + 128 3 z 1 2 z 2 3 12256 9 z 2 3 + 89 3 z 1 3 z 2 2 5221 3 z 1 z 2 2 + 79 3 z 1 4 z 2 16568 9 z 1 2 z 2 410 3 z 1 5 + 9840 z 1 3 )
for the nonlinear function α . Note that for z Z 4 the function α ( z ) has the same limit for z 0 . However, α is unbounded, if z R 4 is not restricted to Z 4 . This makes it more complicated to find a Lipschitz constant for α , since the system trajectory may come arbitrary close to the x 3 -axis. However, since the observer cannot observe the system at this set, one could exclude a neighbourhood from the convergence considerations and regularize the function (17). In contrast to arbitrary introduced singularities, the non-observability is a system property.

5.4. The Van Der Pol Oscillator

As a final example we consider an instance of the Van der Pol oscillator
x ˙ 1 = x 2 x ˙ 2 = x 1 x 2 x 1 2 1
with output map y = h ( x ) = x 2 . An observer analysis shows that this system is locally observable everywhere. Four Lie derivatives of the output map are required for the local invertibility of the observability map q 4 . If an additional output derivative is included, the map q 5 is even injective. Thus, the system is globally observable.
Although one would expect that a globally smooth vector field for the observability normal form exists in some dimension, we were not able to compute such a one, yet. The ideal F 6 has the form
z 4 z 6 + , z 3 z 6 + , z 2 z 6 + , z 1 2 z 6 + ,
while computing F 7 is still not yet feasible. The problematic point when solving for z 6 = z ˙ 5 is only the origin ( x 1 , x 2 ) = ( 0 , 0 ) (or its image under the observability map). This should not be a big issue for observing the Van der Pol oscillator. Indeed, all trajectories starting in the open circle x 1 2 + x 2 2 < 1 will leave this circle, as can be shown using the time-reversed system and the Lyapunov function V ( x ) = x 1 2 x 2 2 . Thus, the Van der Pol oscillator possesses a positively invariant set Ω where the observer has a Lipschitz continuous vector field. The vector field, especially the nonlinearity α , for the observer can be constructed similar as for the Lorenz attractor. However, the nonlinearity α has to be scaled for large magnitudes of the observer state z ^ and for small magnitudes as well.
For this particular system very high observer gains were required in order to achieve convergence. A better bound for the image q 5 ( Ω ) of the positively invariant set would possibly allow a much smaller gain.

6. Numerical Implementation

In order to verify the results presented in this article, the observers are simulated on a digital processor. Given initial conditions x 0 = x ( 0 ) and z ^ 0 = q ( x ^ 0 ) for the systems and the observers state, respectively, the corresponding differential Equations (1a), (1b) and (10) can be numerically integrated. Here, the system can be represented in the original coordinates. The numerical integration is carried out simultaneous using the compound state ( x , z ^ ) of the system and observer. For moderate observer gains explicit integration schemes such as explicit Runge–Kutta methods [43] can be used. As the observer gain is increased, the differential equations become more and more stiff such that implicit methods like implicit Runge–Kutta methods may be better suited. One may also exploit explicit exponential Rosenbrock integrators [44], which perform well over wide ranges of observer gains.
The vector field for the observer is adopted, such that it is globally Lipschitzian by scaling the nonlinear part α . One wants on one hand to preserve the behaviour of the system in the region of interest. On the other hand, large Lipschitz constants require large observer gains, which is undesirable. Thus, the nonlinear part should drop relatively fast beyond the region of interest. In order to compute a suitable scaling (11), a symmetric box
| x i | X i > 0 , i = 1 , , n
for the systems state is chosen first, such that it contains the positively invariant set with some margin. This box transforms under the observability map q N to a subset of R N . Again, a superset of this image is computed, which takes the same form
| z j | Z j , j = 1 , , N
as before. Since the observability map is a polynomial, an upper bound is easily found by considering the absolute value of each polynomial term. Thus, the embedded systems state will be contained in the box. As norm for (11) we choose
z = i = 1 N z i 2 Z i 2
such that z N holds for the positively invariant set. The nonlinearity can be damped for grater magnitudes.
It remains to project the solution t z ^ of the embedded observer to the original state space. This was done by solving the optimization problem
x ^ ( t ) = arg   min x ^ q ( x ^ ) z ^ ( t )
point-wise. An initial guess x ^ 0 for t = 0 is already known, and this value also minimizes the objective function. For other samples x ^ ( t k ) we simply use the solution x ^ ( t k 1 ) of the previous time step of the numerical integrator as initial guess. This should be no problem for small discrete time steps. If the integrator uses large time steps, the solution is interpolated such that the time step t k t k 1 remains bounded. On the other hand (1a) and (1b) can be integrated to predict x ^ ( t k ) from the previous solution. Then the solution of the optimization problem (18) using this initial guess can be regarded as a correction. This technique will work well once the observer error has sufficiently decreased.
This proposed numerical solution of the projection has still a flaw, especially for larger observer errors. Since the observer state is not restricted to the embedded set Z N R N , it may diverge from Z N and eventually converge again. However, the (possibly multivalued) projection q x ^ ( t ) onto Z N with x ^ given by (18) is not unique. A gradient descent method will always only find a local minimum, which may be located far from the global one. During the trajectory there are therefore some points where a local minimum vanishes, a local minimum splits into multiple ones, or multiple minima merge. Near these regions the Hessian is ill-conditioned and the minimum may be discontinuous, as can be observed at the presented examples.
In a practical application all these numerical schemes have to be implemented in a robust way. Further, the integration of the differential equations and the projection have to be done within a limited number of computation steps. While this can be relatively easy guaranteed when using an explicit and stable integration scheme, there are still some problems to be solved for the projection.

7. Conclusions and Outlook

In this contribution an algebraic approach was presented to embed a polynomial system into its observability form with different dimension of the embedded space. With increasing dimension, the set of points where this map fails to be locally injective is reduced. That dimension, where this point set equals the set of intrinsically not locally observable points can be computed at first.
The examples show that some systems already possess an observability normal form with Lipschitzian vector field. Others required the embedding into an ever higher-dimensional space until the vector field is Lipschitz continuous. There are also systems for that we did not succeed in finding a Lipschitzian vector field, even for globally observable systems. It would be desirable to have an algorithm available that computes an observability normal form with the fewest points at that the vector field fails to be locally Lipschitzian, similar to the observability criterion.
Once the observability normal form has been found, the observer design is straight forward. A more sophisticated approach is yet required for the projection step in order to transform the observer state back to the original coordinates. Especially for implementations in practical systems a numerically robust method will be required.
This article only considers polynomial systems to this end. However, many systems can be transformed such that the vector field is in polynomial form, possibly through an embedding again. This holds in general for rational systems [45], p. 18.
Observers can also be used to identify system parameters or to detect faults. In order to show identifiability of the parameters, higher order derivatives of the measurable outputs may be required as well [46]. The proposed observer can be easily adopted to estimate the parameters by augmenting the systems state with the parameters.

Author Contributions

Conceptualization, D.G. and K.R.; methodology, D.G. and K.R.; software, D.G.; investigation, D.G.; writing, D.G. and K.R.; supervision, K.R.; funding acquisition, K.R. All authors have read and agreed to the published version of the manuscript.

Funding

Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)–417698841.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Luenberger, D.G. Observing the State of a Linear System. IEEE Trans. Mil. Electron. 1964, 8, 74–80. [Google Scholar] [CrossRef]
  2. Luenberger, D.G. Observers for Multivariable Systems. IEEE Trans. Autom. Control. 1966, 11, 190–197. [Google Scholar] [CrossRef]
  3. Kalman, R.E. A new approach to linear filtering and prediction problems. Trans. Asme J. Basic Eng. 1960, 82, 35–45. [Google Scholar] [CrossRef]
  4. Kalman, R.E.; Bucy, R.S. New results in linear filtering and prediction theory. Trans. Asme J. Basic Eng. 1961, 83, 95–108. [Google Scholar] [CrossRef]
  5. Willems, J.C. Deterministic last squares filtering. J. Econ. 2004, 118, 341–373. [Google Scholar] [CrossRef]
  6. Krener, A.J.; Isidori, A. Linearization by output injection and nonlinear observers. Syst. Control. Lett. 1983, 3, 47–52. [Google Scholar] [CrossRef]
  7. Bestle, D.; Zeitz, M. Canonical form observer design for non-linear time-variable systems. Int. J. Control 1983, 38, 419–431. [Google Scholar] [CrossRef]
  8. Back, J.; Seo, J.H. Immersion Technique for Nonlinear Observer Design. In Proceedings of the American Control Conf. (ACC), Anchorage, AK, USA, 8–10 May 2002; pp. 2645–2646. [Google Scholar] [CrossRef]
  9. Back, J.; Shim, H.; Seo, J.H. An algorithm for system immersion into nonlinear observer form: Forced systems. In Proceedings of the Preprints IFAC World Congress, Prague, Czech Republic, 3–8 July 2005; pp. 126–131. [Google Scholar] [CrossRef]
  10. Astolfi, D.; Praly, L.; Marconi, L. A note on observability canonical forms for nonlinear Systems. IFAC Proc. Vol. 2013, 46, 436–438. [Google Scholar] [CrossRef] [Green Version]
  11. Gauthier, J.P.; Hammouri, H.; Othman, S. A Simple Observer for Nonlinear Systems—Application to Bioreactors. IEEE Trans. Autom. Control. 1992, 37, 875–880. [Google Scholar] [CrossRef]
  12. Ciccarella, G.; Mora, M.D.; Germani, A. A Luenberger-like Observer for Nonlinear Systems. Int. J. Control 1993, 57, 537–556. [Google Scholar] [CrossRef]
  13. Dalla Mora, M.; Germani, A.; Manes, C. A state observer for nonlinear dynamical systems. Nonlinear Anal. Theory Methods Appl. 1997, 30, 4485–4496. [Google Scholar] [CrossRef]
  14. Astolfi, D.; Marconi, L. A High-Gain Nonlinear Observer With Limited Gain Power. IEEE Trans. Autom. Control. 2015, 60, 3059–3064. [Google Scholar] [CrossRef]
  15. Astolfi, D.; Marconi, L.; Praly, L.; Teel, A.R. Low-power peaking-free high-gain observers. Automatica 2018, 98, 169–179. [Google Scholar] [CrossRef]
  16. Farza, M.; Ragoubi, A.; Saïd, S.H. Improved high gain observer design for a class of disturbed nonlinear systems. Nonlinear Dyn. 2021, 106, 631–655. [Google Scholar] [CrossRef]
  17. Raghavan, S.; Hedrick, J.K. Observer design for a class of nonlinear systems. Int. J. Control 1994, 59, 515–528. [Google Scholar] [CrossRef]
  18. Rajamani, R. Observers for Lipschitz Nonlinear Systems. IEEE Trans. Autom. Control. 1998, 43, 397–401. [Google Scholar] [CrossRef]
  19. Röbenack, K. Improving High Gain Observer Design for Nonlinear Systems Using the Structure of the Linear Part. In Systems, Automation & Control; Derbel, N., Ed.; De Gruyter Oldenbourg: Berlin, Germany; Berlin, MA, USA, 2016; pp. 57–74. [Google Scholar] [CrossRef]
  20. Levine, J.; Marino, R. Nonlinear System Immersion, Observers and Finite-Dimensional Filters. Syst. Control. Lett. 1986, 7, 133–142. [Google Scholar] [CrossRef]
  21. Gauthier, J.P.; Hammouri, H.; Kupka, I. Observers for Nonlinear Systems. In Proceedings of the IEEE Conference on Decision and Control (CDC), Brighton, UK, 11–13 December 1991; pp. 1483–1489. [Google Scholar] [CrossRef]
  22. Lee, J.M. Introduction to Smooth Manifolds. In Graduate Texts in Mathematics, 2nd ed.; Springer: New York, NY, USA, 2013; Volume 218. [Google Scholar]
  23. Cox, D.A.; Little, J.; O’Shea, D. Ideals, Varieties, and Algorithms, 4th ed.; Springer International Publishing: Cham, Switzerland, 2015. [Google Scholar]
  24. Guernez, C.; Cassar, J.; Staroswiecki, M. Extension of Parity Space to Non Linear Polynomial Dynamic Systems. In Proceedings of the IFAC Symposium on Fault Detection, Supervision and Safety for Technical Processes (SAFEPROCESS 97), Kingston upon Hull, UK, 26–28 August 1997; pp. 857–862. [Google Scholar] [CrossRef]
  25. Glad, S.T. Nonlinear state space and input output descriptions using differential polynomials. In New Trends in Nonlinear Control Theory; Descusse, J., Fliess, M., Isidori, A., Leborgne, D., Eds.; Springer: Berlin/Heidelberg, Germany, 1989; pp. 182–189. [Google Scholar] [CrossRef]
  26. Hermann, R.; Krener, A.J. Nonlinear Controllability and Observability. IEEE Trans. Autom. Control. 1977, 22, 728–740. [Google Scholar] [CrossRef]
  27. Bartosiewicz, Z. Local observability of nonlinear systems. Syst. Control. Lett. 1995, 25, 295–298. [Google Scholar] [CrossRef]
  28. Sontag, E.D. A concept of local observability. Syst. Control. Lett. 1984, 5, 41–47. [Google Scholar] [CrossRef]
  29. Tibken, B. Observability of nonlinear systems—An algebraic approach. In Proceedings of the IEEE Conference on Decision and Control (CDC), Nassau, Bahamas, 14–17 December 2004; Volume 5, pp. 4824–4825. [Google Scholar] [CrossRef]
  30. Kawano, Y.; Ohtsuka, T. Global observability of polynomial systems. In Proceedings of the SICE Annual Conference, Taipei, Taiwan, 18–21 August 2010; pp. 2038–2041. [Google Scholar]
  31. Menini, L.; Possieri, C.; Tornambè, A. Algorthms to Compute the Largest Invariant Set Contained in an Algebraic Set for Continuous-Time and Discrete-Time Nonlinear Systems. IEEE/CAA J. Autom. Sinica 2020, 7, 57–69. [Google Scholar] [CrossRef]
  32. Gerbet, D.; Röbenack, K. On Global and Local Observability of Nonlinear Polynomial Systems: A Decidable Criterion. Automatisierungstechnik 2020, 68, 395–409. [Google Scholar] [CrossRef]
  33. Gerbet, D.; Röbenack, K. Nonlinear observability for polynomial systems: Computation and examples. In Proceedings of the International Conference on System Theory, Control and Computing (ICSTCC), Sinaia, Romania, 8–10 October 2020; pp. 425–432. [Google Scholar] [CrossRef]
  34. Kreisselmeier, G.; Engel, R. Nonlinear Observers for Autonomous Lipschitz Continuous Systems. IEEE Trans. Autom. Control. 2003, 48, 451–464. [Google Scholar] [CrossRef]
  35. Guckenheimer, J.; Holmes, P. Nonlinear Oscillations, Dynamical Systems, and Bifurcations of Vector Fields; Springer: New York, NY, USA, 1983. [Google Scholar]
  36. Paradowski, T.; Tibken, B.; Swiatlak, R. An Approach to determine Observability of Nonlinear Systems Using Interval Analysis. In Proceedings of the American Control Conference (ACC), Seattle, WA, USA, 24–26 May 2017; pp. 3932–3937. [Google Scholar] [CrossRef]
  37. Röbenack, K.; Voßwinkel, R. Formal Verification of Local and Global Observability of Polynomial Systems Using Quantifier Elimination. In Proceedings of the International Conference on System Theory, Control and Computing (ICSTCC 2019), Sinaia, Romania, 9–11 October 2019; pp. 314–319. [Google Scholar] [CrossRef]
  38. Lorenz, E.N. Deterministic non-periodic flow. J. Atmos. Sci. 1963, 20, 130–141. [Google Scholar] [CrossRef]
  39. Sparrow, C. The Lorenz Equations: Birfucations, Chaos, and Strange Atractors; Springer: New York, NY, USA, 1982. [Google Scholar]
  40. Krishchenko, A.P.; Starkov, K.E. Localization of compact invariant sets of the Lorenz system. Phys. Lett. A 2006, 353, 383–388. [Google Scholar] [CrossRef]
  41. Leonov, G.A.; Bunin, A.I.; Koksch, N. Attraktorlokalisierung des Lorenz-Systems. ZAMM—J. Appl. Math. Mech. 1987, 67, 649–656. [Google Scholar] [CrossRef]
  42. Röbenack, K.; Voßwinkel, R.; Richter, H. Automatic Generation of Bounds for Polynomial Systems with Application to the Lorenz System. Chaos Solitons Fractals 2018, 113, 25–30. [Google Scholar] [CrossRef]
  43. Runge, C. Ueber die numerische Auflösung von Differentialgleichungen. Math. Ann. 1895, 46, 167–178. [Google Scholar] [CrossRef]
  44. Luan, V.T.; Ostermann, A. Exponential Rosenbrock methods of order five — construction, analysis and numerical comparisons. J. Comput. Appl. Math. 2014, 255, 417–431. [Google Scholar] [CrossRef]
  45. Gofen, A. The ordinary differential equations and automatic differentiation unified. Complex Var. Elliptic Equations 2009, 54, 825–854. [Google Scholar] [CrossRef]
  46. Gerbet, D.; Röbenack, K. An Algebraic Approach to Identifiability. Algorithms 2021, 14, 255. [Google Scholar] [CrossRef]
Figure 1. Phase plot of the undamped Duffing oscillator. The equilibria are makes as dots.
Figure 1. Phase plot of the undamped Duffing oscillator. The equilibria are makes as dots.
Machines 11 00190 g001
Figure 2. Trajectories for the embedded system state z (blue/dark/solid) and the observer state z ^ (orange/lightdashed) of the Duffing oscillator (13).
Figure 2. Trajectories for the embedded system state z (blue/dark/solid) and the observer state z ^ (orange/lightdashed) of the Duffing oscillator (13).
Machines 11 00190 g002
Figure 3. Observer error for the Duffing oscillator (logarithmic scale).
Figure 3. Observer error for the Duffing oscillator (logarithmic scale).
Machines 11 00190 g003
Figure 4. Trajectories for the system state x (blue/dark/solid) and the projected observer state x ^ (orange/lightdashed) of the Duffing oscillator (13). The projection of the observer state is discontinuous.
Figure 4. Trajectories for the system state x (blue/dark/solid) and the projected observer state x ^ (orange/lightdashed) of the Duffing oscillator (13). The projection of the observer state is discontinuous.
Machines 11 00190 g004
Figure 5. Trajectories for the embedded system state z (blue/dark/solid) and the observer state z ^ (orange/light/dashed) of the system (15).
Figure 5. Trajectories for the embedded system state z (blue/dark/solid) and the observer state z ^ (orange/light/dashed) of the system (15).
Machines 11 00190 g005
Figure 6. Observer error for the system (15) (logarithmic scale).
Figure 6. Observer error for the system (15) (logarithmic scale).
Machines 11 00190 g006
Figure 7. Trajectories for the system state x (blue/dark/solid) and the projected observer state x ^ (orange/light/dashed) of the system (15).
Figure 7. Trajectories for the system state x (blue/dark/solid) and the projected observer state x ^ (orange/light/dashed) of the system (15).
Machines 11 00190 g007
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Gerbet, D.; Röbenack, K. A High-Gain Observer for Embedded Polynomial Dynamical Systems. Machines 2023, 11, 190. https://doi.org/10.3390/machines11020190

AMA Style

Gerbet D, Röbenack K. A High-Gain Observer for Embedded Polynomial Dynamical Systems. Machines. 2023; 11(2):190. https://doi.org/10.3390/machines11020190

Chicago/Turabian Style

Gerbet, Daniel, and Klaus Röbenack. 2023. "A High-Gain Observer for Embedded Polynomial Dynamical Systems" Machines 11, no. 2: 190. https://doi.org/10.3390/machines11020190

APA Style

Gerbet, D., & Röbenack, K. (2023). A High-Gain Observer for Embedded Polynomial Dynamical Systems. Machines, 11(2), 190. https://doi.org/10.3390/machines11020190

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop