Next Article in Journal
Integral Inequalities Involving Strictly Monotone Functions
Next Article in Special Issue
Maximum Power Point Tracker Controller for Solar Photovoltaic Based on Reinforcement Learning Agent with a Digital Twin
Previous Article in Journal
Finite-Time Contractive Control of Spacecraft Rendezvous System
Previous Article in Special Issue
Development of Slime Mold Optimizer with Application for Tuning Cascaded PD-PI Controller to Enhance Frequency Stability in Power Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Design of Distributed Interval Observers for Multiple Euler–Lagrange Systems

1
The School of Mechanical and Electrical Engineering, Soochow University, Suzhou 215325, China
2
Conservatoire National des Arts et Métiers (CNAM), Cedric-Lab, 292, Rue Saint-Martin, CEDEX 03, 75141 Paris, France
*
Authors to whom correspondence should be addressed.
Mathematics 2023, 11(8), 1872; https://doi.org/10.3390/math11081872
Submission received: 22 March 2023 / Revised: 11 April 2023 / Accepted: 12 April 2023 / Published: 14 April 2023
(This article belongs to the Special Issue Advanced Control Theory with Applications)

Abstract

:
This paper investigates the problem of distributed interval estimation for multiple Euler–Lagrange systems. An interconnection topology is supposed to be strongly connected. To design distributed interval observers, the coordinate transformation method is employed. The construction of the distributed interval observer is given by the monotone system theory, and the stability is analyzed by the Lyapunov stability theory. Unlike the current works, each sub-interval observer has its own gain; in addition to this, additional observer gains are used to reduce the conservatism of design. The gains of all sub-interval observers are determined by both the monotone system theory and the Lyapunov stability theory. Finally, a simulation example verifies the feasibility of the presented distributed interval observers.

1. Introduction

Euler–Lagrange systems (ELSs) have been studied by a wide range of scholars as a common class of systems for describing many real mechanical models. In fact, some of the variables in a specific mechanical system are not directly available. Therefore, a number of scholars have addressed the observer design problem for ELSs. A speed observer design method for general ELSs was presented in [1]. The authors in [2] designed a nonlinear disturbance observer for ELSs and realized the estimation of unknown disturbances. Ref. [3] used a sliding-mode disturbance observer for ELSs to design a semi-global exponential controller. With the deepening of research and the development of multi-agent systems, scholars investigated the problem of the state estimation of multiple ELSs (MELSs) in recent years. In [4], the authors designed distributed observers (DOs) for a class of MELSs without external disturbances. Ref. [5] studied the output-based tracking control problem for MELSs, in which the authors designed a novel nonlinear DO. In [6], a DO-based fault-detection method for MELSs was introduced, and a DO-based controller was also designed. In addition to this, the investigation on MELSs with uncertainties had received considerable attention. Ref. [7] addressed the problem of leader-following consensus of uncertain MELSs under switching network topology and proposed a DO design method to recover the states. Moreover, the distributed adaptive observers were designed for MELSs with uncertainties in [8]. There are also other interesting works on MELSs [9,10,11,12] herein.
As an effective estimation method, interval observers (IOs) can recover the upper and lower boundaries of uncertain systems. The concept of IOs was introduced in [13]. The IOs are further divided into centralized IOs (CIOs) and distributed IOs (DIOs). There are many studies on CIOs [14,15,16,17,18,19,20,21]. For continuous systems, an IO design method was introduced for linear time-invariant systems with disturbances in [14]. The authors in [15] gave an effective design method of IO for time-varying systems. For discrete-time systems, [16] formulated a design framework of IO, and [17] investigated the IO design problem for time-varying discrete-time systems. In [18], the IO design method for discrete-time switched systems was studied. Over the past decade, the research of functional IO has also attracted the attention of some researchers [19,20,21]. On the other hand, the investigation on DIOs has also been reported by some works recently such as [22,23,24]. The authors of [22] presented an method to design DIOs, which was applied to fault detection for multi-agent systems. The authors of [23] considered the design method of DIOs for a class of linear time-invariant systems with uncertainties. Finally, The authors of [24] extended the DIOs design method to a class of fractional-order systems. The problem of estimation of MELSs is always complicated due to the uncertainty contained in the system itself. Most of the existing works add constraints to achieve state estimation; however, this problem can be avoided if an interval estimation approach is used and state estimation can also be achieved. Therefore, it is necessary to design DIOs for MELSs. To the authors’ best knowledge, there are few reports on DIOs for MELSs.
Based on the above discussion, this paper studies the DIOs design problem of MELSs. First of all, the coordinate transformation method must necessarily be introduced. Then, the framework of DIOs is constructed based on the monotone system theory. Additionally, the stability of DIO is guaranteed by Lyapunov stability theory. The rest of the paper is structured as follows. Section 2 gives the preliminaries, which include the graph theory and system model. Section 3 provides the DIO design method based on monotone system theory. In Section 4, a numerical example is used to show the validity of the presented design method of DIO. Finally, Section 5 is the conclusion of the paper.
Notaion: For a matrix E, E + denotes m a x { 0 , E } , E = E + E . For a real symmetric matrix O R n × n , O 0 ( O 0 ) indicates that O is positive (negative) definite, H e ( O ) = O T + O . ⊗ represents the Kronecker product, and the diag{·} denotes a block diagonal matrix.

