# On Couple-Group Consensus of Multiagent Networks with Communication and Input Time Delays

Authors: Liang-hao Ji; Xin-yue Zhao
Journal: Journal of Control Science and Engineering
 (2016)

---

## Abstract

This paper investigated the couple-group consensus problems of the multiagent networks with the influence of communication and input time delays. Based on the frequency-domain theory, some algebraic criteria are addressed analytically. From the results, it is found that the input time delays and the coupling strengths between agents of the systems play a crucial role in reaching group consensus. The convergence of the system is independent of the communication delays, but it will affect the convergence rate of the system. Finally, several simulated examples are provided to verify the validity and correctness of our theoretical results.


---

## Body

## 1. Introduction

Over the past few years, increasing attention has been paid to the investigation of distributed cooperative control of multiagent networks due to its broad application in many areas, such as distributed sensor networks [1], congestion control in networks [2, 3], and flocking [4, 5]. As a fundamental problem of cooperative control, consensus problem of multiagent networks has become the focus of researchers in many fields. Consensus of multiagent networks usually means a group of agents converging to a consistent state through sharing local communication with their neighbors. Recently, lots of works about consensus have been reported [6–11].Group consensus is an extended consensus problem, which means that the agents in a network reach more than one consistent state. Namely, some agents in one subgroup can reach a consistent state while there is no consensus among different subgroups of the whole networks.Recently, many reports about group consensus have been listed, such as, for second-order multiagent networks with time delays, the group consensus problem investigated in [12]. Based on the semitensor product of matrices and the vertex coloring of graphs, the group consensus problem of the multiagent network is discussed [13]. Yi et al. [14] discussed the group consensus issue of linearly coupled multiagent networks, where the relation between Laplacian and number of groups was derived. Based on some assumptions, Tan et al. [15] obtained some sufficient and necessary conditions to guarantee solvability of group consensus problems. Hu et al. [16] studied average-group consensus problems with undirected networks by designing a novel hybrid protocol. In [17], Zhao et al. discussed couple-group consensus problems of second-order multiagent networks with fixed and stochastic switching topologies and provided a sufficient and necessary condition for the mean-square couple-group consensus. In [18], conditions for reaching group consensus with centralized and decentralized event-triggered control were illustrated, respectively. Moreover, pinning control strategies have been introduced for reducing the cost of network control in [19–23]. In [24, 25], Yu and Wang addressed group consensus problems of networks with directed graphs and strongly connected and balanced topology. Furthermore, in [26, 27], Yu and Wang discussed the group consensus problem with communication delays and switching topologies. For the networks with strongly connected and balanced topology, Wang and Uchida [28] investigated the group consensus of multiagent networks with communication delays. Based on the networks with bipartite topology, group consensus of first-order multiagent networks with and without time delays were investigated in [29], respectively. Du et al. [30] further extended the conclusions in [29] and obtained an upper bound of time delay. Ji et al. [31] considered the group consensus of undirected and connected bipartite graphs, respectively, and proposed a sufficient condition for group consensus. In [32], Lianghao and Xinyue discussed the group consensus problem for second-order multiagent networks with the influence of input and communication time delays.It is worth noting that the related research works mentioned above either only consider the influence of communication delays or simply discuss the special case that the communication delay is equal to the input delay, such as in [24–27, 29–31]. Meanwhile, most of the works are based on the special topologies [16, 24, 25, 28–31], for instance, undirected, strongly connected, and balanced topologies. As we know, time delays objectively exist in the networks and are usually different. Meanwhile, time delays can degrade or even destroy the stable performance of the complex systems. Inspired by the related works, this paper focuses on discussing the couple-group consensus of multiagent networks under the influence of time delays. The main contributions are listed as follows: firstly, this paper investigated the influence of different time delays for the multiagent networks with the asymmetric topology. By using frequency-domain theory, the criteria which can guarantee the achievement of couple-group consensus are proposed. Secondly, either the algebraic criteria we obtained are less conservative than the findings in related works or the relevant research works can be seen as the special cases of our works.The rest of the paper is organized as follows. In Section2, some relevant concepts about graph theory and model formulation are reviewed. In Section 3, the problems of group consensus for multiagent networks with multiple time delays are analyzed. Several numerical experiments are illustrated in Section 4. Finally, some conclusions and future work are drawn.


