Next Article in Journal
Entropy and Cross-Level Orderliness in Light of the Interconnection between the Neural System and Consciousness
Previous Article in Journal
Galilean Bulk-Surface Electrothermodynamics and Applications to Electrochemistry
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Flocking Behaviors under Hierarchical Leadership of Thermodynamic Cucker–Smale Particles with Multiplicative White Noise and Perturbation

School of Science, Jiangnan University, Wuxi 214122, China
*
Author to whom correspondence should be addressed.
Entropy 2023, 25(3), 417; https://doi.org/10.3390/e25030417
Submission received: 20 December 2022 / Revised: 16 February 2023 / Accepted: 22 February 2023 / Published: 25 February 2023
(This article belongs to the Section Complexity)

Abstract

:
The thermodynamic Cucker–Smale model (TCS model) describes dynamic consistency caused by different temperatures between multi-agent particles. This paper studies the flocking behaviors of the TCS model with multiplicative white noise under hierarchical leadership. First, we introduce the corresponding model of two particles. Then, by using mathematical induction and considering the properties of differential functions, it is proved that, under certain conditions, the group can achieve flocking. Finally, we verify the conclusion through numerical simulation results. Similarly, this paper studies the above model with perturbation functions.

1. Introduction

Classical flocking dynamics in nature include the coordinated flight of birds, the vortices of fish, the collective migration of ant colonies, and the growth and self-organizing activation of cells, etc. [1,2]. Rich and highly coordinated flocking behaviors emerge in systems composed of interconnected and constantly moving individuals. The main purpose of flocking research is to reveal dynamic behaviors of complex systems and guide engineering applications such as UAV flight and robot formation.
Flocking describes a phenomenon in which self-driven particles are connected by simple rules and organized from a disordered state to ordered motion. Vicsek [3] described the formation mechanism of flocking behavior by means of numerical experiments. Jadbabaie [4] strictly proved the correctness of the above numerical experiments based on certain assumptions from the view point of mathematics. Since then, many mathematical models have emerged to study the consistency and flocking behavior of multi-agent systems [5,6,7]. In 2007, Cucker and Smale [8] proposed the Cucker–Smale model (CS model) on the basis of the Vicsek model. The dynamic equation of the i-th particle is as follows
d x i = v i d t d v i = 1 N 1 k N ϕ i k v k v i d t
where ϕ i k = 1 / 1 + x i t x k t 2 β is the communication weight. When β 0.5 , an unconditional flocking of the CS model is achieved. In this model, there is no constraint that velocities must be the same. Furthermore, the communication weight is related to the absolute distance between the i-th particle and its neighbor. It is consistent with the actual situation. Many scholars have carried out research on the CS model [9,10,11,12].
Shen [13] studied the CS system with asymmetric interaction structure, which is the CS system under hierarchy. Each particle is only affected by the leadership set. When β 0.5 , the continuous system can achieve unconditional cluster motion.
Ha [14] presented a thermodynamically consistent particle (TCP) model based on the theory of multi-temperature mixing of fluids in the case of spatially homogeneous processes. The proposed thermodynamic model includes the flocking model of the CS type as its isothermal approximation. Then, Ha [15] proposed a new type of CS model, called a thermodynamic Cucker–Smale model (TCS model). It describes a phenomenon caused by different internal temperature variations between particles in the gas mixture system. If the initial temperature is homogeneous ( θ i 0 = 1 ), the system is reduced to the CS model. The TCS system is derived by the entropy theory on the basis of the traditional dynamic system, which is a fusion of thermodynamics and complex networks. The TCS model has a noise term not only in the velocity differential equation but also in the temperature equation. The estimation of this asymmetric network has much broader real-world applications. Many scholars have conducted in-depth research on the TCS system [16,17,18].
Most modeling of flocking systems only considers the dynamics of the same particles. In real scenarios, however, we need to study the flocking of different particles. Firstly, our TCS model can better simulate the temperature variation of the particles in the system in a more realistic way. The TCS model describes the temperature variation of the particles and explores the internal energy, while the traditional CS model only considers the mechanical motion of the particles. Secondly, we study the TCS system with perturbations to describe the flocking behavior of systems composed of different particles. The active particles discussed in our system are not identical and their motion has some degrees of freedom. Moreover, the establishment of leaders is a common tool in formation control, so the TCS model is studied under hierarchy to simulate the situation. Finally, the inclusion of white noise can better model the effect of environmental factors on the system. Based on this, this paper investigates the flocking behavior of the TCS model with multiplicative white noise under a hierarchical leader. The particles considered in the system are not identical and perturbation terms are introduced into the velocity variation of the particles, allowing a degree of flexibility for each particle. It is shown that the system can satisfy flocking under certain conditions. This conclusion is verified by numerical simulation results.

2. System Descriptions and Main Results

