This paper demonstrates several sufficient frameworks for the mono-cluster flocking, the non-emergence of mono-cluster flocking and the multi-cluster flocking of the thermodynamic Cucker–Smale model with a unit-speed constraint (say TCSUS). First, in a different way than [
Citation: Hyunjin Ahn. Non-emergence of mono-cluster flocking and multi-cluster flocking of the thermodynamic Cucker–Smale model with a unit-speed constraint[J]. Networks and Heterogeneous Media, 2023, 18(4): 1493-1527. doi: 10.3934/nhm.2023066
[1] | Shenglun Yan, Wanqian Zhang, Weiyuan Zou . Multi-cluster flocking of the thermodynamic Cucker-Smale model with a unit-speed constraint under a singular kernel. Networks and Heterogeneous Media, 2024, 19(2): 547-568. doi: 10.3934/nhm.2024024 |
[2] | Hyunjin Ahn, Woojoo Shim . Interplay of a unit-speed constraint and time-delay in the flocking model with internal variables. Networks and Heterogeneous Media, 2024, 19(3): 1182-1230. doi: 10.3934/nhm.2024052 |
[3] | Hyunjin Ahn, Se Eun Noh . Finite-in-time flocking of the thermodynamic Cucker–Smale model. Networks and Heterogeneous Media, 2024, 19(2): 526-546. doi: 10.3934/nhm.2024023 |
[4] | Hyunjin Ahn . Asymptotic flocking of the relativistic Cucker–Smale model with time delay. Networks and Heterogeneous Media, 2023, 18(1): 29-47. doi: 10.3934/nhm.2023002 |
[5] | Hyunjin Ahn . Uniform stability of the Cucker–Smale and thermodynamic Cucker–Smale ensembles with singular kernels. Networks and Heterogeneous Media, 2022, 17(5): 753-782. doi: 10.3934/nhm.2022025 |
[6] | Hyeong-Ohk Bae, Seung Yeon Cho, Jane Yoo, Seok-Bae Yun . Effect of time delay on flocking dynamics. Networks and Heterogeneous Media, 2022, 17(5): 803-825. doi: 10.3934/nhm.2022027 |
[7] | Young-Pil Choi, Cristina Pignotti . Emergent behavior of Cucker-Smale model with normalized weights and distributed time delays. Networks and Heterogeneous Media, 2019, 14(4): 789-804. doi: 10.3934/nhm.2019032 |
[8] | J. J. P. Veerman, B. D. Stošić, A. Olvera . Spatial instabilities and size limitations of flocks. Networks and Heterogeneous Media, 2007, 2(4): 647-660. doi: 10.3934/nhm.2007.2.647 |
[9] | Matteo Novaga, Emanuele Paolini, Eugene Stepanov, Vincenzo Maria Tortorelli . Isoperimetric planar clusters with infinitely many regions. Networks and Heterogeneous Media, 2023, 18(3): 1226-1235. doi: 10.3934/nhm.2023053 |
[10] | Michael Herty, Lorenzo Pareschi, Giuseppe Visconti . Mean field models for large data–clustering problems. Networks and Heterogeneous Media, 2020, 15(3): 463-487. doi: 10.3934/nhm.2020027 |
This paper demonstrates several sufficient frameworks for the mono-cluster flocking, the non-emergence of mono-cluster flocking and the multi-cluster flocking of the thermodynamic Cucker–Smale model with a unit-speed constraint (say TCSUS). First, in a different way than [
Emergent dynamics in interacting multi-agent systems are frequently observed in nature. Examples include the aggregation of bacteria [39], flocking of birds and vehicular flocking [7,14,19,34], schooling of fish [20,38] and the synchronization of fireflies and pacemaker cells [1,8,21,37,43]. To more introduce related literature, we refer to [22,35,41,42]. Herein, we are primarily concerned with "flocking" in which agents exhibit ordered movements and form appropriate groups. After the work of Vicsek et al. in [40], many studies on models representing flocking have been actively conducted for decades. Among them, the Cucker–Smale model [19] has received significant attention in math and physics communities due to its dissipative and simple velocity structure. Essentially, the Cucker–Smale model is a flocking dynamic system for position and velocity based on the Newtonian sense, which is governed by
{dxidt=vi,t>0,i∈{1,⋯,N},dvidt=κNN∑j=1ψ(‖xi−xj‖)(vj−vi),(xi(0),vi(0))=(x0i,v0i)∈Rd×Rd, | (1.1) |
where N denotes the number of particles, κ is a nonnegative coupling strength and ψ is a communication weight. To date, there have been many works examining this system and its variants due to its dissipative structure for velocity, such as the mean-field limit [5,6,25,28,30], kinetic models [9,32], hydrodynamic descriptions [23,24,33], particle analysis [9,10,13,14,15,16,17,18], temperature field [26,31] and relativistic setting [4,5,6,27].
Since Eq (1.1), the authors of [12] noted that several Vicsek-type models with unit-speed constraints have been actively studied concerning heading angles in math community. To give a unit-speed constraint to Eq (1.1), the authors modified the velocity coupling term Eq (1.1)2 so that the velocity of each agent has a unit-speed constraint as follows:
ψ(‖xi−xj‖)(vj−vi)⟶ψ(‖xi−xj‖)(vj−⟨vj,vi⟩vi‖vi‖2), |
where the modified term is perpendicular to vi. Thus, they proposed the following Cucker–Smale type model with constant speed and studied its flocking dynamics:
{dxidt=vi,t>0,i∈{1,⋯,N},dvidt=κNN∑j=1ψ(‖xi−xj‖)(vj−⟨vj,vi⟩vi‖vi‖2),(xi(0),vi(0))=(x0i,v0i)∈Rd×Rd. | (1.2) |
Equation (1.2) has also been studied from several perspectives; for example, particle analysis [12], the emergence of the bi-cluster flocking in [17], multi-cluster flocking and critical coupling strength in [29], time-delay effect [11] and general digraph setting [36].
However, because the above literature [11,12,17,29,36] were only motivated by the original Cucker–Smale model (1.1) without considering internal energy, the author of [2] noted the extension of the above model to a temperature field to describe more realistic flocking dynamics. For this, as a backbone model, the author first adopted a thermodynamic Cucker–Smale model proposed by [26,31] based on the theory of multi-temperature mixture of fluids under the space of homogeneity, which is given by the following second-order ODEs for position-velocity-temperature (xi,vi,Ti):
dxidt=vi,t>0,i∈[N]:={1,⋯,N}, | (1.3a) |
dvidt=κ1NN∑j=1ϕ(‖xi−xj‖)(vjTj−viTi), | (1.3b) |
ddt(Ti+12‖vi‖2)=κ2NN∑j=1ζ(‖xi−xj‖)(1Ti−1Tj), | (1.3c) |
(xi(0),vi(0),Ti(0))=(x0i,v0i,T0i)∈Rd×Rd×R+−{0}, | (1.3d) |
where ∑Ni=1T0i=:NT∞, N denotes the number of particles, κ1,κ2 are nonnegative coupling strengths and ψ,ζ are communication weights. Then, motivated from the derivation idea of Eq (1.2), by modifying the velocity coupling term Eq (1.3a) as
ϕ(‖xi−xj‖)(vjTj−viTi)⟶ϕ(‖xi−xj‖)(vjTj−⟨vj,vi⟩viTj‖vi‖2), |
the author suggested the following TCSUS model in terms of position-velocity-temperature (xi,vi,Ti):
{dxidt=vi,t>0,i∈{1,⋯,N},dvidt=κ1NN∑j=1ϕ(‖xi−xj‖)(vjTj−⟨vj,vi⟩viTj‖vi‖2),ddt(Ti+12‖vi‖2)=κ2NN∑j=1ζ(‖xi−xj‖)(1Ti−1Tj),(xi(0),vi(0),Ti(0))=(x0i,v0i,T0i)∈Rd×Sd−1×(R+−{0}), | (1.4) |
where ∑Ni=1T0i=:NT∞. Afterward, the author immediately verified that each agent in the system (1.4) has a unit-speed. Then, from the relations,
‖vi‖=1,⟨vj,vi⟩viTj‖vi‖2=⟨vj,vi⟩viTjandddt(Ti+12‖vi‖2)=dTidt, |
the author simply represented the system (1.4) as follows:
dxidt=vi,t>0,i∈{1,⋯,N}, | (1.5a) |
dvidt=κ1NN∑j=1ϕ(‖xi−xj‖)(vj−⟨vj,vi⟩viTj), | (1.5b) |
dTidt=κ2NN∑j=1ζ(‖xi−xj‖)(1Ti−1Tj), | (1.5c) |
(xi(0),vi(0),Ti(0))=(x0i,v0i,T0i)∈Rd×Sd−1×(R+−{0}), | (1.5d) |
where ∑Ni=1T0i=:NT∞. Here, we set R+:=[0,∞) throughout the paper and we assume that two communication weights ϕ, ζ:R+→R+ are nonnegative, locally Lipschitz continuous and monotonically decreasing and that Sd−1 is the unit (d−1)-sphere isometrically embedded in Rd; hence,
0≤ϕ(r)≤ϕ(0)=1,(ϕ(r1)−ϕ(r2))(r1−r2)≤0,∀r,r1,r2≥0,ϕ(⋅)∈C0,1loc(R+;R+),0≤ζ(r)≤ζ(0)=1,(ζ(r1)−ζ(r2))(r1−r2)≤0,∀r,r1,r2≥0,ζ(⋅)∈C0,1loc(R+;R+),Sd−1:={x:=(x1,⋯,xd)|d∑i=1|xi|2=1,}where xi is the i −th component of x∈Rd. |
The system (1.5) was studied in terms of mono-cluster flocking and bi-cluster flocking in [2] and collision avoidance [3], but the multi-cluster flocking of system (1.5) has not been studied yet. Indeed, the multi-cluster flocking phenomenon is ubiquitous in daily life. Examples include opinion disagreement, schools of fish invaded by predators and flight multi-formation. In addition, a phenomenon in which individuals with the same characteristics gather together can be an example of the multi-cluster flocking.
Therefore, this paper is mainly interested in the non-emergence of mono-cluster flocking in the system (1.5) under a sufficiently small coupling strength and extending the bi-cluster flocking of [2] to general multi-cluster flocking. For this, we first introduce several basic notions concerning mono- and multi-cluster flocking as follows:
Definition 1.1. Let Z={(xi,vi,Ti)}Ni=1 be a solution to the system (1.5).
(1) The configuration Z exhibits mono-cluster flocking if the following statements hold:
(i)(Group formation)⟺supt∈R+max1≤i,j≤N‖xi(t)−xj(t)‖<∞,(ii)(Velocity alignment)⟺limt→∞max1≤i,j≤N‖vj(t)−vi(t)‖=0,(iii)(Temperature equilibrium)⟺limt→∞max1≤i,j≤N|Tj(t)−Ti(t)|=0. |
(2) The configuration Z exhibits multi-cluster flocking if there exist n cluster groups Zα={(xαi,vαi,Tαi)}Nαi=1 such that the following assertions hold for 1≤n≤N:
(i)|Zα|=Nα≥1,n∑α=1|Zα|=n∑α=1Nα=N,(ii)supt∈R+max1≤k,l≤Nα‖xαk(t)−xαl(t)‖<∞,limt→∞max1≤k,l≤Nα‖vαk(t)−vαl(t)‖=0,limt→∞max1≤k,l≤Nα|Tαk(t)−Tαl(t)|=0,n≥3,1≤α≤n,(iii)inft∈R+mink,l‖xαk−xβl‖=∞,1≤k≤Nα,1≤l≤Nβ,1≤α≠β≤n. |
Then, we are primarily concerned with the following issue:
● (Main issue): How can we find sufficient conditions for the non-emergence of mono-cluster flocking in the system (1.5)? Additionally, under what sufficient conditions with respect to the initial data and system parameters can mono-cluster flocking emerge in system (1.5)?
The paper is organized as follows. Section 2 introduces several basic estimates for temperatures in system (1.5) and previous results studied in [2]. Section 3 gives a mono-cluster flocking estimate different from the previous paper [3] and proves the non-emergence of mono-cluster flocking under suitable sufficient conditions when ϕ is integrable in system (1.5). Next, we describe several sufficient frameworks for the mono-cluster flocking of system (1.5) when the communication weight ϕ is non-integrable. Section 4 reorganizes system (1.5) to the multi-cluster setting and derives some dissipative structures on each cluster group to demonstrate the multi-cluster flocking of system (1.5) under admissible data. Finally, Section 5 briefly summarizes the main results and discusses the remaining issues left for future work.
Notation. Throughout the paper, we denote the following notation for brevity:
‖⋅‖=standardl2-norm,⟨⋅,⋅⟩=standard inner product,yi=i-th component ofy∈Rd,X:=(x1,⋯,xN),V:=(v1,⋯,vN),T:=(T1,⋯,TN),R+:=[0,∞),DZ(t):=max1≤i,j≤N‖zi(t)−zj(t)‖forZ=(z1,⋯,zN)∈{X,V,T}. |
This section reviews several basic results for the subsystem (1.5c) to guarantee its global well-posedness; these estimates will be crucial throughout this paper. Afterward, we introduce the previous bi-cluster flocking results of system (1.5) studied in [2].
This subsection deals with the entropy principle, the propagation of conserved quantity, and the uniform boundedness of temperature to the subsystem (1.5c). For this, we begin with defining the entropy of system (1.5).
Definition 2.1. [26,31] Let {(xi,vi,Ti)}Ni=1 be a solution to the system (1.5). Then, the entropy is defined as
S(t):=N∑i=1ln(Ti(t))=ln(N∏i=1Ti(t)). |
Then, we present the entropy principle and conserved temperature sum as below:
Proposition 2.1. [26,31] Assume that {(xi,vi,Ti)}Ni=1 is a solution to the system (1.5). Then, one has the following two assertions:
1. (Conserved temperature sum) The total sum ∑Ni=1Ti is conserved for t≥0.
N∑i=1Ti(t)=N∑i=1T0i=NT∞. |
2. (Entropy principle) Entropy S monotonically increases for t≥0:
dSdt=κ22NN∑i,j=1ζ(‖xj−xi‖)|1Ti−1Tj|2≥0. |
Subsequently, we offer the following uniform boundedness consisting of strictly positive lower and upper bounds for temperatures to the system (1.5):
Proposition 2.2. [26](Uniform boundedness for temperatures) Let Z={(xi,vi,Ti)}Ni=1 be a solution to system (1.5). Then, min1≤i≤NTi(t) monotonically increases and max1≤i≤NTi(t) monotonically decreases in time. In other words, for t≥0,
0<min1≤i≤NT0i=:T∞m≤Ti(t)≤max1≤i≤NT0i=:T∞M,i=1,⋯,N. |
Since Proposition 2.2 holds, ϕ,ζ are uniformly bounded, and the speed of each agent is unit. We directly obtain the well-posedness of system (1.5) from the standard Cauchy–Lipschitz theory.
This subsection introduces the previous mono-cluster flocking and bi-cluster flocking estimated in [2]. First, we revisit the following mono-cluster flocking of the system (1.5) verified in [3]:
Proposition 2.3. [2] (Mono-cluster flocking) Suppose that {(xi,vi,Ti)}Ni=1 is a global-in-time solution to the system (1.5) with the initial data {(x0i,v0i,T0i)}Ni=1 and assume that there exists a positive constant D∞X>0 that satisfies
D2V(0)<T∞mϕ(D∞X)2T∞MandDX(0)+2T∞MDV(0)κ1ϕ(D∞X)<D∞X. | (2.1) |
Then, we get that for t∈R+,
D2V(t)<2D2V(0)andDX(t)<D∞X, |
which yields the following mono-cluster flocking estimate of system (1.5) for t∈R+:
DV(t)≤DV(0)exp(−κ1ϕ(D∞X)2T∞M),DT(t)≤DT(0)exp(−κ2ζ(D∞X)(T∞M)2t). |
However, in Theorem 3.1, we can attain another mono-cluster flocking dynamics of system (1.5) by reducing the higher-order dissipative differential inequality in terms of velocity in Proposition 3.1 to a suitable lower-order inequality.
Subsequently, to describe the results of extending the mono-cluster flocking of Proposition 2.3 to bi-cluster flocking, we describe the admissible set (H) proposed in [2]; for two cluster groups Z1={(x1i,v1i,T1i)}N1i=1 and Z2={(x2j,v2j,T2j)}N2j=1, we set the following three configuration vectors:
Aα:=(aα1,⋯aαNα)α=1,2,whereA∈{X,V,T},a∈{x,v,T}andA:=(A1,A2). |
Next, for α∈{1,2}, we denote L∞ diameters regarding position-velocity-temperature for each cluster group
DXα:=max1≤i,j≤Nα‖xαi−xαj‖,DVα:=max1≤i,j≤Nα‖vαi−vαj‖,DTα:=max1≤i,j≤Nα|Tαi−Tαj| |
and we let
DX:=DX1+DX2,DV:=DV1+DV2,DT:=DT1+DT2. |
Then, the admissible set (H) in terms of a system parameter and initial data is given by
(H)=:{(X(0),V(0),T(0))∈R2dN×(R+−{0})N|(H0),(H1),(H2)and(H3)hold.} |
● (H0)(Basic notation): For simplicity, we set
Λ0:=2NT∞MDV(0)κ1min(N1,N2)ϕ(D∞X)+16N2(T∞M)2ϕ(r02)κ1(min(N1,N2))2(ϕ(D∞X))2T∞m+8NT∞M∫∞0ϕ(s+r02)dsmin(N1,N2)ϕ(D∞X)T∞m,r0:=min1≤i≤N1,1≤j≤N2(xk1i(0)−xk2j(0)),Λ1:=κ1min(N1,N2)ϕ(D∞X)2NT∞M,Λ2:=κ1N1NT∞mΛ1+κ1N2NT∞m∫∞0ϕ(s+r02)ds,Λ3:=κ1N2NT∞mΛ1+κ1N1NT∞m∫∞0ϕ(s+r02)ds,Λ4:=min(N1,N2)κ2ζ(D∞X)N(T∞M)2,Λ5:=2κ2(1T∞m−1T∞M). |
● (H1)(Well prepared conditions): There exists a strictly positive number D∞X>0 such that
D∞X>DX(0)+Λ0andϕis integrable(⟺∫∞0ϕ(s)ds<∞). |
● (H2)(Separated initial data): For k∈[d] fixed in H0, the initial data and system parameters are chosen to be properly partitioned as follows:
r0>0,vk1i(0)−Λ2>12,vk2j(0)+Λ3<−12. |
● (H3)(Small fluctuations and coupling strength): The perturbation of local velocity in each cluster group and the coupling strength are sufficiently small:
2κ1T∞m∫∞r02ϕ(s)ds<DV(0)≤√T∞mmin(N1,N2)ϕ(D∞X)2max(N1,N2)T∞M. |
When the admissible set (H) is assumed, the author of [2] verified the following bi-cluster flocking of system (1.5):
Proposition 2.4. [2] (Bi-cluster flocking) Suppose that Z1={(x1i,v1i,T1i)}N1i=1 and Z2={(x2j,v2j,T2j)}N2j=1 are a global-in-time solution to the bi-cluster dynamical system (1.5). Further, assume that the admissible set (H) is valid. Then, we can get the following bi-cluster flocking result in time.
1. min1≤i≤N1,1≤j≤N2‖x1i−x2j‖≥t+r02,DX(t)<D∞X.
2. DV(t)≤DV(0)exp(−Λ1t)+2κ1T∞mΛ1exp(−Λ12t)ϕ(r02)+2κ1T∞mΛ1ϕ(t+r02).
3. DT(t)≤DT(0)exp(−Λ4t)+Λ5exp(−Λ42t)ζ(r02)+Λ5ζ(t+r02).
In Section 4, we extend the sufficient frameworks for the bi-cluster flocking of Proposition 2.4 to the multi-cluster flocking result.
This section provides suitable sufficient frameworks for the mono-cluster flocking and gives sufficient conditions to guarantee the non-emergence of mono-cluster flocking to system (1.5) when ϕ is integrable. Finally, in the case of system (1.5) under non-integrable ϕ, we present a sufficient condition independent of coupling strength for mono-cluster flocking to arise.
This subsection recalls a dissipative structure for position-velocity-temperature L∞-diameters derived in [2] and gives a mono-cluster flocking result different from Proposition 2.3 which is the mono-cluster flocking of system (1.5) proven in [2]. For this, we begin with the following dissipative inequalities for system (1.5):
Proposition 3.1. [2] Suppose that {(xi,vi,Ti)}Ni=1 is a solution to the system (1.5). Then, we have that for a.e. t∈R+−{0},
|dDXdt|≤DV,dDVdt≤−κ1(ϕ(DX)T∞M−D2V2T∞m)DV,dDTdt≤−κ2ζ(DX)(T∞M)2DT. |
Now, we are ready to study the new mono-cluster flocking result of system (1.5).
Theorem 3.1. (Mono-cluster flocking) Assume that {(xi,vi,Ti)}Ni=1 is a solution to the system (1.5). Suppose that there exists a nonnegative number D∞X∈R+ such that the following conditions hold:
D2V(0)<2ϕ(D∞X)T∞mT∞M,DX(0)−√T∞MT∞mκ1√2ϕ(D∞X)log(2ϕ(D∞X)T∞m−T∞MD2V(0)(√2ϕ(D∞X)T∞m+√T∞MDV(0))2)≤D∞X. | (3.1) |
Then, we attain the following assertions for t∈R+:
1. DX(t)≤D∞X,
2. DV(t)≤(T∞M2ϕ(D∞X)T∞m+(1D2V(0)−T∞M2ϕ(D∞X)T∞m)exp(2κ1ϕ(D∞X)tT∞M))−12,
3. DT(t)≤DT(0)exp(−κ2ζ(D∞X)(T∞M)2t).
Proof. (i) (The case of DV(t)>0 for t∈R+) First, we set g(t) as
g(t)=1D2V(t). |
It follows from the second assertion of Proposition 3.1 that
dg(t)dt≥2κ1T∞Mϕ(DX(t))g(t)−κ1T∞m,a.e.t∈R+−{0}. | (3.2) |
Due to inequality (3.1) and the continuity of DX, the following set:
S:={s>0|(1) holds fort∈(0,s)} |
is nonempty and we denote t∗:=supS>0. Next, we claim that
t∗=+∞. |
For the proof by contradiction, suppose that t∗<∞. Then, we can obtain from inequality (3.2) and the definition of S that
dg(t)dt≥2κ1T∞Mϕ(D∞X)g(t)−κ1T∞m,a.e.t∈(0,t∗). |
Moreover, using Grönwall's lemma with the above inequality yields that
g(t)≥T∞M2ϕ(D∞X)T∞m+(g(0)−T∞M2ϕ(D∞X)T∞m)exp(2κ1ϕ(D∞X)tT∞M),t∈[0,t∗]. |
This induces that for t∈[0,t∗],
DV(t)≤(T∞M2ϕ(D∞X)T∞m+(1D2V(0)−T∞M2ϕ(D∞X)T∞m)exp(2κ1ϕ(D∞X)tT∞M))−12. | (3.3) |
Accordingly, we combine inequality (3.3) with the first assertion of Proposition 3.1 to estimate that for t∈[0,t∗],
DX(t)≤DX(0)+∫t0DV(s)ds≤DX(0)+∫t0(T∞M2ϕ(D∞X)T∞m+(1D2V(0)−T∞M2ϕ(D∞X)T∞m)exp(2κ1ϕ(D∞X)sT∞M))−12ds<DX(0)+∫∞0(T∞M2ϕ(D∞X)T∞m+(1D2V(0)−T∞M2ϕ(D∞X)T∞m)exp(2κ1ϕ(D∞X)sT∞M))−12ds=DX(0)−√T∞MT∞mκ1√2ϕ(D∞X)log(2ϕ(D∞X)T∞m−T∞MD2V(0)(√2ϕ(D∞X)T∞m+√T∞MDV(0))2)≤D∞X, |
which contradicts to t∗<∞. Therefore, t∗=∞ and for t∈R+,
DX(t)≤D∞X. | (3.4) |
Hence, one has for t∈R+,
DV(t)≤(T∞M2ϕ(D∞X)T∞m+(1D2V(0)−T∞M2ϕ(D∞X)T∞m)exp(2κ1ϕ(D∞X)tT∞M))−12. |
In addition, because the third assertion of Proposition 3.1 and inequality (3.4) hold, we derive that for a.e. t∈R+−{0},
dDTdt≤−κ2ζ(DX)(T∞M)2DT≤−κ2ζ(D∞X)(T∞M)2DT, |
which implies that for t∈R+,
DT(t)≤DT(0)exp(−κ2ζ(D∞X)(T∞M)2). |
(ii) (The case of DV(t)=0 for some t∈R+) We define s∗ by
s∗:=inf{t∈R+|DV(t)=0}. |
Then, s∗∈R+ and applying the Cauchy–Lipschitz theory implies that
DV(t)=0,t≥s∗. |
Finally, if we follow the arguments employed in the first case, we immediately reach the desired mono-cluster flocking estimate.
Before we end this subsection, we provide the following remark:
Remark 3.1. Although T∞mϕ(D∞X)2T∞M of Eq (2.1) and 2ϕ(D∞X)T∞mT∞M of Eq (3.1) satisfy the following inequality for D∞X≥0:
T∞mϕ(D∞X)2T∞M≤2ϕ(D∞X)T∞mT∞M, |
but the following term diverges to −∞ when 2ϕ(D∞X)T∞m and T∞MD2V(0) are close to each other in Eq (3.1):
log(2ϕ(D∞X)T∞m−T∞MD2V(0)(√2ϕ(D∞X)T∞m+√T∞MDV(0))2). |
Thus, it is unknown which of Proposition 2.3 and Theorem 3.1 yields better mono-cluster flocking result.
This subsection guarantees the non-emergence of mono-cluster flocking of the system (1.5) with integrable ϕ and sufficient small κ1. For this, we employ the main strategies implemented in [29] for the targeted system (1.5).
This subsubsection offers basic notations and preliminary estimates to show the non-emergence of the mono-cluster flocking of system (1.5) when ϕ is integrable. First, we consider the following subdivided n≥2 configurations {Z0α}nα=1 of Z0={(x0i,v0i,T0i)}Ni=1 satisfying
(x0αi,v0αi,T0αi),(x0αj,v0αj,T0αj)∈Z0α⟺v0αi=v0αj, |
where
|Z0α|=:Nα≥1,Z0=˙∪nα=1Z0α. |
In other words, we primarily deal with the initial configuration Z0 that is not in a mono-cluster flocking state. Subsequently, we reorganize the system (1.5) to distinguish the n-dynamics initiated from n-subdivided initial configurations Z0α as follows:
{dxαidt=vαi,t>0,i=1,⋯,Nα,α=1,⋯,n,n≥2,dvαidt=κ1NNα∑j=1ϕ(‖xαi−xαj‖)(vαj−⟨vαj,vαi⟩vαiTαj)+κ1N∑β≠αNβ∑j=1ϕ(‖xαi−xβj‖)(vβj−⟨vβj,vαi⟩vαiTβj),dTαidt=κ2NNα∑j=1ζ(‖xαi−xαj‖)(1Tαi−1Tαj)+κ2N∑β≠αNβ∑j=1ζ(‖xαi−xβj‖)(1Tαi−1Tβj),(xαi(0),vαi(0),Tαi(0))=(x0αi,v0αi,T0αi)∈Rd×Sd−1×(R+−{0}). | (3.5) |
In the following, we denote local averages and local deviations for α=1,⋯,n
xcenα=1NαNα∑i=1xαi,vcenα=1NαNα∑i=1vαi,ˆxαi:=xαi−xcenα,ˆvαi:=vαi−vcenα, |
and we set the following notation to estimate the degree of separation between n-subdivided initial configuration sets {Z0α}nα=1.
D(x0):=maxα≠β,i,j‖x0αi−x0βj‖,θ0:=minα≠βarccos⟨vcenα(0),vcenβ(0)⟩,λ0:=min(cos((δ+ϵ)θ0)−cos((1−4δ−ϵ)θ0),cos(δθ0)−cos((1−δ)θ0)−(D(x0)+2T0)⋅(N−1)κ1NT∞m), |
where two auxiliary parameters ϵ,δ ∈(0,1) will be specified later such that λ0>0 in Section 3.2.2 and we define T0 as
T0:=maxα≠β,i,j{0,−⟨x0αi−x0βj,vcenα(0)⟩λ0}. |
We observe that D(x0), θ0 and λ0 are dependent on given initial data non-mono-cluster flocking state. As we will see later, T0 is indeed the time when two agents belonging to different cluster groups begin to move away from each other linearly and λ0 is needed to estimate T0. For the detailed descriptions, see Section 3.2.2.
Next, we set the coupling strength ˜κ0 dependent on given initial data Z0={(x0i,v0i)}Ni=1 of the system (1.5) as follows:
(i) (The case of minα≠β,i,j⟨(x0αi−x0βj),vcenα⟩<0): We define ˜κ0 as
˜κ0=min(NT∞m(1−cos(δθ0))2(N−1)T0,NT∞m(cos(δθ0)−cos((1−δ)θ0)−λ0)(N−1)(D(x0)+2T0),λ0(cos(δθ0)−cos((δ+ϵ)θ0))(1−γN)∫∞0ϕ(s)ds),whereγN:=minαNαN. |
(ii) (The case of minα≠β,i,j⟨(x0αi−x0βj),vcenα⟩≥0): We define ˜κ0 as
˜κ0=˜λ0(1−cos(˜δθ0))(1−γN)∫∞0ϕ(s)ds,where˜λ0:=cos(˜δθ0)−cos((1−˜δ)θ0). |
Herein, an auxiliary parameter ˜δ∈(0,1) will be determined such that ˜λ0>0 later in Section 3.2.2.
Finally, we present the definitions of △αi,βj(t) and vminα, which will be crucially used to verify the non-emergence of mono-cluster flocking in the system (1.5). We let
△αi,βj(t):=⟨xαi(t)−xβj(t),vcenα(t)⟩,vminα:=min1≤i≤Nα⟨vαi(t),eα(T0)⟩, |
where eα(t):=vcenα(t)‖vcenα(t)‖. Note that △αi,βj(t) shows how well Zα(t) and Zβ(t) are separated from each other at time t. Therefore, rigorous estimates concerning △αi,βj(t) are important to obtain the non-emergence of mono-cluster flocking in the system (1.5).
In what follows, we demonstrate the non-emergence of the mono-cluster flocking of the TCSUS system (1.5). For this, we assume that T0>0 throughout the subsubsection. If otherwise, it is a trivial case when T0=0 (see Theorem 3.2). Now, we begin with the following preparatory lemmas:
Lemma 3.1. Suppose that Zα is a solution to the system (3.5) with given initial data Z0α that is a non-mono-cluster flocking state for each α∈{1,⋯,n}. Assume that there exists a positive number δ∈(0,13) such that
0<κ1<NT∞m(1−cos(δθ0))2(N−1)T0. |
Then, one has for t∈[0,T0] and α≠β,
1. ⟨vαi,vcenα⟩>cos(δθ0),⟨vβj,vcenα⟩<cos((1−δ)θ0),
2. ⟨vαi,vβj⟩<cos((1−δ)θ0),⟨eα,eβ⟩<cos((1−3δ)θ0).
Proof. To estimate the first assertion of (1), we first see that
dvαidt=κ1NN∑j=1ϕ(‖xαi−xj‖)(vj−⟨vj,vαi⟩vαiTj)=κ1NN∑j≠αiϕ(‖xαi−xj‖)(vj−⟨vj,vαi⟩vαiTj). |
Then, the triangle inequality and ϕ≤1 yield that
‖dvαidt‖≤(N−1)κ1NT∞m, |
where we used Proposition 2.2 and ‖vj−⟨vj,vαi⟩vαi‖≤1. Thus, it follows that
|ddt⟨vαi,vcenα⟩|≤2(N−1)κ1NT∞m, |
which implies by the condition for κ1 and construction of Z0α that for t∈[0,T0],
⟨vαi(t),vcenα(t)⟩=⟨vαi(0),vcenα(0)⟩+∫t0dds⟨vαi(s),vcenα(s)⟩ds≥⟨vαi(0),vcenα(0)⟩−2(N−1)κ1T0NT∞m=1−2(N−1)κ1T0NT∞m>cos(δθ0). |
To prove the second assertion of (1), we employ the same method as in the proof of the first assertion of (1) as follows:
‖dvβjdt‖≤(N−1)κ1NT∞mand then, |ddt⟨vβj,vcenα⟩|≤2(N−1)κ1NT∞m. |
From the definitions of Z0α and θ0, we get that for t∈[0,T0],
⟨vβj,vcenα⟩≤⟨vβj(0),vcenα(0)⟩+2(N−1)κ1T0NT∞m=⟨vcenβ(0),vcenα(0)⟩+2(N−1)κ1T0NT∞m≤cos(θ0)+2(N−1)κ1T0NT∞m≤cos(θ0)+1−cos(δθ0)<cos((1−δ)θ0), |
where we used the assumption for κ1. Next, following the proof of (1), we can also attain the first assertion of (2) for t∈[0,T0]:
⟨vαi,vβj⟩<cos((1−δ)θ0). |
Finally, to verify the second assertion of (2), we combine (1) and the first assertion of (2) to attain that for t∈[0,T0],
arccos(⟨eα,eβ⟩)≥−arccos(⟨eα,vαi⟩)+arccos(⟨vαi,vβj⟩)−arccos(⟨vβj,eβ⟩)>(1−δ)θ0−2δθ0=(1−3δ)θ0. |
Therefore, ⟨eα,eβ⟩<cos((1−3δ)θ0) for t∈[0,T0] and we conclude this lemma.
The following lemma plays a key role in deriving the desired result:
Lemma 3.2. Let Zα be a solution to the system (3.5) with given initial data Z0α that is a non-mono-cluster flocking state for each α=1,⋯,n. Suppose that there exists a positive number δ∈(0,13) such that
0<κ1<min(NT∞m(1−cos(δθ0))2(N−1)T0,NT∞m(cos(δθ0)−cos((1−δ)θ0)−λ0)(N−1)(D(x0)+2T0)),λ0>0. |
Then, we obtain that
minα≠β,i,j△αi,βj(T0)>0. |
Proof. First, we note that
‖xαi(t)−xβj(t)‖=‖xαi(0)−xβj(0)+∫t0(vαi(s)−vβj(s))ds‖≤D(x0)+2T0. |
Hence, we have from the arguments studied in Lemma 3.1 and the definition of λ0 that
ddt△αi,βj=⟨vαi,vcenα⟩−⟨vβj,vcenα⟩+⟨xαi−xβj,˙vcenα⟩>cos(δθ0)−cos((1−δ)θ0)−(D(x0)+2T0)(N−1)κ1NT∞m≥λ0>0, |
which leads to the following result using the definition of T0:
△αi,βj(t)>△αi,βj(0)+λ0tand thus, △αi,βj(T0)>△αi,βj(0)+λ0T0>0. |
From the above relation, we take minα≠β,i,j to derive that
minα≠β,i,j△αi,βj(T0)>0. |
We reach the desired lemma.
Subsequently, to prove the main result using the bootstrapping argument, we denote ˉT0
ˉT0:=sup{t∈(T0,∞)|minα,i⟨vαi(s),eα(T0)⟩>cos((δ+ϵ)θ0),s∈[T0,t)}, |
where an auxiliary parameter ϵ∈(0,1) will be determined in Lemma 3.3. Here, we observe from Lemma 3.2 that eα(T0) is well-defined. In addition, ˉT0 is well-defined due to Lemma 3.1. Indeed,
⟨vαi(T0),eα(T0)⟩>cos(δθ0)>cos((δ+ϵ)θ0). |
From now on, we claim that
ˉT0=∞. |
Lemma 3.3. Assume that Zα is a solution to the system (3.5) given initial data Z0α that is a non-mono-cluster flocking state for each α=1,⋯,n. Suppose that there exist positive numbers ϵ and δ that satisfy
0<δ<1−2ϵ5,ϵ∈(0,12),0<κ1<NT∞m(1−cos(δθ0))2(N−1)T0,λ0>0. |
Then, for t∈[T0,ˉT0],
maxα,β,j⟨vβj,eα(T0)⟩<cos((1−4δ−ϵ)θ0),minα≠β,i,j⟨vαi−vβj,eα(T0)⟩>λ0. |
Proof. To get the first assertion, from the definition of ˉT0 and Lemma 3.1, we estimate that
arccos(⟨vβj,eα(T0)⟩)≥arccos(⟨eβ(T0),eα(T0)⟩)−arccos(⟨vβj,eβ(T0)⟩)>(1−3δ)θ0−(δ+ϵ)θ0=(1−4δ−ϵ)θ0. |
This leads us to deduce that
maxα,β,j⟨vβj,eα(T0)⟩<cos((1−4δ−ϵ)θ0). |
Additionally, the definition of ˉT0 and the first assertion yield that
minα≠β,i,j⟨(vαi−vβj),eα(T0)⟩>cos((δ+ϵ)θ0)−cos((1−4δ−ϵ)θ0)≥λ0. |
We need the following lemma to verify that ˉT0=∞:
Lemma 3.4. Let Zα be a solution to the system (3.5) given initial data Z0α that is a non-mono-cluster flocking state for each α=1,⋯,n. Assume that there exist positive numbers ϵ and δ that satisfy 0<δ<1−2ϵ5,ϵ∈(0,12), and
0<κ1<min(NT∞m(1−cos(δθ0))2(N−1)T0,NT∞m(cos(δθ0)−cos((1−δ)θ0)−λ0)(N−1)(D(x0)+2T0)),λ0>0. |
Then, we reach that
ϕM(t):=maxα≠β,i,jϕ(‖xβj−xαi‖)≤ϕ(λ0(t−T0)),t∈[T0,ˉT0). |
Proof. By applying Lemma 3.2 and Lemma 3.3, we induce that for t∈[T0,ˉT0),
‖xαi−xβj‖≥⟨(xαi−xβj),eα(T0)⟩=⟨(xαi(T0)−xβj(T0)),eα(T0)⟩+∫tT0⟨(vαi(s)−vβj(s)),eα(T0)⟩ds>∫tT0⟨(vαi(s)−vβj(s)),eα(T0)⟩ds>λ0(t−T0). |
Then, this leads to the following result for t∈[T0,ˉT0) due to the monotonicity of ϕ:
ϕM(t):=maxα≠β,i,jϕ(‖xβj−xαi‖)≤ϕ(λ0(t−T0)). |
Hence, we conclude the desired lemma.
Subsequently, we estimate the time derivative of vminα to demonstrate the main result.
Lemma 3.5. Let Zα be a solution to the system (3.5) given initial data Z0α that is a non-mono-cluster flocking state for each α=1,⋯,n. Then, for α=1,⋯,n, it follows that for t∈[T0,ˉT0),
˙vminα≥−κ1(1−γN)ϕMT∞m. |
Proof. First, we fix α∈{1,⋯,n}; then, we select index iα:=iα(t)∈{1,⋯,Nα} at time t such that
vminα=⟨vαiα,eα(T0)⟩. |
Then, if we use system (3.5), Proposition 2.2, and the definitions of iα and ˉT0, we obtain that
˙vminα=⟨˙vαiα,eα(T0)⟩=κ1NNα∑j=1⟨ϕ(‖xαiα−xαj‖)(vαj−⟨vαj,vαiα⟩vαiαTαj),eα(T0)⟩+κ1N∑β≠αNβ∑j=1⟨ϕ(‖xαiα−xβj‖)(vβj−⟨vβj,vαiα⟩vαiαTβj),eα(T0)⟩≥κ1N∑β≠αNβ∑j=1⟨ϕ(‖xαiα−xβj‖)(vβj−⟨vβj,vαiα⟩vαiαTβj),eα(T0)⟩≥−κ1ϕMT∞m⋅(N−Nα)N≥−κ1(1−γN)ϕMT∞m, |
where we employed
‖vβj−⟨vβj,vαiα⟩vαiα‖≤1. |
Thus, we get the desired lemma.
Finally, we are ready to study the non-emergence of the mono-cluster flocking of system (3.5) under the integrable communication weight ϕ, i.e.,
‖ϕ‖L1=∫∞0ϕ(s)ds<∞. |
Theorem 3.2. (Non-emergence of mono-cluster flocking) Assume that Zα is a solution to the system (3.5) with given initial data Z0α that is a non-mono-cluster flocking state for each α=1,⋯,n. Suppose that T0>0 and there exist positive numbers ϵ and δ that satisfy 0<δ<1−2ϵ5 and ϵ∈(0,12) such that
0<κ1<˜κ0,λ0>0. |
Then, we attain that
minα≠β,i,jsupt∈R+‖xαi−xβj‖=∞,minα≠β,i,jlim inft→∞‖vαi−vβj‖>0. |
Meanwhile, when T0=0, we let ˜λ>0 and ˜δ∈(0,12). Then, we can reach the same results as above.
Proof. To demonstrate the desired results, we divide them by the following dichotomy:
T0>0orT0=0. |
(i)(The case ofT0>0) For the proof by contradiction, suppose that ˉT0<∞. Then, there exist α∈{1,⋯,n} and iα∈{1,⋯,Nα} such that
⟨vαiα(ˉT0),eα(T0)⟩=cos((δ+ϵ)θ0). |
Then, we use Lemmas 3.1, 3.4 and 3.5 to obtain that for t∈[T0,ˉT0],
⟨vαiα,eα(T0)⟩≥vminα≥vminα(T0)−κ1(N−Nα)NT∞m∫tT0ϕM(s)ds≥cos(δθ0)−κ1(N−Nα)NT∞mλ0‖ϕ‖L1≥cos(δθ0)−κ1(1−γN)T∞mλ0‖ϕ‖L1>cos((δ+ϵ)θ0), |
which gives a contradiction; therefore, ˉT0=∞. Then, the second assertion of Lemmas 3.3 and 3.4 with ˉT0=∞ yield the desired result.
(ii)(The case ofT0=0) This case is trivial, but we provide the proof rigorously to compare with the proof regarding the first assertion. Let
T∗0:=sup{t∈R+−{0}|minα,i⟨vαi,eα(0)⟩>cos(˜δθ0),t∈[0,t)},where˜δ∈(0,12). |
It follows from the definition of Zα that T∗0>0 exists. For the proof by contradiction, suppose that T∗0<∞. Next, we employ the same method as utilized in proof of the first assertion of Lemma 3.1 to estimate that
⟨vβj(t),eα(0)⟩<cos(1−˜δ)θ0,t∈[0,T∗0). |
Hence, we have
minα≠β,i,j⟨vαi(t)−vβj(t),eα(0)⟩>cos(˜δθ0)−cos((1−˜δ)θ0)=:˜λ0>0. |
Then, similarly to the proof of Lemma 3.4, one can show that
ϕM(t)≤ϕ(˜λ0t),t∈[0,T∗0] |
and thus, for t∈[0,T∗0), we can get the following estimates using the same methodologies as in the proof of Lemma 3.5:
⟨vαiα,eα(0)⟩≥vminα≥vminα(0)−κ1(N−Nα)NT∞m∫t0ϕM(s)ds=1−κ1(N−Nα)NT∞m∫t0ϕM(s)ds≥1−κ1(N−Nα)NT∞mλ0‖ϕ‖L1>cos(˜δθ0), |
which leads to a contradiction. Therefore, T∗0=∞. Finally, if the arguments of Lemmas 3.3 and 3.4 are applied to the case of T0=0, we conclude the desired result.
This subsection demonstrates a different sufficient framework than Section 3.1 for mono-cluster flocking to emerge in the system (1.5) when ϕ is non-integrable by using the previous results of [3].
Proposition 3.2. [3] Let {(xi,vi,Ti)}Ni=1 be a solution to the system (1.5) such that
A(v)(0):=min1≤i,j≤N⟨v0i,v0j⟩>0,DV(0)<κ1A(v)(0)T∞M∫∞DX(0)ϕ(s)ds. |
Then, there exists a nonnegative number D∞X∈R+ satisfying for t∈R+,
1. (Group formation) DX(t)≤D∞X,
2. (Velocity alignment) DV(t)≤DV(0)exp(−κ1A(v)(0)ϕ(D∞X)T∞Mt),
3. (Temperature equilibrium) DT(t)≤DT(0)exp(−κ2ζ(D∞X)(T∞M)2t).
Proof. We employ the same methodologies as the proofs of Lemma 3.1 and Theorem 3.2 in [3] to obtain the desired result. Although the previous paper [3] dealt with the singular communication weight ϕ to system (1.5), the proofs of Lemma 3.1 and Theorem 3.2 in [3] can be applied, even assuming the regular communication weight case covered in this paper.
Due to Proposition 3.2, we note the following remark.
Remark 3.2. It is easy to check that we can remove the condition,
DV(0)<κ1A(v)(0)T∞M∫∞DX(0)ϕ(s)ds, |
when ϕ is non-integrable. In other words, when ϕ is non-integrable, the mono-cluster flocking of the system (1.5) emerges under the only assumption A(v)(0)>0.
Finally, we present the following mono-cluster flocking of system (1.5) under non-integrable ϕ:
Theorem 3.3. (Mono-cluster flocking under non-integrable ϕ) Assume that {(xi,vi,Ti)}Ni=1 is a solution to the system (1.5) under non-integrable ϕ and suppose that
A(v)(0):=min1≤i,j≤N⟨v0i,v0j⟩>0. |
Then, there exists a nonnegative number D∞X∈R+ such that for t∈R+,
1. (Group formation) DX(t)≤D∞X,
2. (Velocity alignment) DV(t)≤DV(0)exp(−κ1A(v)(0)ϕ(D∞X)T∞Mt),
3. (Temperature equilibrium) DT(t)≤DT(0)exp(−κ2ζ(D∞X)(T∞M)2t).
This section provides several sufficient frameworks for the multi-cluster flocking of the system (1.5). In Section 3, we studied that mono-cluster flocking does not occur when the coupling strength κ1 is less than a certain positive value in system (1.5) with integrable ϕ. In Section 3.2.1, we employed suitable subdivided configurations, {Z0α}nα=1, so that all initial velocities are equal to each other in each group and deduced some sufficient conditions guaranteeing the non-emergence of the mono-cluster flocking of the system. Accordingly, we may wonder what the sufficient conditions are for multi-cluster flocking to occur, so it is necessary to check how little coupling strength is required for multi-cluster flocking to occur in system (1.5). To achieve this, we reorganize the system (1.5) under integrable ϕ to a multi-cluster setting and then derive suitable dissipative differential inequalities with respect position–velocity–temperature. Finally, using bootstrapping arguments for these inequalities, we deduce appropriate sufficient conditions in terms of the initial data and system parameters to guarantee the mono-cluster flocking of system (1.5). As a direct consequence, we also prove that the velocity and temperature of all agents in each cluster group converge to the same values.
This subsection converts the TCSUS model (1.5) into some multi-cluster setting. Afterward, we present basic estimates for the averages of position-velocity-temperature. For this, we begin by reorganizing the system (1.5) to the following multi-cluster setting:
dxαidt=vαi,t>0,i∈{1,⋯,Nα},α∈{1,⋯,n},n≥3, | (4.1a) |
˙vαi=κ1NNα∑j=1ϕ(‖xαi−xαj‖)(vαj−⟨vαi,vαj⟩vαi)Tαj | (4.1b) |
+κ1N∑β≠αNβ∑j=1ϕ(‖xαi−xβj‖)(vβj−⟨vαi,vβj⟩vαi)Tβj, | (4.1c) |
˙Tαi=κ2NNα∑j=1ζ(‖xαi−xαj‖)(1Tαi−1Tαj)+κ2N∑β≠αNβ∑j=1ζ(‖xαi−xβj‖)(1Tαi−1Tβj), | (4.1d) |
(xαi(0),vαi(0),Tαi(0))∈Z0α×T0αi⊂Rd×Sd−1×(R+−{0}). | (4.1e) |
For each cluster group Zα={(xαi,vαi,Tαi)}Nαi=1, we denote the following three configuration vectors:
Aα:=(aα1,⋯aαNα),1≤α≤n,whereA∈{X,V,T},a∈{x,v,T},A:=(A1,⋯,Aα). |
Next, we define position-velocity-temperature L∞-diameters to each cluster group as follows:
(i) (The position-velocity-temperature diameters to the α-th cluster group)
DXα:=max1≤i,j≤Nα‖xαi−xαj‖,DVα:=max1≤i,j≤Nα‖vαi−vαj‖,DTα:=max1≤i,j≤Nα|Tαi−Tαj|. |
(ii) (The local averages of velocity and temperature in each cluster group)
vcenα:=1NαNα∑i=1vαi,Tcenα:=1NαNα∑i=1Tαi. |
Before we end this subsection, we offer the following lemma regarding the local averages of velocity and temperature for each cluster group. This lemma will be crucially used to prove that the velocity and temperature of all agents in each cluster group converges to some unified values.
Lemma 4.1. Assume that Zα={(xαi,vαi,Tαi)}Nαi=1 is a solution to the system (4.1). Then, each local average (xcenα,vcenα,Tcenα) satisfies the following relations:
{dxcenαdt=vcenα,t>0,α∈{1,⋯,n},n≥3,Nα˙vcenα=κ1NNα∑i=1Nα∑j=1ϕ(‖xαi−xαj‖)vαi‖vαj−vαi‖22Tαj+κ1N∑β≠αNα∑i=1Nβ∑j=1ϕ(‖xαi−xβj‖)(vβj−vαi+vαi‖vβj−vαi‖22)1Tβj,Nα˙Tcenα=κ2N∑β≠αNα∑i=1Nβ∑j=1ζ(‖xαi−xβj‖)(1Tαi−1Tβj). |
Proof. The first assertion is trivial. For the second assertion, we take ∑Nαi=1 to ˙vαi and use the standard trick of interchanging i and j and dividing 2 and
1−⟨vαi,vαj⟩=‖vαi−vαj‖22. |
For the third assertion, we take ∑Nαi=1 to ˙Tαi and again use the standard trick as above.
In the following, we derive several dissipative differential inequalities with respect to position–velocity–temperature to obtain suitable sufficient frameworks in terms of system parameters and initial data for the multi-cluster flocking of system (4.1). For this, we define
DX:=n∑α=1DXα,DV:=n∑α=1DVα,DT:=n∑α=1DTα. |
Note that the above diameter functionals DX, DV and DT measure the total deviations of position, velocity and temperature to each cluster group Zα, respectively.
To reduce the TCSUS system (4.1) to its appropriate dissipative structure, we employ the following functionals: For α=1,⋯,n,
Φαij(t):=ϕ(‖xαi−xαj‖)Nα+(1−Nα∑j=1ϕ(‖xαi−xαj‖)Nα)δij, |
where δij denotes the Kronecker delta. Next, for simplicity, we set
ϕαij:=ϕ(‖xαi−xαj‖). |
Then, we can easily check that Φαij satisfies the following properties:
1. Φαij≥ϕαijNα,Nα∑j=1Φαij=1,Φαij=Φαji,
2. Nα∑j=1Φαij(vαj−⟨vαj,vαi⟩vαi)Tαj=Nα∑j=1ϕαijNα(vαj−⟨vαj,vαi⟩vαi)Tαj.
Similarly, we can observe that the functional Ψαij defined by
Ψαij(t):=ζ(‖xαi−xαj‖)Nα+(1−∑Nαj=1ζ(‖xαi−xαj‖)Nα)δij,ζαij:=ζ(‖xαi−xαj‖) |
satisfies the following relations:
1. Ψαij≥ζαijNα,Nα∑j=1Ψαij=1,Ψαij=Ψαji,
2. Nα∑j=1Ψαij(1Tαi−1Tαj)=Nα∑j=1ζαijNα(1Tαi−1Tαj).
We note that the above functionals of this type have already been used several times in previous literature [2,6,25,27,28]. Unlike the aforementioned previous papers, the above functionals can be applied to a multi-cluster setting.
In what follows, we induce dissipative differential inequalities in terms of DX, DV and DT, respectively, to deduce several sufficient frameworks for the multi-cluster flocking estimate of system (4.1).
Lemma 4.2. (Dissipative structure) Suppose that Zα={(xαi,vαi,Tαi)}Nαi=1 is a solution to the system (4.1). If we set ϕM and ζM as
ϕM(t):=maxα≠β,i,jϕ(‖xβj−xαi‖),ζM(t):=maxα≠β,i,jζ(‖xβj−xαi‖). |
Then, we have the following three differential inequalities for a.e. t∈R+−{0}:
1. |dDXdt|≤DV,
2. dDVdt≤−κ1min(N1,⋯,Nα)ϕ(DX)NT∞MDV+κ1max(N1,⋯,Nα)D3V2NT∞m+2κ1(n−1)ϕMT∞m,
3. dDTdt≤−κ2min(N1,⋯,Nα)ζ(DX)N(T∞M)2DT+2κ2(n−1)ζM(1T∞m−1T∞M).
Proof. Cauchy–Schwarz's inequality immediately yields the first assertion. Next, to prove the third assertion, we choose two indices, Mt and mt, depending on t, such that
DTα(t)=TαMt(t)−Tαmt(t),1≤mt,Mt≤Nα. |
Now, we recall the subsystem (4.1c) as follows:
˙Tαi=κ2NNα∑j=1ζ(‖xαi−xαj‖)(1Tαi−1Tαj)+κ2N∑β≠αNβ∑j=1ζ(‖xαi−xβj‖)(1Tαi−1Tβj). |
Then, for a.e. t∈R+−{0}, one can show that by using the definitions of Mt and mt
dDTαdt=κ2NNα∑j=1ζ(‖xαMt−xαj‖)(1TαMt−1Tαj)−κ2NNα∑j=1ζ(‖xαmt−xαj‖)(1Tαmt−1Tαj)+κ2N∑β≠αNβ∑j=1ζ(‖xαMt−xβj‖)(1TαMt−1Tβj)−κ2N∑β≠αNβ∑j=1ζ(‖xαmt−xβj‖)(1Tαmt−1Tβj)=:I1+I2+I3+I4. |
(i) (Estimate of I1+I2) Similar to the proof of Lemma 3.2 in [2], for a.e. t∈R+−{0},
I1+I2≤−κ2Nαζ(DXα)N(T∞M)2DTα. |
(ii) (Estimate of I3+I4) From Proposition 2.2 and the definitions of ϕM and ϕm, for a.e. t∈R+−{0},
I3+I4≤κ2N|∑β≠αNβ∑j=1ζ(‖xαMt−xβj‖)(1TαMt−1Tβj)|+κ2N|∑β≠αNβ∑j=1ζ(‖xαmt−xβj‖)(1Tαmt−1Tβj)|≤2κ2(N−Nα)ζMN(1T∞m−1T∞M). |
Thus, combining I1+I2 and I3+I4 yields that for a.e. t∈R+−{0},
dDTαdt≤−κ2Nαζ(DXα)N(T∞M)2DTα+2κ2(N−Nα)ζMN(1T∞m−1T∞M). |
Therefore, we take the summation from α = 1 to n to the above inequality to get that for a.e. t∈R+−{0},
dDTdt≤−κ2min(N1,⋯,Nα)ζ(DX)N(T∞M)2DT+2κ2(n−1)ζM(1T∞m−1T∞M). |
To verify the second assertion, we select two indices Mt and mt depending on t satisfying
DVα(t)=‖vαMt(t)−vαmt(t)‖,1≤mt,Mt≤Nα. |
We recall the following velocity coupling Eq (4.1b):
˙vαi=κ1NNα∑j=1ϕ(‖xαi−xαj‖)(vαj−⟨vαi,vαj⟩vαi)Tαj+κ1N∑β≠αNβ∑j=1ϕ(‖xαi−xβj‖)(vβj−⟨vαi,vβj⟩vαi)Tβj. |
Hence, we attain that for a.e. t∈R+−{0},
12dD2Vαdt=⟨vαMt−vαmt,˙vαMt−˙vαmt⟩=⟨vαMt−vαmt,κ1NNα∑j=1ϕαMtj(vαj−⟨vαMt,vαj⟩vαMtTαj)−κ1NNα∑j=1ϕαmtj(vαj−⟨vαmt,vαj⟩vαmtTαj)⟩+⟨vαMt−vαmt,κ1N∑β≠αNβ∑j=1ϕ(‖xαMt−xβj‖)(vβj−⟨vαMt,vβj⟩vαMtTβj)−κ1N∑β≠αNβ∑j=1ϕ(‖xαmt−xβj‖)(vβj−⟨vαmt,vβj⟩vαmtTβj)⟩=:J1+J2. |
(iii) (Estimate of J1) In the same way as the proof of Lemma 3.2 of [2], for a.e. t∈R+−{0},
J1≤−κ1NαN(ϕ(DXα)T∞M−D2Vα2T∞m)D2Vα. |
(iiii) (Estimate of J2) We employ the following identities:
‖vβj−⟨vαMt,vβj⟩vαMt‖≤1,‖vβj−⟨vαmt,vβj⟩vαmt‖≤1 |
with Cauchy–Schwarz's inequality and Proposition 2.2 to estimate that for a.e. t∈R+−{0},
J2≤κ1DVαN‖∑β≠αNβ∑j=1ϕ(‖xαMt−xβj‖)(vβj−⟨vαMt,vβj⟩vαMtTβj)‖+κ1DVαN‖∑β≠αNβ∑j=1ϕ(‖xαmt−xβj‖)(vβj−⟨vαmt,vβj⟩vαmtTβj)‖≤2κ1(N−Nα)ϕMDVαNT∞m. |
Then, we combine J1 and J2 to derive that for a.e. t∈R+−{0},
dDVαdt≤−κ1NαN(ϕ(DXα)T∞M−D2Vα2T∞m)DVα+2κ1(N−Nα)ϕMNT∞m. |
We take the summation from α = 1 to n to the above inequality to obtain that
dDVdt≤−κ1min(N1,⋯,Nα)ϕ(DX)NT∞MDV+κ1max(N1,⋯,Nα)D3V2NT∞m+2κ1(n−1)ϕMT∞m, |
because the monotonicity of ϕ implies that
D3V≥∑αD3Vα,min(ϕ(DX1),⋯,ϕ(DXα))≥ϕ(DX). |
Finally, we demonstrate the second assertion.
Remark 4.1. In Lemma 4.2, the two terms below
−κ1min(N1,⋯,Nα)ϕ(DX)NT∞MDV+κ1max(N1,⋯,Nα)D3V2NT∞m,−κ2min(N1,⋯,Nα)ζ(DX)N(T∞M)2DT |
are related to the velocity alignment and temperature equilibrium for each cluster group of system (4.1), respectively. Meanwhile, the following terms in Lemma 4.2
2(n−1)ϕMκ1T∞m,2(n−1)ζM(1T∞m−1T∞M)κ2 |
show the tendency of the velocities and temperatures of system (4.1) to separated into n multi-cluster groups in system (4.1).
This subsection describes suitable sufficient frameworks (H) for the multi-cluster flocking estimate and then, under (H), we demonstrate the multi-cluster flocking of the proposed system (4.1). For this, we first display the admissible data (H) as follows:
(H):={(X(0),V(0),T(0))∈R2dN×(R+−{0})N|(H0),(H1),(H2)and(H3)hold.} |
(i) (H0)(Notation): For brevity, we denote the following notation:
Λ:=DV(0)Λ0+4(n−1)κ1T∞mΛ20ϕ(r02)+4(n−1)κ1(min1≤α≤n−1d(Iα,Iα+1))T∞mΛ0∫∞r02ϕ(s)ds,δ∈(0,1),ˉΛ0:=κ2min(N1,⋯,Nα)ζ(D∞X)N(T∞M)2,Λ0:=δκ1min(N1,⋯,Nα)ϕ(D∞X)NT∞M,Λα:=κ1NαNT∞mΛ0+κ1(N−Nα)NT∞m(min1≤α≤n−1d(Iα,Iα+1))∫∞r02ϕ(s)ds,r0:=minα<β,i,j(xkβj(0)−xkαi(0))for some fixed 1≤k≤d. |
(ii) (H1)(Well prepared conditions): There exists a strictly positive number D∞X>0 such that
D∞X≥DX(0)+Λ,andϕ is integrablei.e., ‖ϕ‖L1<∞. |
(iii) (H2)(Separated initial data): For fixed 1≤k≤d in (H0), there exist real sequences (ai)ni=1 and (bi)ni=1 such that the initial data and system parameters are selected to be split suitably as follows:
r0>0,a1<b1<a2<b2⋯<an<bn,Iα:=[aα,bα]⊂[−1,1],Iα∩Iβ=∅(β≠α),[vkαi(0)−Λα,vkαi(0)+Λα]⊂Iα:=[aα,bα]⊂[−1,1],α,β=1,⋯,n,i=1,⋯,Nα. |
(iii) (H3)(Small fluctuations and coupling strength): The local velocity perturbation for each cluster group and coupling strength are sufficiently small as follows:
2κ1(√1+δ+1)(n−1)∫∞r02ϕ(s)dsδ(min1≤α≤n−1d(Iα,Iα+1))T∞m<DV(0)≤√2(1−δ)ϕ(D∞X)min(N1,⋯,Nα)T∞m(1+δ)max(N1,⋯,Nα)T∞M. |
Next, we give a brief comment regarding (H). The assumption (H1) is that the sufficient condition guarantees a group formation to each cluster group. Note that (H2) implies that position initial data for each cluster group should be sufficiently separate from each other to verify the multi-cluster flocking result. Indeed, if vkαi(0) is covered by Iα:=[aα,bα], then we take sufficiently small κ1 so that [vkαi(0)−Λα,vkαi(0)+Λα]⊂Iα because Λα is linearly proportional to κ1. (H3) describes that the velocity perturbation between each pair of cluster groups is sufficiently small to deduce the velocity alignment for each cluster group. Here, we can find the admissible data satisfying the assumption (H3) when κ1 is sufficiently small. Moreover, under sufficiently large r0 and suitable temperature initial data and small coupling strength regime, we can check that the sufficient framework (H) is admissible data.
To prove the multi-cluster flocking result, we define the following set:
S:={s>0|minα≠β,i,j‖xαi(t)−xβj(t)‖≥(min1≤α≤n−1d(Iα,Iα+1))t+r02,t∈[0,s)}, |
where d(Iα,Iα+1) is a distance between adjacent intervals Iα and Iα+1. Herein, we observe that S is nonempty due to the assumption (H2) and the continuity of ‖xαi(t)−xβj(t)‖, and we set
supS=:T∗. |
Lemma 4.3. Assume that Zα={(xαi,vαi,Tαi)}Nαi=1 is a solution to the system (4.1). Suppose that (H0), (H1), and (H3) hold. Then, it follows that
DV(t)<√(1+δ)DV(0),DX(t)≤D∞X,t∈[0,T∗]. | (4.2) |
Proof. First, we consider
S′:={s>0|the desired estimates Eq (4.2) hold,t∈[0,s],s≤T∗}. |
Let supS′=:T∗∗ and suppose that T∗∗<T∗ for the proof by contradiction. Then, one has for t∈[0,T∗∗], {
D2V(t)≤(1+δ)D2V(0)≤2(1−δ)ϕ(D∞X)min(N1,⋯,Nα)T∞mmax(N1,⋯,Nα)T∞M |
and
−κ1min(N1,⋯,Nα)ϕ(DX)NT∞M≤−κ1min(N1,⋯,Nα)ϕ(D∞X)NT∞M. |
Then, for a.e. t∈(0,T∗∗), the second assertion of Lemma 4.2 and the above estimates lead to the following inequalities:
dDVdt≤−κ1min(N1,⋯,Nα)ϕ(DX)NT∞MDV+κ1max(N1,⋯,Nα)D3V2NT∞m+2κ1(n−1)ϕMT∞m≤−δκ1min(N1,⋯,Nα)ϕ(D∞X)NT∞MDV+2κ1(n−1)ϕMT∞m=−Λ0DV+2κ1(n−1)ϕMT∞m. |
This gives from Grönwall's lemma that for t∈[0,T∗∗],
DV(t)≤DV(0)exp(−Λ0t)+2κ1(n−1)T∞mΛ0exp(−Λ02t)ϕ(r02)+2κ1(n−1)T∞mΛ0ϕ((min1≤α≤n−1d(Iα,Iα+1))t+r02), | (4.3) |
where we used the definition of S and the fact that
ϕM≤ϕ((min1≤α≤n−1d(Iα,Iα+1))t+r02). |
Moreover, we again employ Grönwall's lemma to reach that for t∈[0,T∗∗],
DV(t)≤DV(0)exp(−Λ0t)+2κ1(n−1)(min1≤α≤n−1d(Iα,Iα+1))T∞m∫∞r02ϕ(s)ds. | (4.4) |
Next, using the definition of T∗∗ yields that
D2V(T∗∗)=(1+δ)D2V(0)orDX(T∗∗)=D∞X. |
In the former case, it is contradictory to (H3) because inequality (4.4) implies that
DV(T∗∗)=√1+δDV(0)≤DV(0)+2κ1(n−1)(min1≤α≤n−1d(Iα,Iα+1))T∞m∫∞r02ϕ(s)ds. |
In the latter case, we estimate from inequality (4.3) that for t∈[0,T∗∗],
DX(t)≤DX(0)+∫t0DV(s)ds≤DX(0)+∫t0[DV(0)exp(−Λ0s)+2κ1(n−1)T∞mΛ0exp(−Λ02s)ϕ(r02)+2κ1(n−1)T∞mΛ0ϕ((min1≤α≤n−1d(Iα,Iα+1))s+r02)]ds<DX(0)+Λ≤D∞X. | (4.5) |
Accordingly, DX(T∗∗)<D∞X, which is contradictory. Finally, supS′=T∗∗=T∗. We have reached the desired lemma.
Subsequently, we claim that T∗=∞, which is crucial to derive the multi-cluster flocking estimate of the system (4.1).
Theorem 4.1. Following Lemma 4.3, we further assume that (H2) holds. Then, we get that
T∗=∞. |
This is equivalent to
minα≠β,i,j‖xαi(t)−xβj(t)‖≥(min1≤α≤n−1d(Iα,Iα+1))t+r02,t∈R+. |
Proof. For the proof by contradiction, suppose that T∗<∞. From the definition of S, we select four indices that satisfy
1≤α∗<β∗≤n,i∗∈{1,⋯,Nα∗}andj∗∈{1,⋯,Nβ∗} |
such that
‖xα∗i∗(T∗)−xβ∗j∗(T∗)‖=(min1≤α≤n−1d(Iα,Iα+1))T∗+r02. |
Then, we show that for the k∈{1,⋯,d} chosen in (H0),
‖xα∗i∗(T∗)−xβ∗j∗(T∗)‖≥xkβ∗j∗(T∗)−xkαi∗(T∗)=xkβ∗j∗(0)−xkα∗i∗(0)+∫T∗0(vkβ∗j∗(t)−vkα∗i∗(t))dt≥r0+∫T∗0(vkβ∗j∗(t)−vkα∗i∗(t))dt. |
Next, we integrate system (4.1b) and employ the following relation:
‖vαj−⟨vαi,vαj⟩vαi‖2=1−⟨vαi,vαj⟩2=(1−⟨vαi,vαj⟩)(1+⟨vαi,vαj⟩)≤D2Vα |
to attain that for t∈[0,T∗],
|vkαi(t)−vkαi(0)|≤‖vαi(t)−vαi(0)‖≤∫t0‖˙vαi‖ds≤κ1NαNT∞m∫t0DVα(s)ds+κ1(N−Nα)NT∞m∫t0ϕM(s)ds≤κ1NαNT∞m∫∞0DVα(s)ds+κ1(N−Nα)NT∞m∫∞0ϕ(min1≤α≤n−1d(Iα,Iα+1)s+r02)ds≤κ1NαNT∞m∫∞0DV(s)ds+κ1(N−Nα)NT∞m∫∞0ϕ(min1≤α≤n−1d(Iα,Iα+1)s+r02)ds≤κ1NαNT∞mΛ+κ1(N−Nα)NT∞m∫∞0ϕ(min1≤α≤n−1d(Iα,Iα+1)s+r02)ds=κ1NαNT∞mΛ+κ1(N−Nα)NT∞m(min1≤α≤n−1d(Iα,Iα+1))∫∞r02ϕ(s)ds=:Λα, |
where we used ϕ≤1, ‖vβj−⟨vαi,vβj⟩vαi‖≤1, and Λ was estimated in inequality (4.5). Therefore, it follows by (H2) that for α=1,⋯,n,
vkαi(0)+Λα≥vkαi(0)+|vkαi(t)−vkαi(0)|≥vkαi(t)=vkαi(0)+vkαi(t)−vkαi(0)≥vkαi(0)−|vkαi(t)−vkαi(0)|≥vkαi(0)−Λα⟹vkαi(t)∈Iα. |
Then, we derive that using the assumption (H2),
‖xα∗i∗(T∗)−xβ∗j∗(T∗)‖≥r0+∫T∗0(vkβ∗j∗(t)−vkα∗i∗(t))dt>r02+min1≤α≤n−1d(Iα,Iα+1)T∗, |
which gives a contradiction to T∗<∞. Consequently, we conclude that T∗=∞.
Now, we are ready to prove the multi-cluster flocking dynamics under sufficient framework (H) by applying Lemma 4.3 and Theorem 4.1. In addition, we verify that there exist common velocity and temperature convergence values depending on the decay rates of the integrable communication weights ϕ and ζ, respectively, in each cluster group.
Theorem 4.2. Let Zα={(xαi,vαi,Tαi)}Nαi=1 be a solution to the system (4.1) and suppose that the frameworks (H0), (H1), (H2), and (H3) hold. Then, we obtain the following assertions for t∈R+:
1. (Velocity alignment for each cluster group)
DV(t)≤DV(0)exp(−Λ0t)+2κ1(n−1)T∞mΛ0exp(−Λ02t)ϕ(r02)+2κ1(n−1)T∞mΛ0ϕ((min1≤α≤n−1d(Iα,Iα+1))t+r02). |
2. (Temperature equilibrium for each cluster group)
DT(t)≤DT(0)exp(−ˉΛ0t)+2κ2(n−1)(1T∞m−1T∞M)exp(−ˉΛ02t)ζ(r02)+2κ2(n−1)(1T∞m−1T∞M)ζ((min1≤α≤n−1d(Iα,Iα+1))t+r02). |
Proof. We apply the second assertion of Lemma 4.2, the definition of the set S, and Theorem 4.1 to have that for a.e. t∈R+−{0},
dDVdt≤−Λ0DV+2κ1(n−1)T∞mϕM≤−Λ0DV+2κ1(n−1)T∞mϕ(r02+min1≤α≤n−1d(Iα,Iα+1)t). |
From inequality (4.3), we recall that for t∈R+,
DV(t)≤DV(0)exp(−Λ0t)+2κ1(n−1)T∞mΛ0exp(−Λ02t)ϕ(r02)+2κ1(n−1)T∞mΛ0ϕ((min1≤α≤n−1d(Iα,Iα+1))t+r02). |
Hence, we reach the desired first assertion. To prove the second assertion, we employ the third assertion of Lemma 4.2, Theorem 4.1, and the second assertion of Lemma 4.3 to get that for a.e. t∈R+−{0},
dDTdt≤−κ2min(N1,⋯,Nα)ζ(DX)N(T∞M)2DT+2κ2(n−1)ζM(1T∞m−1T∞M)≤−ˉΛ0DT+2κ2(n−1)(1T∞m−1T∞M)ζ((min1≤α≤n−1d(Iα,Iα+1))t+r02). |
We use Grönwall's lemma to yield that for t∈R+,
DT(t)≤DT(0)exp(−ˉΛ0t)+2κ2(n−1)(1T∞m−1T∞M)exp(−ˉΛ02t)ζ(r02)+2κ2(n−1)(1T∞m−1T∞M)ζ((min1≤α≤n−1d(Iα,Iα+1))t+r02). |
We conclude the desired second assertion.
As a direct consequence, we present the following result that the velocity and temperature of each agent in each cluster group converge to some same nonnegative value, respectively:
Corollary 4.1. Assume that Zα={(xαi,vαi,Tαi)}Nαi=1 is a solution to system (4.1). Then, under the sufficient frameworks (H0), (H1), (H2), and (H3), there exist some convergence values v∞α and T∞α for α=1,⋯,n that satisfy that for t∈R+,
1. (Velocity convergence value for each cluster group)
‖vαi(t)−v∞α‖=O(exp(−Λ02t)+ϕ((min1≤α≤n−1d(Iα,Iα+1))s+r02)+∫∞tϕ((min1≤α≤n−1d(Iα,Iα+1))s+r02)ds). |
2. (Temperature convergence value for each cluster group)
|Tαi(t)−T∞α|=O(exp(−ˉΛ02t)+ζ((min1≤α≤n−1d(Iα,Iα+1))s+r02)+∫∞tζ((min1≤α≤n−1d(Iα,Iα+1))s+r02)ds). |
Proof. Remember from Lemma 4.1 that
Nα˙vcenα=κ1NNα∑i=1Nα∑j=1ϕ(‖xαi−xαj‖)vαi‖vαj−vαi‖22Tαj+κ1NNα∑i=1Nβ∑j=1ϕ(‖xαi−xβj‖)(vβj−vαi+vαi‖vβk−vαi‖22)1Tβj. |
If we denote v∞α as
v∞α:=limt→∞vcenα(t)=vcenα(0)+κ1NNαNα∑i=1Nα∑j=1∫∞0ϕ(‖xαi−xαj‖)vαi‖vαj−vαi‖22Tαj+κ1NNαNα∑i=1Nβ∑j=1∫∞0ϕ(‖xαi−xβj‖)(vβj−vαi+vαi‖vβj−vαi‖22)1Tβj, |
then we have that
‖vcenα(t)−v∞α‖≤κ1NNαNα∑i=1Nα∑j=1∫∞tϕ(‖xαi−xαj‖)vαi‖vαj−vαi‖22Tαj+κ1NNαNα∑i=1Nβ∑j=1∫∞tϕ(‖xαi−xβj‖)(vβj−vαi+vαi‖vβj−vαi‖22)1Tβj |
because
vcenα=vcenα(0)+κ1NNαNα∑i=1Nα∑j=1∫t0ϕ(‖xαi−xαj‖)vαi‖vαj−vαi‖22Tαjds+κ1NNαNα∑i=1Nβ∑j=1∫t0ϕ(‖xαi−xβj‖)(vβj−vαi+vαi‖vβj−vαi‖22)1Tβjds. |
Then, the multi-flocking estimate studied in Theorem 4.1 and the monotonicity and non-negativity of ϕ imply that
‖vcenα(t)−v∞α‖=O(exp(−Λ0t)+∫∞tϕ((min1≤α≤n−1d(Iα,Iα+1))s+r02)ds). |
Subsequently, we recall from Theorem 4.1 that
‖vαi(t)−vcenα(t)‖=O(exp(−Λ02t)+ϕ((min1≤α≤n−1d(Iα,Iα+1))s+r02)). |
We combine the above estimates to derive that for α=1,⋯,n,
‖vαi(t)−v∞α‖=O(exp(−Λ02t)+ϕ((min1≤α≤n−1d(Iα,Iα+1))s+r02)+∫∞tϕ((min1≤α≤n−1d(Iα,Iα+1))s+r02)ds). |
Similar to the above, there exists some positive value T∞α such that for α=1,⋯,n,
|Tαi(t)−T∞α|=O(exp(−ˉΛ02t)+ζ((min1≤α≤n−1d(Iα,Iα+1))s+r02)+∫∞tζ((min1≤α≤n−1d(Iα,Iα+1))s+r02)ds). |
We conclude the desired results.
In this paper, we have demonstrated various sufficient frameworks regarding the mono-cluster flocking, the non-emergence of mono-cluster flocking, and multi-cluster flocking of the TCSUS system. First, we presented the admissible data for the mono-cluster flocking of TCSUS to occur. From the result, we observed that the mono-cluster flocking occurs when the coupling strength is large enough, and then we were interested in how small the coupling strength must be to avoid mono-cluster flocking emerging. Second, we verified that if the coupling strength is smaller than some appropriate value in the TCSUS model with an integrable communication weight ϕ, then the mixed configuration gradually becomes separated after some time, and then each sub-ensemble simultaneously moves away linearly as the time increases. Hence, this showed the non-emergence of the mono-cluster flocking to the system. However, when ϕ is non-integrable, we did not provide a suitable sufficient framework for the non-emergence of the mono-cluster flocking and we only gave a sufficient condition independent of the coupling strength for mono-cluster flocking to occur. Third, employing the spatial separation r0 and velocity separations Iα's, when the initial configuration is well separated given similar to multi-cluster, we proved that the multi-cluster flocking holds in the system with an integrable ϕ. The novelty of this paper is that we have extended the multi-cluster flocking of system (1.2) (see [29]) to a temperature field and generalize the bi-cluster flocking of system (1.5) (see [2]) to the multi-cluster flocking. We were unable to demonstrate a sufficient framework where the multi-cluster flocking emerges in a mixed initial configuration (not well separated) rather than from the multi-cluster flocking under the conditions such that the initial configuration is well separated could be an interesting research topic. This issue is left for future work.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
The work of H. Ahn was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (2022R1C12007321).
The authors declare there is no conflict of interest.
[1] |
J. A. Acebron, L. L. Bonilla, C. J. P. Pérez Vicente, F. Ritort, R. Spigler, The Kuramoto model: A simple paradigm for synchronization phenomena, Rev. Mod. Phys., 77 (2005), 137–185. https://doi.org/10.1103/RevModPhys.77.137 doi: 10.1103/RevModPhys.77.137
![]() |
[2] |
H. Ahn, Emergent behaviors of thermodynamic Cucker–Smale ensemble with a unit-speed constraint, Discrete Contin. Dyn. Syst. B, 28 (2023), 4800–4825. https://doi.org/10.3934/dcdsb.2023042 doi: 10.3934/dcdsb.2023042
![]() |
[3] | H. Ahn, J. Byeon, S. Y. Ha, Thermodynamic Cucker–Smale ensemble with unit-speed and its sufficient framework for collision avoidance, arXiv, 2023. https://arXiv.org/abs/2304.00872 |
[4] |
H. Ahn, S. Y. Ha, M. Kang, W. Shim, Emergent behaviors of relativistic flocks on Riemannian manifolds, Physica D, 427 (2021), 133011. https://doi.org/10.1016/j.physd.2021.133011 doi: 10.1016/j.physd.2021.133011
![]() |
[5] |
H. Ahn, S. Y. Ha, D. Kim, F. Schlöder, W. Shim, The mean-field limit of the Cucker–Smale model on Riemannian manifolds, Q. Appl. Math., 80 (2022), 403–450. https://doi.org/10.1090/qam/1613 doi: 10.1090/qam/1613
![]() |
[6] |
H. Ahn, S. Y. Ha, J. Kim, Uniform stability of the relativistic Cucker–Smale model and its application to a mean-field limit, Commun. Pure Appl. Anal., 20 (2021), 4209–4237. https://doi.org/10.3934/cpaa.2021156 doi: 10.3934/cpaa.2021156
![]() |
[7] |
G. Albi, N. Bellomo, L. Fermo, S. Y. Ha, J. Kim, L. Pareschi, et al., Vehicular traffic, crowds, and swarms: From kinetic theory and multiscale methods to applications and research perspectives, Math. Models Methods Appl. Sci., 29 (2019), 1901–2005. https://doi.org/10.1142/S0218202519500374 doi: 10.1142/S0218202519500374
![]() |
[8] | J. Buck, E. Buck, Biology of synchronous flashing of fireflies, Nature, 211 (1966), 562–564. https://www.nature.com/articles/211562a0 |
[9] |
J. A. Carrillo, M. Fornasier, J. Rosado, G. Toscani, Asymptotic flocking dynamics for the kinetic Cucker–Smale model, SIAM. J. Math. Anal., 42 (2010), 218–236. https://doi.org/10.1137/090757290 doi: 10.1137/090757290
![]() |
[10] |
P. Cattiaux, F. Delebecque, L. Pedeches, Stochastic Cucker–Smale models: old and new, Ann. Appl. Probab., 28 (2018), 3239–3286. https://doi.org/10.1214/18-AAP1400 doi: 10.1214/18-AAP1400
![]() |
[11] |
S. H. Choi, S. Y. Ha, Interplay of the unit-speed constraint and time-delay in Cucker–Smale flocking, J. Math. Phys., 59 (2018), 082701. https://doi.org/10.1063/1.4996788 doi: 10.1063/1.4996788
![]() |
[12] |
S. H. Choi, S. Y. Ha, Emergence of flocking for a multi-agent system moving with constant speed, Commun. Math. Sci. 14 (2016), 953–972. https://dx.doi.org/10.4310/CMS.2016.v14.n4.a4 doi: 10.4310/CMS.2016.v14.n4.a4
![]() |
[13] |
Y. P. Choi, J. Haskovec, Cucker–Smale model with normalized communication weights and time delay, Kinet. Relat. Models, 10 (2017), 1011–1033. https://doi.org/10.3934/krm.2017040 doi: 10.3934/krm.2017040
![]() |
[14] | Y. P. Choi, S. Y. Ha, Z. Li, Emergent dynamics of the Cucker–Smale flocking model and its variants, in Modeling and Simulation in Science and Technology Birkhauser, Springer, 2017. https://doi.org/10.1007/978-3-319-49996-3-8 |
[15] |
Y. P. Choi, D. Kalsie, J. Peszek, A. Peters, A collisionless singular Cucker–Smale model with decentralized formation control, SIAM J. Appl. Dyn. Syst., 18 (2019), 1954–1981. https://doi.org/10.1137/19M1241799 doi: 10.1137/19M1241799
![]() |
[16] |
Y. P. Choi, Z. Li, Emergent behavior of Cucker–Smale flocking particles with heterogeneous time delays, Appl. Math. Lett., 86 (2018), 49–56. https://doi.org/10.1016/j.aml.2018.06.018 doi: 10.1016/j.aml.2018.06.018
![]() |
[17] |
J. Cho, S. Y. Ha, F. Huang, C. Jin, D. Ko, Emergence of bi-cluster flocking for agent-based models with unit speed constraint, Anal. Appl., 14 (2016), 39–73. https://doi.org/10.1142/S0219530515400023 doi: 10.1142/S0219530515400023
![]() |
[18] |
J. Cho, S. Y. Ha, F. Huang, C. Jin, D. Ko, Emergence of bi-cluster flocking for the Cucker–Smale model, Math. Models Methods Appl. Sci., 26 (2016), 1191–1218. https://doi.org/10.1142/S0218202516500287 doi: 10.1142/S0218202516500287
![]() |
[19] |
F. Cucker, S. Smale, Emergent behavior in flocks, IEEE Trans. Automat. Contr., 52 (2007), 852–862. https://doi.org/10.1109/TAC.2007.895842 doi: 10.1109/TAC.2007.895842
![]() |
[20] |
P. Degond, S. Motsch, Large-scale dynamics of the persistent turning walker model of fish behavior, J. Stat. Phys., 131 (2008), 989–1021. https://doi.org/10.1007/s10955-008-9529-8 doi: 10.1007/s10955-008-9529-8
![]() |
[21] |
G. B. Ermentrout, An adaptive model for synchrony in the firefly Pteroptyx malaccae, J. Math. Biol., 29 (1991), 571–585. https://doi.org/10.1007/BF00164052 doi: 10.1007/BF00164052
![]() |
[22] |
E. Ferrante, A. E. Turgut, A. Stranieri, C. Pinciroli, M. Dorigo, Self-organized flocking with a mobile robot swarm: a novel motion control method, Adapt. Behav., 20 (2012), 460–477. https://doi.org/10.1177/1059712312462248 doi: 10.1177/1059712312462248
![]() |
[23] |
A. Figalli, M. Kang, A rigorous derivation from the kinetic Cucker–Smale model to the pressureless Euler system with nonlocal alignment, Anal. PDE., 12 (2019), 843–866. https://doi.org/10.2140/apde.2019.12.843 doi: 10.2140/apde.2019.12.843
![]() |
[24] |
S. Y. Ha, M. J. Kang, B. Kwon, A hydrodynamic model for the interaction of Cucker–Smale particles and incompressible fluid, Math. Models. Methods Appl. Sci., 11 (2014), 2311–2359. https://doi.org/10.1142/S0218202514500225 doi: 10.1142/S0218202514500225
![]() |
[25] |
S. Y. Ha, J. Kim, C. Min, T. Ruggeri, X. Zhang, Uniform stability and mean-field limit of a thermodynamic Cucker–Smale model, Quart. Appl. Math., 77 (2019), 131–176. https://doi.org/10.1090/qam/1517 doi: 10.1090/qam/1517
![]() |
[26] |
S. Y. Ha, J. Kim, T. Ruggeri, Emergent behaviors of thermodynamic Cucker–Smale particles, SIAM J. Math. Anal., 50 (2018), 3092–3121. https://doi.org/10.1137/17M111064X doi: 10.1137/17M111064X
![]() |
[27] |
S. Y. Ha, J. Kim, T. Ruggeri, From the relativistic mixture of gases to the relativistic Cucker–Smale flocking, Arch. Rational Mech. Anal., 235 (2020), 1661–1706. https://doi.org/10.1007/s00205-019-01452-y doi: 10.1007/s00205-019-01452-y
![]() |
[28] |
S. Y. Ha, J. Kim, X. Zhang, Uniform stability of the Cucker–Smale model and its application to the mean-field limit, Kinet. Relat. Models, 11 (2018), 1157–1181. https://doi.org/10.3934/krm.2018045 doi: 10.3934/krm.2018045
![]() |
[29] |
S. Y. Ha, D. Ko, Y. Zhang, Remarks on the coupling strength for the Cucker–Smale with unit speed, Discrete Contin. Dyn. Syst., 38 (2018), 2763–2793. https://doi.org/10.3934/dcds.2018116 doi: 10.3934/dcds.2018116
![]() |
[30] |
S. Y. Ha, J. G. Liu, A simple proof of Cucker–Smale flocking dynamics and mean-field limit, Commun. Math. Sci., 7 (2009), 297–325. https://doi.org/10.4310/CMS.2009.v7.n2.a2 doi: 10.4310/CMS.2009.v7.n2.a2
![]() |
[31] |
S. Y. Ha, T. Ruggeri, Emergent dynamics of a thermodynamically consistent particle model, Arch. Ration. Mech. Anal., 223 (2017), 1397–1425. https://doi.org/10.1007/s00205-016-1062-3 doi: 10.1007/s00205-016-1062-3
![]() |
[32] |
S. Y. Ha, E. Tadmor, From particle to kinetic and hydrodynamic description of flocking, Kinet. Relat. Models, 1 (2008), 415–435. https://doi.org/10.3934/krm.2008.1.415 doi: 10.3934/krm.2008.1.415
![]() |
[33] |
T. K. Karper, A. Mellet, K. Trivisa, Hydrodynamic limit of the kinetic Cucker–Smale flocking model, Math. Models Methods Appl. Sci., 25 (2015), 131–163. https://doi.org/10.1142/S0218202515500050 doi: 10.1142/S0218202515500050
![]() |
[34] |
R. Olfati-Saber, Flocking for multi-agent dynamic systems: algorithms and theory, IEEE Trans. Automat. Contr., 51 (2006), 401–420. https://doi.org/10.1109/TAC.2005.864190 doi: 10.1109/TAC.2005.864190
![]() |
[35] | A. Pikovsky, M. Rosenblum, J. Kurths, Synchronization: A Universal Concept in Nonlinear Sciences, Cambridge: Cambridge University Press, 2001. |
[36] |
L. Ru, X. Li, Y. Liu, X. Wang, Flocking of Cucker–Smale model with unit speed on general digraphs, Proc. Am. Math. Soc., 149 (2021), 4397–4409. https://doi.org/10.1090/proc/15594 doi: 10.1090/proc/15594
![]() |
[37] |
S. H. Strogatz, From Kuramoto to Crawford: exploring the onset of synchronization in populations of coupled oscillators, Phys. D, 143 (2000), 1–20. https://doi.org/10.1016/S0167-2789(00)00094-4 doi: 10.1016/S0167-2789(00)00094-4
![]() |
[38] |
J. Toner, Y. Tu, Flocks, herds, and schools: A quantitative theory of flocking, Phys. Rev. E, 58 (1998), 4828–4858. https://doi.org/10.1103/PhysRevE.58.4828 doi: 10.1103/PhysRevE.58.4828
![]() |
[39] |
C. M. Topaz, A. L. Bertozzi, Swarming patterns in a two-dimensional kinematic model for biological groups, SIAM J. Appl. Math., 65 (2004), 152–174. https://doi.org/10.1137/S0036139903437424 doi: 10.1137/S0036139903437424
![]() |
[40] |
T. Vicsek, A. Czirók, E. Ben-Jacob, I. Cohen, O. Schochet, Novel type of phase transition in a system of self-driven particles, Phys. Rev. Lett. 75 (1995), 1226–1229. https://doi.org/10.1103/PhysRevLett.75.1226 doi: 10.1103/PhysRevLett.75.1226
![]() |
[41] |
T. Vicsek, A. Zefeiris, Collective motion, Phys. Rep., 517 (2012), 71–140. https://doi.org/10.1016/j.physrep.2012.03.004 doi: 10.1016/j.physrep.2012.03.004
![]() |
[42] | A. T. Winfree, The geometry of biological time, New York: Springer, 1980. https://doi.org/10.1007/978-3-662-22492-2 |
[43] |
A. T. Winfree, Biological rhythms and the behavior of populations of coupled oscillators, J. Theor. Biol., 16 (1967), 15–42. https://doi.org/10.1016/0022-5193(67)90051-3 doi: 10.1016/0022-5193(67)90051-3
![]() |
1. | Shenglun Yan, Wanqian Zhang, Weiyuan Zou, Multi-cluster flocking of the thermodynamic Cucker-Smale model with a unit-speed constraint under a singular kernel, 2024, 19, 1556-1801, 547, 10.3934/nhm.2024024 | |
2. | Seung-Yeal Ha, Guanghui Jin, Youwei Ma, Wook Yoon, Emergent behaviors of two thermodynamically consistent inertial spin models, 2024, 34, 1054-1500, 10.1063/5.0223494 | |
3. | Jeong Seok Han, Woojoo Shim, Hyunjin Ahn, Global-In-Time Discrete Approximation of the Cucker–Smale Model with a Unit Speed Constraint, 2025, 192, 1572-9613, 10.1007/s10955-025-03397-x |