Journal
APPLIED MATHEMATICS AND COMPUTATION
Volume 350, Issue -, Pages 153-162Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.amc.2019.01.006
Keywords
Complex networks; Multi-agent systems; Communication delays; Consensus; Antagonistic interactions
Categories
Funding
- National Natural Science Foundations of China [61573102, 61573008]
- Natural Science Foundation of Jiangsu Province of China [BK20170019]
- National Priority Research Project - Qatar National Research Fund [NPRP 200 9 166-1-031]
- SDUST Research Fund [2018TDJH101]
Ask authors/readers for more resources
This paper investigates the consensus problem in networks of agents with antagonistic interactions and communication delays. For undirected signed networks, we respectively establish 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. Further, 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. (C) 2019 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available