Definition 1
([13]). A group 1 , , N is said to be under a hierarchical leadership if, for all x R d , the adjacency matrix A x = a i j x satisfies (1) a i j 0 j < i ; (2) for all i > 1 , the set L i = j a i j > 0 . L i is the leading set of the i-th particle.
Our model is described as follows
d x i = v i d t d v i = λ k L i ϕ i k v k θ k v i θ i d t + σ i k L i ϕ i k v k v i d W i t d θ i = μ k L i ζ i k 1 θ i 1 θ k d t
where λ , μ > 0 and σ i R are coupling strengths and noise intensity coefficient W i t is one-dimensional Brownian motion. We consider the white Gauss noises [19,20] which are independently identically distributed.
E d W i t = 0 , V d W i t d W j t * = δ i j δ t t *
where E · , V · are the expectation and variance of random variables, respectively. Furthermore, ϕ i k , ζ i k are the inter-individual connection weight functions [21].
ϕ i k = 1 / 1 + x i t x k t 2 β β 0.5 ζ i k = 1 / 1 + x i t x k t 2 β β 0.5
Furthermore, we study System (2) with disturbance functions of time f i t , t 0 . The TCS model is turned into
d x i = v i d t d v i = λ k L i ϕ i k v k θ k v i θ i d t + f i d t + σ i k L i ϕ i k v k v i d W i t d θ i = μ k L i ζ i k 1 θ i 1 θ k d t
Definition 2
([14]). A group is said to be flocking if, for all x , v R d , θ R satisfy (1) sup E x i x k < (2) lim t E v i v k = 0 (3) lim t E θ i θ k = 0 .
The flocking behaviors of systems are discussed under the above definition. The main results are as follows. For System (2), we have
Theorem 1.
We suppose that 1 , 2 , , N is a hierarchical group. Particle 1 is the global leader and moves at a constant temperature. For t , if β < 1 / 2 , the temperatures of System (2) have asymptotic consistency.
Theorem 2.
We suppose that 1 , 2 , , N is a hierarchical group. Particle 1 is the global leader and moves at a constant speed. If, for t , β < 1 / 2 , σ < 2 λ θ M 0 1 , σ : = max σ i i = 1 , 2 , , N , System (2) can achieve flocking.
For System (3), we have
Theorem 3.
We suppose that 1 , 2 , , N is a hierarchical group. System (3) satisfies 0   f i t d t   < and E f i f j q e p t . Particle 1 is the global leader and the change in velocity only depends on f 1 . If, for t , β < 1 / 2 , σ < 2 λ θ M 0 1 , σ : = max σ i i = 1 , 2 , , N , System (3) can achieve flocking.

3. Result Proof of System (2)

3.1. Proof of Theorem 1