## 2. Preliminaries

Based on graph theory, an agent and the information interaction between them in a multiagent networks can be described byG=(V,E,A), where V=v1,v2,…,vN is node set, N=1,2,…,N denotes node index set, E⊆V×V is the edge set, and A={aij}∈RN×N is the weighted adjacency matrix. The neighbor of node vi is denoted by Ni={vj∈V:vi,vj∈E}. For convenience, suppose aij>0 if vj∈Ni and aii=0 for ∀i∈N. The Laplacian matrix of G is denoted by L=D-A, where D=diag⁡di,i∈N and di=∑vj∈Niaij.For first-order multiagent networks, the dynamics of the system can be listed as(1)x˙it=uit,where xi(t),ui(t)∈Rk denotes the position state and control input of the agent i at time t, respectively. For simplicity, we just only consider the case xi(t),ui(t)∈R. When k>1, it is easy to promote the results by applying the Kronecker product.Next, some related definitions and lemmas will be listed firstly.Definition 1.
For∀i,j∈N, the first-order multiagent networks (1) can be said to achieve consensus asymptotically if and only if limt→∞⁡xit-xjt=0.Definition 2 (see [33]).
For a bipartite graphg=(V,E) which has the following properties, where V and E denote its vertex and edge sets: (i)
V1∪V2=V and V1∩V2=⌀, where V1 and V2 are the two vertex subsets;(ii)
∀e=(x,y)∈E, where x∈V1 and y∈V2.
Assumes the topologyG=V,E,A of order n+m(n,m>1) consists of two subgroups, G1=V1,E1,A1 and G2=V2,E2,A2, where V1=v1,v2,…,vn and V2=vn+1,vn+2,…,vn+m. Then, the set of finite index is defined by L1=1,2,…,n and L2=n+1,n+2,…,n+m. In these two subgroups, N1i=vj∈V1:vi,vj∈E and N2i=vj∈V2:vi,vj∈E represent the neighbor set of node vi, respectively. Then, we know that V=V1∪V2 and Ni=N1i∪N2i. For convenience, in this paper we only consider the case of two-group consensus problem.Definition 3.
Protocol (1) is said to reach a couple-group consensus asymptotically if the states of agents satisfy(i)
limt→∞⁡xit-xjt=0, ∀i,j∈L1;(ii)
limt→∞⁡xit-xjt=0, ∀i,j∈L2.Lemma 4 (see [29]).
For a connected bipartite graphG, the rank of D+A is n-1, where D and A are the degree matrix and the adjacency matrix, respectively.Lemma 5 (see [34]).
If the graphG contains a globally reachable node, 0 is the simple eigenvalue of itsLaplacian matrix.Lemma 6 (see [35]).
For∀γ∈0,1, if ω∈R, convex hull γCo0∪Eijω,i∈N will not enclose the point -1,j0, where Eijω=π/2T×e-jωT/jω and T denotes time delay.Lemma 7 (see [36]).
Forω∈R, convex hull γCo0∪Eijω,i∈N contains the set of ⋃i∈ℵGi.


## 3. Couple-Group Consensus of Multiagent Networks with Multiple Delays

In this section, we illustrate group consensus of multiagent networks with multiple time delays.


### 3.1. Couple-Group Consensus of Delayed Multiagent Networks with Bipartite Topologies

