Event‐triggered Guaranteed Cost Consensus of Networked Singular Multi‐agent Systems

The problem of event‐triggered guaranteed cost consensus of discrete‐time singular multi‐agent systems with switching topologies is investigated in this paper. To save the limited network communication bandwidth of multi‐agent systems, a novel event‐triggered networked consensus mechanism is propose...

Full description

Saved in:
Bibliographic Details
Published in:Asian journal of control 2019-09, Vol.21 (5), p.2425-2440
Main Authors: Xu, Qiyi, Zhang, Yijun, Xiao, Shunyuan
Format: Article
Language:English
Subjects:
discrete‐time
event‐triggered
Graph theory
Guaranteed cost consensus
Linear matrix inequalities
Matrix methods
singular multi‐agent system
System theory
Systems theory
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:The problem of event‐triggered guaranteed cost consensus of discrete‐time singular multi‐agent systems with switching topologies is investigated in this paper. To save the limited network communication bandwidth of multi‐agent systems, a novel event‐triggered networked consensus mechanism is proposed. Based on the graph theory and singular system theory, sufficient conditions of guaranteed‐cost consensus of discrete‐time singular multi‐agent systems are derived and given in the form of the linear matrix inequalities, respectively. A co‐design approach of the multi‐agent consensus gain matrix and the event‐triggered parameters is presented. Furthermore, based on the approach of second class equivalent transformation for singular systems, the cost function is determined, and an explicit expression of consensus functions is presented. Finally, a numerical example is provided to illustrate the effectiveness of the proposed method.
ISSN:1561-8625
1934-6093
DOI:10.1002/asjc.1848