Lemma 1.
Let x i , v i , θ i i = 1 N be the solution of the TCS system. Temperatures have the minimum value θ i t θ min , i = 1 , 2 , , N .
Proof. 
ε 0 , θ min is given. We defined a set
S : = T > 0 θ i t > θ min ε , t 0 , T , i = 1 , , N
From the continuity of θ i and the definition of θ min , it follows that S and then sup S = is proved by reduction to absurdity.
We consider T * : = sup S < ; hence there exists 1 i * N obtaining θ i * T * = θ m i n ε . For 0 < t < T * , since ζ is a monotone subtracting function and ζ 0 = 1 , we have
d θ i * d t = μ k L i * ζ i * k 1 θ i * 1 θ k > μ k L i * ζ i * k 1 θ i * 1 θ m i n ε = θ m i n ε θ i * θ i * θ m i n ε μ k L i * ζ i * k
Because ζ is a monotone decreasing function, ζ 0 = 1 and θ i * > θ m i n ε , there is θ m i n ε θ i * θ i * θ m i n ε < 0 , such that
d θ i * d t θ m i n ε θ i * θ i * θ m i n ε μ i * ζ 0 = μ i * θ m i n ε θ i * θ i * θ m i n ε
It yields
θ m i n ε θ i * θ i * θ m i n ε d θ i * d t > μ i *
We integral (7) to t
θ m i n ε θ i * t θ i * 0 + θ m i n ε 2 log θ i * t θ m i n ε θ i * 0 θ m i n ε μ i * t , 0 < t < T *
When t T * , θ i * θ m i n ε , the left value of (8) tends to . It yields a conflict, which means T * = . Therefore, for any ε 0 , θ min , we have
θ i t > θ m i n ε , t 0 , , i = 1 , , N
According to the arbitrariness of ε ,
θ i t θ m i n , t 0 , , i = 1 , , N
It is obvious that the minimum value θ m 0 : = θ min = min k θ k 0 . □
Remark 1.
We explain the maximum situation θ M 0 : = θ max = max k θ k 0 , whose proof is the same as the minimum part.
Remark 2.
According to E θ min E θ i E θ max , E θ i θ j E θ i + E θ j D , where D > 0 is a constant.
Lemma 2.
If particle 1 is the global leader and moves at a constant speed, for any t > 0 , E v i t D 1 i N , where D > 0 is a constant.
Proof. 
First, we prove E v 2 t is bounded by reduction to absurdity. If E v 2 t is unbounded, there exists a component j 1 j d which satisfies lim t E v 2 j t = . Integrate the second equation of the system and calculate the expected result
v 2 j 0 = E v 2 j t + λ 0 t E ϕ 21 v 1 j 0 θ 1 0 v 2 j s θ 2 s ds
Since θ min < θ 2 s , θ 1 0 < θ max , (11) implies v 2 j 0 = . A contradiction appears, which means E v 2 t is bounded.
We assume that E v 2 t , , E v l 1 t l 1 3 are bounded. The presence of D 0 makes max 1 i l 1 v i t D . A mathematical induction method is used to prove E v l t is bounded.
Assuming that E v l t is unbounded, there exists a component j 1 j d which satisfies lim t E v l j t = . Integrate the equation and calculate the expected result
v l j 0 = E v l j t + λ 0 t k L l E ϕ l k v l j s θ l s v k j s θ k s ds
Since θ min < θ l s , θ k s < θ max , (12) implies v l j 0 = . A contradiction appears, which means E v l t is bounded. □
Because of the norm inequality E v i v j E v i + E v j , there is a D 0 satisfying E v i v j D 0 .
Lemma 3.
We consider a hierarchical population of two individuals, corresponding to θ 2 θ 1 , satisfying the following equation
d θ = μ ζ 1 θ 2 1 θ 1 d t + ξ d t
including ζ x R
(1)
1 ζ x , t = 1 + x t 2 β > 0
(2)
E ξ q e p t ( p , q > 0 )
There are P , Q > 0 , for all t > 0 , bringing E θ t Q e P t 1 2 β / 2 into existence.
Proof. 
From (13), we have
d θ 2 = 2 θ d θ = μ ζ θ 2 θ 1 θ 2 + 2 θ ξ d t
From Lemma 1, there is a nonnegative constant D causing E θ D . We take advantage of the property of expectation
2 E θ ξ 2 E θ E ξ 2 D q e p t
For E x t = x 0 + 0 t E v s d s x 0 + D 0 t , when t > T 1 , there exist T 1 > 0 , m 1 > 0 satisfying
1 + x t 2 β m 1 x t 2 β
Therefore,
E ζ t = E 1 + x t 2 β m 1 E x t 2 β m 1 x 0 + D 0 t 2 β
When t > x 0 / D 0 , similarly to x 0 < D 0 t , we have m 1 x 0 + D 0 t 2 β > m 1 2 D 0 t 2 β . There exists T = max T 1 , x 0 / D , when t > T , such that E ζ > m t 2 β m = m 1 2 D 0 2 β . Since ζ t < 1 , there are ζ 2 t < ζ t and E ζ 2 t < E ζ t . For θ 1 , θ 2 < θ M 0 ,
E μ ζ θ 2 θ 1 E μ ζ θ M 0 2 = μ θ M 0 2 E ζ < μ m θ M 0 2 t 2 β : = b t
From (14)–(18), by defining d Θ = b t V + 2 D q e p t d t , Θ 0 = θ 2 0 , we obtain
E Θ = e b t d t 2 D q e p t e b t d t d t + C = θ 2 0 e μ m θ M 0 2 1 2 β t 1 2 β 2 D q e p t e μ m θ M 0 2 1 2 β t 1 2 β d t + 1
There are P , Q satisfying E Θ Q e P t 1 2 β . According to the comparison theorem, when t > T ,
lim t E θ 2 lim t E Θ Q e P t 1 2 β
Next, we give the proof of Theorem 1.
Proof. 
(Proof of Theorem 1)
The conclusion is proved to be valid for a subpopulation 1 , 2 . According to the definition of hierarchical groups, L 2 = 1 , ζ 21 > 0 , and the thermostatic movement of agent1, the following equation can be known
d θ 1 = 0 , d θ 2 = λ ζ 21 1 θ 2 1 θ 1 d t
We consider
θ = θ 2 θ 1
It is available that
d θ = μ ζ θ θ 2 θ 1 d t
which satisfies the conditions of Lemma 3. There are P , Q 0 independent of t such that E θ t Q e P t 1 2 β / 2 .
It is assumed that the subgroup 1 , 2 , , l 1 satisfies the lemma condition, where 3 l 1 k . We obtain constants P 1 , Q 1 0 such that
max 1 i , j l 1 E θ i θ j Q 1 e P 1 t 1 2 β / 2
We need to prove the subgroup 1 , 2 , , l also satisfies the lemma condition. Consider the average temperature of all leaders of individual l
θ ¯ l = 1 l 1 i L l θ i
For each individual j ( 1 j l 1 ) , using the above equation, we get
E θ j θ ¯ l = 1 l 1 i L l E θ j θ i Q 1 e P 1 t 1 2 β / 2
Let θ = θ l θ ¯ l , we get
d θ = d θ l d θ ¯ l = μ k L l ζ l j 1 θ l 1 θ j d t d θ ¯ l = μ j L l ζ l j 1 l 1 i L l 1 θ i 1 θ l d t + μ j L l ζ l j 1 l 1 i L l 1 θ i 1 θ j d t μ l 1 i L l j L i ζ i j 1 θ i 1 θ j d t : = μ j L l ζ l j 1 l 1 i L l 1 θ i 1 θ l d t + ξ d t
The following inequality is given by ζ l j < 1 and ζ = j L l ζ l j l 1 N 1
E ξ μ j L l 1 l 1 i L l 1 θ i 1 θ j + μ l 1 i L l j L i 1 θ i 1 θ j μ θ m 0 2 l 1 q e p t + μ θ m 0 2 l 1 q e p t = 2 μ θ m 0 2 l 1 q e p t
The inequality above satisfies Lemma 3. There exist Q 2 , P 2 such that
E θ = E θ l θ ¯ l Q 2 e P 2 1 2 β / 2
Using the norm inequality, we get
E θ j θ l E θ j θ ¯ l + E θ l θ ¯ l Q 1 e P 1 1 2 β / 2 + Q 2 e P 2 1 2 β / 2 Q e P 1 2 β / 2
where Q = Q 1 + Q 2 , P = min P 1 , P 2 . It is true that
lim t E θ i θ j = 0

3.2. Proof of Theorem 2

