# Weighted Couple-Group Consensus Analysis of Heterogeneous Multiagent Systems with Cooperative-Competitive Interactions and Time Delays

Authors: Xingcheng Pu; Chaowen Xiong; Lianghao Ji; Longlong Zhao
Journal: Complexity
 (2019)

---

## Abstract

In this paper, the weighted couple-group consensus of continuous-time heterogeneous multiagent systems with input and communication time delay is investigated. A novel weighted couple-group consensus protocol based on cooperation and competition interaction is designed, which can relax the in-degree balance condition. By using graph theory, general Nyquist criterion and Gerschgorin disc theorem, the time delay upper limit that the system may allow is obtained. The conclusions indicate that there is no relationship between weighted couple-group consensus and communication time delay. When the agents input time delay, the coupling weight between the agents, and the systems control parameters are satisfied, the multiagent system can converge to any given weighted coupling group consistent state. The experimental simulation results verify the correctness of the conclusion.


---

## Body

## 1. Introduction

As an important branch of distributed system, multiagent systems (MASs) have been paid great attention by many scholars due to their wide application in many fields [1–6], such as multirobot system, wireless sensor network, and distributed target tracking. For example, in [5], the distributed formation control problem for multiple nonholonomic wheeled mobile robots would be solved by using a variable transformation, algebraic graph theory, matrix theory, and Lyapunov control approach.Consensus or synchronization, as one of the most important problems of MASs, is to design an appropriately distributed protocol to make different agents achieve a common state. Group consensus, as an extension of consensus, is very suitable for multitasks and large-scale problems. Up to now, there are many results for consensus or group consensus [7–18]. On the other hand, the controllability problem of multiagent systems has attracted great interests and concern since Tanner proposed it in 2004. In the past decades, many controllability criteria have been given for multiagent systems [19–24]. However, most of these results focused on single time scale. In [25], the group controllability of two-time-scale multiagent networks was firstly proposed and some easy-to-use criteria were proposed for group controllability of two-time-scale multiagent networks compared with the rank criterion. In [26], Long et al. further investigated second-order controllability of two-time-scale multiagent systems, and some more effective second-order controllability conditions would be determined only by the eigenvalues of system matrices. In [27], a new format of time-varying formation shape was proposed, and a new class of distributed adaptive observer-based controllers was designed under the mild assumption that both leaders and followers were introspective. As we know, most existing results have been obtained mainly based on the nodes of the network system. In some other real situations, each agent cannot obtain the neighbors state information in a real networked system. Therefore, in [28], the authors studied the discrete-time nonnegative edge synchronization of networked systems based on neighbors output information, which gives us a novelty and interesting synchronization method.


### 1.1. Related Contributions

It should be noticed that all the aforementioned results are based on the common assumption that the multiagent systems are homogeneous. In this situation, all agents of the whole systems have the same dynamics. However, in real life, almost every agent has its own dynamics because of different external and interaction impacts. Hence, it is natural for us to model heterogeneous multiagent systems. In recent years, some heterogeneous multiagent systems models have been established [29–32]. In [29], dynamical consensus of heterogeneous multiagent systems which consist of the first-order and second-order agent dynamics has been discussed. In [30], a consensus protocol is proposed for high-ordered heterogeneous systems with uncertain communication delays. Furthermore, more and more scholars pay much attention to the group consensus of heterogeneous systems. For example, in [31], a heterogeneous system consisting of first-order and second-order agents has been studied on the basis of fixed and switching topologies. In [32], some sufficient group consensus conditions have been obtained for a kind of heterogeneous system with diverse input time delays based on frequency-domain analysis method and matrix theory. In [33], some sufficient couple-group consensus conditions have been derived for a kind of discrete-time heterogeneous systems consisting of first-order and second- order agents under the influence of communication and input time delays. In [34], Li et al. studied the consensus problem in heterogeneous linear discrete-time MASs. In [35], Cui et al. discussed the consensus problem of heterogeneous chaotic network systems with or without delay. In [36], the consensus problems of linear systems and nonlinear systems were studied separately. In [37], Liu et al. studied the consensus problem of heterogeneous MASs under certain assumptions. In [38], Goldin et al. studied the consensus of heterogeneous networks with undirected topology.At the same time, some achievements have been made in the research of weighted consensus. For example, in [39], the concept of weighted consensus was proposed, and the multiagent weighted average consensus is studied. In [40], Shi et al. studied the robust consensus control for a class of MASs by PID algorithm and weighted edge dynamics. In addition, MASs based on cooperation-competition interactions are also receiving more and more attention. In [41], Hu et al. studied the second-order consensus problem of heterogeneous MASs. In [42], Hu et al. studied the swarming behavior of multiple Euler-Lagrange systems with cooperation-competition interactions.


### 1.2. The Main Motivation