2. Preliminaries

2.1. Graph Theory

For a digraph G with N vertices, the adjacency matrix A R n × n = [ a i j ] is given by a i j = 0 , if ( i , j ) S, where S is the set of edges, and a i j = 1 , otherwise. The length path from a vertex i to a vertex j is a sequence of r + 1 distinct vertices starting at i and ending at j, and consecutive vertices are adjacent to each other. A graph G is said to be connected if there is a path between any two vertices of the graph G. The Laplacian matrix L of graph G is defined as L : = D A . D is called the degree matrix of G . For a connected graph, the Laplacian matrix has a single zero eigenvalue and the corresponding eigenvector is 1 N . Additionally, if G is connected then 0 = λ 1 ( G ) λ 2 ( G ) λ N ( G ) , where λ i ( G ) is the eigenvalue of L .
Lemma 1 
([25]). Assume that G is a strongly connected graph. Denote r i ( i = 1 , , N ) as the left eigenvector with eigenvalue 0, and R = d i a g { r 1 , , r N } ; then, R L + L T R 0 holds.
Lemma 2 
([26]). If graph G is strongly connected, the generalized algebraic connectivity of G could be represented as a ( L ) = m i n r T x = 0 , x 0 x T ( R L + L T R ) x 2 x T R x . If the topology is balanced, the matrix R = r 1 I N . Then, a ( L ) = λ m i n ( H e ( L ) 2 ) holds.

2.2. System Model

In general, an ELS with second-order dynamics can be written as
M i ( q i ) q ¨ i + C i ( q i , q ˙ i ) q ˙ i + G i ( q i ) = u i ,
where q i R n is the vector of generalized coordinates, M i ( q i ) R n × n represents the inertia matrix, C ( q i , q ˙ i ) R n × n denotes the vector of Coriolis and centripetal forces, G ( q ) R n is the gravity vector, and u i R n stands for the vector of generalized control input forces. Next, we take the following transformations for system (1):
x ˙ 1 = x 2 , x ˙ 2 = h ( x 1 ) u + f ( x 1 , x 2 ) ,
where x i 1 = q i , x i 2 = q ˙ i , h ( x i 1 ) = M ( x i 1 ) 1 , f ( x i 1 , x i 2 ) = M ( x i 1 ) 1 ( C ( x i 1 , x i 2 ) x i 2 + G ( x i 1 ) ) . The joint displacements are measurable; under the above state reconstruction, we can obtain the following equation:
x ˙ i ( t ) = A x i ( t ) + B u i ( t ) + ϕ i ( x i ( t ) ) , y i ( t ) = C x i ( t ) ,
where A = 0 n × n I n × n 0 n × n 0 n × n R 2 n × 2 n , B = 0 n × n h ( x i 1 ) R 2 n × n , C = I n × n 0 n × n R n × 2 n , and ϕ i ( x i ( t ) ) = 0 n × 1 f ( x i 1 , x i 2 ) R 2 n .
Lemma 3 
([27]). If ϕ ( x i ) is a Lipschitz function that is globally differentiable, then there are two increasing Lipschitz functions f ( x i ) and g ( x i ) such that
ϕ ( x i ) = f ( x i ) g ( x i ) .
Lemma 4 
([27]). For the function ϕ ( x i ) in Lemma 3, a global Lipschitz function ϕ ¯ ( x i a , x i b ) exists such that:
ϕ ¯ ( x i , x i ) = ϕ ( x i ) ,
ϕ ¯ x i a 0 , and ϕ ¯ x i b 0 .
The above lemmas can help us obtain the boundaries of nonlinear function ϕ ( x i , x i ) :
x ̲ i x x ¯ i ϕ ¯ ( x ̲ i , x ¯ i ) ϕ ( x i , x i ) ϕ ¯ ( x ¯ i , x ̲ i ) .
Lemma 5 
([24]). For ϕ ( x i ) , ϕ ¯ ( x ¯ i , x ̲ i ) and ϕ ¯ ( x ̲ i , x ¯ i ) defined in Lemma 4, matrices F i { 1 , 2 , 3 , 4 } exist such that
ϕ ¯ ( x ¯ i , x ̲ i ) ϕ ( x i ) ) F 1 e ¯ i + F 2 e ̲ i , ϕ ( x i ) ϕ ¯ ( x ̲ i , x ¯ i ) F 3 e ¯ i + F 4 e ̲ i ,
where e ̲ i = x i x i ̲ and e ¯ i = x ¯ i x i .
Lemma 6 
([14]). Given a constant matrix A R m × n and a vector ζ R n × 1 , if ζ [ ζ ̲ , ζ ¯ ] holds, then
A + ζ ̲ A ζ ¯ A ζ A + ζ ¯ A ζ ̲ .
In order to obtain the main results, we need the following assumptions.
Assumption 1. 
The nonlinear function ϕ i ( x i ( t ) ) is considered as a global Lipschitz function.
Assumption 2. 
For every sub-system, the initial state of system (3) satisfies the following inequality:
x ̲ i ( 0 ) x i ( 0 ) x ¯ i ( 0 ) .
Assumption 3. 
The topology graph is considered to be balanced and strongly connected.
Assumption 4. 
Matrices L, M, Y ¯ , and Y ̲ exist such that Π is Metzler with
Π = Ψ + Y ¯ Y ¯ Y ̲ Ψ + Y ̲ ,
where Ψ = A ^ L C ^ γ M ( L I n ) .
Remark 1. 
The above assumptions have been commonly used and widely accepted in previous studies. Similar to [22], the topology graph is supposed to be balanced and strongly connected in this paper; based on this, we provide the following results.