In [29], group consensus problems of the multiagent networks with protocol (2) and (3) were discussed and some sufficient conditions which can guarantee the achievement of group consensus were proposed as well:(2)uit=-∑vj∈Niaijxjt+xit,i∈N,(3)uit=-∑vj∈Niaijxjt-τ+xit-τ,i∈N,where τ denotes the time delay.Motivated by the related research works, we will discuss the group consensus problem of multiagent networks with different time delays. Consider the following protocol listed as(4)uit=-∑vj∈Niaijxjt-Tij+xit-Ti,i∈N,where Tij denotes the communication delay between vi and vj and Ti denotes the input delay of vi. With (4), the closed-loop form of the networks (1) is(5)x˙it=-∑vj∈Niaijxjt-Tij+xit-Ti,i∈N.Theorem 8.
∀ i ∈ N, if ∑vj∈NiaijTi<π/4 can be satisfied, system (5) with bipartite topology will achieve couple-group consensus asymptotically.Proof.
Taking the Laplace transform to (5), we can obtain the characteristic equation as det⁡sI+De-sTij+Ae-sTi=0, where I denotes unit matrix, D denotes the degree matrix, and A denotes adjacency matrix. Define Fs=det⁡sI+De-sTij+Ae-sTi, by the generalNyquist stability criterion, it is easy to know that the group consensus of the networks (5) can be achieved if and only if all zeros of Fs have negative real parts or F(s) has a simple zero at s=0. Therefore, the following two cases are considered, respectively:(i)
Whens=0, Fs=det⁡D+A, by Lemma 4, we know that Fs contains a single zero at s=0.(ii)
Whens≠0, define Ps=Fs/s, Gs=(De-sTij+Ae-sTi)/s, then Ps=det⁡I+Gs. It is easy to check that the discussion about the zeros of Fs is equal to the zeros of Ps. So if all zeros of Ps have negative real parts, networks (5) will reach group consensus.
Defines=jω; by the generalNyquist stability criterion, it follows that all zeros of Fs have negative real parts for ∀ω∈R, if theNyquist curve of the eigenvalue of Gjω does not enclose the point (-1,j0). By theGerschgorin disk theorem, the equivalent of Gjω satisfies (6)λGjω∈⋃i∈NGi,(7)Gi=ζ:ζ∈C,ζ-∑vj∈Niaije-jωTijω≤∑vj∈Niaije-jωTijω.From (7), we know that the center of Gi is Gi0jω=∑vj∈Niaij(e-jωTi/jω). Suppose the intersection point Wi connects the center of the disk and the origin point of complex plane. The track of point Wi is Wijω=2∑vj∈Niaij(e-jωTi/jω). Based on Lemma 6, as Wijω=γi×Eijω and γi<1, we know that ∑vj∈NiaijTi<π/4 holds. When γ=max⁡γi,i∈N and γ<1, for ∀i∈N, the next equation holds γCo0∪Eijω⊇γi0∪Eijω=Co0∪Wijω. By Lemma 6, noting that (-1,j0)∉γCo0∪Ei(jω),i∈N and based on Lemma 7, as Co(0∪Wi(jω),i∈N)⊇⋃i∈NGi, then (-1,j0)∉⋃i∈NGi holds. Thus, λ(G(jw)) does not enclose the point (-1,j0). That is to say, all zeros of Ps have negative real parts.
The proof of Theorem8 is completed.Remark 9.
WhenTi=Tij=τ, that is, all agents have same communication delays and input delays, it is obvious that protocols (3) and (4) are the same. That is to say, protocol (3) is a special form of (4). In [29–31], the cases where the input time delay is identical are discussed respectively. Whereas the time delays of the system including input time delay and communication time delays exist objectively and are usually different from each other, protocol (4) is more general.Remark 10.
Compared with the result in Theorem8, it is known that the upper bound of time delays derived in [29] is relatively too broad. Meanwhile, according to the results in Theorem 8, it is shown that the group convergence of the networks is related to the input delays and adjacent weights among agents and independent of communication delays.


### 3.2. Couple-Group Consensus of First-Order Delayed Networks with the Topology Containing a Globally Reachable Node