Lemma 4.
We assume x , v R d (considering a hierarchical population of two individuals corresponding to x 2 x 1 , v 2 v 1 ), satisfying the following equations
d x = v d v = λ ϕ v 1 θ 1 v 2 θ 2 d t σ ϕ v d W + ξ 1 d t + ξ 2 d W
including ϕ x R , σ R
(1)
1 ϕ x , t = 1 + x t 2 β > 0
(2)
E ξ 1 , E ξ 2 q e p t ( p , q > 0 )
(3)
σ < 2 λ θ M 0 1
There are P , Q > 0 , for all t > 0 , bringing E v t Q e P t 1 2 β / 2 into existence.
Proof. 
We use the It o ^ formula
d v 2 = 2 v d v + d v · d v = 2 λ ϕ v 2 v 1 · v 1 θ 1 v 2 θ 2 + σ 2 ϕ 2 v 2 d t + 2 v ξ 1 σ ϕ v ξ 2 + ξ 2 2 d t + 2 ξ 2 v 2 σ ϕ v 2 d W : = L 1 + L 2 d t + L 3 d t + 2 ξ 2 v 2 σ ϕ v 2 d W
Then, we estimate L 1
v 1 θ 1 v 2 θ 2 = v 1 v 2 θ 1 + v 2 1 θ 1 1 θ 2 = v 1 v 2 θ 2 + v 1 1 θ 1 1 θ 2
L 1 = 2 λ ϕ v 2 v 1 · v 1 v 2 θ 1 + v 2 1 θ 1 1 θ 2 : = L 11 + L 12 = 2 λ ϕ v 2 v 1 · v 1 v 2 θ 2 + v 1 1 θ 1 1 θ 2 : = L 13 + L 14
L 11 = 2 λ ϕ v 2 v 1 · v 1 v 2 θ 1 = 2 λ ϕ v 2 v 1 2 θ 1 = 2 λ ϕ θ 1 v 2 L 12 = 2 λ ϕ v 2 v 1 · v 2 1 θ 1 1 θ 2 = 2 λ ϕ θ 2 θ 1 θ 1 θ 2 v 2 v 1 · v 2 L 13 = 2 λ ϕ v 2 v 1 · v 1 v 2 θ 2 = 2 λ ϕ v 2 v 1 2 θ 2 = 2 λ ϕ θ 2 v 2 L 14 = 2 λ ϕ v 2 v 1 · v 1 1 θ 1 1 θ 2 = 2 λ ϕ θ 2 θ 1 θ 1 θ 2 v 2 v 1 · v 1
The calculation results are in the following equations.
d v 2 = L 11 + L 13 2 d t + L 12 + L 14 2 d t + L 2 d t + L 3 d t + 2 ξ 2 v 2 σ ϕ v 2 d W
First, we estimate L 11 + L 13 2 . For θ 1 , θ 2 θ M 0
L 11 + L 13 2 = λ ϕ 1 θ 1 + 1 θ 2 v 2 2 λ ϕ θ M 0 v 2
Second, we estimate L 12 + L 14 2
L 12 + L 14 2 = λ ϕ θ 2 θ 1 θ 1 θ 2 v 2 v 1 · v 2 + λ ϕ θ 2 θ 1 θ 1 θ 2 v 2 v 1 · v 1 = λ ϕ θ 2 θ 1 θ 1 θ 2 v · v 1 + v 2
From Lemma 3, we have E θ 2 θ 1 Q e P t 1 2 β / 2 . From Lemma 2, we have E v i D i = 1 , 2 . For ϕ 1 , θ m 0 θ 1 , θ 2 θ M 0 ,
E L 12 + L 14 2 = E λ ϕ θ 2 θ 1 θ 1 θ 2 v · v 1 + v 2 λ θ 1 θ 2 E ϕ E v · v 1 + v 2 E θ 2 θ 1 m e n t
Third, we estimate L 3 . From Lemma 3.1, there is a nonnegative constant D 0 causing E v D 0 . For E ϕ 1 , we take advantage of the properties of expectations,
2 E v ξ 1 σ E ϕ v ξ 2 + E ξ 2 2 2 E v E ξ 1 + σ E ϕ E v E ξ 2 + E ξ 2 2 2 D 0 q e p t + σ D 0 q e p t + q 2 e 2 p t c e p t
where c = 2 D 0 q + σ D 0 q + q 2 .
For ϕ t < 1 , there are ϕ 2 t < ϕ t and E ϕ 2 t < E ϕ t . For σ < 2 λ θ M 0 1
E 2 λ ϕ θ M 0 + σ 2 ϕ 2 = 2 λ θ M 0 E ϕ + σ 2 E ϕ 2 < 2 λ θ M 0 E ϕ + σ 2 E ϕ < E ϕ < m t 2 β : = a t
From (37), (38), (40), (41) and (42), by defining
d V = a t V + m e n t + c e p t d t + 2 V 1 2 ξ 2 2 σ ϕ V d W
we obtain
E V = e a t d t m e n t + c e p t e a t d t d t + C = v 2 0 e m 1 2 β t 1 2 β m e n t + c e p t e m 1 2 β t 1 2 β d t + 1
There are P , Q satisfying E V Q e P t 1 2 β . According to the comparison theorem, when t > T ,
lim t E v 2 lim t E V Q e P t 1 2 β
Next, we give the proof of Theorem 2.
Proof. 
(Proof of Theorem 2)
For the subgroup 1 , 2 , , l l = 1 , 2 , , N , the theorem is proved by mathematical induction.
The conclusion is proved to be valid for a subpopulation 1 , 2 . According to the definition of the hierarchical group, L 2 = 1 , ϕ 21 > 0 , and a constant-speed movement of agent1, we have
d x 1 = v 1 d t , d x 2 = v 2 d t d v 1 = 0 , d v 2 = λ ϕ 21 v 1 θ 1 v 2 θ 2 d t + σ ϕ 21 v 1 v 2 d W
We consider
x = x 2 x 1 , v = v 2 v 1
It is available that
d x = v d t d v = λ ϕ v 1 θ 1 v 2 θ 2 d t σ ϕ v d W
which satisfy the conditions of Lemma 4. The existence of P , Q 0 independent of t make E v t Q e P t 1 2 β / 2 true.
It is assumed that the subgroup 1 , 2 , , l 1 satisfies the lemma condition, where 3 l 1 k . Then we obtain constants P 1 , Q 1 0 such that
max 1 i , j l 1 E v i v j Q 1 e P 1 t 1 2 β / 2
It is proved that the subgroup 1 , 2 , , l also satisfies the lemma condition. We consider the average position and average velocity of all leaders of individual l.
x l ¯ = 1 l 1 i L l x i , v l ¯ = 1 l 1 i L l v i
For each individual j ( 1 j l 1 ) , using the above equation, we get
E v j v ¯ l = 1 l 1 i L l E v j v i Q 1 e P 1 t 1 2 β / 2
Let v = v l v l ¯ , x = x l x l ¯ , we get
d x = v d t d v = d v l d v ¯ l = λ j L l ϕ l j v j θ j v l θ l d t + σ i j L l ϕ l j v j v l d W l t d v ¯ l = λ j L l ϕ l j v l θ l 1 l 1 i L l v i θ i d t σ l ϕ l j v l v ¯ l d W l t + λ j L l ϕ l j v j θ j 1 l 1 i L l v i θ i d t + σ l j L l ϕ l j v j v ¯ l d W l t λ l 1 i L l j L i ϕ i j v j θ j v i θ i d t 1 l 1 i L l j L i σ i ϕ i j v j v i d W i t : = λ j L l ϕ l j v l θ l 1 l 1 i L l v i θ i d t σ l ϕ l j v d W l t + ξ 1 d t + ξ 2 d W l t
From Lemma 2, E v i t D , then we have
v i θ i v j θ j = v i v j θ i + v j 1 θ i 1 θ j v i v j θ i + v j θ i θ j θ i θ j 1 θ m 0 v i v j + D θ m 0 2 θ i θ j
It is given by ϕ l j < 1 , ϕ = j L l ϕ l j l 1 N 1 , (49) and temperature consistency that
E ξ 1 λ j L l E v j θ j 1 l 1 i L l v i θ i + λ l 1 i L l j L i E v j θ j v i θ i λ θ m 0 l 1 q e p t + D θ m 0 2 l 1 q e p t + λ θ m 0 l 1 q e p t + D θ m 0 2 l 1 q e p t = 2 λ θ m 0 + 2 D θ m 0 2 l 1 q e p t
E ξ 2 σ l j L l E v j v ¯ l + σ l 1 i L l j L i E v j v i σ l l 1 q e p t + σ l 1 q e p t = 2 σ l 1 q e p t
The inequality above satisfies Lemma 4 condition. There exist Q 2 , P 2 such that
E v = E v l v ¯ l Q 2 e P 2 1 2 β / 2
Using the norm inequality, we get
E v j v l E v j v ¯ l + E v l v ¯ l Q 1 e P 1 1 2 β / 2 + Q 2 e P 2 1 2 β / 2 Q e P 1 2 β / 2
where Q = Q 1 + Q 2 , P = min P 1 , P 2 . It is true that
lim t E v i v j = 0 sup 1 t < E x i x j = sup 1 t < E x i 0 x j 0 + 0 t v i v j d s x i 0 x j 0 + 0 t E v i v j d s

