Bipartite Consensus for Multi-Agent Systems With Time-Varying Delays Based on Method of Delay Partitioning

Bipartite consensus protocol is designed for multi-agent systems with time-varying delays. Then, the bipartite consensus problem is transformed into a corresponding stability problem by methods of gauge transformation and state transformation. The Lyapunov-Krasovskii functional is constructed, and t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2019, Vol.7, p.29285-29294
Main Authors: Zhang, Xiaodan, Liu, Kaien, Ji, Zhijian
Format: Article
Language:English
Subjects:
Bipartite consensus
delay partitioning
Delays
free matrix integral inequality
Linear matrix inequalities
linear matrix inequality
Mathematical analysis
Multi-agent systems
Multiagent systems
Partitioning
Protocols
Symmetric matrices
System effectiveness
time-varying delays
Time-varying systems
Topology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Bipartite consensus protocol is designed for multi-agent systems with time-varying delays. Then, the bipartite consensus problem is transformed into a corresponding stability problem by methods of gauge transformation and state transformation. The Lyapunov-Krasovskii functional is constructed, and the linear matrix inequality theory based on methods of delay partitioning and free matrix integral inequality is used to obtain sufficient conditions for a bipartite consensus of multi-agent systems. Both the first-order and second-order multi-agent systems are investigated. Finally, the effectiveness of the obtained results is illustrated by virtue of simulation results.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2902378