In [24–27], based on the in-degree balance assumptions (A1) and control algorithm (8), the average-group consensus of multiagent networks with undirected, strongly connected, and balanced topology is explored, respectively.(A1):∑j=n+1n+maij=0, ∀i∈L1, and ∑j=1naij=0, ∀i∈L2:(8)uit=∑Vj∈N1iaijxjt-xit+∑Vj∈N2iaijxjt,∀i∈L1∑Vj∈N2iaijxjt-xit+∑Vj∈N1iaijxjt,∀i∈L2.Based on (8), Ji et al. [31] addressed multiagent networks (9) with undirected topology and delays: (9)uit=∑Vj∈N1iaijxjt-τ-xit-τ+∑Vj∈N2iaijxjt-τ,∀i∈L1∑Vj∈N2iaijxjt-τ-xit-τ+∑Vj∈N1iaijxjt-τ,∀i∈L2,where τ denotes time delay.Inspired by related research work, group consensus problem of multiagent networks with multiple delays will be discussed. Considering different communication and input delays, group consensus protocol (10) is proposed as(10)uit=∑Vj∈N1iaijxjt-Tij-xit-Ti+∑Vj∈N2iaijxjt-Tij,∀i∈L1∑Vj∈N2iaijxjt-Tij-xit-Ti+∑Vj∈N1iaijxjt-Tij.∀i∈L2,With protocol (10), the closed-loop form of the networks (1) is(11)x˙it=∑Vj∈N1iaijxjt-Tij-xit-Ti+∑Vj∈N2iaijxjt-Tij,∀i∈L1∑Vj∈N2iaijxjt-Tij-xit-Ti+∑Vj∈N1iaijxjt-Tij.∀i∈L2.Theorem 11.
Based on the in-degree balance conditions (A1), system (11) with the topology containing a globally reachable node can achieve couple-group consensus asymptotically if ∑k=1,k≠im+naikTi<π/4, i=1,2,…,n+m, holds.Proof.
Taking the Laplace transform to (11), its characteristic equation can be easily obtained as det⁡sI+Ls=0, where(12)Ls=lijs=-aije-sTij,j≠i∑k=1,k≠im+naike-sTi,j=i.
The remainder of the proof process is similar to the proof of Theorem8, but here we omit it due to the space limitation.Remark 12.
WhenTi=Tij=τ, protocols (9) and (10) are identical. Therefore, the related works in [24–27] can be seen as the special cases of Theorem 11.Remark 13.
From the results in Theorems8 and 11, it is shown that the achievement of the group consensus of the systems is determined by the input time delays and the coupling weight among the agents. Meanwhile, the node cannot tolerate bigger input delays if it owns a bigger coupling weight.Corollary 14.
WhenTi=τ, system (11) with the topology containing a globally reachable node can achieve couple-group consensus asymptotically if assumption (A1) is satisfied and τ<π/4d holds, where d=max⁡{∑k=1,k≠im+naik}, i=1,2,…,m+n.Remark 15.
The result in Corollary14 is a special case of Theorem 11, and it is consistent with the relevant conclusions in [31]. Meanwhile, it is shown that the tolerant upper bound of input time delay in the system is determined by the node who owns the max coupling weight.


## 3.1. Couple-Group Consensus of Delayed Multiagent Networks with Bipartite Topologies