It is obvious that heterogeneous systems are more complex than homogeneous systems and it is more difficult for us to deal with the relevant crucial topics. Inspired by the recent developments for heterogeneous multiagent systems, this paper will further investigate the weighted group consensus. To the best of our knowledge, most of existing literatures only discuss homogeneous systems, the multiagent systems in which all agent share a common value.In this paper, we mainly investigate the weighted group consensus for a class of continuous-time heterogeneous multiagent systems with input and communication time delay. In recent years, although group consensus of multiagent systems has derived many significant results. It is worth mentioning that most of the existing results only discussed the situation where all agents possessed a fixed weighted-value, even most of the obtained results mainly focused on the consensus of heterogeneous multiagent systems, and few results were proposed for group consensus of heterogeneous networks with input and communication time delay. Furthermore, all these related conclusions were based only on agents’ competitive or cooperative relation. However, in complicated practical situation, the consensus protocol needs to be adjusted with circumstances, cooperative tasks, or other constraint conditions. All these reasons incite us to study the weighted group consensus for heterogeneous multiagent systems with input and communication time delay.


### 1.3. Statement of Contributions

There are three main contributions in this paper. Firstly, the model is different from cooperative or competitive heterogeneous networks, both cooperative and competitive interactions are considered, it extends the scope of the existing research, and a kind of weighted couple-group consensus agreement based on cooperation-competition relationship is introduced, which is quite different from the literature [31, 32, 35, 37, 38]. Relying on the new protocol control, the agents can receive neighbor information more reasonably and speed up the system to achieve group consensus. Secondly, in order to simplify the analysis process, we remove the dynamic virtual speed of the first-order agent, such as in [29, 31, 32, 37]. A novel weighted couple-group consensus protocol is designed, which relaxes the in-degree balance condition and the results are also applicable to directed and undirected graphs. On the other hand, we turn the weighted matrix into a dynamic form, which makes the designed controller more flexible. Thirdly, some sufficient conditions have been obtained for the group consensus of this system by using graph theory, general Nyquist criterion, and Gerschgorin disc theorem. Unlike the [31, 32, 37], we do not require that the system satisfies the condition that the geometric versatility of the zero eigenvalues of the Laplacian matrix is not less than 2, which makes the system’s topology more flexible. With the help of these conditions, the time delay upper limit of this system can be computed and the multiagent system can converge to any given state only if the weighted group consensus parameters are satisfied. The simulation results well verify the correctness of the conclusion.The rest of this article is organized as follows. The second section lists some preliminary knowledge and problem description. The third section presents the main results and proof process of group consensus. The fourth section verifies the correctness and effectiveness of the proposed method through simulation. Finally we come to a conclusion.Note. In this context, C denotes a complex set and R denotes a real set. IN represents a unit matrix, where N represents a dimension. ReZ is the real part, and Z is the model, where ∀Z∈C. λiA represents the ith eigenvalue of matrix A, and det(A) represents the determinant of the matrix.


## 1.1. Related Contributions

It should be noticed that all the aforementioned results are based on the common assumption that the multiagent systems are homogeneous. In this situation, all agents of the whole systems have the same dynamics. However, in real life, almost every agent has its own dynamics because of different external and interaction impacts. Hence, it is natural for us to model heterogeneous multiagent systems. In recent years, some heterogeneous multiagent systems models have been established [29–32]. In [29], dynamical consensus of heterogeneous multiagent systems which consist of the first-order and second-order agent dynamics has been discussed. In [30], a consensus protocol is proposed for high-ordered heterogeneous systems with uncertain communication delays. Furthermore, more and more scholars pay much attention to the group consensus of heterogeneous systems. For example, in [31], a heterogeneous system consisting of first-order and second-order agents has been studied on the basis of fixed and switching topologies. In [32], some sufficient group consensus conditions have been obtained for a kind of heterogeneous system with diverse input time delays based on frequency-domain analysis method and matrix theory. In [33], some sufficient couple-group consensus conditions have been derived for a kind of discrete-time heterogeneous systems consisting of first-order and second- order agents under the influence of communication and input time delays. In [34], Li et al. studied the consensus problem in heterogeneous linear discrete-time MASs. In [35], Cui et al. discussed the consensus problem of heterogeneous chaotic network systems with or without delay. In [36], the consensus problems of linear systems and nonlinear systems were studied separately. In [37], Liu et al. studied the consensus problem of heterogeneous MASs under certain assumptions. In [38], Goldin et al. studied the consensus of heterogeneous networks with undirected topology.At the same time, some achievements have been made in the research of weighted consensus. For example, in [39], the concept of weighted consensus was proposed, and the multiagent weighted average consensus is studied. In [40], Shi et al. studied the robust consensus control for a class of MASs by PID algorithm and weighted edge dynamics. In addition, MASs based on cooperation-competition interactions are also receiving more and more attention. In [41], Hu et al. studied the second-order consensus problem of heterogeneous MASs. In [42], Hu et al. studied the swarming behavior of multiple Euler-Lagrange systems with cooperation-competition interactions.


