Next Article in Journal
Riemann–Liouville Fractional Integral Inequalities for Generalized Pre-Invex Functions of Interval-Valued Settings Based upon Pseudo Order Relation
Next Article in Special Issue
Synchronization of Nonlinear Complex Spatiotemporal Networks Based on PIDEs with Multiple Time Delays: A P-sD Method
Previous Article in Journal
Three-Dimensional Synthesis of Manufacturing Tolerances Based on Analysis Using the Ascending Approach
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Consensus Control of Leaderless and Leader-Following Coupled PDE-ODEs Modeled Multi-Agent Systems

1
Faculty of Management and Economics, Kunming University of Science and Technology, Kunming 650500, China
2
Systems Engineering Research Institute, China State Shipbuilding Corporation Limited, Beijing 100094, China
3
School of Precision Instrument and Opto-electronics Engineering, Tianjin Univeristy, Tianjin 300072, China
4
School of Automation and Electrical Engineering, Linyi University, Linyi 276005, China
5
School of Information Science and Technology, Linyi University, Linyi 276005, China
*
Author to whom correspondence should be addressed.
All authors contributed equally to this work.
Mathematics 2022, 10(2), 201; https://doi.org/10.3390/math10020201
Submission received: 13 December 2021 / Revised: 7 January 2022 / Accepted: 7 January 2022 / Published: 10 January 2022
(This article belongs to the Special Issue Advanced Control Theory with Applications)

Abstract

:
This paper discusses consensus control of nonlinear coupled parabolic PDE-ODE-based multi-agent systems (PDE-ODEMASs). First, a consensus controller of leaderless PDE-ODEMASs is designed. Based on a Lyapunov-based approach, coupling strengths are obtained for leaderless PDE-ODEMASs to achieve leaderless consensus. Furthermore, a consensus controller in the leader-following PDE-ODEMAS is designed and the corresponding coupling strengths are obtained to ensure the leader-following consensus. Two examples show the effectiveness of the proposed methods.

1. Introduction

Consensus in multi-agent systems (MASs) is to achieve a common group objective when agents have different initial states [1,2,3,4]. It has received great attention in the past decade as a result from its wide applications in flocking of mobile robots [5], opinion dynamics in social networks [6], formation of unmanned vehicles [7,8,9], microgrid energy management [10], traffic flow [11], etc.
In a pioneering contribution, many important control methods were proposed for consensus of MASs, focusing on models based on ordinary differential equations [12,13,14,15,16,17,18,19,20]. Actually, there are many practical cases in nature and discipline fields with spatio-temporal characteristics, modeled by coupled partial differential equations (PDEs) [21,22,23,24,25]. Applied to overhead cranes [26], hormonal therapy [27], traffic flow [28], etc., another class of spatio-temporal models is based on coupled partial differential equations—ordinary differential equations (PDE-ODEs) [29,30,31]. Therefore, it is important to research consensus control of PDE-based coupled MASs (PDEMASs) or coupled PDE-ODE-based MASs (PDE-ODEMASs).
More recently, there have been many important results related to PDEMASs. Ref. [32] studied a distributed adaptive controller of uncertain leader-following parabolic PDEMASs; ref. [33] studied consensus control for parabolic and second-order hyperbolic PDEMASs; ref. [34] studied distributed P-type iterative learning for PDEMASs with time delay; refs. [35,36] studied iterative learning control for PDEMASs without and with time delay; ref. [37] studied boundary control of 3-D PDEMASs with arbitrarily large boundary input delay; refs. [38,39] studied consensus and input constraint consensus of nonlinear PDEMASs using boundary control. However, consensus control for PDE-ODEMASs has not been addressed yet, which is a new challenge.
Motivated by the above, this paper studies consensus control of nonlinear coupled parabolic PDE-ODEMASs with Neumann boundary conditions. First, dealing with the leaderless case, a consensus controller of leaderless PDE-ODEMASs is designed. The leaderless consensus error system is obtained and one Lyapunov functional candidate is given. Using Wirtinger’s inequality and matrix properties, coupling strengths are obtained for leaderless PDE-ODEMASs to achieve cluster consensus. Furthermore, dealing with the leader-following case, a consensus controller of leader-following PDE-ODEMASs is designed. The leader-following consensus error system is obtained and another Lyapunov functional candidate is given. The corresponding coupling strengths are obtained to ensure leader-following consensus.
The remainder of this paper is organized as follows. The problem formulation is given in Section 2. Section 3 presents a consensus control design of the leaderless PDE-ODEMAS and Section 4 gives that of the leader-following PDE-ODEMAS. An example to illustrate the effectiveness of the proposed method is presented in Section 5 and Section 6 offers some concluding remarks.
Notations: λ max ( · ) , λ 2 ( · ) stand for the maximum eigenvalue and smallest nonzero eigenvalue of ·, respectively. ⊗ is a Kronecker product of matrices. The identity matrix of n order is denoted by I n . | | · | | denotes the Euclidean norm for vectors in R n or the induced 2-norm for matrices in R m × n .

2. Problem Formulation