In [29], group consensus problems of the multiagent networks with protocol (2) and (3) were discussed and some sufficient conditions which can guarantee the achievement of group consensus were proposed as well:(2)uit=-∑vj∈Niaijxjt+xit,i∈N,(3)uit=-∑vj∈Niaijxjt-τ+xit-τ,i∈N,where τ denotes the time delay.Motivated by the related research works, we will discuss the group consensus problem of multiagent networks with different time delays. Consider the following protocol listed as(4)uit=-∑vj∈Niaijxjt-Tij+xit-Ti,i∈N,where Tij denotes the communication delay between vi and vj and Ti denotes the input delay of vi. With (4), the closed-loop form of the networks (1) is(5)x˙it=-∑vj∈Niaijxjt-Tij+xit-Ti,i∈N.Theorem 8.
∀ i ∈ N, if ∑vj∈NiaijTi<π/4 can be satisfied, system (5) with bipartite topology will achieve couple-group consensus asymptotically.Proof.
Taking the Laplace transform to (5), we can obtain the characteristic equation as det⁡sI+De-sTij+Ae-sTi=0, where I denotes unit matrix, D denotes the degree matrix, and A denotes adjacency matrix. Define Fs=det⁡sI+De-sTij+Ae-sTi, by the generalNyquist stability criterion, it is easy to know that the group consensus of the networks (5) can be achieved if and only if all zeros of Fs have negative real parts or F(s) has a simple zero at s=0. Therefore, the following two cases are considered, respectively:(i)
Whens=0, Fs=det⁡D+A, by Lemma 4, we know that Fs contains a single zero at s=0.(ii)
Whens≠0, define Ps=Fs/s, Gs=(De-sTij+Ae-sTi)/s, then Ps=det⁡I+Gs. It is easy to check that the discussion about the zeros of Fs is equal to the zeros of Ps. So if all zeros of Ps have negative real parts, networks (5) will reach group consensus.
Defines=jω; by the generalNyquist stability criterion, it follows that all zeros of Fs have negative real parts for ∀ω∈R, if theNyquist curve of the eigenvalue of Gjω does not enclose the point (-1,j0). By theGerschgorin disk theorem, the equivalent of Gjω satisfies (6)λGjω∈⋃i∈NGi,(7)Gi=ζ:ζ∈C,ζ-∑vj∈Niaije-jωTijω≤∑vj∈Niaije-jωTijω.From (7), we know that the center of Gi is Gi0jω=∑vj∈Niaij(e-jωTi/jω). Suppose the intersection point Wi connects the center of the disk and the origin point of complex plane. The track of point Wi is Wijω=2∑vj∈Niaij(e-jωTi/jω). Based on Lemma 6, as Wijω=γi×Eijω and γi<1, we know that ∑vj∈NiaijTi<π/4 holds. When γ=max⁡γi,i∈N and γ<1, for ∀i∈N, the next equation holds γCo0∪Eijω⊇γi0∪Eijω=Co0∪Wijω. By Lemma 6, noting that (-1,j0)∉γCo0∪Ei(jω),i∈N and based on Lemma 7, as Co(0∪Wi(jω),i∈N)⊇⋃i∈NGi, then (-1,j0)∉⋃i∈NGi holds. Thus, λ(G(jw)) does not enclose the point (-1,j0). That is to say, all zeros of Ps have negative real parts.
The proof of Theorem8 is completed.Remark 9.
WhenTi=Tij=τ, that is, all agents have same communication delays and input delays, it is obvious that protocols (3) and (4) are the same. That is to say, protocol (3) is a special form of (4). In [29–31], the cases where the input time delay is identical are discussed respectively. Whereas the time delays of the system including input time delay and communication time delays exist objectively and are usually different from each other, protocol (4) is more general.Remark 10.
Compared with the result in Theorem8, it is known that the upper bound of time delays derived in [29] is relatively too broad. Meanwhile, according to the results in Theorem 8, it is shown that the group convergence of the networks is related to the input delays and adjacent weights among agents and independent of communication delays.


## 3.2. Couple-Group Consensus of First-Order Delayed Networks with the Topology Containing a Globally Reachable Node