## 1.2. The Main Motivation

It is obvious that heterogeneous systems are more complex than homogeneous systems and it is more difficult for us to deal with the relevant crucial topics. Inspired by the recent developments for heterogeneous multiagent systems, this paper will further investigate the weighted group consensus. To the best of our knowledge, most of existing literatures only discuss homogeneous systems, the multiagent systems in which all agent share a common value.In this paper, we mainly investigate the weighted group consensus for a class of continuous-time heterogeneous multiagent systems with input and communication time delay. In recent years, although group consensus of multiagent systems has derived many significant results. It is worth mentioning that most of the existing results only discussed the situation where all agents possessed a fixed weighted-value, even most of the obtained results mainly focused on the consensus of heterogeneous multiagent systems, and few results were proposed for group consensus of heterogeneous networks with input and communication time delay. Furthermore, all these related conclusions were based only on agents’ competitive or cooperative relation. However, in complicated practical situation, the consensus protocol needs to be adjusted with circumstances, cooperative tasks, or other constraint conditions. All these reasons incite us to study the weighted group consensus for heterogeneous multiagent systems with input and communication time delay.


## 1.3. Statement of Contributions

There are three main contributions in this paper. Firstly, the model is different from cooperative or competitive heterogeneous networks, both cooperative and competitive interactions are considered, it extends the scope of the existing research, and a kind of weighted couple-group consensus agreement based on cooperation-competition relationship is introduced, which is quite different from the literature [31, 32, 35, 37, 38]. Relying on the new protocol control, the agents can receive neighbor information more reasonably and speed up the system to achieve group consensus. Secondly, in order to simplify the analysis process, we remove the dynamic virtual speed of the first-order agent, such as in [29, 31, 32, 37]. A novel weighted couple-group consensus protocol is designed, which relaxes the in-degree balance condition and the results are also applicable to directed and undirected graphs. On the other hand, we turn the weighted matrix into a dynamic form, which makes the designed controller more flexible. Thirdly, some sufficient conditions have been obtained for the group consensus of this system by using graph theory, general Nyquist criterion, and Gerschgorin disc theorem. Unlike the [31, 32, 37], we do not require that the system satisfies the condition that the geometric versatility of the zero eigenvalues of the Laplacian matrix is not less than 2, which makes the system’s topology more flexible. With the help of these conditions, the time delay upper limit of this system can be computed and the multiagent system can converge to any given state only if the weighted group consensus parameters are satisfied. The simulation results well verify the correctness of the conclusion.The rest of this article is organized as follows. The second section lists some preliminary knowledge and problem description. The third section presents the main results and proof process of group consensus. The fourth section verifies the correctness and effectiveness of the proposed method through simulation. Finally we come to a conclusion.Note. In this context, C denotes a complex set and R denotes a real set. IN represents a unit matrix, where N represents a dimension. ReZ is the real part, and Z is the model, where ∀Z∈C. λiA represents the ith eigenvalue of matrix A, and det(A) represents the determinant of the matrix.


## 2. Problem Description and Preliminary Knowledge

In order to facilitate the follow-up work, we need introduce some preliminary knowledge of the graph theory.


### 2.1. Graph Theory and Interconnection Topology

ConsideringN agents, the topological relationship of the agent is represented by the graph G=(V,E,A), where V=v1,v2,⋯,vN represent the set of vertices of the graph. E⊆V×V and A=(aij)N×N∈RN×N represent the edge set and the adjacency matrix, respectively. In this article, the case of containing a self-loop is not considered.Note that the undirected graph can be thought as a special directed graph, and we assumeaij>0 if eij∈E in this paper. That is, if and only if the node (agent) is able to receive information from the node (agent), aij>0. At the same time, Ni=j∈V:eij∈E represents the set of neighbor nodes, and Di=degin(i)=∑j=1Naij represents the set of nodes within the degree, where the in-degree matrix D can also be expressed as diagd1,d2,⋯dN. Therefore, L=D-A is defined as a Laplacian matrix. Note. The adjacency matrix A is a symmetric matrix if and only if the graph is an undirected graph.


### 2.2. Problem Statement