4. Result Proof of System (3)

Lemma 5.
Let x i , v i , θ i be the solution of System (3), where
0 f i t d t <
If particle 1 is the global leader and the change in velocity only depends on f 1 , for any t > 0 , E v i t D 1 i N , where D > 0 is a constant.
Proof. 
For particle 1,
d v 1 = f 1 d t
By integrating (60) and computing the expectation, it yields
E v 1 = 0 f i t d t <
The result holds.
First, we proof E v 2 t is bounded by reduction to absurdity. If E v 2 t is unbounded, there exists a component j 1 j d which satisfies lim t E v 2 j t = . Integrate the second equation of the system and calculate the expected result
v 2 j 0 = E v 2 j t + E 0 t f 2 t d s + λ 0 t E ϕ 21 v 1 j s θ 1 s v 2 j s θ 2 s ds
Since θ min < θ 2 s , θ 1 s < θ max , E v 1 < and E 0 t f 2 t d s < , (62) implies v 2 j 0 = . A contradiction appears, which means E v 2 t is bounded.
We assume that E v 2 t , , E v l 1 t l 1 3 are bounded. The presence of D 0 makes max 1 i l 1 v i t D . A mathematical induction method is used to prove E v l t is bounded.
Assuming that E v l t is unbounded, there exists a component j 1 j d , which satisfies lim t E v l j t = . Integrate the equation and calculate the expected result
v l j 0 = E v l j t + E 0 t f l t d s + λ 0 t k L l E ϕ l k v l j s θ l s v k j s θ k s ds
Since θ min < θ l s , θ k s < θ max and E 0 t f l t d s < , (63) implies v l j 0 = . A contradiction appears, which means E v l t is bounded. □
Since the norm inequality E v i v j E v i + E v j , there is a D 0 satisfying E v i v j D 0 .
From Lemma 5, the proof of the temperature boundedness and consistency of the corresponding system are same as Lemma 3. Next, we discuss the fluctuation of velocities in the corresponding system.
Lemma 6.
We assume x , v R d (considering a hierarchical population of two individuals corresponding to x 2 x 1 , v 2 v 1 ), satisfying the following equations
d x = v d v = λ ϕ v 1 θ 1 v 2 θ 2 d t σ ϕ v d W + f 1 f 2 d t + ξ 1 d t + ξ 2 d W
including ϕ x R , σ R
(1)
1 ϕ x , t = 1 + x t 2 β > 0
(2)
E ξ 1 , E ξ 2 , E f 1 f 2 q e p t ( p , q > 0 )
(3)
σ < 2 λ θ M 0 1
There are P , Q > 0 , for all t > 0 , bringing E v t Q e P t 1 2 β / 2 into existence.
Proof. 
We use the It o ^ formula
d v 2 = 2 v d v + d v · d v = 2 λ ϕ v 2 v 1 · v 1 θ 1 v 2 θ 2 + σ 2 ϕ 2 v 2 d t + 2 v f 1 f 2 + 2 v ξ 1 σ ϕ v ξ 2 + ξ 2 2 d t + 2 ξ 2 v 2 σ ϕ v 2 d W : = L 1 + L 2 d t + L 3 d t + + 2 ξ 2 v 2 σ ϕ v 2 d W
The process of estimating L 1 and L 2 is the same as Lemma 4. Only the calculation of L 3 is explained here. From Lemma 5, there is a nonnegative constant D 0 causing E v D 0 . For E ϕ 1 , we take advantage of the properties of expectations,
2 E v f 1 f 2 + 2 E v ξ 1 σ E ϕ v ξ 2 + E ξ 2 2 2 E v s . E f 1 f 2 + 2 E v E ξ 1 + σ E ϕ E v E ξ 2 + E ξ 2 2 2 D 0 q e p t + 2 D 0 q e p t + σ D 0 q e p t + q 2 e 2 p t c e p t
where c = 4 D 0 q + σ D 0 q + q 2 .
It can be seen that (66) is an extension of (41) and thus all subsequent proofs apply. Then we have
lim t E v 2 lim t E V Q e P t 1 2 β
Next, we give the proof of Theorem 3.
Proof. 
(Proof of Theorem 3)
For the subgroup 1 , 2 , , l l = 1 , 2 , , N , the theorem is proved by mathematical induction.
The conclusion is proved to be valid for a subpopulation 1 , 2 . According to the definition of hierarchical group, L 2 = 1 , ϕ 21 > 0 , and a constant-speed movement of agent1, we have
d x 1 = v 1 d t , d x 2 = v 2 d t
d v 1 = f 1 d t , d v 2 = λ ϕ 21 v 1 θ 1 v 2 θ 2 d t + f 2 d t + σ ϕ 21 v 1 v 2 d W
We consider
x = x 2 x 1 , v = v 2 v 1
It is available that
d x = v d t d v = λ ϕ v 1 θ 1 + f 2 f 1 d t v 2 θ 2 d t σ ϕ v d W
which satisfy the conditions of Lemma 6. The existence of P , Q 0 independent of t make E v t Q e P t 1 2 β / 2 true.
It is assumed that the subgroup 1 , 2 , , l 1 satisfies the lemma condition, where 3 l 1 k . Then we obtain constants P 1 , Q 1 0 such that
max 1 i , j l 1 E v i v j Q 1 e P 1 t 1 2 β / 2
It is proved that the subgroup 1 , 2 , , l also satisfies the lemma condition. We consider the average position and average velocity of all leaders of individual l.
x l ¯ = 1 l 1 i L l x i , v l ¯ = 1 l 1 i L l v i
For each individual j ( 1 j l 1 ) , using the above equation, we get
E v j v ¯ l = 1 l 1 i L l E v j v i Q 1 e P 1 t 1 2 β / 2
Let v = v l v l ¯ , x = x l x l ¯ , we get
d x = v d t d v = d v l d v ¯ l = λ j L l ϕ l j v j θ j v l θ l d t + σ i j L l ϕ l j v j v l d W l t d v ¯ l = λ j L l ϕ l j v l θ l 1 l 1 i L l v i θ i d t σ l ϕ l j v l v ¯ l d W l t + f l 1 l 1 i L l f i d t + λ j L l ϕ l j v j θ j 1 l 1 i L l v i θ i d t + σ l j L l ϕ l j v j v ¯ l d W l t λ l 1 i L l j L i ϕ i j v j θ j v i θ i d t 1 l 1 i L l j L i σ i ϕ i j v j v i d W i t : = λ j L l ϕ l j v l θ l 1 l 1 i L l v i θ i d t σ l ϕ l j v d W l t + ξ 1 d t + ξ 2 d W l t
From Lemma 5, E v i t D , then we have
v i θ i v j θ j = v i v j θ i + v j 1 θ i 1 θ j v i v j θ i + v j θ i θ j θ i θ j 1 θ m 0 v i v j + D θ m 0 2 θ i θ j
It is given by ϕ l j < 1 , ϕ = j L l ϕ l j l 1 N 1 , (72) and temperature consistency that
E f l 1 l 1 i L l f i l 1 q e p t
E ξ 1 λ j L l E v j θ j 1 l 1 i L l v i θ i + λ l 1 i L l j L i E v j θ j v i θ i λ θ m 0 l 1 q e p t + D θ m 0 2 l 1 q e p t + λ θ m 0 l 1 q e p t + D θ m 0 2 l 1 q e p t = 2 λ θ m 0 + 2 D θ m 0 2 l 1 q e p t
E ξ 2 σ l j L l E v j v ¯ l + σ l 1 i L l j L i E v j v i σ l l 1 q e p t + σ l 1 q e p t = 2 σ l 1 q e p t
The inequality above satisfies Lemma 6. There exist Q 2 , P 2 such that
E v = E v l v ¯ l Q 2 e P 2 1 2 β / 2
Using the norm inequality, we get
E v j v l E v j v ¯ l + E v l v ¯ l Q 1 e P 1 1 2 β / 2 + Q 2 e P 2 1 2 β / 2 Q e P 1 2 β / 2
where Q = Q 1 + Q 2 , P = min P 1 , P 2 . It is true that
lim t E v i v j = 0 sup 1 t < E x i x j = sup 1 t < E x i 0 x j 0 + 0 t v i v j d s x i 0 x j 0 + 0 t E v i v j d s