In [24–27], based on the in-degree balance assumptions (A1) and control algorithm (8), the average-group consensus of multiagent networks with undirected, strongly connected, and balanced topology is explored, respectively.(A1):∑j=n+1n+maij=0, ∀i∈L1, and ∑j=1naij=0, ∀i∈L2:(8)uit=∑Vj∈N1iaijxjt-xit+∑Vj∈N2iaijxjt,∀i∈L1∑Vj∈N2iaijxjt-xit+∑Vj∈N1iaijxjt,∀i∈L2.Based on (8), Ji et al. [31] addressed multiagent networks (9) with undirected topology and delays: (9)uit=∑Vj∈N1iaijxjt-τ-xit-τ+∑Vj∈N2iaijxjt-τ,∀i∈L1∑Vj∈N2iaijxjt-τ-xit-τ+∑Vj∈N1iaijxjt-τ,∀i∈L2,where τ denotes time delay.Inspired by related research work, group consensus problem of multiagent networks with multiple delays will be discussed. Considering different communication and input delays, group consensus protocol (10) is proposed as(10)uit=∑Vj∈N1iaijxjt-Tij-xit-Ti+∑Vj∈N2iaijxjt-Tij,∀i∈L1∑Vj∈N2iaijxjt-Tij-xit-Ti+∑Vj∈N1iaijxjt-Tij.∀i∈L2,With protocol (10), the closed-loop form of the networks (1) is(11)x˙it=∑Vj∈N1iaijxjt-Tij-xit-Ti+∑Vj∈N2iaijxjt-Tij,∀i∈L1∑Vj∈N2iaijxjt-Tij-xit-Ti+∑Vj∈N1iaijxjt-Tij.∀i∈L2.Theorem 11.
Based on the in-degree balance conditions (A1), system (11) with the topology containing a globally reachable node can achieve couple-group consensus asymptotically if ∑k=1,k≠im+naikTi<π/4, i=1,2,…,n+m, holds.Proof.
Taking the Laplace transform to (11), its characteristic equation can be easily obtained as det⁡sI+Ls=0, where(12)Ls=lijs=-aije-sTij,j≠i∑k=1,k≠im+naike-sTi,j=i.
The remainder of the proof process is similar to the proof of Theorem8, but here we omit it due to the space limitation.Remark 12.
WhenTi=Tij=τ, protocols (9) and (10) are identical. Therefore, the related works in [24–27] can be seen as the special cases of Theorem 11.Remark 13.
From the results in Theorems8 and 11, it is shown that the achievement of the group consensus of the systems is determined by the input time delays and the coupling weight among the agents. Meanwhile, the node cannot tolerate bigger input delays if it owns a bigger coupling weight.Corollary 14.
WhenTi=τ, system (11) with the topology containing a globally reachable node can achieve couple-group consensus asymptotically if assumption (A1) is satisfied and τ<π/4d holds, where d=max⁡{∑k=1,k≠im+naik}, i=1,2,…,m+n.Remark 15.
The result in Corollary14 is a special case of Theorem 11, and it is consistent with the relevant conclusions in [31]. Meanwhile, it is shown that the tolerant upper bound of input time delay in the system is determined by the node who owns the max coupling weight.


## 4. Simulation Examples