Based on the above-mentioned preliminary knowledge of graph theory, in this paper we propose a heterogeneous multiagent system withN agents, which contains second-order and first-order dynamics. In order not to lose generality, it is assumed that the first n agents are second-order dynamics, and the last m agents are first-order dynamics, where N=m+n. The specific system model can be designed as follows:(1)x˙it=vit,v˙it=uit,i∈o1x˙it=uit,i∈o2,whereo1=1,2,…,n, o2=n+1,n+2,…,n+m, o=o1∪o2, xit, vit, and uit∈R, where xit is the location of the agent i, uit is the control rule of the i agent, and vit is the speed. Obviously, since each agent’s neighbors can be first-order or second-order, they are divided into Ni,s and Ni,f. So the neighbor node set Ni=Ni,f∪Ni,s. Because the dynamics of the agent in the system are heterogeneous, Its adjacency matrix can be expressed as(2)A=AsAsfAfsAfwhere As∈Rn×n is an adjacency matrix composed of second-order agents, Asf is composed of coupling weights from second-order agents to first-order agents, Afs is composed of first-order to second-order coupling weights, and Af∈Rm×m is an adjacency matrix composed of first-order agents. Therefore, we can further write the Laplacian matrix as follows.(3)L=D-A=Ls+Dsf-Asf-AfsLf+DfsThe matrix L represents the interaction between only the second-order agents, and the matrix Lf represents the interaction between only the first-order agents. It should be noted that both of the matrices are Laplacian matrices, where Dsf=diag∑j∈Ni,faij,i∈o1 and Dfs=diag∑j∈Ni,saij,i∈o2 are the in-degree matrix of the agent i, which represents the neighbor information received from different orders.To facilitate the follow-up work, here are some definitions and lemmas.Definition 1.
For the heterogeneous MASs to progressively implement the weighted couple-group consensus, the system should satisfy the following two conditions:(4)limt→+∞xit-xjt=0,ifi,j∈ok,k=1,2,limt→+∞vit-vjt=0,ifi,j∈ok,k=1.Definition 2.
For the bipartite graphG=V,E, the vertex set V can be split into two disjoint subsets V1 and V2, where V1∩V2=∅, and at the same time ∀e=w,q∈E, where w∈V1 and q∈V2.Lemma 3 (see [15]).
For an undirected bipartite graph,λiL∈R. At the same time, it should be noted that directed bipartite graphs containing directed spanning trees have the following two properties: (1) rankL=n-1, (2) when λiL≠0, ReλiL>0, where n is the number of system agents, matrix L=D+A.


## 2.1. Graph Theory and Interconnection Topology

ConsideringN agents, the topological relationship of the agent is represented by the graph G=(V,E,A), where V=v1,v2,⋯,vN represent the set of vertices of the graph. E⊆V×V and A=(aij)N×N∈RN×N represent the edge set and the adjacency matrix, respectively. In this article, the case of containing a self-loop is not considered.Note that the undirected graph can be thought as a special directed graph, and we assumeaij>0 if eij∈E in this paper. That is, if and only if the node (agent) is able to receive information from the node (agent), aij>0. At the same time, Ni=j∈V:eij∈E represents the set of neighbor nodes, and Di=degin(i)=∑j=1Naij represents the set of nodes within the degree, where the in-degree matrix D can also be expressed as diagd1,d2,⋯dN. Therefore, L=D-A is defined as a Laplacian matrix. Note. The adjacency matrix A is a symmetric matrix if and only if the graph is an undirected graph.


## 2.2. Problem Statement

Based on the above-mentioned preliminary knowledge of graph theory, in this paper we propose a heterogeneous multiagent system withN agents, which contains second-order and first-order dynamics. In order not to lose generality, it is assumed that the first n agents are second-order dynamics, and the last m agents are first-order dynamics, where N=m+n. The specific system model can be designed as follows:(1)x˙it=vit,v˙it=uit,i∈o1x˙it=uit,i∈o2,whereo1=1,2,…,n, o2=n+1,n+2,…,n+m, o=o1∪o2, xit, vit, and uit∈R, where xit is the location of the agent i, uit is the control rule of the i agent, and vit is the speed. Obviously, since each agent’s neighbors can be first-order or second-order, they are divided into Ni,s and Ni,f. So the neighbor node set Ni=Ni,f∪Ni,s. Because the dynamics of the agent in the system are heterogeneous, Its adjacency matrix can be expressed as(2)A=AsAsfAfsAfwhere As∈Rn×n is an adjacency matrix composed of second-order agents, Asf is composed of coupling weights from second-order agents to first-order agents, Afs is composed of first-order to second-order coupling weights, and Af∈Rm×m is an adjacency matrix composed of first-order agents. Therefore, we can further write the Laplacian matrix as follows.(3)L=D-A=Ls+Dsf-Asf-AfsLf+DfsThe matrix L represents the interaction between only the second-order agents, and the matrix Lf represents the interaction between only the first-order agents. It should be noted that both of the matrices are Laplacian matrices, where Dsf=diag∑j∈Ni,faij,i∈o1 and Dfs=diag∑j∈Ni,saij,i∈o2 are the in-degree matrix of the agent i, which represents the neighbor information received from different orders.To facilitate the follow-up work, here are some definitions and lemmas.Definition 1.
For the heterogeneous MASs to progressively implement the weighted couple-group consensus, the system should satisfy the following two conditions:(4)limt→+∞xit-xjt=0,ifi,j∈ok,k=1,2,limt→+∞vit-vjt=0,ifi,j∈ok,k=1.Definition 2.
For the bipartite graphG=V,E, the vertex set V can be split into two disjoint subsets V1 and V2, where V1∩V2=∅, and at the same time ∀e=w,q∈E, where w∈V1 and q∈V2.Lemma 3 (see [15]).
For an undirected bipartite graph,λiL∈R. At the same time, it should be noted that directed bipartite graphs containing directed spanning trees have the following two properties: (1) rankL=n-1, (2) when λiL≠0, ReλiL>0, where n is the number of system agents, matrix L=D+A.


