# Cluster Anticonsensus of Multiagent Systems Based on theQ-Theory

Authors: Liping Zhang; Haibo Jiang; Shuguang Guo
Journal: Discrete Dynamics in Nature and Society
 (2014)

---

## Abstract

We investigate the problem of cluster anticonsensus of multiagent systems.  For multiagent continuous systems, a new control protocol is designed based on theQ-theory. Then by LaSalle's invariance principle we prove that if the graph is connected and bipartite, then the cluster anticonsensus is achieved
by the proposed control protocol.  On the other hand,  a similar control protocol is designed for multiagent discrete-time systems. Then, sufficient conditions are given to guarantee the cluster anticonsensus of multiagent discrete-time systems by
using the Q-theory and LaSalle's invariance principle. Numerical simulations show the effectiveness of our theoretical results.


---

## Body

## 1. Introduction

Recently, multiagent systems have attracted much attention in various disciplines, such as mathematical, physical, biological, and social sciences [1–4]. The multiagent systems can generate a desired collective behavior by local interaction among the agents, such as group consensus, group coordination, and oscillator synchronization [5–7]. Very recently, many researchers have investigated several consensus problems of multiagent systems, such as consensus over directed networks with fixed and switching topologies, consensus over networks with input delays, and stochastic consensus seeking with measurement noise [8–13]. In [14, 15], a kind of impulsive control protocol has been introduced for multiagent linear and nonlinear systems, respectively.On the other hand, synchronization of chaotic systems and complex networks has sparked the interest of many researchers. Many different types of synchronization phenomena have been observed such as complete synchronization, generalized synchronization, lag synchronization, antisynchronization, and cluster synchronization [16–24]. Among them, antisynchronization is a noticeable phenomenon which has been observed in periodic oscillators and some biological systems. When the systems achieve antisynchronization, their states have the same absolute values but opposite signs. Now antisynchronization has been investigated and many results have been published [19–22]. Besides, cluster synchronization often exists in biological science and communication engineering. When the systems achieve cluster synchronization, the nodes in the same group reach consensus with each other, but there is no synchronization between nodes in different groups. More recently cluster synchronization has been investigated intensively [23, 24]. To the best of our knowledge, however, there are very few results on cluster anticonsensus of multiagent systems, which motivates this study. When the systems achieve the cluster anticonsensus, the nodes can be partitioned into two disjoint groups. Besides, the nodes in the same group reach consensus with each other and the states of the nodes in different groups have the same absolute values but opposite signs. In [25], the authors studied the phenomenon of the synchronization in the array of the pendulum clocks hanging from an elastically fixed horizontal beam and observed the cluster antisynchronization phenomenon in the experiment of n Huygens’ clocks, that is, antiphase synchronization in n
/
2 pairs of pendula for even n. Since Huygens’ clocks are classical oscillators, we believe that cluster anticonsensus is useful for the array of oscillators and can be applied to secure communications, biological engineering, and so on in the future.Very recently the signless Laplacian has attracted the attention of researchers. Several papers on the signless Laplacian spectrum have been reported since 2005 and a new spectral theory of graphs which is called theQ-theory is developing by many researchers [26–31]. Many real-world networks can be represented by bipartite graphs which have been extensively used in modern coding theory, concurrent systems, projective geometry, distributed systems, and so on. More recently, the cluster and community structure of bipartite networks has been studied by many researchers [32]. Therefore, the cluster anticonsensus problem of multiagent systems over the networks whose graphs are connected and bipartite is worth studying. In [33], the authors investigated the problem of impulsive cluster anticonsensus of discrete multiagent linear dynamic systems and sufficient conditions are given to guarantee the cluster anticonsensus of the discrete multiagent linear dynamic system based on the Q-theory.In this paper, we investigate the problem of cluster anticonsensus of multiagent systems based on theQ-theory. For multiagent continuous systems, a new control protocol is designed and by LaSalle’s invariance principle we prove that if the graph is connected and bipartite, then the cluster anticonsensus is achieved by the proposed control protocol. On the other hand, the cluster anticonsensus of multiagent discrete-time systems is considered and sufficient conditions are given to guarantee the cluster anticonsensus.This paper is organized as follows. In Section2, we provide some results in the Q-theory. In Section 3, we investigate the cluster anticonsensus problem for multiagent continuous systems. Section 4 considers the cluster anticonsensus of multiagent discrete-time systems. In Section 5, numerical simulations are included to show the effectiveness of our theoretical results. Some conclusions are drawn in Section 6.Notation.
Throughout this paper, the superscripts “−1” and “T” stand for the inverse and transpose of a matrix, respectively;ℝ
n denotes the n-dimensional Euclidean space. Let ℝ be the set of real numbers, ℕ
=
{
0,1
,
2
,
…
}; ℝ
n
×
m is the set of all n
×
m real matrices. For real symmetric matrices X and Y, the notation X
≥
Y (X
>
Y, resp.) means that the matrix X
-
Y is positive semidefinite (positive definite, resp.); I
n
∈
ℝ
n
×
n is an identity matrix.


