Applied Mathematics and Computation 350 (2019) 153–162
Contents lists available at ScienceDirect
Applied Mathematics and Computation
journal homepage: www.elsevier.com/locate/amc
Consensus of signed networked multi-agent systems with
nonlinear coupling and communication delays
Jianquan Lu
a , b , c , ∗
, Xing Guo
a , d
, Tingwen Huang
e
, Zhen Wang
f
a
School of Mathematics, Southeast University, Nanjing 210096, China
b
School of Automation and Electrical Engineering, Linyi University, Linyi 276005, Shandong, China
c
Department of Mathematics, Zhejiang Normal University, Jinhua 321004, China
d
School of Information Science and Engineering, Southeast University, Nanjing 210096, China
e
Texas A&M University at Qatar, Doha 23874, Qatar
f
College of Mathematics and Systems Science, Shandong University of Science and Technology, Qingdao 266590, China
a r t i c l e i n f o
Keywords:
Complex networks
Multi-agent systems
Communication delays
Consensus
Antagonistic interactions
a b s t r a c t
This paper investigates the consensus problem in networks of agents with antagonistic in-
teractions and communication delays. For undirected signed networks, we respectively es-
tablish two dynamic models corresponding to linear and nonlinear coupling. Based on Lya-
punov stability theory and some other mathematical analysis, it is proved that all agents
on signed networks can reach agreement on a consensus value except for the sign. Fur-
ther, a bipartite consensus solution is given for linear coupling networks, and an explicit
expression associating with bipartite consensus solution is provided for nonlinear coupling
networks. Finally, numerical simulations are given to demonstrate the effectiveness of our
theoretical results.
© 2019 Elsevier Inc. All rights reserved.
1. Introduction
With the recent technological advance on communication resources, distributed control of multi-agent systems has been
studied more and more widely [1–3] . Some significant results, such as consensus [4,5] , state feedback control [6–8] , for-
mation control [9–16] , and synchronization [17–24] , have attracted attention of plentiful experts from diverse disciplines.
Specially, the consensus of the multi-agent system is a focal research topic and has been intensively investigated in the past
decade.
Consensus, which means to reach an agreement among all agents, is closely correlated with many practical applications,
such as birds’ migration [25,26] , robots’ coordination [27] and control of distributed sensor networks [28] . Some interesting
works on consensus have been done in the past few years. In [29,30] , consensus problem for nonlinearly coupled networks
was investigated, and the results were generalized to directed networks. Aiming at detail-balanced multi-agent networks,
[31] proposed a new protocol for finite-time consensus of multi-agent networks.
To achieve consensus, each node in a network has to transmit its state information to its neighbours via connections.
However, because of physical and environmental limitations, communication constraints between connected nodes are un-
avoidable. As is well-known, the communication delay is one of the most universal communication constraints. Thus, re-
searches on consensus of multi-agent systems containing communication delays received widespread attentions [32–41] .
∗
Corresponding author at: School of Mathematics, Southeast University, Nanjing 210096, China.
E-mail address: jqluma@seu.edu.cn (J. Lu).
https://doi.org/10.1016/j.amc.2019.01.006
0 096-30 03/© 2019 Elsevier Inc. All rights reserved.
评论0