5. Numerical Simulation

This section uses computer simulation to verify the results of the theorems. Figure 1 shows the directed graph of the hierarchy in the numerical experiment with four individuals as examples. The arrow in the figure points from the leader to the follower.
The total time t is 50 s, λ is 10 and μ is 5. For the initial data, we consider 12 particles as the hierarchical group whose initial positions and velocities are random numbers uniformly distributed in the interval 1 , 1 .

5.1. Numerical Experiments for System (2)

We take σ = 1 and β = 0.5 , which satisfies the theorem condition of this paper. Simulation results verify the correctness of the conclusion.
Figure 2 shows the position, velocity and temperature trajectory images of System (2) changing with time when noise intensity σ is 1. The temperature and velocity of each particle tend to match that of the overall leader (particle 1).
Figure 3 shows the position difference, velocity difference and temperature difference images of System (2) when noise intensity σ is 1. We introduce some functionals to describe the flocking process: X = x M x m , V = v M v m and Θ = θ M θ m , which mean the differences between the maximum and minimum values at moment t. Figure 3a, b and c display the dynamics of X t , V t and Θ t showing the fluctuations around the overall leader as a function of the choice of the coupling strength. Taking the same initial values, the systems converge when the values of β are 0.5, 0.3 and 0.1. The lower the β value, the larger the communication coefficient, and the sooner the system will reach flocking.
Then we take σ = 5 and β = 0.5 . Figure 4a and b, show the dynamics of X t , V t and Figure 4c shows the velocity trajectory of each particle. System (2) is unable to reach flocking state if the noise value is too large to satisfy the condition of the theorem. There is a tolerance limit to noise.
As shown in Figure 2, Figure 3 and Figure 4, when certain conditions are met, the positions, velocities and temperatures in System (2) are globally flocking, which shows the correctness of Theorem 1 and Theorem 2. The simulation results agree well with the conditions of our theorem, thus verifying our theorem. Due to the chaotic nature of the system, there is some oscillation in the velocity or velocity difference of the system.