## 2. Preliminaries

In this section, we provide some results in theQ-theory [26–31, 34].An undirected graph𝒢 of order N consists of a vertex set 𝒱
=
{
1,2
,
…
,
N
} and an edge set ℰ
=
{
(
i
,
j
)
:
i
,
j
∈
𝒱
}
⊂
𝒱
×
𝒱. The set of neighbors of vertex i is denoted by 𝒩
i
=
{
j
∈
𝒱
:
(
i
,
j
)
∈
ℰ
,
j
≠
i
}. A path between each distinct vertices i and j means a sequence of distinct edges of 𝒢 of the form (
i
,
k
1
)
,
(
k
1
,
k
2
)
,
…, and (
k
l
,
j
). A cycle is a path such that the start vertex and end vertex are the same. If there is a path between any two vertices of a graph 𝒢, then 𝒢 is connected otherwise disconnected. A graph 𝒢 is a bipartite graph if 𝒱
(
𝒢
) can be partitioned into two disjoint subsets U and W, called partite sets, such that every edge of 𝒢 joins a vertex of U and a vertex of W. A graph is bipartite if and only if it does not contain an odd cycle.A weighted adjacency matrixA
=
[
a
i
j
]
∈
ℝ
N
×
N, where a
i
i
=
0 and a
i
j
=
a
j
i
≥
0, i
≠
j. a
i
j
>
0 if and only if there is an edge between vertex i and vertex j. For an unweighted graph 𝒢
,
A is a 0-1 matrix. The outdegree of vertex i is defined as de
g
out
(
i
)
=
∑
j
=
1
n
‍
a
i
j. Let D be the diagonal matrix with the outdegree of each vertex along the diagonal and call it the degree matrix of 𝒢. The signless Laplacian matrix of the weighted graph is defined as Q
𝒢
=
D
+
A. For an unweighted graph 𝒢,
(1)
Q
𝒢
=
[
q
i
j
]
N
×
N
,
where
(2)
q
i
j
=
{
|
𝒩
i
|
,
i
=
j
,
1
,
j
∈
𝒩
i
,
0
,
otherwise
,
and here |
𝒩
i
| denotes the cardinality of the set |
𝒩
i
|.Let𝒢 be an undirected graph on N vertices, having m edges. Let R be its vertex edge incidence matrix which is a N
×
m matrix such that r
i
j
=
1 if the vertex i and edge e
j are incident and 0 if otherwise. The following relations are well known:
(3)
R
R
T
=
D
+
A
=
Q
.From (3), the signless Laplacian is a positive semidefinite matrix; that is, all its eigenvalues are nonnegative. Let 𝒢 be a graph with Q-eigenvalues q
1
,
q
2
,
…
,
q
N (q
1
≥
q
2
≥
⋯
≥
q
N). The largest eigenvalue q
1 is called the Q-index of 𝒢.Lemma 1 (see [26]).
The least eigenvalue of the signless Laplacian of a connected graph is equal to 0 if and only if the graph is bipartite. In this case 0 is a simple eigenvalue.Lemma 2 (see [31]).
Let𝒢 be a graph on N vertices with vertex degrees d
1
,
d
2
,
…
,
d
N and largest Q-eigenvalue q
1. Then
(4)
2
min
⁡
1
≤
i
≤
N
⁡
d
i
≤
q
1
≤
2
max
⁡
1
≤
i
≤
N
⁡
d
i
.
For a connected graph𝒢, equality holds in either of these inequalities if and only if 𝒢 is regular.


## 3. Cluster Anticonsensus of Multiagent Continuous Systems

In this section, we investigate the cluster anticonsensus problem for multiagent continuous systems.Here, we consider a continuous system consisting ofN agents indexed by i
=
1,2
,
…
,
N. The dynamics of each agent is
(5)
x
˙
i
(
t
)
=
u
i
(
t
)
,
i
=
1,2
,
…
,
N
,
where x
i
(
t
)
∈
ℝ and u
i
(
t
)
∈
ℝ are the state and the control input of agent i at time t, respectively. x
i
(
0
) is the initial value of agent i.Different from the traditional control protocol by the Lapalacian matrix [5–7], a new control protocol is designed by the signless Laplacian matrix to achieve the cluster anticonsensus of multiagent systems. The control input of agent i is designed as
(6)
u
i
(
t
)
=
-
∑
j
∈
𝒩
i
(
x
i
(
t
)
+
x
j
(
t
)
)
,
i
=
1,2
,
…
,
N
,
where 𝒩
i is the set of neighbors of agent i.Then, under the control protocol (6), the dynamics of agent i satisfies the following equations:
(7)
x
˙
i
(
t
)
=
-
∑
j
∈
𝒩
i
(
x
i
(
t
)
+
x
j
(
t
)
)
,
i
=
1,2
,
…
,
N
.Letx
(
t
)
=
(
x
1
(
t
)
,
x
2
(
t
)
,
…
,
x
N
(
t
)
)
T, then the system (7) can be described as
(8)
x
˙
(
t
)
=
-
Q
x
(
t
)
,
where Q is the signless Laplacian of the graph 𝒢 of the network.Definition 3.
For the system (5), the cluster anticonsensus is said to be achieved under the control protocol (6) if
(9)
lim
⁡
i
1
,
i
2
∈
U
,
t
→
+
∞
|
x
i
1
(
t
)
-
x
i
2
(
t
)
|
=
0
,
lim
⁡
j
1
,
j
2
∈
W
,
t
→
+
∞
|
x
j
1
(
t
)
-
x
j
2
(
t
)
|
=
0
,
lim
⁡
i
∈
U
,
j
∈
W
,
t
→
+
∞
|
x
i
(
t
)
+
x
j
(
t
)
|
=
0
,
where U and W are two nonempty subsets of 𝒱
(
𝒢
) and U
∩
W
=
∅ and U
∪
W
=
𝒱
(
𝒢
).Remark 4.
From Definition3, if the system (5) achieves the cluster anticonsensus, the nodes can be partitioned into two disjoint groups. Besides, the nodes in the same group completely reach consensus with each other and the states of the nodes in different groups have the same absolute values but opposite signs. Since all state errors of the nodes in the same group converge to 0, then this cluster anticonsensus is complete cluster anticonsensus in fact.Now we develop the cluster anticonsensus results of the system (5) in the following.Theorem 5.
Consider the system (5). If the graph 𝒢 of the network is connected and bipartite, then the cluster anticonsensus is achieved under the control protocol (6). Moreover,
(10)
lim
⁡
i
∈
U
,
t
→
+
∞
x
i
(
t
)
=
-
lim
⁡
j
∈
W
,
t
→
+
∞
x
j
(
t
)
=
c
,
where U and W are two partite sets of the graph 𝒢; c
=
(
∑
i
∈
U
‍
x
i
(
0
)
-
∑
j
∈
W
‍
x
j
(
0
)
)
/
N.Proof.
Consider the Lyapunov function candidate(11)
V
(
x
(
t
)
)
=
x
T
(
t
)
Q
x
(
t
)
=
∑
i
=
1
N
∑
j
∈
𝒩
i
,
j
<
i
‍
(
x
i
(
t
)
+
x
j
(
t
)
)
2
.
Taking the derivative ofV
(
x
(
t
)
) with respect to t, we obtain
(12)
V
˙
(
x
(
t
)
)
=
x
˙
T
(
t
)
Q
x
(
t
)
+
x
T
(
t
)
Q
x
˙
(
t
)
=
-
2
x
T
(
t
)
Q
T
Q
x
(
t
)
=
-
2
(
Q
x
(
t
)
)
T
Q
x
(
t
)
≤
0
.
Obviously,V
˙
(
x
(
t
)
)
=
0 if and only if Q
x
(
t
)
=
0. Thus the set E
=
{
x
:
Q
x
(
t
)
=
0
}. By LaSalle’s invariance principle [35], we get x
i
(
t
)
+
x
j
(
t
)
→
0
,
t
→
∞, j
∈
𝒩
i, and 1
≤
i, j
≤
N. Let U and W be two partite sets of the bipartite 𝒢. Since the graph 𝒢 of the network is connected by Lemma 1 and [33, Lemma 2.1], it follows that
(13)
lim
⁡
i
1
,
i
2
∈
U
,
t
→
+
∞
|
x
i
1
(
t
)
-
x
i
2
(
t
)
|
=
0
,
lim
⁡
j
1
,
j
2
∈
W
,
t
→
+
∞
|
x
j
1
(
t
)
-
x
j
2
(
t
)
|
=
0
,
lim
⁡
i
∈
U
,
j
∈
W
,
t
→
+
∞
|
x
i
(
t
)
+
x
j
(
t
)
|
=
0
.
Therefore, the cluster anticonsensus is achieved under the control protocol (6).
Observe that∑
i
∈
U
‍
x
˙
i
(
t
)
-
∑
j
∈
W
‍
x
˙
j
(
t
)
=
0. This implies that ∑
i
∈
U
‍
x
i
(
t
)
-
∑
j
∈
W
‍
x
j
(
t
) is invariant. Then, we have
(14)
lim
⁡
i
∈
U
,
t
→
+
∞
x
i
(
t
)
=
-
lim
⁡
j
∈
W
,
t
→
+
∞
x
j
(
t
)
=
c
,
where c
=
(
∑
i
∈
U
‍
x
i
(
0
)
-
∑
j
∈
W
‍
x
j
(
0
)
)
/
N. This completes the proof.


## 4. Cluster Anticonsensus of Multiagent Discrete-Time Systems

In this section, we consider the cluster anticonsensus of multiagent discrete-time systems.Here, we consider a discrete-time system consisting ofN agents indexed by i
=
1,2
,
…
,
N. The dynamics of each agent is
(15)
x
i
(
k
+
1
)
=
x
i
(
k
)
+
ϵ
u
i
(
k
)
,
k
∈
ℕ
,
i
=
1,2
,
…
,
N
,
where x
i
(
t
)
∈
ℝ and u
i
(
t
)
∈
ℝ are the state and the control input of agent i at step k, respectively. ϵ
>
0 is a positive constant to be determined later. x
i
(
0
) is the initial value of agent i.Similar to (6), the control input of agent i is designed as
(16)
u
i
(
k
)
=
-
∑
j
∈
𝒩
i
‍
(
x
i
(
k
)
+
x
j
(
k
)
)
,
i
=
1,2
,
…
,
N
,
where 𝒩
i is the set of neighbors of agent i.Then, under the control protocol (16), the dynamics of agent i satisfies the following equations:
(17)
x
i
(
k
+
1
)
=
x
i
(
k
)
-
ϵ
∑
j
∈
𝒩
i
‍
(
x
i
(
k
)
+
x
j
(
k
)
)
,
i
=
1,2
,
…
,
N
.Letx
(
k
)
=
(
x
1
(
k
)
,
x
2
(
k
)
,
…
,
x
N
(
k
)
)
T, then the system (17) can be described as
(18)
x
(
k
+
1
)
=
(
I
-
ϵ
Q
)
x
(
k
)
,
where Q is the signless Laplacian of the graph 𝒢 of the network.Definition 6.
For the system (15), the cluster anticonsensus is said to be achieved under the control protocol (16) if
(19)
lim
⁡
i
1
,
i
2
∈
U
,
k
→
+
∞
|
x
i
1
(
k
)
-
x
i
2
(
k
)
|
=
0
,
lim
⁡
j
1
,
j
2
∈
W
,
k
→
+
∞
|
x
j
1
(
k
)
-
x
j
2
(
k
)
|
=
0
,
lim
⁡
i
∈
U
,
j
∈
W
,
k
→
+
∞
|
x
i
(
t
)
+
x
j
(
k
)
|
=
0
,
where U and W are two nonempty subsets of 𝒱
(
𝒢
) and U
∩
W
=
∅ and U
∪
W
=
𝒱
(
𝒢
).Now sufficient conditions which guarantee the cluster anticonsensus of the system (15) are proposed in the following theorem.Theorem 7.
Consider the system (15). Assume that the graph 𝒢 of the network is connected and bipartite. If ϵ is chosen such that 0
<
ϵ
<
1
/
d
max
⁡, where d
max
⁡ is the maximum degree of the graph 𝒢, then the cluster anticonsensus is achieved under the control protocol (16). Moreover,
(20)
lim
⁡
i
∈
U
,
k
→
+
∞
x
i
(
k
)
=
-
lim
⁡
j
∈
W
,
k
→
+
∞
x
j
(
k
)
=
c
,
where U and W are two partite sets of the graph 𝒢; c
=
(
∑
i
∈
U
‍
x
i
(
0
)
-
∑
j
∈
W
‍
x
j
(
0
)
)
/
N.Proof.
Consider the Lyapunov function candidate(21)
V
(
x
(
k
)
)
=
x
T
(
k
)
Q
x
(
k
)
=
∑
i
=
1
N
‍
∑
j
∈
𝒩
i
,
j
<
i
‍
(
x
i
(
k
)
+
x
j
(
k
)
)
2
.
Then, we have(22)
Δ
V
(
x
(
k
)
)
=
V
(
x
(
k
+
1
)
)
-
V
(
x
(
k
)
)
=
x
T
(
k
+
1
)
Q
x
(
k
+
1
)
-
x
T
(
k
)
Q
x
(
k
)
=
x
T
(
k
)
(
I
-
ϵ
Q
)
T
Q
(
I
-
ϵ
Q
)
x
(
k
)
-
x
T
(
k
)
Q
x
(
k
)
=
x
T
(
k
)
(
-
2
ϵ
Q
2
+
ϵ
2
Q
3
)
x
(
k
)
.
Letq
1
≥
q
2
≥
⋯
≥
q
N be the eigenvalues of Q and let P be a nonsingular matrix such that P
-
1
Q
P
=
diag
⁡
{
q
1
,
q
2
,
…
,
q
N
}. Since the graph 𝒢 of the network is connected and bipartite, by Lemma 1, it follows that q
N
=
0 is a simple eigenvalue of Q. Then, P
-
1
(
-
2
ϵ
Q
2
+
ϵ
2
Q
3
)
P
=
diag
⁡
{
-
2
ϵ
q
N
2
+
ϵ
2
q
N
3
,
…
,
-
2
ϵ
q
2
2
+
ϵ
2
q
2
3
,
0
}. By Lemma 2, we have 0
<
q
i
≤
2
d
max
⁡, i
=
1
,
…
,
N
-
1, where d
max
⁡ is the maximum degree of the graph 𝒢. If ϵ is chosen such that 0
<
ϵ
<
1
/
d
max
⁡, then -
2
ϵ
q
i
2
+
ϵ
2
q
i
3
<
0, i
=
1
,
…
,
N
-
1. This implies that -
2
ϵ
Q
2
+
ϵ
2
Q
3
≤
0 and 0 is a simple eigenvalue of -
2
ϵ
Q
2
+
ϵ
2
Q
3. Therefore, Δ
V
(
x
(
k
)
)
≤
0. Obviously, Δ
V
(
x
(
k
)
)
=
0 if and only if x
T
(
k
)
(
-
2
ϵ
Q
2
+
ϵ
2
Q
3
)
x
(
k
)
=
0; that is, Q
x
(
k
)
=
0. Thus, the set E
=
{
x
:
Q
x
(
k
)
=
0
}. By LaSalle’s invariance principle [35], we get x
i
(
k
)
+
x
j
(
k
)
→
0, k
→
∞, j
∈
𝒩
i, and 1
≤
i, j
≤
N. Let U and W be two partite sets of the graph 𝒢. Since the graph 𝒢 of the network is connected, by Lemma 1 and [33, Lemma 2.1], it follows that
(23)
lim
⁡
i
1
,
i
2
∈
U
,
k
→
+
∞
|
x
i
1
(
k
)
-
x
i
2
(
k
)
|
=
0
,
lim
⁡
j
1
,
j
2
∈
W
,
k
→
+
∞
|
x
j
1
(
k
)
-
x
j
2
(
k
)
|
=
0
,
lim
⁡
i
∈
U
,
j
∈
W
,
k
→
+
∞
|
x
i
(
k
)
+
x
j
(
k
)
|
=
0
.
Therefore, the cluster anticonsensus is achieved under the control protocol (16).
Observe that∑
i
∈
U
‍
(
x
i
(
k
+
1
)
-
x
i
(
k
)
)
-
∑
j
∈
W
‍
(
x
j
(
k
+
1
)
-
x
j
(
k
)
)
=
0. This implies that ∑
i
∈
U
‍
x
i
(
k
)
-
∑
j
∈
W
‍
x
j
(
k
) is invariant. Then, we have
(24)
lim
⁡
i
∈
U
,
k
→
+
∞
x
i
(
k
)
=
-
lim
⁡
j
∈
W
,
k
→
+
∞
x
j
(
k
)
=
c
,
where c
=
(
∑
i
∈
U
‍
x
i
(
0
)
-
∑
j
∈
W
‍
x
j
(
0
)
)
/
N. This completes the proof.Remark 8.
SinceI
-
ϵ
Q is not a stochastic matrix, the traditional method based on the properties of stochastic matrices is not applicable. Theorem 7 is proved by the Q-theory and LaSalle’s invariance principle.


## 5. Simulations

In this section, two numerical examples are provided to show the effectiveness of our theoretical results.Example 1.
Here we consider a system consisting of 11 agents indexed byi
=
1,2
,
…
,
11. The dynamics of each agent is
(25)
x
˙
i
(
t
)
=
u
i
(
t
)
,
i
=
1,2
,
…
,
N
,
where x
i
(
t
)
∈
ℝ and u
i
(
t
)
∈
ℝ are the state and the control input of agent i at time t, respectively.
The control input of agenti is designed as (6). Figures 1 and 2 show the Herschel graph which is a bipartite undirected graph with 11 vertices and 18 edges. From Figure 1, the signless Laplacian matrix of the Herschel graph is obtained as follows:
(26)
Q
=
[
3
1
0
1
1
0
0
0
0
0
0
1
4
1
0
0
1
1
0
0
0
0
0
1
3
1
0
0
0
1
0
0
0
1
0
1
4
0
0
0
0
1
1
0
1
0
0
0
3
1
0
0
0
1
0
0
1
0
0
1
3
0
0
0
0
1
0
1
0
0
0
0
3
1
0
0
1
0
0
1
0
0
0
1
3
1
0
0
0
0
0
1
0
0
0
1
3
0
1
0
0
0
1
1
0
0
0
0
3
1
0
0
0
0
0
1
1
0
1
1
4
]
.
The signless Laplacian eigenvalues of the Herschel graph are6.7321
≥
5
≥
5
≥
4.7321
≥
3.2679
≥
3
≥
3
≥
2
≥
2
≥
1.2679
≥
0. The Herschel graph is connected and bipartite, and thus the conditions in Theorem 5 are satisfied. In the simulation, the initial values are chosen as
(27)
x
(
0
)
=
[
2.1564,0.7774
,
-
0.6670,3.8424
,
-
1.0695
,
-
3.2102
,
1.3333,1.2400
,
-
1.7206,3.0297,4.9948
]
T
.Simulation results are shown in Figure 3. The simulation results show that the cluster anticonsensus of the multiagent continuous system is achieved by the control protocol. Let U
=
{
1,3
,
6,7
,
9,10
} and W
=
{
2,4
,
5,8
,
11
}. Then, by a simple computation, we can verify that
(28)
lim
⁡
i
∈
U
,
t
→
+
∞
x
i
(
t
)
=
-
lim
⁡
j
∈
W
,
t
→
+
∞
x
j
(
t
)
=
(
∑
i
∈
U
x
i
(
0
)
-
∑
j
∈
W
x
j
(
0
)
)
11
=
-
0.8058
.Figure 1
Herschel graph: original style.Figure 2
Herschel graph: bipartite style.Figure 3
The time histories ofx
i
(
t
), i
=
1,2
,
…
,
11.Example 2.
Here we consider a system consisting of 30 agents indexed byi
=
1,2
,
…
,
30. The dynamics of each agent is
(29)
x
i
(
k
+
1
)
=
x
i
(
k
)
+
ϵ
u
i
(
k
)
,
k
∈
ℕ
,
i
=
1,2
,
…
,
N
,
where x
i
(
t
)
∈
ℝ and u
i
(
t
)
∈
ℝ are the state and the control input of agent i at step k, respectively.
The control input of agenti is designed as (16). Figures 4 and 5 show the Levi graph which is a bipartite undirected graph with 30 vertices and 45 edges. The Levi graph is connected. If we choose ϵ
=
0.25, then the conditions in Theorem 7 are satisfied. In the simulation, the initial values are randomly chosen in the interval [
-
5,5
]. Simulation results are shown in Figure 6. The simulation results show that the cluster anticonsensus of the multiagent discrete-time system is achieved by the control protocol. Let U
=
{
1,3
,
5,7
,
9,11,13,15,17,19,21,23,25,27,29
} and =
{
2,4
,
6,8
,
10,12,14,16
,
18,20,22,24,26,28,30
}. Then, by a simple computation, we can also verify that
(30)
lim
⁡
i
∈
U
,
k
→
+
∞
x
i
(
k
)
=
-
lim
⁡
j
∈
W
,
k
→
+
∞
x
j
(
k
)
=
c
,
where c
=
(
∑
i
∈
U
‍
x
i
(
0
)
-
∑
j
∈
W
‍
x
j
(
0
)
)
/
30.Figure 4
Levi graph: original style.Figure 5
Levi graph: bipartite style.Figure 6
The histories ofx
i
(
k
), i
=
1,2
,
…
,
30.


## 6. Conclusions

In this paper, we investigate the problem of cluster anticonsensus of multiagent systems based on theQ-theory. For multiagent continuous systems, if the graph is connected and bipartite, then the cluster anticonsensus is achieved by the proposed control protocol. For multiagent discrete-time systems, sufficient conditions are given to guarantee the cluster anticonsensus by the proposed control protocol. Numerical simulations show the effectiveness of our theoretical results. However, the proposed methods cannot be used to study cluster anticonsensus based on other general graph topologies directly. The future work is to consider the cluster anticonsensus problem of multiagent systems under other general structures.



---

*Source: 254749-2014-04-09.xml*