In this section, some simulation examples will be given to show the effectiveness and correctness of our findings.Experiment 1.
Suppose the topology of the networks (5) is shown as Figure 1. In Figure 1, nodes v1, v2, v3, v4, and v5 belong to the two different subgroups, respectively. In the experiment, initial states of agents are generated from 0 to 10 randomly and the input delays of agents are set as follows: T1=0.2 s, T2=0.2 s, and T3=T4=T5=0.1 s. It is easy to verify that all input delays satisfy the conditions in Theorem 8. Meanwhile, for simplicity, we only consider the case that the communication time delays among the agents are same and set it as Tij=0.1,0.2,0.3,0.4 s, i,j=1,2,3,4,5, respectively. The trajectories of the agents are shown in Figure 2 for these four cases. According to the results, it is shown that networks (5) can achieve couple-group consensus asymptotically, respectively. At the same time, by comparing the trajectories with different communication delays, it is clear that communication time delays will not affect convergence properties of the networks but can affect the convergence rate of the system. Furthermore, with the decrease of the communication delays, the faster systems will convergence.Figure 1
Topology of the multiagent networks (5).Figure 2
State trajectories of the agents in the networks (5) with delays.
(a)
T i j = 0.1 s (b)
T i j = 0.2 s (c)
T i j = 0.3 s (d)
T i j = 0.4 sFrom Figure1, by Theorem 8, the allowed input delays of v1 and v2 should satisfy Ti<π/12=0.26 s, which means that group consensus of the networks can be achieved. Next, the following two cases are considered and the state trajectories of the networks (5) are shown in Figure 3:(i)
ResetT1=0.26 s; input delays of other nodes are not changed.(ii)
ResetT2=0.26 s; input delays of other nodes are not changed.Figure 3
State trajectories of the agents in the networks (5) with diverse input delays when Tij=0.1 s.
(a)
T 1 = 0.26 s (b)
T 2 = 0.26 sFrom the results in Figure3, it is illustrated that networks (5) will not reach couple-group group consensus in these three cases. Therefore, the results of simulation experiments further verity the correctness and effectiveness of the algebraic criteria in Theorem 8.From Figure1, it is easy to get its eigenvalues are 0,-2.0,-2.0,-3.0,-5.0, respectively. Based on the bound of time delays 0<τ<(-π/2λm) s presented in [29], the bound of time delays presented in [29] has τ∈(0,0.314) s. Compared with the results in Figure 3, the upper bound of the time delay is too broader.Experiment 2.
Given the dynamical networks (11) with 5 nodes, the topology and connection weights between nodes are shown in Figure 4. Agents v1, v2, and v3 are in a group while agents v4 and v5 are in another group. Meanwhile, the topology of multiagent networks contains a globally reachable node and satisfies the in-degree balance assumption (A1). Similarly, the initial states of agents are generated from 0 to 10 randomly, and communication delay of all agents is set as Tij=0.3 s; input delays of the agents are T1=0.1 s, T2=0.7 s, T3=0.2 s, T4=0.5 s, and T5=0.2 s. It is easy to verify the conditions in Theorem 11 can be satisfied. The state trajectories of the agents in networks (11) are shown in Figure 5(a); it is clear that the networks can achieve couple-group consensus.Figure 4
The topology of the multiagent networks (11).Figure 5
State trajectories of the agents in the networks (11).
(a)
T 1 = 0.1 s (b)
T 1 = 0.4 sNext, the upper bound of time delay presented in Theorem11 will be checked. To node v1, it has d~1=2 according the topology shown in Figure 4. By Theorem 11, the input delay of node v1 should satisfy T1<π/8 s. If set T1=0.4 s, obviously, the condition in Theorem 11 is not satisfied. In the case of communication and input delays of other nodes keeping unchanged, described in Figure 5(b), couple-group consensus will not be achieved.Experiment 3.
Based on the Experiment2, the validity of Corollary 14 will be verified here. From Corollary 14, we can get τ<π/8 s. So the following two cases are considered: τ=0.35 s and τ=0.4 s. The trajectories of the agents are shown in Figure 6, respectively. The results illustrate that the couple-group consensus of the system can be achieved if the conditions in Corollary 14 are satisfied.Figure 6
State trajectories of the agents in the networks (11) when Ti=τ.
(a)
τ = 0.35 s (b)
τ = 0.4 s


## 5. Conclusion

This paper investigated the couple-group consensus problem of multiagent networks with time delays. By applying the theory of frequency-domain, some criteria are derived which can guarantee the realization of group consensus. Meanwhile, the upper bounds of input time delays that the systems can be tolerant are proposed analytically as well. From the results, it is shown that both the input delays and the coupling weights between the agents play an important part in the achievement of group consensus. However, communication delays just only affect the convergence rate of networks. Thus, convergence performance of the system can be improved by reducing the communication time delays.



---

*Source: 2625497-2016-11-10.xml*