3. Main Results

To design DIO for system (3), some preliminary preparations are needed. First, the equivalence transformation is performed for system matrix A R n × n . Using the linear transformation z i = H x i , the system (3) becomes
z i ˙ ( t ) = A ¯ z i ( t ) + B ¯ u i ( t ) + H ϕ i ( H 1 z i ( t ) ) , y i ( t ) = C ¯ z i ( t ) ,
where A ¯ = H A H 1 , B ¯ = H B , and C ¯ = C H 1 .
Remark 2. 
In order to estimate the bounds of the nonlinear function ϕ i ( x ) , we define that
φ i ( z ¯ i , z ̲ i ) = ϕ i ( H a + z ¯ i H a z ̲ i , H a + z ̲ i H a z ¯ i ) , φ i ( z ̲ i , z ¯ i ) = ϕ i ( H a + z ̲ i H a z ¯ i , H a + z ¯ i H a z ̲ i ) ,
where z ¯ i ( t ) and z ̲ i ( t ) represent the estimated values of z i ( t ) , and H a = H 1 .
Under Lemma 6, the following inequality can be obtained:
Φ i ( z ̲ i , z ¯ i ) = H + φ i ( z ̲ i , z ¯ i ) H φ i ( z ¯ i , z ̲ i ) H ϕ i ( H 1 z i ) H + φ i ( z ¯ i , z ̲ i ) H φ i ( z ̲ i , z ¯ i ) = Φ i ( z ¯ i , z ̲ i ) .
Remark 3. 
After the transformation of the coordinates, the conclusion of Lemma 5 takes the following form:
Φ i ( z ¯ i , z ̲ i ) H ϕ i ( H 1 z i ) N 1 e ¯ i + N 2 e ̲ i , H ϕ i ( H 1 z i ) Φ i ( z ̲ i , z ¯ i ) N 3 e ¯ i + N 4 e ̲ i ,
where N i = F i H ( i = 1 , 2 , 3 , 4 ) are constant matrices.
To achieve z ̲ z z ¯ , the following DIOs for each sub-system are constructed:
z ¯ ˙ i ( t ) = A ¯ z ¯ i ( t ) + B ¯ u i ( t ) + Φ i ( z ¯ i , z ̲ i ) + L i ( y i C ¯ z ¯ i ( t ) ) + Y ¯ i ( z ¯ i ( t ) z ̲ i ( t ) ) + γ M i j = 0 N a i j ( z ¯ j z ¯ i ) , z ̲ ˙ i ( t ) = A ¯ z ̲ i ( t ) + B ¯ u i ( t ) + Φ i ( z ̲ i , z ¯ i ) + L i ( y i C ¯ z ̲ i ( t ) ) Y ̲ i ( z ¯ i ( t ) z ̲ i ( t ) ) + γ M i j = 0 N a i j ( z ̲ j z ̲ i ) .
Then, the error system for i-th sub-system is obtained
e ¯ ˙ i ( t ) = z ¯ ˙ i z ˙ i = ( A ¯ L i C ¯ γ M i j = 0 N L i j ) e ¯ i ( t ) + Φ i ( z ¯ i , z ̲ i ) H ϕ i ( H 1 z i ( t ) ) + Y ¯ i ( e ¯ i ( t ) e ̲ i ( t ) ) , e ̲ ˙ i ( t ) = z ̲ ˙ i z ˙ i = ( A ¯ L i C ¯ γ M i j = 0 N L i j ) e ̲ i ( t ) + H ϕ i ( H 1 z i ( t ) ) Φ i ( z ¯ i , z ̲ i ) + Y ̲ i ( e ¯ i ( t ) e ̲ i ( t ) ) .
Under Assumption 3, the dynamics of the global system are expressed as
z ˙ ( t ) = A ^ z ( t ) + B ^ u ( t ) + ϕ ^ ( z ( t ) ) , y ( t ) = C ^ z ( t ) ,
where z = [ z 1 T , , z N T ] T , y = [ y 1 T , , y N T ] T , A ^ = d i a g { A ¯ , , A ¯ N } , B ^ = d i a g { B ¯ , , B ¯ N } , u = [ u 1 T , , u N T ] T , ϕ ^ = [ ( H ϕ 1 ) T , , ( H ϕ N ) T ] T , C ^ = d i a g { C ¯ , , C ¯ N } .
The dynamics of the global observer system are given by
z ¯ ˙ ( t ) = A ^ z ¯ ( t ) + B ^ u ( t ) + Φ ¯ + L ( y C ^ z ¯ ( t ) ) + Y ¯ ( z ¯ ( t ) z ̲ ( t ) ) γ M ( L I n ) z ¯ ( t ) , z ̲ ˙ ( t ) = A ^ z ̲ ( t ) + B ^ u ( t ) + Φ ̲ + L ( y C ^ z ̲ ( t ) ) Y ̲ ( z ¯ ( t ) z ̲ ( t ) ) γ M ( L I n ) z ̲ ( t ) ,
where Φ ¯ = Φ 1 ( z ¯ 1 , z ̲ 1 ) Φ N ( z ¯ N , z ̲ N ) , Φ ̲ = Φ 1 ( z ̲ 1 , z ¯ 1 ) Φ N ( z ̲ N , z ¯ N ) , L = L 1 L N Y ¯ = Y ¯ 1 Y ¯ N , Y ̲ = Y ̲ 1 Y ̲ N .
Theorem 1. 
If Assumptions 1–4 hold, the z ¯ ( t ) and z ̲ ( t ) given in (15) satisfy z ̲ ( t ) z ( t ) z ¯ ( t ) .
Proof. 
The dynamics of the global error system are given by
e ¯ ˙ ( t ) = z ¯ ˙ ( t ) z ˙ ( t ) = [ A ^ L C ^ γ M ( L I n ) ] e ¯ ( t ) + Φ ¯ ϕ ^ ( z ( t ) ) + Y ¯ ( e ¯ ( t ) e ̲ ( t ) ) , e ̲ ˙ ( t ) = z ˙ ( t ) z ̲ ˙ ( t ) = [ A ^ L C ^ γ M ( L I n ) ] e ̲ ( t ) + ϕ ^ ( z ( t ) ) Φ ̲ + Y ̲ ( e ¯ ( t ) e ̲ ( t ) ) .
Define ϵ ( t ) = e ¯ ( t ) e ̲ ( t ) , then we can obtain the derivative of ϵ ( t )
ϵ ˙ ( t ) = Π ϵ ( t ) + Φ ˜ ,
where
Π = Ψ + Y ¯ Y ¯ Y ̲ Ψ + Y ̲ , Φ ˜ = Φ ¯ ϕ ^ ( z ( t ) ) ϕ ^ ( z ( t ) ) Φ ̲ .
The proof of the validity of (12) and (15) is equivalent to the proof of the non-negativity of the error system. From Lemma 4 and Remark 2, we have Φ ¯ ϕ ^ ( z ( t ) ) 0 and ϕ ^ ( z ( t ) ) Φ ̲ 0 . It is obvious that e ¯ ( 0 ) 0 and e ̲ ( 0 ) 0 from Assumption 2. By Assumption 4, we have Π is Metzler. Above all, considering the monotone system theory, ϵ ( t ) 0 holds, which implies z ̲ ( t ) z ( t ) z ¯ ( t ) for all t 0 . Hence, the proof of Theorem 1 is completed.
After proving the boundedness of DIO, we proceed to design the observer gain L i , Y ¯ i , Y ̲ i , and M i to guarantee the stability of the DIO (15).
Theorem 2. 
Given a positive definite matrix P = P T and a constant τ > 0 , if a solution exists such that
Ω ˜ = H e ( P A ¯ Q i C ¯ + P N 1 + W ¯ i ) 2 τ I n P N 2 W ¯ i + N 3 T P + W ̲ i T N 2 T P W ¯ i T + P N 3 + W ̲ i H e ( P A ¯ Q i C ¯ + P N 4 W ̲ i ) 2 τ I n 0 ,
γ > τ a ( L ) ,
where L i = P 1 Q i , Y ¯ i = P 1 W ¯ i , Y ̲ i = P 1 W ̲ i , and M i 1 = P are the observer gains, γ is the coupling strength, then the system (15) is a DIO of (14).
Proof. 
A Lyapunov function candidate can be defined as V ( t ) = i = 0 N r i e ¯ i T P e ¯ i + i = 0 N r i e ̲ i T P e ̲ i ; then, the derivative of V ( t ) can be written as □
V ˙ ( t ) = i = 0 N r i ( Γ e ¯ i + χ ¯ i + Y ¯ i ( e ¯ i e ̲ i ) ) T P e ¯ i + i = 0 N r i ( Γ e ̲ i + χ ̲ i + Y ̲ i ( e ¯ i e ̲ i ) ) T P e ̲ i + i = 0 N r i e ¯ i T P ( Γ e ¯ i + χ ¯ i + Y ¯ i ( e ¯ i e ̲ i ) ) + i = 0 N r i e ̲ i T P ( Γ e ̲ i + χ ̲ i + Y ̲ i ( e ¯ i e ̲ i ) ) i = 0 N r i ( Γ e ¯ i + N 1 e ¯ i + N 2 e ̲ i + Y ¯ i ( e ¯ i e ̲ i ) ) T P e ¯ i + i = 0 N r i ( Γ e ̲ i + N 3 e ¯ i + N 4 e ̲ i + Y ̲ i ( e ¯ i e ̲ i ) ) T P e ̲ i + i = 0 N r i e ¯ i T P ( Γ e ¯ i + N 1 e ¯ i + N 2 e ̲ i + Y ¯ i ( e ¯ i e ̲ i ) ) + i = 0 N r i e ̲ i T P ( Γ e ̲ i + N 3 e ¯ i + N 4 e ̲ i + Y ̲ i ( e ¯ i e ̲ i ) ) = ( ( R ( A ¯ L i C ¯ ) γ R L M i ) e ¯ + R ( N 1 + Y ¯ i ) e ¯ + R ( N 2 Y ¯ i ) e ̲ ) ( I P ) e ¯ + ( ( R ( A ¯ L i C ¯ ) γ R L M i ) e ̲ + R ( N 3 + Y ̲ i ) e ¯ + R ( N 4 Y ̲ i ) e ̲ ) T ( I P ) e ̲ + e ¯ T ( I P ) ( ( R ( A ¯ L i C ¯ ) γ R L M i ) e ¯ + R ( N 1 + Y ¯ i ) e ¯ + R ( N 2 Y ¯ i ) e ̲ ) + e ̲ T ( I P ) ( ( R ( A ¯ L i C ¯ ) γ R L M i ) e ̲ + R ( N 3 + Y ̲ i ) e ¯ + R ( N 4 Y ̲ i ) e ̲ ) = e ¯ T ( R H e ( P A ¯ P L i C ¯ + P ( N 1 + Y ¯ i ) ) γ ( R L + L T R ) P M ) e ¯ + e ¯ T ( R ( P ( N 2 Y ¯ i ) + ( N 3 + Y ̲ i ) T P ) ) e ̲ + e ̲ T ( R ( ( N 2 Y ¯ i ) T P + P ( N 3 + Y ̲ i ) ) ) e ¯ + e ̲ T ( R H e ( P A ¯ P L i C ¯ + P ( N 4 Y ̲ i ) ) γ ( R L + L T R ) P M ) e ̲ ,
where Γ = A ¯ L i C ¯ γ M i j = 0 N L i j , χ ¯ i = Φ i ( z ¯ i , z ̲ i ) H ϕ i ( H 1 z i ( t ) ) , and χ ̲ i = H ϕ i ( H 1 z i ( t ) ) Φ i ( z ̲ i , z ¯ i ) .
It follows from Lemma 2 that
2 a ( L ) e ¯ T R e ¯ e ¯ T ( R L + L T R ) e ¯ ,
2 a ( L ) e ̲ T R e ̲ e ̲ T ( R L + L T R ) e ̲ .
Considering M i = P 1 , (21) and (22), (20) can be written as
V ˙ ( t ) e ¯ T ( R H e ( P A ¯ P L i C ¯ + P ( N 1 + Y ¯ i ) ) 2 γ a ( L ) R I n ) e ¯ + e ¯ T ( R ( P ( N 2 Y ¯ i ) + ( N 3 + Y ̲ i ) T P ) ) e ̲ + e ̲ T ( R ( ( N 2 Y ¯ i ) T P + P ( N 3 + Y ̲ i ) ) ) e ¯ + e ̲ T ( R H e ( P A ¯ P L i C ¯ + P ( N 4 Y ̲ i ) ) 2 γ a ( L ) R I n ) e ̲ .
Noting that γ > τ a ( L ) , we have
V ˙ ( t ) e ¯ T ( R H e ( P A ¯ P L i C ¯ + P ( N 1 + Y ¯ i ) ) 2 τ R I n ) e ¯ + e ¯ T ( R ( P ( N 2 Y ¯ i ) + ( N 3 + Y ̲ i ) T P ) ) e ̲ + e ̲ T ( R ( ( N 2 Y ¯ i ) T P + ( P N 3 + Y ̲ i ) ) ) e ¯ + e ̲ T ( R H e ( P A ¯ P L i C ¯ + P ( N 4 Y ̲ i ) ) 2 τ R I n ) e ̲ = ϵ T ( t ) R Ω ϵ ( t ) ,
where ϵ ( t ) = [ e ¯ T , e ̲ T ] T , and
Ω = H e ( P A ¯ P L i C ¯ + P ( N 1 + Y ¯ i ) ) 2 τ I n P ( N 2 Y ¯ i ) + ( N 3 + Y ̲ i ) T P ( N 2 Y ¯ i ) T P + P ( N 3 + Y ̲ i ) H e ( P A ¯ P L i C ¯ + P ( N 4 Y ̲ i ) ) 2 τ I n .
Then, V ˙ ( t ) < 0 and Ω 0 are equal, which shows that l i m t e ¯ ( t ) = 0 and l i m t e ̲ ( t ) = 0 . The stability of DIO can be guaranteed.
Remark 4. 
To satisfy the LMI toolbox, Q i = P L i , W ¯ i = P Y ¯ i , W ̲ i = P Y ̲ i are applied to Ω, which results in
Ω ˜ = H e ( P A ¯ Q i C ¯ + P N 1 + W ¯ i ) 2 τ I n P N 2 W ¯ i + N 3 T P + W ̲ i T N 2 T P W ¯ i T + P N 3 + W ̲ i H e ( P A ¯ Q i C ¯ + P N 4 W ̲ i ) 2 τ I n .

