# Swarming Behaviors in Multiagent Systems with Nonlinear Dynamics and Aperiodically Intermittent Communication

Authors: Anding Dai; Yicheng Liu; Dongyun Yi; Peiying Xiong
Journal: Mathematical Problems in Engineering
 (2019)

---

## Abstract

This paper investigates the stability of a class of swarm model with nonlinear dynamics and aperiodically intermittent communication. Different from previous works, it assumes that the agents obtain information from the neighbors at a series of aperiodically time intervals. Moreover, nonlinear dynamics and time delay are considered. It finds that all agents in a swarm can reach cohesion within a finite time under discontinuous communication, where the upper bounds of cohesion depend on the parameters of the swarm model and communication time. A numerical example is given to demonstrate the validity of the theoretical results.


---

## Body

## 1. Introduction

In recent years, distributed cooperative control of multiagents has attracted great interest due to its applications in the fields of physics, engineering, social science, etc. Researchers have spent a lot of efforts in understanding how a herd of animals, school of fish, and man-made mobile autonomous agents can produce coordinated collective behaviors due to local interactions among individuals [1–3].Swarming is an important branch of distributed coordinated control system. Gazi et al. proposed a swarm model which used a special interaction function and studied its aggregation, cohesion, and stability properties [4]. Afterwards, the authors [5] proposed an M-member “individual-based” continuous-time swarm model and investigated collective behaviors of swarm with general nonlinear attraction and repulsion functions. In [6], stability properties of a continuous-time model for swarm aggregation in the n-dimensional space were discussed, and an asymptotic bound for the spatial size of the swarm was computed by using the parameters of the swarm model. For more about the results of the swarm aggregation problem, see [7, 8] and subsequent references therein.But so far, only a few works have studied swarming behaviors of multiagents with nonlinear dynamical and aperiodically intermittent communication. Swarm systems with nonlinear dynamics are very common in nature, such as fish school and bird flock, whose trajectories are nonlinear, which means the swarm center of an agent is not a fixed constant. Considering this factor, a class of continuous nonlinear swarm models has been proposed and swarm behaviors have been studied [9]. In [10], stability of nonlinear multiagent systems under directed topology has been researched, which proves that if the topology of the underlying swarm is strongly connected, then all agents will converge globally or exponentially to the super ellipsoid in finite time. In [11, 12], mean square exponential synchronization of dynamic networks with random switching and parameter uncertainties has been considered, and the conditions for synchronization under strong connected topology are obtained. Consensus of fractional order nonlinear multiagent systems has been studied in [13, 14]. There is a common feature for achieving stable algorithms of these multiagent systems in [10–14]; that is, each agent can get information from itself and its neighbors without interruption. However, in real life, information about the state of some agents may be unavailable within a certain timetable period; for this reason, intermittent control algorithm was proposed. Each agent can only get information from himself and his neighbors intermittently instead of continuously. At the same time, the intermittent control algorithm has attracted wide attention for it is more effective in saving energy [15–17]. In [14], swarm problem of the first-order nonlinear multiagent systems under periodically intermittent control is discussed, and the proportion of communication time to achieve stability is given. In [18], consensus of the second-order multiagent systems with periodic intermittent communication and nonlinear dynamics is studied. And a new periodic intermittent strategy is proposed to ensure the realization of consensus. In [19], consensus problems for second-order multiagent systems with delayed and intermittent communication were investigated. The distributed consensus tracking problem of multiagent systems with switching directed topologies is studied [20, 21], in which the control inputs to the followers may be temporally missed. Although many intermittent control strategies have been put forward to realize the consensus, swarming and synchronization of multiagents systems, most of the results are based on the periodic intermittent control. And the requirement of periodicity of intermittent control is quite restricted. In fact, the requirement of periodicity is unreasonable and unnecessary, and aperiodically intermittent communication is more general in many real scenarios [22].To sum up, this paper studies the swarm behaviors of nonlinear multiagents systems with aperiodically intermittent communication, to assume the communication between agents is intermittent and the communication time is arbitrary. By using Lyapunov approach, some sufficient conditions are proposed to guarantee the swarm behaviors of multiagent systems. The contributions of this paper are as follows:(1) An aperiodically intermittent communication strategy is proposed, which is more general than periodic intermittent communication.(2) The nonlinear dynamics and time delay are taken into account.(3) Our conclusion shows that under the strongly connected topology the swarm behaviors can be guaranteed, when the communication ratio reaches a certain condition.