Consider a nonlinear PDE-ODEMAS as
x ˙ i ( t ) = f ( x i ( t ) ) + 0 1 w ( y i ( ξ , t ) ) d ξ + u i ( t ) , y i ( ξ , t ) t = α 2 y i ( ξ , t ) ξ 2 + p ( y i ( ξ , t ) ) + q ( x i ( t ) ) + U i ( ξ , t ) ,
such that
y i ( ξ , t ) ξ ξ = 0 = 0 , y i ( ξ , t ) ξ ξ = 1 = 0 , x i ( 0 ) = x i 0 , y i ( ξ , 0 ) = y i 0 ( ξ ) ,
where ( ξ , t ) [ 0 , 1 ] × [ 0 , ) , respectively, mean the spatial variable and time variable; x i ( t ) , y i ( ξ , t ) R n are the states; u i ( t ) , U i ( ξ , t ) R n are the control inputs; x i 0 , y i 0 ( ξ ) are bounded and y i 0 ( ξ ) is continuous; α is a positive scalar; i { 1 , 2 , , N } ; and f ( · ) , w ( · ) , p ( · ) , q ( · ) R n are sufficiently smooth nonlinear functions.
Define consensus error e i ( t ) = Δ x i ( t ) 1 N j = 1 N x j ( t ) and ε i ( ξ , t ) = Δ y i ( ξ , t ) 1 N j = 1 N y j ( ξ , t ) .
Definition 1.
For the leaderless PDE-ODEMAS (1), (2) with any initial conditions, if
lim t e i ( t ) 0 , lim t ε i ( ξ , t ) 0 ,
for any i { 1 , 2 , , N } , then the leaderless PDE-ODEMAS (1), (2) achieves consensus.
Lemma 1
([40]). Let κ be a differentiable function with κ ( 0 ) = 0 and κ ( 1 ) = 0 , then
0 1 κ T ( s ) κ ( s ) d s π 2 0 1 κ ˙ T ( s ) κ ˙ ( s ) d s .
Lemma 2
([41]). For an undirected connected graph with Laplacian matrix L, and x R n such that 1 N T x = 0 , then
λ 2 ( L ) x T x x T L x .
If Laplacian matrix L R N × N is symmetric, then 0 = λ 1 ( · ) < λ 2 ( · ) λ N ( · ) . The smallest nonzero eigenvalue of λ 2 ( · ) is known as the algebraic connectivity of graphs [41].
Assumption A1.
Assume f ( · ) , p ( · ) , q ( · ) , w ( · ) satisfy the Lipschitz condition, i.e., for any ν 1 and ν 2 R n , there exist scalars γ 1 , γ 2 , γ 3 , γ 4 > 0 such that
| f ( ν 1 ) f ( ν 2 ) | γ 1 | ν 1 ν 2 | , | p ( ν 1 ) p ( ν 2 ) | γ 2 | ν 1 ν 2 | , | q ( ν 1 ) q ( ν 2 ) | γ 3 | ν 1 ν 2 | , | w ( ν 1 ) w ( ν 2 ) | γ 4 | ν 1 ν 2 | .

3. Consensus Control of the Leaderless PDE-ODEMAS