4. Simulation

In this section, a team of 2-DOF manipulator models with an directed graph is applied to validate the feasibility of the presented DIOs for ELSs. The example runs on a CPU Inter Core i7-10750H CPU with 2.59 GHZ and 8 GB of RAM; the main software used is MATLAB 2018a.
The parameters of the model can be referred to [12], and the description of the parameters is shown in Table 1. First of all, the matrix L is
L = 3 1 1 1 1 2 1 0 1 1 2 0 1 0 0 1 ,
From Lemma 2, it follows that α ( L ) = 1 . Then, we chose the coordinate transformation matrix as
H = 1 0 0 0 0 1 0 0 1 0 1 0 0 1 0 1 .
By solving (19), the gain of the observer can be calculated.
W ¯ i = 1.7448 0 0.3703 0 0 1.7448 0 0.3703 0.3703 0 1.0920 0 0 0.3703 0 1.0920 , W ̲ i = 1.7448 0 0.3703 0 0 1.7448 0 0.3703 0.3703 0 1.0920 0 0 0.3703 0 1.0920 ,
Q = 5.3976 0 0 5.3976 3.0250 0 0 3.0250 , M i = 0.5235 0 0.0920 0 0 0.5235 0 0.0920 0.0920 0 0.8917 0 0 0.0920 0 0.8917 ,
and
P = 1.9456 0 0.2008 0 0 1.9456 0 0.2008 0.2008 0 1.1422 0 0 0.2008 0 1.1422 .
Noting Remark 4, we can obtain
Y ¯ i = 0.9474 0 0.2943 0 0 0.9474 0 0.2943 0.4908 0 1.0078 0 0 0.4908 0 1.0078 , Y ̲ i = 0.9474 0 0.2943 0 0 0.9474 0 0.2943 0.4908 0 1.0078 0 0 0.4908 0 1.0078 ,
L i = 3.1040 0 0 3.1040 3.1941 0 0 3.1941 .
The initial value is defined as x ( 0 ) = [ 0 5 6 4 4 1 5 6 3 4 6 1 6 4 1 5 ] T . The initial values of DIO are chosen as x ¯ ( 0 ) = [ 10 10 9 7 10 10 13 9 10 10 7 13 10 10 8 10 ] T and x ̲ ( 0 ) = [ 4 4 4.5 3.5 4 4 5 1 4 4 4 6 4 4 1 4 ] T , and γ is given as γ = 3 .
The simulation results are displayed in the figures below. It is worth noting that i in v i j refers to the i-th manipulator and j represents the j-th state. Figure 1, Figure 2, Figure 3 and Figure 4 depict the original state trajectory of velocity and the state trajectory of DIO at the two joints of the four manipulators, respectively. It can be seen that the boundaries of the DIO recover the state of the original system. Figure 5, Figure 6, Figure 7 and Figure 8 show the errors in the DIO and the original system velocity for the four manipulators at the two joints, respectively. From the figures, we can see that the error between the original system and observer converge to a small bound, which means that the DIO is valid.
Remark 5. 
In the simulation, we first need to design a coordinate transformation matrix and then solve Ω ˜ < 0  (25) by using the LMI toolbox, and the feasible solution is applied to the simulation model we have built. The complexity of the computation is reflected in solving the LMI, and the details are shown in Table 2.
It is worth noting that the parameters in Table 2 all need to be recalculated if the topology or the coordinate transformation matrix changes.
Remark 6. 
Compared with [22], MELSs contain nonlinearities, which makes it more complicated to design the IO. That is, the design method proposed in the paper can also be applied to more general systems. Unlike [24], two observer gains Y ¯ i and Y ̲ i are considered to make the the sufficient condition less conservative while ensuring the existence of the interval observer. As shown in Table 3, the conditions obtained using the method in this article are solvable. However, using the method in [24], there is no solution.