## 3. Main Results

Most existing works are based on the competition or cooperation relationship of agents. At the same time, only a single form of delay is considered. For example, in [38], the grouping of heterogeneous systems with the same input delay is studied. Its system is described as follows:(5)x˙it=vit,v˙it=∑j∈o1aijxjt-τ-xit-τ+∑j∈o2aijxjt-τ+∑j∈o1aijvjt-τ-vit-τ+∑j∈o2aijvjt-τ,i∈o1.And(6)x˙it=vit-τ+∑j∈o2aijxjt-τ-xit-τ+∑j∈o1aijxjt-τ,v˙it=∑j∈o2aijxjt-xit+∑j∈o1aijxjt,i∈o2.In (5) and (6), it is not difficult to see that the agents rely on cooperative relationships for information exchange, and there are also speed estimates in the first-order agents. Considering that in practical applications, competitive interactions are inevitable. Therefore, we design a weighted couple-group consensus protocol that utilizes the competition-cooperative interaction of agents. The specific form is as follows:(7)x˙it=vit,v˙it=αi∑j∈Nsiaijxjt-τij-xit-τ-∑j∈Ndiaijxjt-τij+xit-τ-βivit-τ,i∈o1.And(8)x˙it=γi∑j∈Nsiaijxjt-τij-xit-τ-∑j∈Ndiaijxjt-τij+xit-τ,i∈o2.Here τij indicates communication delay between agent j and agent i, and τ represents the identical input delay of the agents. Nsi denotes a neighbor of the same dynamic as the agent i. Similarly, Ndi denotes a neighbor of a different dynamic from the agent i. Meanwhile, αi, βi, and γi>0, where αi=α1,α2,…,αN, βi=β1,β2,…,βN, γi=γ1,γ2,…,γN, N is the number of agents.Remark 4.
This paper designs a controller with weighted coefficients. By adjusting the weighted coefficient of the controller, the state of many agents can be globally converged to any given weighted state. Compared with the original controller, the designed controller is more flexible and more adaptable to different states. At the same time, when the agentj and the agent i have the same dynamic, we adopt a cooperative approach. When the agents j and i have different dynamic, we use a competitive approach. By using cooperation-competition relationship, we ensure that heterogeneous MASs can achieve weighted couple-group consensus.Theorem 5.
Based on system (7) and (8), and the undirected bipartite graph is assumed to be the topology of the system. if these conditions hold: βi2>2αiDi and τ∈0,min⁡1/2βi,1/2γimax⁡D~i, where Di=∑j∈Niaij, i∈o1 and D~i=∑j∈Niaij, i∈o2, then the system can progressively achieve weighted couple-group consensus.Proof.
By performing the Laplace transform on (7) and (8), we can get the following expression:(9)sxis=vis,svis=αi∑j∈Nsiaije-τijsxjs-e-τsxis-∑j∈Ndiaije-τijsxjs+e-τsxis-βie-τsvis,i∈o1.(10)sxis=γi∑j∈Nsiaije-τijsxjs-e-τsxis-∑j∈Ndiaije-τijsxjs+e-τsxis,i∈o2.Transform xit and vit into Laplace forms xis and vis, respectively. From the (9), we have(11)s2xis=αi∑j∈Nsiaije-τijsxjs-e-τsxis-∑j∈Ndiaije-τijsxjs+e-τsxis-βise-τsxis,i∈o1.After transformation, we can get the following formula:(12)sxis=-s2xis+αi∑j∈Nsiaije-τijsxjs-e-τsxis-∑j∈Ndiaije-τijsxjs+e-τsxisβie-τs,i∈o1.Next, we define xss=x1s,x2s,…,xnsT, xfs=xn+1s,xn+2s,…,xn+msT, and(13)L^=l^ijn+m×n+m=e-τijsaij,i≠j∑j∈Niaije-τs,i=j.
According to (10) and (12), we can get(14)sxss=-s2C2xss+C2C1-1L^s+D^sfxss-C2C1-1A^sfxfse-τs,sxfs=-C3-1A^fsxss-C3-1L^f+D^fsxfs.Here(15)C1=1α1…0⋮⋱⋮0⋯1αN,C2=1β1…0⋮⋱⋮0⋯1βN,C3=1γ1…0⋮⋱⋮0⋯1/γN.
Next, we defineys=xsTs,xfTsT, and we have(16)sys=Υ~sys.Here(17)Υ~s=-C2s2-C2C1-1L^s+D^sfe-τs-C2C1-1A^sfe-τs-C3-1A^fs-C3-1L^f+D^fs.According to (16), we can get Θ~s=detsI-Υ~s. According to the Lyapunov stability criterion, when the ReλiΘ~s<0, or s=0, the system achieves group consensus. Next, using general Nyquist criteria, we discuss these two situations.
Whens=0, it can be clearly seen that 0 is a characteristic value of the matrix D+A, so one root of the formula can be obtained when s=0. At the same time, when s=0, Θ~0=detD+A∏i=1nαi/∏i=1nβi∏i=1mγi.
Whens≠0, set Θ~s=detΦs+I and(18)Φs=s2C2+C2C1-1L^s+D^sfse-τsC2C1-1αiA^sfse-τsC3-1A^fssC3-1L^f+D^fsswhere s=jω. In order for the system to achieve group consensus, the general Nyquist criterion, if and only if the point -1,j0 is not surrounded by the Nyquist curve, Θ~s′s root is located on the left half of the complex field. Based on the Gerschgorin disk theorem, we can get(19)λΦjω∈Φi,i∈o1∪Φi,i∈o2.When i∈o1, we have the following.(20)Φi=x:x∈C,x-αijωβi∑j∈Niaij-jωβiejωτ≤∑j∈Niαiaijjωβie-jωτij-τFor the convenience of calculation, we set Di=∑j∈Niaij,i∈o1. At the same time, according to the general criteria, since the point -a,j0,a≥1, cannot be encircled in Φi, i∈o1, we can further transform the inequality into the following form:(21)-a-αiDijωβi-jωβiejωτ>∑j∈Niαiaijjωβie-jωτij-τ.According to the Euler formula and from (21), we can get(22)-a-αiDiωβij-jωβicos⁡ωτ+jsin⁡ωτ>αiDijωβicos⁡ωτij-τ-jsin⁡ωτij-τ.After some transformation, we can get the following.(23)a2-2aωβisin⁡ωτ+ω2βi2-2αiDiβi2cos⁡ωτ>0It is easy to see from (23) that when a≥1,a2-2aω/βisin⁡ωτ is monotonically increasing.(24)1-2ωβisin⁡ωτ+ω2βi2-2αiDiβi2cos⁡ωτ>0Since βi is a positive number, we can transform (24) into the following form.(25)βi2-2ωβisin⁡ωτ+ω2-2αiDicos⁡ωτ>0According to (24), it is obvious that the following two inequalities are true:(26)2αiDicos⁡ωτ-βi2<0and(27)2ωβisin⁡ωτ-ω2<0.According to (26), we can get βi2>2αiDi, because cos⁡ωτ≤1. According to (27), we can change it to the following form.(28)1-2βiτsin⁡ωτωτ>0Since sin⁡ωτ/ωτ≤1, (27) is established if and only if τ≤1/2βi.
Similarly, wheni∈o2, we can get the following inequalities according to the Gerschgorin theorem:(29)Φi=x:x∈C,x-γijω∑j∈Niaije-jωτ≤∑j∈Niγiaijjωe-jωτijso, the point -a,j0, a≥1, cannot be encircled in Φi, i∈o2, and then the following inequality is obtained.(30)-a-γijω∑j∈Niaije-jωτ>∑j∈Niγiaijjωe-jωτijNext, we define D~i=∑j∈Niaij,i∈o2; then from (30), we have the following.(31)-a+γiD~ijω∑j∈Nijcos⁡ωτ+sin⁡ωτ>∑j∈NiγiD~ijω-jcos⁡ωτij-sin⁡ωτijAfter some calculations, we can get the following simplified formula.(32)a2-2aγiD~iωsin⁡ωτ>0From (32), we know that a2-2aγiD~i/ωsin⁡ωτ will gradually increase as a increases. Here we set a=1. Obviously, we have the following.(33)1-2γiD~iωsin⁡ωτ>0Since sin⁡ωτ/ωτ≤1, (32) is established if and only if τ≤1/2γiD~i.
Obviously, we have completed the proof of Theorem5.Corollary 6.
Based on system (7) and (8), a bipartite digraph containing a directed spanning tree is assumed to be the topology of the system. If these conditions hold: βi2>2αiDi and τ∈0,min⁡1/2βi,1/2γimax⁡D~i, where Di=∑j∈Niaij,i∈o1, and D~i=∑j∈Niaij,i∈o2, then the system can progressively achieve weighted couple-group consensus.Combined with the previous analysis, it is clear that the theorem is completed.Using Proof and Lemma3, it is clear that Corollary 6 is true.Theorem5 is proved.Remark 7.
From Theorem5, we can see that the control parameters αi, βi, γi and coupling weight of the system are the key parameters affecting the consensus of the weighted couple-group, and the input time delay is determined by the coupling weight and the control parameters. However, we can see that communication delay has no effect on group consensus.Remark 8.
The proposed system (7) and (8) is constructed by using the cooperation-competitive interaction between agents in this paper. Since most of the agents currently working rely on the cooperation or competitive relationship, such as in [17, 18, 29, 31, 32, 34–39], this paper studies the group consensus of heterogeneous complex systems from a new perspective. At the same time, it should be noted that in the proposed protocol, the first-order agent does not contain virtual speed estimation, which can make more rational use of resources and reduce computational cost, for example, in [29, 31, 32, 37].Remark 9.
Different from the works in [31, 32, 37], we have relaxed the condition of intra-degree balance, which facilitates communication between agents. In real life, there are many limitations in in-degree balance, because it will result in no actual communication between subsystems [13]. In other words, it will cause the interaction between agents in different subsystems to be offset. At the same time, we do not require that the system satisfies the condition that the geometric versatility of the zero eigenvalues of the Laplacian matrix is not less than 2, which makes the system’s topology more flexible.Remark 10.
Most of the works are weighted by a fixed value. We use dynamic weighted methods here, namely,αi, βi, and γi. The weighted coefficients corresponding to each agent are different, which enables the MASs state to converge globally to any given weighted state. Compared with the original controller, the designed controller is more flexible and more adaptable to different states. In addition, in most of the existing works, the consideration of the delay problem is relatively simple. Only the effects of either input delays [36] or time delays are not considered, such as [31, 32, 36].To discuss the effect of different input delays and communication delays on the multiagent implementation of group consensus, we rewrite (7) and (8) as follows:(34)x˙it=vit,v˙it=αi∑j∈Nsiaijxjt-τij-xit-τi-∑j∈Ndiaijxjt-τij+xit-τi-βivit-τi,i∈o1.(35)x˙it=γi∑j∈Nsiaijxjt-τij-xit-τi-∑j∈Ndiaijxjt-τij+xit-τi,i∈o2.Here τij represents the communication delay between the agents i and j, and τi represents the input time delay of the agent i.Theorem 11.
Based on Protocol (34) and (35), the undirected bipartite graph is assumed to be the topology of the system. If these conditions hold: βi2>2αiDi and if i∈o1,τi∈0,1/2βi or, otherwise, τi∈0,1/2γiD~i,i∈o2, where Di=∑j∈Niaij, i∈o1, and D~i=∑j∈Niaij, i∈o2, then the system can progressively achieve weighted couple-group consensus.Corollary 12.
Based on Protocol (34) and (35), a bipartite digraph containing a directed spanning tree is assumed to be the topology of the system. If these conditions hold: βi2>2αiDi and if i∈o1, τi∈0,1/2βi or, otherwise, τi∈0,1/2γiD~i, i∈o2, where Di=∑j∈Niaij, i∈o1, and D~i=∑j∈Niaij, i∈o2, then the system can progressively achieve weighted couple-group consensus.The conclusion here is obvious.Remark 13.
From Theorem11, the communication delay of the agent has no effect on the group consensus of the system. At the same time, the upper limit of the input time delay is controlled by the control parameters and coupling weights with the same dynamics, and the delay conditions between different dynamics are different. Communication delay has no effect on the group consensus of the system.Remark 14.
Since the system needs some other external conditions when implementing group consensus, our assumed topology is not a specific topology. For example, in [31, 32, 36, 37], the topology of the system is also an undirected graph or a graph containing a directed spanning tree. At the same time, in order to achieve group consensus, some additional assumptions are needed, mentioned in Remarks 7, 8, and 9.