5.2. Numerical Experiments for System (3)

For System (3), the disturbance functions are as follows.
f 1 = 1 1 + t 2 ; f i = 1 1 + t 2 + a e b t , a > 0 , b > 0 , i 1
We take σ = 1 , which satisfies the theorem condition of this paper. Simulation results verify the correctness of the conclusion.
Figure 5 shows the position, velocity and temperature trajectory images of System (3) changing with time when noise intensity σ is 1 and β is 0.3. Figure 5a, b and c show the states of all particles attaining flocking. After a few fluctuations, the particle swarm moves forward in a fixed formation around the leader (particle 1). Each particle’s temperature and velocity tend to match particle 1. This shows that the system achieves flocking, which is consistent with the description of the theorem.
In Figure 6, corresponding to σ = 2 , Figure 6a, b and c show the position difference X t , velocity difference V t and temperature difference Θ t images of System (3). We observe that the experimental data are discrete and that particles move with a degree of freedom; the velocity curve is not smooth. Velocity difference tends to 0 over time; the system reaches flocking. For the TCS system, it has a noise term in the differential equation for velocity. The fluctuation of velocity decays exponentially.
Then we take σ = 5 . Figure 7a and b show the dynamics of X t , V t and Figure 7c shows the velocity trajectory of each particle in System (3). If the noise value is too large to satisfy the conditions of the theorem, the system will not reach the flocking state.
As shown in Figure 5, Figure 6 and Figure 7, when certain conditions are met, the positions, velocities and temperatures in System (3) are globally flocking, which shows the correctness of Theorem 3. The above numerical experiments show that in a TCS system with white noise under hierarchical leadership, adding a small perturbation to the velocity variation, the system can still achieve flocking when the noise satisfies the theorem conditions.

6. Conclusions

In this paper, the effect of multiplicative white noise on a TCS system with free disturbance under a hierarchical system is considered. Due to the properties of hierarchy, the system can be studied by mathematical induction. It is proved that, when the noise intensity meets certain conditions, the system can achieve flocking. The results are verified by numerical simulation. Similarly, we study the above models with perturbation functions and generate good results. We show that particles can keep pace with the determined overall leader, even if there exist some noises. Small perturbations do not affect the convergence of the hierarchy up to a certain noise limit.
Based on this system, other factors such as communication delay, system chaos and individual collision avoidance are all problems to be solved. According to the actual situation, this model is established to study the evolution of flocking dynamics. This mechanism can solve the problem of system consistency and cooperation, and has considerable application value in multi-robot flocking cooperation, UAV formation control, etc. For example, when the robot queue is disturbed, the whole team can also be consistent with the leader.

Author Contributions

Methodology, S.Y. and Y.J.; validation, S.Y., Y.S. and A.H.; writing—original draft preparation, S.Y.; writing—review and editing, Y.J. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Natural Science Foundation of Jiangsu Province grant number BK20181342.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
CSCucker–Smale
TCSThermodynamic Cucker–Smale
UAVUnmanned aerial vehicle