5. Conslusions

In this paper, a DIO design method for MELSs is studied. The design conditions are relaxed by using the coordinate transformation method. Two methods of designing observer gains are formulated under monotone system theory and Lyapunov stability theory. Meanwhile, the additional observer gains Y ¯ and Y ̲ are introduced in DIO, which also provide more feasibility for the existence of the observer. Finally, an example is given to verify the effectiveness of the presented DIO design method. In the future, we will try to relax the requirements of the topology graph and study the design of DIO-based controller algorithms.

Author Contributions

Conceptualization, Z.Y. and J.H.; Methodology, Z.Y., J.H. and T.N.D.; Validation, Z.Y., J.H. and T.N.D.; Writing—original draft, Z.Y.; Writing—review & editing, J.H. and T.N.D.; Supervision, J.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Stamnes, Ø.N.; Aamo, O.M.; Kaasa, G.O. A constructive speed observer design for general Euler–Lagrange systems. Automatica 2011, 47, 2233–2238. [Google Scholar] [CrossRef]
  2. Mohammadi, A.; Marquez, H.J.; Tavakoli, M. Nonlinear disturbance observers: Design and applications to Euler–Lagrange systems. IEEE Control Syst. Mag. 2017, 37, 50–72. [Google Scholar]
  3. Sun, T.; Cheng, L.; Wang, W.; Pan, Y. Semiglobal exponential control of Euler–Lagrange systems using a sliding-mode disturbance observer. Automatica 2020, 112, 108677. [Google Scholar] [CrossRef]
  4. Stamnes, Ø.N.; Aamo, O.M.; Kaasa, G.O. Global output feedback tracking control of Euler–Lagrange systems. IFAC Proc. Vol. 2011, 44, 215–220. [Google Scholar] [CrossRef]
  5. Yang, Q.; Fang, H.; Mao, Y.; Huang, J. Distributed tracking for networked Euler–Lagrange systems without velocity measurements. J. Syst. Eng. Electron. 2014, 25, 671–680. [Google Scholar] [CrossRef]
  6. Liu, L.; Shan, J. Distributed formation control of networked Euler–Lagrange systems with fault diagnosis. J. Frankl. Inst. 2015, 352, 952–973. [Google Scholar] [CrossRef]
  7. Cai, H.; Huang, J. Leader-following consensus of multiple uncertain Euler–Lagrange systems under switching network topology. Int. J. Gen. Syst. 2014, 43, 294–304. [Google Scholar] [CrossRef]
  8. Cai, H.; Huang, J. The leader-following consensus for multiple uncertain Euler–Lagrange systems with a distributed adaptive observer. In Proceedings of the 2015 IEEE 7th International Conference on Cybernetics and Intelligent Systems (CIS) and IEEE Conference on Robotics, Automation and Mechatronics (RAM), Siem Reap, Cambodia, 15–17 July 2015; pp. 218–223. [Google Scholar]
  9. Cai, H.; Huang, J. The leader-following consensus for multiple uncertain Euler–Lagrange systems with an adaptive distributed observer. IEEE Trans. Autom. Control 2015, 61, 3152–3157. [Google Scholar] [CrossRef]
  10. Wang, S.; Huang, J. Adaptive leader-following consensus for multiple Euler–Lagrange systems with an uncertain leader system. IEEE Trans. Neural Netw. Learn. Syst. 2018, 30, 2188–2196. [Google Scholar] [CrossRef] [Green Version]
  11. Guo, X.; Wei, G.; Yao, M.; Zhang, P. Consensus Control for Multiple Euler–Lagrange Systems Based on High-Order Disturbance Observer: An Event-Triggered Approach. IEEE/CAA J. Autom. Sin. 2022, 9, 945–948. [Google Scholar] [CrossRef]
  12. Sun, Y.; Dong, D.; Qin, H.; Wang, W. Distributed tracking control for multiple Euler–Lagrange systems with communication delays and input saturation. ISA Trans. 2020, 96, 245–254. [Google Scholar] [CrossRef] [PubMed]
  13. Gouzé, J.L.; Rapaport, A.; Hadj-Sadok, M.Z. Interval observers for uncertain biological systems. Ecol. Model. 2000, 133, 45–56. [Google Scholar] [CrossRef]
  14. Mazenc, F.; Bernard, O. Interval observers for linear time-invariant systems with disturbances. Automatica 2011, 47, 140–147. [Google Scholar] [CrossRef] [Green Version]
  15. Thabet, R.E.H.; Raissi, T.; Combastel, C.; Efimov, D.; Zolghadri, A. An effective method to interval observer design for time-varying systems. Automatica 2014, 50, 2677–2684. [Google Scholar] [CrossRef]
  16. Mazenc, F.; Dinh, T.N.; Niculescu, S.I. Interval observers for discrete-time systems. Int. J. Robust Nonlinear Control 2014, 24, 2867–2890. [Google Scholar] [CrossRef] [Green Version]
  17. Efimov, D.; Perruquetti, W.; Raïssi, T.; Zolghadri, A. Interval observers for time-varying discrete-time systems. IEEE Trans. Autom. Control 2013, 58, 3218–3224. [Google Scholar] [CrossRef] [Green Version]
  18. Guo, S.; Zhu, F. Interval observer design for discrete-time switched system. IFAC-PapersOnLine 2017, 50, 5073–5078. [Google Scholar] [CrossRef]
  19. Gu, D.K.; Liu, L.W.; Duan, G.R. Functional interval observer for the linear systems with disturbances. IET Control Theory Appl. 2018, 12, 2562–2568. [Google Scholar] [CrossRef]
  20. Raïssi, T.; Videau, G.; Zolghadri, A. Interval observer design for consistency checks of nonlinear continuous-time systems. Automatica 2010, 46, 518–527. [Google Scholar] [CrossRef]
  21. Huong, D.C. Design of functional interval observers for non-linear fractional-order systems. Asian J. Control 2020, 22, 1127–1137. [Google Scholar] [CrossRef]
  22. Zhang, Z.H.; Yang, G.H. Distributed fault detection and isolation for multiagent systems: An interval observer approach. IEEE Trans. Syst. Man Cybern. Syst. 2018, 50, 2220–2230. [Google Scholar] [CrossRef]
  23. Li, D.; Chang, J.; Chen, W.; Raïssi, T. IPR-based distributed interval observers design for uncertain LTI systems. ISA Trans. 2022, 121, 147–155. [Google Scholar] [CrossRef] [PubMed]
  24. Zhang, H.; Huang, J.; He, S. Fractional-Order Interval Observer for Multiagent Nonlinear Systems. Fractal Fract. 2022, 6, 355. [Google Scholar] [CrossRef]
  25. Yu, W.; Chen, G.; Cao, M.; Kurths, J. Second-order consensus for multiagent systems with directed topologies and nonlinear dynamics. IEEE Trans. Syst. Man Cybern. Part B (Cybern.) 2009, 40, 881–891. [Google Scholar]
  26. Li, Z.; Liu, X.; Fu, M.; Xie, L. Global H∞ consensus of multi-agent systems with Lipschitz non-linear dynamics. IET Control Theory Appl. 2012, 6, 2041–2048. [Google Scholar] [CrossRef]
  27. Moisan, M.; Bernard, O. Robust interval observers for global Lipschitz uncertain chaotic systems. Syst. Control Lett. 2010, 59, 687–694. [Google Scholar] [CrossRef]