## 2. Model and Preliminaries

The swarm model considered in [4] is first reviewed. In a swarm of N agents in the n-dimensional Euclidean space, the motion dynamics of the agent ith is described as follows:(1)x˙it=∑j=1,j≠iNgxit-xjt,i=1,2,…,Nwhere xi(t)=[xi1(t),xi2(t),…,xin(t)]T∈Rn is the position of agent i at time t; g:Rn→Rn represents the interaction force between the corresponding agents in the form of repulsion and attraction given by(2)gy=-ygay-gry,where ga:R+→R+ represents the attraction term, whereas gr:R+→R+ represents the repulsion term, and y=yTy.Note that most of the existing protocols are implemented based on a common assumption that all information is transmitted continuously among agents. This assumption might be rare case in practice and noneconomic, since the information exchange among agents does not need to exist all the time. For example, agents may only communicate with their neighbors over some disconnected time intervals due to the unreliability of communication channels, failure of physical devices, etc. On the other hand, in real biological systems, each agent’s motion dynamic is determined not only by interagent interactions, but also by each agent’s intrinsic dynamics. Therefore, the following generalized swarm model with nonlinear dynamics and intermittent communication is considered:(3)x˙it=ft,xit,xit-τ+∑j=1,j≠iNaijgxit-xjt,t∈tk,sk,ft,xit,xit-τ,t∈sk,tk+1,where k=0,1,2,…, f(t,xi(t),xi(t-τ))=[f1(·,·,·),f2(·,·,·),…,fn(·,·,·)]T is continuous vector value functions describing the dynamics of agent i and τ is time delay. A=(aij)N×N is coupled matrix of model (3), if agent i is subjected to the action from agent j(i≠j), then aij>0; otherwise, aij=0. Here, we take aii=∑j=1,j≠iNaij and assume that the coupling matrix A is irreducible, which means that the corresponding digraph is strongly connected. [tk,tk+1) denotes the k-th communication period, and sk-tk≥0 is the communication width.Remark 1.
This paper assumes that the communication topology of multiagent system (3) is fixed, symmetrical and irreducible. In fact, the communication topology of the system can be further weakened to be switched topology, and the topology contains the case of a directed spanning tree. Consistency of multiagent systems with switching topology and directed spanning trees is studied in references [20, 21]. However, there are few researches on swarming behavior problem about this kind of multiagent systems.Remark 2.
The purpose of this paper is to minimize the communication time of agents under the condition of guaranteeing the swarming behavior of multiagent systems. At present, there are several communication mechanisms in reducing communication time, such as impulsive communication [23], intermittent communication, and event-triggered communication [24]. As for event-triggered communication mechanism, the system uses sampled data to determine whether the triggering condition is satisfied or not. If the triggering condition is satisfied (the plant state deviates more than a certain threshold from a desired value), the system communicates; otherwise, it will be no need to communicate. Compared with periodic control, event-triggered control has obvious advantages in resolving communication energy, computing, and communication constraints in designing wireless networked control systems [24]. In this paper, we mainly study the swarming behavior of multiagent systems under intermittent communication. Unlike event-triggered communication, intermittent communication is the intermittent exchange of information among agents according to the setting communication strategy (i.e., the interleaving of communication and noncommunication). On the other hand, intermittent communication is related to impulsive communication. When each communication time Tk=sk-tk tends to zero, model (3) evolves into interconnected impulsive system [23]. For the interconnected impulsive system, it can be stabilized by choosing the appropriate pulse intensity and pulse time series (the relevant theories can be consulted in literature [23]).Assume that system (3) satisfies the initial conditions: xi0(t)=[xi10(t),xi20(t),…,xin0(t)]T∈C([t0-τ,t0],Rn). To discuss swarming behaviors, we define the set(4)x¯=∑i=1Nξixit,as the average position for system (3), where ξ=(ξ1,ξ2,…,ξN)T is the left eigenvector of A corresponding to eigenvalue zero and ∑i=1Nξi=1.The dynamical equation ofx¯ satisfies(5)x¯˙=∑i=1Nξift,xit,xit-τ+∑i=1N∑j=1Nξiaijgxit-xjt,t∈tk,sk,∑i=1Nξift,xit,xit-τ,t∈sk,tk+1.Define the error vectorsei(t)=xi(t)-x¯, then the error dynamical system can be rewritten as(6)e˙it=f~t,eit,eit-τ+∑j=1,j≠iNaijgeit-ejt+J-∑s=1N∑j=1Nξsasjgest-ejt,t∈tk,sk,f~t,eit,eit-τ+J,t∈sk,tk+1,where f~(t,ei(t),ei(t-τ))=f(t,xi(t),xi(t-τ))-f(t,x¯(t),x¯(t-τ)), and J=f(t,x¯(t),x¯(t-τ))-∑s=1Nξsf(t,xs(t),xs(t-τ)).For the purpose of the swarming behaviors of multiagent systems (3), we need the following assumptions and lemmas.Assumption 3.
The functionsf(·,·,·) satisfy the Lipschitz condition. That is, there exist two constants l1,l2>0 such that (7)ft,x,xτ-ft,y,yτ≤l1x-y+l2xτ-yτ,∀x,y,xτ,yτ∈Rn.Assumption 4.
For the aperiodically intermittent communication strategy, there exist two positive scalars0<θ<ω, such that, for i=0,1,2,…(8)infi⁡si-ti=θ>0,supi⁡ti+1-ti=ω<+∞.Assumption 5.
There exist constantsa,b>0, such that ga(y)=a, gr(y)≤b/y for any y∈Rn. That is, the attraction function is fixed linear and the repulsion function is bounded.Lemma 6 (see [11]).
Letx∈Rn and y∈Rn, then for any positive definite symmetric matrix P∈Rn×n such that (9)±2xTy≤xTPx+yTP-1yLemma 7 (see [3]).
Given a matrixW=ωij⊂RM×M, suppose that ωij≥0 for i≠j and ωii=-∑j=1,j≠iMωij<0 for i=1,2,…,M. If W is irreducible, then W+WT and EW+WTE are both irreducible, where E=diag⁡(ξ1,ξ2,…,ξM) and ξ=ξ1,ξ2,…,ξMT are the left eigenvector of W corresponding to eigenvalue zero.Lemma 8 (see [25]).
Letw:[μ-τ,+∞)→[0,+∞) be a continuous function such that (10)w˙t≤-awt+bmax⁡wtis satisfied for t≥μ. If a>b>0, then (11)wt≤max⁡wμe-εt-μ,t≥μ,where max⁡wt=supt-τ≤s≤t⁡w(s), and ε>0 is the smallest real root of the equation (12)ε-a+beετ=0.Lemma 9 (see [18]).
Letw:[μ-τ,+∞)→[0,+∞) be a continuous function such that (13)w˙t≤awt+bmax⁡wtis satisfied for t≥μ. If a>0,b>0, then (14)wt≤max⁡wt≤max⁡wμea+bt-μ,t≥μ,where max⁡wt=supt-τ≤s≤t⁡w(s).