## 4. Simulation

In this section, several simulation results will be used to illustrate the validity of the results obtained. Figure1 shows a binary topology of a heterogeneous system. The entire system is divided into two subgroups, G1 and G2. The system contains agents 1, 2, 3, 4, 5, 6, and 7. In order not to lose generality, we denote 2, 4, and 7 as second-order agents, denoted by o1. The first-order agent includes the remaining agents 1, 3, 5, and 6 and is represented by o2. Obviously, subgroup G1 and subgroup G1 are heterogeneous in Figure 1.Figure 1
The bipartite digraph topology of the heterogeneous MASs.Remark 15.
From Figure1, the dynamics of the agents in subgroup G1 and subgroup G2 are heterogeneous. Obviously, we do not require that the dynamics of agents within the same subgroup be homogeneous, such as [32, 37].Example 16.
For convenience, we setaij=1,i,j∈1,7, and let αi=diag1,1.5,2,3,0.9,0.8,0.5, βi=diag3,4,3,4,3,3,2, γi=diag1,1.5,2,3,0.9,0.8,0.5. Since Figure 1 is an undirected bipartite graph, we can get d1=2,d2=4,d3=2,d4=2,d5=2,d6=2,d7=2.
According to the qualification conditions proposed by Theorem5, we can calculate the range of the input delay as τ=min⁡τ1,τ2,τ3,τ4,τ5,τ6,τ7. In the simulation experiment, we assume τ=0.05. Obviously, τ at this time satisfies all the qualifications. To verify the impact of different delays on system group consensus, we assume different input delays and communication delays. In Figure 2, we assume an input delay of τ=0.05 and then input different communication delays to compare their effects on the system convergence rate. In Figure 3, we fixed the communication delay and then assumed different input delays.Figure 2
The agents position trajectories, whereτ=0.05. (a) τij=0, (b) τij=0.5, and (c) τij=0.9.
(a) (b) (c)Figure 3
The agents position trajectories, whereτij=0.2. (a) τ=0, (b) τ=0.03, and (c) τ=0.08.
(a) (b) (c)Remark 17.
It can be seen from Figures2 and 3 that the input delay and communication delay will affect the convergence trajectory of the agent. When the input delay or the communication delay increases, the convergence speed of the agent decreases, so we can increase the convergence speed by reducing the delay.From the qualification of Theorem11, we can calculate the range of input delay for each agent: τ1=0,1/4, τ2=0,1/8, τ3=0,1/8, τ4=0,1/8, τ5=0,1/3.6, τ6=0,1/3.2, τ7=0,1/4. Here we take τ1=0.2, τ2=0.1, τ3=0.1,τ4=0.1,τ5=0.15,τ6=0.25,τ7=0.2. Obviously all τ are satisfied with Theorem 11. Figure 4 demonstrates that weighted couple-group consensus is achievable. At the same time, according to the upper bound calculated by Theorem 11, we assume τ2=0.5. As can be seen from Figure 5, the system is divergent at this time.Figure 4
The state trajectories of the agents under undirected topology in Figure1 with different input time delays τ1=0.2, τ2=0.1, τ3=0.1, τ4=0.1, τ5=0.15, τ6=0.25, τ7=0.2, communication delay τij=0.9. (a) Positions. (b) Velocities.
(a) (b)Figure 5
The state trajectories of the agents under undirected topology in Figure1 with different input time delays τ1=0.2, τ2=0.5, τ3=0.1, τ4=0.1, τ5=0.15, τ6=0.25, τ7=0.2, communication delay τij=0.9. (a) Positions. (b) Velocities.
(a) (b)Next, we will testify Theorem11 and Corollary 12.Example 18.
We assume that the topology of a heterogeneous system contains a directed spanning tree, as shown in Figure6. Since Figure 6 is an directed bipartite graph, we can get d1=2,d2=3,d3=1,d4=1,d5=1,d6=1,d7=2. According to Corollary 6, we can assume that τ=0.05; obviously, τ satisfies all the qualifications. In Figure 7, we set the input delay τ=0.05 to a fixed value and enter different communication delays. According to the topology and Corollary 12 of Figure 6, we set τ1=0.2,τ2=0.1,τ3=0.2,τ4=0.1,τ5=0.5,τ6=0.5,τ7=0.2, and τij=0.9, as shown in Figure 8. Obviously, from Figures 7 and 8, we can easily find that the system can progressively implement weighted couple-group consensus. When τ4=0.5, the system is divergent, as shown in Figure 9.Figure 6
The directed graph topology of the heterogeneous MASs.Figure 7
The agents position trajectories, whereτ=0.05. (a) τij=0, (b) τij=0.5, and (c) τij=0.9.
(a) (b) (c)Figure 8
The state trajectories of the agents under directed topology in Figure6 with different input time delays τ1=0.2, τ2=0.1, τ3=0.1, τ4=0.1, τ5=0.5, τ6=0.5, τ7=0.2, communication delay τij=0.9. (a) Positions. (b) Velocities.
(a) (b)Figure 9
The state trajectories of the agents under directed topology in Figure6 with different input time delays τ1=0.2, τ2=0.1, τ3=0.1, τ4=0.5, τ5=0.5, τ6=0.5, τ7=0.2, communication delay τij=0.9. (a) Positions. (b) Velocities.
(a) (b)


## 5. Conclusion

This paper studies the group consensus problem of heterogeneous MASs based on bipartite graph structure. The dynamic weighted couple-group consensus in the case of time delay is considered. A new weighted couple-group consensus protocol is designed by using cooperation and competition interaction between agents. Using graph theory, matrix theory, Gerschgorin disk theorem, and general Nyquist criterion, the upper bound of the maximum delay that can be tolerated when the system reaches convergence is obtained. It is not difficult to see from the theoretical results that the weighted couple-group consensus of the heterogeneous MASs is not directly related to the communication delay. The heterogeneous MASs implement weighted couple-group consensus, which is determined by the coupling weight between the agents, the input time delay, and the control parameters. In addition, in order to speed up the convergence of the system, we can reduce the communication delay or input delay, or both of them. The simulation example validated the results. In the future work, we will study the group consensus problems of more complex heterogeneous multiagent systems. For example, we will consider switching topology or event driven.



---

*Source: 8012890-2019-03-17.xml*