Figure 1. Evolutions of velocity of original system and DIO at the first joint (a) and second joint (b) of first manipulator.
Figure 1. Evolutions of velocity of original system and DIO at the first joint (a) and second joint (b) of first manipulator.
Mathematics 11 01872 g001
Figure 2. Evolutions of velocity of original system and DIO at the first joint (a) and second joint (b) of second manipulator.
Figure 2. Evolutions of velocity of original system and DIO at the first joint (a) and second joint (b) of second manipulator.
Mathematics 11 01872 g002
Figure 3. Evolutions of velocity of original system and DIO at the first joint (a) and second joint (b) of third manipulator.
Figure 3. Evolutions of velocity of original system and DIO at the first joint (a) and second joint (b) of third manipulator.
Mathematics 11 01872 g003
Figure 4. Evolutions of velocity of original system and DIO at the first joint (a) and second joint (b) of fouth manipulator.
Figure 4. Evolutions of velocity of original system and DIO at the first joint (a) and second joint (b) of fouth manipulator.
Mathematics 11 01872 g004
Figure 5. The error between the observer and the original system of the first manipulator.
Figure 5. The error between the observer and the original system of the first manipulator.
Mathematics 11 01872 g005
Figure 6. The error between the observer and the original system of the second manipulator.
Figure 6. The error between the observer and the original system of the second manipulator.
Mathematics 11 01872 g006
Figure 7. The error between the observer and the original system of the third manipulator.
Figure 7. The error between the observer and the original system of the third manipulator.
Mathematics 11 01872 g007
Figure 8. The error between the observer and the original system of the fouth manipulator.
Figure 8. The error between the observer and the original system of the fouth manipulator.
Mathematics 11 01872 g008
Table 1. The descriptions of the parameters.
Table 1. The descriptions of the parameters.
ParameterDescription ( i = 1 , 2 , 3 , 4 )
q i The position of manipulator i
q ˙ i The velocity of manipulator i
q ¨ i The acceleration of manipulator i
M i The inertia matrix of manipulator i
C i The vector of Coriolis and centrifugal force of manipulator i
G i The vector of Gravitational force of manipulator i
u i The control input of manipulator i
Table 2. Complexity of the calculation.
Table 2. Complexity of the calculation.
ParameterDescriptionTime
W ¯ i Observer gain0.436 s
W ̲ i Observer gain0.436 s
QObserver gain0.456 s
M i Weight matrix0.318 s
PWeight matrix0.318 s
Y ¯ i Observer gain0.624 s
Y ̲ i Observer gain0.624 s
L i Observer gain0.624 s
Table 3. The solution under different τ [24].
Table 3. The solution under different τ [24].
Value of τ Theorem 2Theorem 2 in [24]
−100-
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

Yin, Z.; Huang, J.; Dinh, T.N. Design of Distributed Interval Observers for Multiple Euler–Lagrange Systems. Mathematics 2023, 11, 1872. https://doi.org/10.3390/math11081872

AMA Style

Yin Z, Huang J, Dinh TN. Design of Distributed Interval Observers for Multiple Euler–Lagrange Systems. Mathematics. 2023; 11(8):1872. https://doi.org/10.3390/math11081872

Chicago/Turabian Style

Yin, Zhihang, Jun Huang, and Thach Ngoc Dinh. 2023. "Design of Distributed Interval Observers for Multiple Euler–Lagrange Systems" Mathematics 11, no. 8: 1872. https://doi.org/10.3390/math11081872

APA Style

Yin, Z., Huang, J., & Dinh, T. N. (2023). Design of Distributed Interval Observers for Multiple Euler–Lagrange Systems. Mathematics, 11(8), 1872. https://doi.org/10.3390/math11081872

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