## 3. Main Result

In this section, we propose some criteria of swarming behaviors for multiagent systems with nonlinear dynamics and aperiodically intermittent communication.Theorem 10.
Let Assumptions3–5 hold, τ≤si-ti and τ≤ti+1-si. If the following conditions are satisfied:
(1) there exist positive constantsα,λ, such that l+aλ2/2ξ^+α≤0 and λ-2α+2βeλτ=0 hold, where l=ε/2+l12/2ε, β=l22/2ε, ξ^=max⁡ξi∣i=1,2,…,N, ξ=(ξ1,ξ2,…,ξN)T is the left eigenvector corresponding to eigenvalues 0 of A, and ∑i=1Nξi=1;
(2) for anyk∈Z+, ∑i=0k-λsi-ti+γti+1-si≤-η(tk+1-t0), where γ=2(l+βeλτ) and η>0;
then, all the agents of multiagent systems (3) will converge to a hyperball Bϵ centered at x¯(t),(15)Bϵ=x1,…,xN∣∑i=1Nξixit-x¯t2≤ϵ,where ϵ=bdA2/l+aλ2/2ξ^+α2. Furthermore, all agents will move into the hyperball Bϵ in a finite time specified by(16)t=t0-1ηln⁡ϵsupt0-τ≤θ≤t0⁡Vθ.Proof.
Choose a nonnegative Lyapunov function as follows:(17)Vt=12∑i=1NξieiTteit).
Then the derivative ofV(t) with respect to time t along the solutions of error system (6) can be calculated as follows.
Whent∈[tk,sk),k=0,1,2,…, we get (18)V˙t=∑i=1NξieiTtf~t,eit,eit-τ+∑j=1,j≠iNaijgeit-ejt+J-∑s=1N∑j=1Nξsasjgest-ejt=∑i=1NξieiTtf~t,eit,eit-τ+∑i=1NξieiTtJ-∑i=1N∑j=1,j≠iNξiaijeiTteit-ejtgaeit-ejt-greit-ejt+∑i=1NξieiTt∑s=1N∑j=1Nξsasjest-ejtgaest-ejt-grest-ejt.
Note that∑i=1NξieiT(t)=0; we have the following:(19)∑i=1NξieiTtJ=0,and(20)∑i=1NξieiTt∑s=1N∑j=1Nξsasjest-ejtgaest-ejt-grest-ejt=0.
By Assumption3 and Lemma 6, one has(21)∑i=1NξieiTtf~t,eit,eit-τ≤∑i=1Nξiε2eiTteit+12εf~Tt,eit,eit-τf~t,eit,eit-τ≤ε2+l122ε∑i=1NξieiTteit+l222ε∑i=1NξieiTt-τeit-τ.
According to Assumption4 and ∑j=1Naij=0, we can obtain(22)-∑i=1N∑j=1,j≠iNξiaijeiTteit-ejtgaeit-ejt=-a∑i=1N∑j=1,j≠iNξiaijeiTteit-eiTtejt=-a∑i=1Nξi∑j=1,j≠iNaijeiTteit-∑j=1,j≠iNaijeiTtejt=a∑i=1N∑j=1NξiaijeiTtejt.(23)∑i=1N∑j=1,j≠iNξiaijeiTteit-ejtgrest-ejt≤-∑i=1Nbaiiξieit.
Substituting (19)-(23) into (18) yields(24)V˙t≤ε2+l122ε∑i=1NξieiTteit+l222ε∑i=1NξieiTt-τeit-τ+a∑i=1N∑j=1NξiaijeiTtejt-∑i=1Nbaiiξieit.
Exchanging rows and columns, it is not difficult to verify that(25)∑i=1N∑j=1NξiaijeiTtejt=12∑j=1ne~jTtEA+ATEe~jt,where e~j(t)=[e1j(t),e2j(t),…,eNj(t)]T, E=diag⁡(ξ1,ξ2,…,ξN).
Consider that the matrixA is irreducible, then EA+ATE is symmetric irreducible (see Lemma 7) and the sum of rows is equal to zero. There exists an unitary matrix P=(p1,p2,…,pn) such that PT(EA+ATE)P=Λ, where Λ=diag⁡(λ1,λ2,…,λN) and 0=λ1>λ2≥⋯≥λN. Let yj=PTe~j(t)=(yj1,yj2,…,yjN)T. Since p1=(1/N)[1,1,…,1]T, one has yj1=p1Te~j(t)=(1/N)∑i=1neij(t)=0. Then,(26)∑i=1N∑j=1NξiaijeiTtejt≤λ22∑j=1nyjTtyjt=λ22∑j=1ne~jTte~jt=λ22∑i=1NeiTteit.
Letξ^=max⁡ξi∣i=1,2,…,N, dA=max⁡-aii∣i=1,2,…,N, l=ε/2+l12/2ε and β=l22/2ε. Note that(27)∑i=1Nξieit=∑i=1Nξiξieit≤∑i=1Nξi1/2∑i=1Nξieit21/2=∑i=1NξieiTteit.Then, taking (26) and (27) into (24), we have(28)V˙t≤l+aλ22ξ^∑i=1NξieiTteit+bdA∑i=1NξieiTteit+β∑i=1NξieiTt-τeit-τ=-α∑i=1NξieiTteit+l+aλ22ξ^+α∑i=1NξieiTteit∑i=1NξieiTteit+bdAl+aλ2/2ξ^+α+β∑i=1NξieiTt-τeit-τ.
If∑i=1NξieiT(t)ei(t)≥bdA2/l+aλ2/2ξ^+α2, then one has(29)V˙t≤-2αVt+2βsupt-τ≤s≤t⁡Vs.Based on Lemma 8 and condition (1) of Theorem 10, there exists λ>0, such that λ-2α+2βeλτ=0 and(30)Vt≤suptk-τ≤s≤tk⁡Vse-λt-tk.
Similarly, whent∈[sk,tk+1), we have(31)V˙t≤l∑i=1NξieiTteit+β∑i=1NξieiTt-τeit-τ≤2lVt+2βsupt-τ≤s≤t⁡Vs.
DefineW(t)=eλtV(t), based on (30) and (31), one has(32)W˙t≤λWt+2lWt+2βeλτsupt-τ≤s≤t⁡Ws,t∈sk,tk+1.
According to Lemma9 and (30), we have(33)Wt≤supsk-τ≤s≤sk⁡Wseλ+γt-sk=supsk-τ≤s≤sk⁡Vseλseλ+γt-sk≤supsk-τ≤s≤sk⁡suptk-τ≤θ≤tk⁡Vθe-λs-tkeλseλ+γt-sk=suptk-τ≤θ≤tk⁡Vθeλtk+λ+γt-sk,where γ=2(l+βeλτ).
Hence,(34)Vt≤suptk-τ≤s≤tk⁡Vse-λsk-tk+γt-sk,t∈sk,tk+1.
By induction, we have(35)Vt≤suptk-τ≤s≤tk⁡suptk-1-τ≤θ≤tk-1⁡Vθe-λsk-1-tk-1+γs-sk-1e-λsk-tk+γtk+1-sk≤suptk-1-τ≤θ≤tk-1⁡Vθe-λsk-1-tk-1+sk-tk+γtk-sk-1+tk+1-sk≤⋯≤supt0-τ≤θ≤t0⁡Vθe-λ∑i=1ksi-ti+γ∑i=1kti+1-si.
According to condition(2) in Theorem 10, we can get(36)Vt≤supt0-τ≤θ≤t0⁡Vθe-ηt-t0,∀t∈tk,tk+1.
This implies that the swarm will globally and exponentially converge to the hyperellipsoidBϵ. Furthermore, all agents will move into the hyperball Bϵ in a finite time specified by(37)t≤t0-1ηln⁡ϵsupt0-τ≤θ≤t0⁡Vθ.
The proof is complete.Remark 11.
In Theorem10, we have given a sufficient condition to guarantee multiagent systems to achieve swarming behaviors under intermittent communication. It needs to be pointed out that under the premise that the guarantee condition 2 is established, communication or noncommunication is allowed in some communication period. It means that -λ(si-ti)+γ(ti+1-si)=γ(ti+1-ti) or -λ(si-ti)+γ(ti+1-si)=-λ(ti+1-ti) holds in some period. In addition, it can be seen from the proof of Theorem 10 that in the time period [ti,si), there is communication between agents which is beneficial to system stability. In the time period [si,ti+1), there is no communication between agents, which is not beneficial (possibly harmful) to system stability. Therefore, in order to ensure the swarm, the communication time between agents should be as long as possible, but the noncommunication time should be as short as possible. On the other hand, condition (2) in Theorem 10 is easy to achieve when -λ(si-ti)+γ(ti+1-si)≤-η(tk+1-ti) holds in all periods. For any i=0,1,2,…, if si-ti≡Tc, ti+1-si≡Tuc, then aperiodically intermittent communication becomes the case of periodically intermittent communication.In the following, we will verify (35) for some special cases.Corollary 12.
Let Assumptions3–5 hold, τ≤si-ti and τ≤ti+1-si. If the following conditions are satisfied:
(1) there exist positive constantsα,λ, such that l+aλ2/2ξ^+α≤0 and λ-2α+2βeλτ=0 hold, where l=ε/2+l12/2ε, β=l22/2ε, ξ^=max⁡ξi∣i=1,2,…,N, ξ=(ξ1,ξ2,…,ξN)T is the left eigenvector corresponding to eigenvalues 0 of A, and ∑i=1Nξi=1;
(2) for anyk∈Z+, -λ(sk-tk)+γ(tk+1-sk)≤-η(tk+1-tk), where γ=2(l+βeλτ) and η>0;
then, all the agents of multiagent systems (3) will converge to a hyperball Bϵ centered at x¯(t),(38)Bϵ=x1,…,xN∣∑i=1Nξixit-x¯t2≤ϵ,where ϵ=bdA2/l+aλ2/2ξ^+α2. Furthermore, all agents will move into the hyperball Bϵ in a finite time specified by(39)t=t0-1ηln⁡ϵsupt0-τ≤θ≤t0⁡Vθ.For anyi=0,1,2,…, if si-ti≡Tc, ti+1-si≡Tuc, where Tc and Tuc are both positive constants. We have the following result.Corollary 13.
Let Assumptions3–5 hold, τ≤Tc and τ≤Tuc. If the following conditions are satisfied:
(1) there exist positive constantsα,λ, such that l+aλ2/2ξ^+α≤0 and λ-2α+2βeλτ=0 hold, where l=ε/2+l12/2ε, β=l22/2ε, ξ^=max⁡ξi∣i=1,2,…,N, ξ=ξ1,ξ2,…,ξNT is the left eigenvector corresponding to eigenvalues 0 of A, and ∑i=1Nξi=1;
(2) for anyk∈Z+, -λTc+γTuc≤-η(Tu+Tuc), where γ=2(l+βeλτ) and η>0;
then, all the agents of multiagent systems (3) will converge to a hyperball Bϵ centered at x¯(t),(40)Bϵ=x1,…,xN∣∑i=1Nξixit-x¯t2≤ϵ,where ϵ=(bdA)2/(l+aλ2/2ξ^+α)2. Furthermore, all agents will move into the hyperball Bϵ in a finite time specified by(41)t=t0-1ηln⁡ϵsupt0-τ≤θ≤t0⁡Vθ.Next, we use the special class of attraction and repulsion function to analyze the swarming behaviors of multiagents systems with aperiodically intermittent communication. It takes the form(42)gy=-y(a-bexp⁡-y2c,where b>a>0 and c>0 are constants. We can derive the following result.Theorem 14.
Let Assumptions3-4 hold, τ≤Tc and τ≤Tuc. If the following conditions are satisfied:
(1) there exist positive constantsα,λ, such that l+aλ2/2ξ^+α≤0 and λ-2α+2βeλτ=0 hold, where l=ε/2+l12/2ε, β=l22/2ε, ξ^=max⁡ξi∣i=1,2,…,N, ξ=(ξ1,ξ2,…,ξN)T is the left eigenvector corresponding to eigenvalues 0 of A, and ∑i=1Nξi=1;
(2) for anyk∈Z+, -λTc+γTuc≤-η(Tu+Tuc), where γ=2(l+βeλτ) and η>0;
then, all the agents of multiagents systems (3) will converge to a hyperball Bϵ centered at x¯(t),(43)Bϵ=x1,…,xN∣∑i=1Nξixit-x¯t2≤ϵ,where ϵ=bdAc2/2el+aλ2/2ξ^+α2. Furthermore, all agents will move into the hyperball Bϵ in a finite time specified by(44)t=t0-1ηln⁡ϵsupt0-τ≤θ≤t0⁡Vθ.Proof.
It is easy to see thatga(y)=a.
DefineF(x)=bxe-x2/c, then(45)F′x=b1-2x2ce-x2/c=>0,x<c2,<0,x>c2.
Hence,(46)Fx≤Fc2=bc2e-1/2.
So,(47)ygry≤bc2e-1/2.
Therefore, Assumption5 holds, when g(y) is the same as (42).
It is known from Corollary13 that Theorem 14 is established.
The proof is complete.


## 4. Numerical Simulation

In this section, we will use a numerical simulation to illustrate the feasibility and effectiveness of our results.Consider the swarm model consisting of six agents, which is described as follows:(48)x˙it=ft,xit,xit-τ+∑j=1,j≠iNaijgxit-xjt,t∈tk,sk,ft,xit,xit-τ,t∈sk,tk+1,where xi(t)=[xi1(t),xi2(t)]T, f(·,·,·)=tanh⁡xit+0.2tanh⁡(xi(t-τ)), g(xi-xj)=-(xi-xj)(a-be-xi-xj2/c), and τ=1, a=1, b=20, c=0.2, and the coupled matric is chosen as(49)A=-5111111-5111111-5111111-5111111-5111111-5.The nonlinear functionf(·,·,·) satisfies the Lipschitz condition with l1=1, l2=0.2. It is easy to know that λ2=-5 and ξ^=1/6, according to the coupled matrix A. Choose ε=1 and α=4, then we get λ=4.4779, γ=5.5221. Let the ratio of communication time to noncommunication time be greater than 1.3376, then all conditions of Theorem 14 are satisfied, and η>0.2. Let the initial states of the agents be chosen randomly from [-10,10]. Moreover, the communication period T=3s, and for the communication width, see Figure 1 (y=1). The results of simulation are given in Figure 2. It is clear that under the aperiodically intermittent communication, all agents can achieve swarming behavior.Figure 1
Communication (y=1) and noncommunication (y=0) time of the system (48).Figure 2
The trajectories of agents inx1-x2 plan.


## 5. Conclusions

In this paper, the swarm stability of nonlinear multiagent systems with aperiodically intermittent communication is studied. Each agent gets information from its neighbors in a series of aperiodically intervals. In addition, each agent has nonlinear dynamics and time delay. It is shown in this paper that under aperiodic discontinuous communication, all agents in a swarm can reach cohesion within a finite time, and the upper bounds of cohesion depend on the parameters of the swarm model, the second largest eigenvalue of the coupling matrix and communication time. Furthermore, an example is given to verify the correctness of the theoretical results.



---

*Source: 3641517-2019-01-23.xml*