References

  1. Dell’Ariccia, G.; Dell’Omo, G.; Wolfer, D.P.; Lipp, H.P. Flock flying improves pigeons’ homing: GPS track analysis of individual flyers versus small groups. Anim. Behav. 2008, 76, 1165–1172. [Google Scholar] [CrossRef] [Green Version]
  2. Motsch, S.; Tadmor, E. A new model for self-organized dynamics and its flocking behavior. J. Stat. Phys. 2011, 144, 923–947. [Google Scholar] [CrossRef] [Green Version]
  3. Vicsek, T.; Czirok, A.; Ben-Jacob, E.; Cohen, I.; Shochet, O. Novel type of phase transition in a system of self-driven particles. Phys. Rev. Lett. 1995, 75, 1226. [Google Scholar] [CrossRef] [Green Version]
  4. Jadbabaie, A.; Lin, J.; Morse, A.S. Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 2003, 48, 988–1001. [Google Scholar] [CrossRef] [Green Version]
  5. Tanner, H.G.; Jadbabaie, A.; Pappas, G.J. Flocking in fixed and switching networks. IEEE Trans. Autom. Control 2007, 52, 863–868. [Google Scholar] [CrossRef]
  6. Ahn, S.; Bae, H.-O.; Ha, S.-Y.; Kim, Y.; Lim, H. Application of flocking mechanism to the modeling of stochastic volatility. Math. Model. Methods Applies Sci. 2013, 23, 1603–1628. [Google Scholar] [CrossRef]
  7. You, R.; Tang, M.; Guo, S.; Cui, G. Proportional Integral Observer-based Consensus Control of Discrete-time Multi-agent Systems. Int. J. Control. Autom. Syst. 2022, 20, 1461–1472. [Google Scholar] [CrossRef]
  8. Cucker, F.; Smale, S. Emergent behavior in flocks. IEEE Trans. Autom. Control 2007, 52, 852–862. [Google Scholar] [CrossRef] [Green Version]
  9. Ha, S.Y.; Lee, K.; Levy, D. Emergence of time-asymptotic flocking in a stochastic Cucker-Smale system. Commun. Math. Sci. 2009, 7, 453–469. [Google Scholar] [CrossRef] [Green Version]
  10. Liu, Y.; Wu, J. Flocking and asymptotic velocity of the Cucker-Smale model with processing delay. J. Math. Anal. Appl. 2014, 415, 53–61. [Google Scholar] [CrossRef]
  11. Ru, L.; Li, Z.; Xue, X. Cucker-Smale flocking with randomly failed interactions. J. Frankl. Inst. 2015, 352, 1099–1118. [Google Scholar] [CrossRef]
  12. Dong, J.G.; Ha, S.Y.; Jung, J.; Kim, D. Emergence of stochastic flocking for the discrete Cucker–Smale model with randomly switching topologies. Commun. Math. Sci. 2021, 19, 205–228. [Google Scholar] [CrossRef]
  13. Shen, J. Cucker-Smale flocking under hierarchical leadership. SIAM J. Appl. Math. 2007, 68, 694–719. [Google Scholar] [CrossRef] [Green Version]
  14. Ha, S.Y.; Ruggeri, T. Emergent Dynamics of a thermodynamically consistent particle model. Arch. Rational Mech. Anal. 2017, 233, 1397–1425. [Google Scholar] [CrossRef]
  15. Ha, S.Y.; Kim, J.; Ruggeri, T. Emergent behaviors of thermodynamic Cucker-Smale particles. Soc. Ind. Appl. Math. 2018, 50, 3092–3121. [Google Scholar] [CrossRef]
  16. Ha, S.Y.; Kim, J.; Min, C.H.; Ruggeri, T.; Zhang, X. Uniform stability and mean-field limit of a thermodynamic Cucker-Smale Model. Q. Appl. Math. 2018, 77, 131–176. [Google Scholar] [CrossRef]
  17. Dong, J.G.; Ha, S.Y.; Kim, D.; Kim, J. Time-delay effect on the flocking in an ensemble of thermomechanical Cucker-Smale particles. J. Differ. Equ. 2019, 266, 2373–2407. [Google Scholar] [CrossRef]
  18. Cho, H.; Dong, J.G.; Ha, S.Y. Emergent behaviors of a thermodynamic Cucker-Smale flock with a time-delay on a general digraph. Math. Methods Appl. Sci. 2021, 45, 164–196. [Google Scholar] [CrossRef]
  19. Cucker, F.; Mordecki, E. Flocking in noisy environments. J. Math. Pures Appl. 2008, 89, 278–296. [Google Scholar] [CrossRef] [Green Version]
  20. Ahn, S.; Ha, S.Y. Stochastic flocking dynamics of the Cucker-Smale model with multiplicative white noises. J. Math. Phys. 2010, 51, 103301. [Google Scholar] [CrossRef]
  21. Ballerini, M.; Cabibbo, N.; Candelier, R.; Zdravkovic, V. Interaction ruling animal collective behavior depends on topological rather than metric distance: Evidence from a field study. Proc. Natl. Acad. Sci. USA 2008, 105, 1232–1237. [Google Scholar] [CrossRef] [PubMed] [Green Version]
Figure 1. Connectivity topology under hierarchical leadership for 4 individuals.
Figure 1. Connectivity topology under hierarchical leadership for 4 individuals.
Entropy 25 00417 g001
Figure 2. Trajectories of position x i t , velocity v i t and temperature θ i t of System (2) and flocking behavior for σ = 1 .
Figure 2. Trajectories of position x i t , velocity v i t and temperature θ i t of System (2) and flocking behavior for σ = 1 .
Entropy 25 00417 g002
Figure 3. Position difference x M x m , velocity difference v M v m and temperature difference θ M θ m of System (2) for σ = 1 .
Figure 3. Position difference x M x m , velocity difference v M v m and temperature difference θ M θ m of System (2) for σ = 1 .
Entropy 25 00417 g003
Figure 4. Position difference X, velocity difference V and velocity trajectories v i t of System (2) with σ = 5 .
Figure 4. Position difference X, velocity difference V and velocity trajectories v i t of System (2) with σ = 5 .
Entropy 25 00417 g004
Figure 5. Trajectories of position x i t , velocity v i t and temperature θ i t of System (3) and flocking behavior for σ = 1 .
Figure 5. Trajectories of position x i t , velocity v i t and temperature θ i t of System (3) and flocking behavior for σ = 1 .
Entropy 25 00417 g005
Figure 6. Position difference x M x m , velocity difference v M v m and temperature difference θ M θ m of System (3) for σ = 1 .
Figure 6. Position difference x M x m , velocity difference v M v m and temperature difference θ M θ m of System (3) for σ = 1 .
Entropy 25 00417 g006
Figure 7. Position difference x M x m , velocity difference v M v m and velocity trajectories v i t of System (3) with σ = 5 .
Figure 7. Position difference x M x m , velocity difference v M v m and velocity trajectories v i t of System (3) with σ = 5 .
Entropy 25 00417 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

Yang, S.; Jin, Y.; Hu, A.; Shao, Y. Flocking Behaviors under Hierarchical Leadership of Thermodynamic Cucker–Smale Particles with Multiplicative White Noise and Perturbation. Entropy 2023, 25, 417. https://doi.org/10.3390/e25030417

AMA Style

Yang S, Jin Y, Hu A, Shao Y. Flocking Behaviors under Hierarchical Leadership of Thermodynamic Cucker–Smale Particles with Multiplicative White Noise and Perturbation. Entropy. 2023; 25(3):417. https://doi.org/10.3390/e25030417

Chicago/Turabian Style

Yang, Shuobing, Yinghua Jin, Aihua Hu, and Yipeng Shao. 2023. "Flocking Behaviors under Hierarchical Leadership of Thermodynamic Cucker–Smale Particles with Multiplicative White Noise and Perturbation" Entropy 25, no. 3: 417. https://doi.org/10.3390/e25030417

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