To achieve consensus of the leaderless PDE-ODEMAS (1), the consensus controller is designed as:
u i ( t ) = d j = 1 N a i j ( x j ( t ) x i ( t ) ) , U i ( ξ , t ) = k j = 1 N b i j ( y j ( ξ , t ) y i ( ξ , t ) ) ,
where d and k are the coupling strengths to be determined, i { 1 , 2 , , N } . Assume that the topological structure A = ( a i j ) N × N is defined as: a i j = a j i > 0 ( i j ) if the agent i connects to j, otherwise a i j = 0 ( i j ) ; a i i = 0 . The topological structure B = ( b i j ) N × N is defined the same as A.
The consensus error system can be obtained from (1), (2), and (7) that
e ˙ i ( t ) = f ( x i ( t ) ) 1 N j = 1 N f ( x j ( t ) ) + 0 1 w ( y i ( ξ , t ) ) d ξ 1 N j = 1 N 0 1 w ( y j ( ξ , t ) ) d ξ + d j = 1 N a i j ( x j ( t ) x i ( t ) ) , ε i ( ξ , t ) t = α 2 ε i ( ξ , t ) ξ 2 + p ( y i ( ξ , t ) ) 1 N j = 1 N p ( y j ( ξ , t ) ) + q ( x i ( t ) ) 1 N j = 1 N q ( x j ( t ) ) + k j = 1 N b i j ( y j ( ξ , t ) y i ( ξ , t ) ) ,
such that
ε i ( ξ , t ) ξ ξ = 0 = 0 , ε i ( ξ , t ) ξ ξ = 1 = 0 , e i ( 0 ) = e i 0 ( ξ ) , ε i ( ξ , 0 ) = ε i 0 ( ξ ) ,
where e i 0 = Δ x i 0 1 N j = 1 N x j 0 and ε i 0 ( ξ ) = Δ y i 0 ( ξ ) 1 N j = 1 N y j 0 ( ξ ) .
Theorem 1.
Under Assumption 1, assume the graphs A and B are connected. Using the controller (7), the leaderless PDE-ODEMAS (1), (2) achieves consensus if
d > γ 1 + 1 2 γ 3 2 + 1 2 λ 2 ( L a ) , k > max { γ 2 + 1 2 γ 4 2 + 1 2 α π 2 λ 2 ( L b ) , 0 } .
Proof. 
Consider the following Lyapunov function as
V 1 ( t ) = 1 2 i = 1 N e i T ( t ) e i ( t ) + 1 2 i = 1 N 0 1 ε i T ( ξ , t ) ε i ( ξ , t ) d ξ .
We have
V 1 ˙ ( t ) = i = 1 N e i T ( t ) e ˙ i ( t ) + i = 1 N 0 1 ε i T ( ξ , t ) ε i ( ξ , t ) t d ξ = i = 1 N e i T ( t ) [ f ( x i ( t ) ) 1 N j = 1 N f ( x j ( t ) ) ] + i = 1 N e i T ( t ) [ 0 1 w ( y i ( ξ , t ) ) d ξ 1 N j = 1 N 0 1 w ( y j ( ξ , t ) ) d ξ ] + i = 1 N e i T ( t ) d j = 1 N a i j ( e j ( t ) e i ( t ) ) + i = 1 N 0 1 ε i T ( ξ , t ) Θ 2 ε i ( ξ , t ) ξ 2 d ξ + i = 1 N 0 1 ε i T ( ξ , t ) ( p ( y i ( ξ , t ) ) 1 N j = 1 N p ( y j ( ξ , t ) ) ) d ξ + i = 1 N 0 1 ε i T ( ξ , t ) ( q ( x i ( t ) ) 1 N j = 1 N q ( x j ( t ) ) ) d ξ + i = 1 N 0 1 ε i T ( ξ , t ) k j = 1 N b i j ( ε j ( ξ , t ) ε i ( ξ , t ) ) d ξ .
According to the matrix property,
i = 1 N e i T ( t ) d j = 1 N a i j ( e j ( t ) e i ( t ) ) = d e T ( t ) ( L a I n ) e ( t ) d λ 2 ( L a ) e T ( t ) e ( t ) ,
and
i = 1 N 0 1 ε i T ( ξ , t ) k j = 1 N b i j ( ε i ( ξ , t ) ε j ( ξ , t ) ) d ξ = k 0 1 ε T ( ξ , t ) ( L b I n ) ε ( ξ , t ) d ξ k λ 2 ( L b ) 0 1 ε T ( ξ , t ) ε ( ξ , t ) d ξ ,
where λ 2 ( · ) denotes the smallest nonzero eigenvalue of ·, L a , i j = a i j when i j , L a , i i = j = 1 N a i j , L b , i j = b i j when i j , L b , i i = j = 1 N b i j . Therefore, L a , L b are Laplacian matrices. Using Lemma 1, for α > 0 ,
0 1 i = 1 N ε i T ( ξ , t ) α ε i , ξ ξ ( ξ , t ) d ξ = α 0 1 ε ξ T ( ξ , t ) ε ξ ( ξ , t ) d ξ α π 2 0 1 ε T ( ξ , t ) ε ( ξ , t ) d ξ .
Using Assumption 1, owing to i = 1 N e i T ( t ) ( f ( 1 N j = 1 N x j ( t ) ) 1 N j = 1 N f ( x j ( t ) ) ) = 0 and i = 1 N ε i T ( ξ , t ) ( f ( 1 N j = 1 N p ( y i ( ξ , t ) ) ) 1 N j = 1 N p ( y i ( ξ , t ) ) = 0 , we have
i = 1 N e i T ( t ) ( f ( x i ( t ) ) 1 N j = 1 N f ( x j ( t ) ) ) γ 1 i = 1 N e i 2 ( t ) ,
and
i = 1 N 0 1 ε i T ( ξ , t ) ( p ( y i ( ξ , t ) ) 1 N j = 1 N p ( y j ( ξ , t ) ) ) d ξ γ 2 0 1 ε i 2 ( ξ , t ) d ξ .
In the same way,
i = 1 N 0 1 ε i T ( ξ , t ) ( q ( x i ( t ) ) 1 N j = 1 N q ( x j ( t ) ) ) d ξ = i = 1 N 0 1 ε i T ( ξ , t ) ( q ( x i ( t ) ) q ( 1 N j = 1 N x j ( t ) ) ) d ξ 1 2 i = 1 N 0 1 ε i T ( ξ , t ) ε i ( ξ , t ) d ξ + 1 2 i = 1 N 0 1 ( q ( x i ( t ) ) q ( 1 N j = 1 N x j ( t ) ) ) 2 d ξ 1 2 i = 1 N 0 1 ε i T ( ξ , t ) ε i ( ξ , t ) d ξ + 1 2 γ 3 2 i = 1 N e i 2 ( t ) ,
and
i = 1 N e i T ( t ) 0 1 ( w ( y i ( ξ , t ) ) 1 N j = 1 N w ( y j ( ξ , t ) ) ) d ξ = i = 1 N e i T ( t ) 0 1 ( w ( y i ( ξ , t ) ) w ( 1 N j = 1 N y j ( ξ , t ) ) ) d ξ 1 2 i = 1 N [ e i T ( t ) e i ( t ) d ξ + 0 1 ( w ( y i ( ξ , t ) ) w ( 1 N j = 1 N y j ( ξ , t ) ) ) 2 d ξ ] 1 2 i = 1 N e i T ( t ) e i ( t ) + 1 2 i = 1 N γ 4 2 0 1 ε i 2 ( ξ , t ) d ξ .
Substituting (13)–(19) into (12),
V 1 ˙ ( t ) ρ 1 e T ( t ) e ( t ) ρ 2 0 1 ε 2 ( ξ , t ) d ξ 2 ρ V ( t ) ,
where e = Δ [ e 1 T , e 2 T , , e N T ] T , ε = Δ [ ε 1 T , ε 2 T , , ε N T ] T , ρ 1 = Δ γ 1 1 2 γ 3 2 1 2 + d λ 2 ( L a ) , ρ 2 = Δ γ 2 1 2 γ 4 2 1 2 + α π 2 + k λ 2 ( L b ) , and ρ = Δ min { ρ 1 , ρ 2 } .
Taking d and k as (10) yields,
ρ 1 > 0 , ρ 2 > 0 .
It follows from (20) and (21) that V 1 ( t ) V 1 ( 0 ) exp { 2 ρ t } , which implies e i ( t ) 0 and ε i ( ξ , t ) 0 as t This completes the proof. □

4. Consensus Control of the Leader-Following PDE-ODEMAS

The leader agent is supposed to be
x ˙ 0 ( t ) = f ( x 0 ( t ) ) + 0 1 w ( y 0 ( ξ , t ) ) d ξ , y 0 ( ξ , t ) t = α 2 y 0 ( ξ , t ) ξ 2 + p ( y 0 ( ξ , t ) ) + q ( x 0 ( t ) ) ,
such that
y 0 ( ξ , t ) ξ ξ = 0 = 0 , y 0 ( ξ , t ) ξ ξ = 1 = 0 , x 0 ( 0 ) = x 0 0 , y 0 ( ξ , 0 ) = y 0 0 ( ξ ) ,
where x 0 0 , y 0 0 ( ξ ) are bounded and y 0 0 ( ξ ) is continuous.
The leader-following consensus controller is designed as:
u i ( t ) = d [ j = 1 N a i j ( x j ( t ) x i ( t ) ) + δ i ( x 0 ( t ) x i ( t ) ) ] , U i ( ξ , t ) = k [ j = 1 N b i j ( y j ( ξ , t ) y i ( ξ , t ) ) + ρ i ( y 0 ( ξ , t ) y i ( ξ , t ) ) ] ,
where δ i > 0 if x i can obtain the information of x 0 ; otherwise, δ i = 0 ; and ρ i > 0 if y i can obtain the information of y 0 ; otherwise, ρ i = 0 .
Let e ˜ i ( t ) = x i ( t ) x 0 ( t ) and ε ˜ i ( ξ , t ) = y i ( ξ , t ) y 0 ( ξ , t ) . The leader-following consensus error system is obtained as
e ˜ ˙ i ( t ) = f ( x i ( t ) ) f ( x 0 ( t ) ) + 0 1 w ( y i ( ξ , t ) ) d ξ 0 1 w ( y 0 ( ξ , t ) ) d ξ d j = 1 N g i j e ˜ j ( t ) , ε ˜ i ( ξ , t ) t = α 2 ε ˜ i ( ξ , t ) ξ 2 + p ( y i ( ξ , t ) ) p ( y 0 ( ξ , t ) ) + q ( x i ( t ) ) q ( x 0 ( t ) ) k j = 1 N h i j ε ˜ j ( ξ , t ) ,
such that
ε ˜ i ( ξ , t ) ξ ξ = 0 = 0 , ε ˜ i ( ξ , t ) ξ ξ = 1 = 0 , e ˜ i ( 0 ) = e ˜ i 0 ( ξ ) , ε ˜ i ( ξ , 0 ) = ε ˜ i 0 ( ξ ) ,
where G = [ g i j ] = L A + d i a g { δ i } , H = [ h i j ] = L B + d i a g { ρ i } , e ˜ i 0 = Δ x i 0 x 0 0 and ε ˜ i 0 ( ξ ) = Δ y i 0 ( ξ ) y 0 0 ( ξ ) .
Definition 2.
For the leader-following PDE-ODEMAS (22), (23) with any initial conditions, if
lim t e ˜ i ( t ) 0 , lim t | | ε ˜ i ( ξ , t ) | | 0 ,
for any i { 1 , 2 , , N } , then the leader-following PDE-ODEMAS (22), (23) achieves consensus.
Theorem 2.
Under Assumption 1, assume the graphs A and B are connected. Using the controller (26), the leader-following PDE-ODEMAS (1) achieves consensus if
d > γ 1 + 1 2 γ 3 2 + 1 2 λ min ( G ) , k > max { γ 2 + 1 2 γ 4 2 + 1 2 α π 2 λ min ( H ) , 0 } .
Proof. 
Consider the Lyapunov functional candidate as
V 2 ( t ) = 1 2 i = 1 N e ˜ i T ( t ) e ˜ i ( t ) + 1 2 i = 1 N 0 1 ε ˜ i T ( ξ , t ) ε ˜ i ( ξ , t ) d ξ .
One has
V 2 ˙ ( t ) = i = 1 N e ˜ i T ( t ) e ˜ ˙ i ( t ) + i = 1 N 0 1 ε ˜ i T ( ξ , t ) ε ˜ i ( ξ , t ) t d ξ = i = 1 N e ˜ i T ( t ) ( f ( x i ( t ) ) f ( x 0 ( t ) ) ) + i = 1 N e ˜ i T ( t ) [ 0 1 w ( y i ( ξ , t ) ) d ξ 0 1 w ( y 0 ( ξ , t ) ) d ξ ] i = 1 N e ˜ i T ( t ) d j = 1 N g i j e ˜ j ( t ) + i = 1 N 0 1 ε ˜ i T ( ξ , t ) α 2 ε ˜ i ( ξ , t ) ξ 2 d ξ + i = 1 N 0 1 ε ˜ i T ( ξ , t ) ( p ( y i ( ξ , t ) ) p ( y 0 ( ξ , t ) ) ) d ξ + i = 1 N 0 1 ε ˜ i T ( ξ , t ) ( q ( x i ( t ) ) q ( x 0 ( t ) ) ) d ξ i = 1 N 0 1 ε ˜ i T ( ξ , t ) k j = 1 N h i j ε ˜ j ( ξ , t ) d ξ .
Since G and H are symmetric positive definite matrices,
i = 1 N e ˜ i T ( t ) d j = 1 N g i j ( e ˜ j ( t ) ) = d e ˜ T ( t ) ( G I n ) e ˜ ( t ) d λ min ( G ) e ˜ T ( t ) e ˜ ( t ) ,
and
i = 1 N 0 1 ε ˜ i T ( ξ , t ) k j = 1 N h i j ε ˜ j ( ξ , t ) d ξ = k 0 1 ε ˜ T ( ξ , t ) ( H I n ) ε ˜ ( ξ , t ) d ξ k λ min ( H ) 0 1 ε ˜ T ( ξ , t ) ε ˜ ( ξ , t ) d ξ ,
where e ˜ = Δ [ e ˜ 1 T , e ˜ 2 T , , e ˜ N T ] T , ε ˜ = Δ [ ε ˜ 1 T , ε ˜ 2 T , , ε ˜ N T ] T , λ min ( · ) denotes the smallest nonzero eigenvalue and G, H are symmetric positive definite matrices.
Considering (13)–(19), and substituting (31)–(32) into (30),
V 2 ˙ ( t ) ( γ 1 + 1 2 γ 3 2 + 1 2 d λ min ( G ) ) e ˜ T ( t ) e ˜ ( t ) + ( γ 2 + 1 2 γ 4 2 + 1 2 α π 2 k λ min ( H ) ) 0 1 ε ˜ T ( ξ , t ) ε ˜ ( ξ , t ) d ξ .
In a similar way to the analysis in Theorem 1, the proof can be completed. □
Remark 1.
Many papers have investigated stabilization control methods for PDE-ODE systems [29,30,31,42], while this paper investigates consensus control for PDE-ODE-based MASs, considering control based on coupling.
Remark 2.
Many significant results were obtained for consensus control modeled by PDEMASs [32,33,34,35,36,37,38,39]. Different from PDEMASs, this paper investigates consensus control methods for PDE-ODEMASs, as well as considering leaderless and leader-following models.

5. Numerical Simulation

Example 1.
Consider the leaderless PDE-ODEMAS (1) and (2) with coefficients as
α = 0.8 , f ( · ) = w ( · ) = p ( · ) = q ( · ) = tanh ( · ) , a i j = b i j = 1 , and i j , for i , j = 1 , 2 , 3 , 4 , n = 2 ,
and with random initial conditions.
It is obvious that f ( · ) , p ( · ) , q ( · ) , and w ( · ) satisfy the Lipschitz condition with γ 1 = γ 2 = γ 3 = γ 4 = 1 .
With Theorem 1, according to (10), d > 0.50 and k > 0 are obtained. Therefore, we take d = 0.51 and k = 0.01 . It can be seen in Figure 1 and Figure 2 that the leaderless PDE-ODEMAS achieves consensus with control gains d = 0.51 and k = 0.01 .
From another point of view, d = 0.49 and k = 0 do not satisfy (10). It can be seen in Figure 3 and Figure 4 that the leaderless PDE-ODEMAS cannot achieve consensus with control gains d = 0.49 and k = 0 .
Example 2.
Consider a nonlinear leader-following PDE-ODEMAS composed of 1 leader agent (22) and (23) and 4 following agents (1) and (2) with coefficients the same as Example 1. In the same way, γ 1 = γ 2 = γ 3 = γ 4 = 1 are obtained. Choose δ i = ρ i = 1 . With Theorem 2, according to (28), d > 2.0 and k > 0 are obtained. Therefore, we take d = 2.1 and k = 0.1 . It can be seen in Figure 5 and Figure 6 that the leader-following PDE-ODEMAS achieves consensus.
From another point of view, d = 1.9 and k = 0 do not satisfy (28). It can be seen in Figure 7 and Figure 8 that the leader-following PDE-ODEMAS cannot achieve consensus with control gains d = 0.49 and k = 0 .

6. Conclusions

This paper has studied consensus control of the PDE-ODEMASs. First, a consensus controller of the leaderless PDE-ODEMASs was designed. We have shown that the cluster consensus behavior can be reached for the given coupling strengths for the leaderless PDE-ODEMASs. Then, a consensus controller in the leader-following PDE-ODEMASs was designed. Leader-following consensus behavior can be arrived at for the given coupling strengths for the leader-following PDE-ODEMASs. In numerical simulations, it shows the obtained gains according to the proposed methods can ensure consensus of both leaderless and leader-following PDE-ODEMASs. On the contrary, the control with gains a little bit less than those according to the proposed methods cannot achieve consensus. There are often a great number of agents in the real world and, in future, pinning consensus, only controlling a few agents of the PDE-ODEMASs, will be studied, as well as time delays.

Author Contributions

Methodology, A.Z.; software, K.Y. and Y.J.; writing—original draft preparation, X.N.; writing—review and editing, C.Y. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Major Science and Technology Special Project of Yunnan Province under grant number 202102AD080002, by the Natural Science Foundation of Shandong Province under grant number ZR2019YQ28, the Development Plan of Youth Innovation Team of Universities in Shandong Province under grant number 2019KJN007.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Mo, L.; Yuan, X.; Yu, Y. Neuro-adaptive leaderless consensus of fractional-order multi-agent systems. Neurocomputing 2019, 339, 17–25. [Google Scholar] [CrossRef]
  2. Benediktsson, J.A.; Swain, P.H. Consensus theoretic classification methods. IEEE Trans. Syst. Man Cybern. 1992, 22, 688–704. [Google Scholar] [CrossRef]
  3. Yang, Y.; Ji, Z.; Tian, L.; Ma, H.; Qi, Q. Bipartite consensus of edge dynamics on coopetition multi-agent systems. Sci. China Inf. Sci. 2019, 62, 229201. [Google Scholar]
  4. Tian, B.; Lu, H.; Zuo, Z.; Yang, W. Fixed-time leader–follower output feedback consensus for second-order multiagent systems. IEEE Trans. Cybern. 2018, 49, 1545–1550. [Google Scholar] [CrossRef]
  5. Ning, B.; Han, Q.L. Prescribed finite-time consensus tracking for multiagent systems with nonholonomic chained-form dynamics. IEEE Trans. Autom. Control 2018, 64, 1686–1693. [Google Scholar] [CrossRef]
  6. Proskurnikov, A.V.; Matveev, A.S.; Cao, M. Opinion dynamics in social networks with hostile camps: Consensus vs. polarization. IEEE Trans. Autom. Control 2015, 61, 1524–1536. [Google Scholar] [CrossRef] [Green Version]
  7. Du, H.; Zhu, W.; Wen, G.; Duan, Z.; Lu, J. Distributed formation control of multiple quadrotor aircraft based on nonsmooth consensus algorithms. IEEE Trans. Cybern. 2017, 49, 342–353. [Google Scholar] [CrossRef]
  8. Cheng, Y.; Jia, R.; Du, H.; Wen, G.; Zhu, W. Robust finite-time consensus formation control for multiple nonholonomic wheeled mobile robots via output feedback. Int. J. Robust Nonlinear Control 2018, 28, 2082–2096. [Google Scholar] [CrossRef]
  9. Shi, S.; Xu, S.; Feng, H. Robust fixed-time consensus tracking control of high-order multiple nonholonomic systems. IEEE Trans. Syst. Man Cybern. Syst. 2019, 51, 1869–1880. [Google Scholar] [CrossRef]
  10. Zheng, Y.; Song, Y.; Hill, D.J.; Zhang, Y. Multiagent system based microgrid energy management via asynchronous consensus admm. IEEE Trans. Energy Convers. 2018, 33, 886–888. [Google Scholar] [CrossRef]
  11. Kušić, K.; Ivanjko, E.; Vrbanić, F.; Greguric, M.; Dusparic, I. Spatial-Temporal Traffic Flow Control on Motorways Using Distributed Multi-Agent Reinforcement Learning. Mathematics 2021, 9, 3081. [Google Scholar] [CrossRef]
  12. Nowzari, C.; Garcia, E.; Cortés, J. Event-triggered communication and control of networked systems for multi-agent consensus. Automatica 2019, 105, 1–27. [Google Scholar] [CrossRef] [Green Version]
  13. Zong, X.; Li, T.; Zhang, J.F. Consensus conditions of continuous-time multi-agent systems with time-delays and measurement noises. Automatica 2019, 99, 412–419. [Google Scholar] [CrossRef] [Green Version]
  14. Tan, X.; Cao, J.; Rutkowski, L.; Lu, G. Distributed dynamic self-triggered impulsive control for consensus networks: The case of impulse gain with normal distribution. IEEE Trans. Cybern. 2021, 51, 624–634. [Google Scholar] [CrossRef] [PubMed]
  15. Liu, M.; Dong, S.; Chen, G.; Liu, M.; Wu, Z. Cooperative neural-adaptive fault-tolerant output regulation for heterogeneous nonlinear uncertain multiagent systems with disturbance. Sci. China Inf. Sci. 2021, 64, 172212. [Google Scholar]
  16. Li, X.; Tang, Y.; Karimi, H.R. Consensus of multi-agent systems via fully distributed event-triggered control. Automatica 2020, 116, 108898. [Google Scholar] [CrossRef]
  17. Li, X.; Yu, Z.; Li, Z.; Wu, N. Group consensus via pinning control for a class of heterogeneous multi-agent systems with input constraints. Inf. Sci. 2021, 542, 247–262. [Google Scholar] [CrossRef]
  18. De la Sen, M.; Alonso-Quesada, S. On finite-time consensus objectives in time-varying interconnected discrete linear dynamic systems under internal and external delays. Adv. Mech. Eng. 2018, 10, 1687814018784840. [Google Scholar] [CrossRef]
  19. Olfati-Saber, R.; Fax, J.A.; Murray, R.M. Consensus and cooperation in networked multi-agent systems. Proc. IEEE 2007, 95, 215–233. [Google Scholar] [CrossRef] [Green Version]
  20. Aman, B.; Ciobanu, G. Knowledge dynamics and behavioural equivalences in multi-agent systems. Mathematics 2021, 9, 2869. [Google Scholar] [CrossRef]
  21. Wang, J.W.; Wang, J.M. Mixed H2/H sampled-data output feedback control design for a semi-linear parabolic PDE in the sense of spatial L norm. Automatica 2019, 103, 282–293. [Google Scholar] [CrossRef]
  22. Chen, P.; Villa, U.; Ghattas, O. Taylor approximation and variance reduction for pde-constrained optimal control under uncertainty. J. Comput. Phys. 2019, 385, 163–186. [Google Scholar] [CrossRef] [Green Version]
  23. Chen, S.; Vazquez, R.; Krstic, M. Folding backstepping approach to parabolic PDE bilateral boundary control. IFAC-PapersOnLine 2019, 52, 76–81. [Google Scholar] [CrossRef]
  24. Buyukkocak, A.T.; Aksaray, D.; Yazcoglu, Y. Planning of heterogeneous multi-agent systems under signal temporal logic specifications with integral predicates. IEEE Robot. Autom. Lett. 2021, 6, 1375–1382. [Google Scholar] [CrossRef]
  25. Wang, G.; Huang, Y.; Wang, X. Consensus of semi-markov multi-agent systems with stochastically unmatched topologies. IET Control Theory Appl. 2021, 15, 1003–1017. [Google Scholar] [CrossRef]
  26. d’Andréa-Novel, B.; Coron, J.M. Exponential stabilization of an overhead crane with flexible cable via a back-stepping approach. Automatica 2000, 36, 587–593. [Google Scholar] [CrossRef]
  27. Hiruko, K.; Okabe, S. Controllability of hybrid PDE-ODE systems with structural instability and applications to mathematical models on intermittent hormonal therapy for prostate cancer. Math. Methods Appl. Sci. 2018, 41, 8229–8247. [Google Scholar] [CrossRef]
  28. Lattanzio, C.; Maurizi, A.; Piccoli, B. Moving bottlenecks in car traffic flow: A PDE-ODE coupled model. SIAM J. Math. Anal. 2011, 43, 50–67. [Google Scholar] [CrossRef]
  29. Wang, J.W.; Wu, H.N. Exponentially stabilizing fuzzy controller design for a nonlinear ODE-beam cascaded system and its application to flexible air-breathing hypersonic vehicle. Fuzzy Sets Syst. 2020, 385, 127–147. [Google Scholar] [CrossRef]
  30. Meglio, F.D.; Argomedo, F.B.; Hu, L.; Krstic, M. Stabilization of coupled linear heterodirectional hyperbolic PDE-ODE systems. Automatica 2018, 87, 281–289. [Google Scholar]
  31. Zhao, Y.; Gao, H.; Qiu, J. Fuzzy observer based control for nonlinear coupled hyperbolic PDE-ODE systems. IEEE Trans. Fuzzy Syst. 2019, 27, 1332–1346. [Google Scholar] [CrossRef]
  32. He, P. Consensus of uncertain parabolic PDE agents via adaptive unit-vector control scheme. IET Control Theory Appl. 2018, 12, 2488–2494. [Google Scholar] [CrossRef]
  33. Fu, Q.; Du, L.; Xu, G.; Wu, J.; Yu, P. Consensus control for multi-agent systems with distributed parameter models. Neurocomputing 2018, 25, 58–64. [Google Scholar] [CrossRef]
  34. Dai, X.; Wang, C.; Tian, S.; Huang, Q. Consensus control via iterative learning for distributed parameter models multi-agent systems with time-delay. J. Frankl. Inst. 2019, 356, 5240–5259. [Google Scholar] [CrossRef]
  35. Fu, Q.; Du, L.; Xu, G.; Wu, J. Consensus control for multi-agent systems with distributed parameter models via iterative learning algorithm. J. Frankl. Inst. 2018, 355, 4453–4472. [Google Scholar] [CrossRef]
  36. Lan, Y.-H.; Wu, B.; Shiy, Y.-X.; Luo, Y.-P. Iterative learning based consensus control for distributed parameter multi-agent systems with time-delay. Neurocomputing 2019, 357, 77–85. [Google Scholar] [CrossRef]
  37. Qi, J.; Wang, S.; Fang, J.-A.; Diagne, M. Control of multi-agent systems with input delay via PDE-based method. Automatica 2019, 106, 91–100. [Google Scholar] [CrossRef]
  38. Yang, C.; He, H.; Huang, T.; Zhang, A.; Qiu, J.; Cao, J.; Li, X. Consensus for non-linear multi-agent systems modelled by PDEs based on spatial boundary communication. IET Control Theory Appl. 2017, 11, 3196–3200. [Google Scholar] [CrossRef]
  39. Yang, C.; Huang, T.; Zhang, A.; Qiu, J.; Cao, J.; Alsaadi, F.E. Output consensus of multiagent systems based on PDEs with input constraint: A boundary control approach. IEEE Trans. Syst. Man Cybern. Syst. 2021, 51, 370–377. [Google Scholar] [CrossRef]
  40. Seuret, A.; Gouaisbaut, F. Jensen’s and Wirtinger’s inequalities for time-delay systems. IFAC Proc. Vol. 2013, 46, 343–348. [Google Scholar] [CrossRef] [Green Version]
  41. Pilloni, A.; Pisano, A.; Orlov, Y.; Usai, E. Consensus-based control for a network of diffusion PDEs with boundary local interaction. IEEE Trans. Autom. Control 2015, 61, 2708–2713. [Google Scholar] [CrossRef] [Green Version]
  42. Wang, J.W.; Krstic, M. Output-feedback boundary control of a heat PDE sandwiched between two ODEs. IEEE TRansactions Autom. Control 2019, 64, 4653–4660. [Google Scholar] [CrossRef]
Figure 1. e i ( t ) withthe control gains d = 0.51 and k = 0.01 in Example 1.
Figure 1. e i ( t ) withthe control gains d = 0.51 and k = 0.01 in Example 1.
Mathematics 10 00201 g001
Figure 2. ε i ( ξ , t ) with the control gains d = 0.51 and k = 0.01 in Example 1.
Figure 2. ε i ( ξ , t ) with the control gains d = 0.51 and k = 0.01 in Example 1.
Mathematics 10 00201 g002
Figure 3. e i ( t ) with the control gains d = 0.49 and k = 0 in Example 1.
Figure 3. e i ( t ) with the control gains d = 0.49 and k = 0 in Example 1.
Mathematics 10 00201 g003
Figure 4. ε i ( ξ , t ) with the control gains d = 0.49 and k = 0 in Example 1.
Figure 4. ε i ( ξ , t ) with the control gains d = 0.49 and k = 0 in Example 1.
Mathematics 10 00201 g004
Figure 5. e ˜ i ( t ) with the control gains d = 2.1 and k = 0.1 in Example 2.
Figure 5. e ˜ i ( t ) with the control gains d = 2.1 and k = 0.1 in Example 2.
Mathematics 10 00201 g005
Figure 6. ε ˜ i ( ξ , t ) with the control gains d = 2.1 and k = 0.1 in Example 2.
Figure 6. ε ˜ i ( ξ , t ) with the control gains d = 2.1 and k = 0.1 in Example 2.
Mathematics 10 00201 g006
Figure 7. e ˜ i ( t ) with the control gains d = 1.9 and k = 0 in Example 2.
Figure 7. e ˜ i ( t ) with the control gains d = 1.9 and k = 0 in Example 2.
Mathematics 10 00201 g007
Figure 8. ε ˜ i ( ξ , t ) with control gains d = 1.9 and k = 0 in Example 2.
Figure 8. ε ˜ i ( ξ , t ) with control gains d = 1.9 and k = 0 in Example 2.
Mathematics 10 00201 g008
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Ni, X.; Yi, K.; Jiang, Y.; Zhang, A.; Yang, C. Consensus Control of Leaderless and Leader-Following Coupled PDE-ODEs Modeled Multi-Agent Systems. Mathematics 2022, 10, 201. https://doi.org/10.3390/math10020201

AMA Style

Ni X, Yi K, Jiang Y, Zhang A, Yang C. Consensus Control of Leaderless and Leader-Following Coupled PDE-ODEs Modeled Multi-Agent Systems. Mathematics. 2022; 10(2):201. https://doi.org/10.3390/math10020201

Chicago/Turabian Style

Ni, Xu, Kejia Yi, Yiming Jiang, Ancai Zhang, and Chengdong Yang. 2022. "Consensus Control of Leaderless and Leader-Following Coupled PDE-ODEs Modeled Multi-Agent Systems" Mathematics 10, no. 2: 201. https://doi.org/10.3390/math10020201

APA Style

Ni, X., Yi, K., Jiang, Y., Zhang, A., & Yang, C. (2022). Consensus Control of Leaderless and Leader-Following Coupled PDE-ODEs Modeled Multi-Agent Systems. Mathematics, 10(2), 201. https://doi.org/10.3390/math10020201

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