文献类型：期刊文献

英文题名：Sampled-Data Consensus of Linear Multi-agent Systems With Packet Losses

作者：Zhang, Wenbing[1];Tang, Yang[2];Huang, Tingwen[3];Kurths, Juergen[4,5,6]

机构：[1]Yangzhou Univ, Dept Math, Yangzhou 225002, Jiangsu, Peoples R China;[2]East China Univ Sci & Technol, Key Lab Adv Control & Optimizat Chem Proc, Minist Educ, Shanghai 200237, Peoples R China;[3]Texas A&M Univ Qatar, Doha 23874, Qatar;[4]Potsdam Inst Climate Impact Res, D-14473 Potsdam, Germany;[5]Humboldt Univ, Inst Phys, D-12489 Berlin, Germany;[6]Nizhnii Novgorod State Univ, Inst Complex Syst, Dept Control Theory, Nizhnii Novgorod 606950, Russia

年份：2017

卷号：28

期号：11

起止页码：2516

外文期刊名：IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS

收录：;EI(收录号：20163402730864);WOS:【SCI-EXPANDED(收录号:WOS:000413403900005)】；

基金：This work was supported in part by the National Natural Science Foundation of China under Grant 61590923, Grant 61374010, Grant 61473189, Grant 61503328, and Grant 61304158, in part by the National Priority Research Project NPRP 7-1482-1-278 funded by Qatar National Research Fund, in part by the IRTG 1740 (DFG), in part by the German Academic Exchange Service (DAAD), in part by the Top Talent Support Program of Yangzhou University, in part by the Fundamental Research Funds for the Central Universities of China under Grant 222201514328, and in part by the Thousand Youth Talents Plan of China.

语种：英文

外文关键词：Consensus; multi-agent systems; packet losses; sampled-data control

摘要：In this paper, the consensus problem is studied for a class of multi-agent systems with sampled data and packet losses, where random and deterministic packet losses are considered, respectively. For random packet losses, a Bernoulli-distributed white sequence is used to describe packet dropouts among agents in a stochastic way. For deterministic packet losses, a switched system with stable and unstable subsystems is employed to model packet dropouts in a deterministic way. The purpose of this paper is to derive consensus criteria, such that linear multi-agent systems with sampled-data and packet losses can reach consensus. By means of the Lyapunov function approach and the decomposition method, the design problem of a distributed controller is solved in terms of convex optimization. The interplay among the allowable bound of the sampling interval, the probability of random packet losses, and the rate of deterministic packet losses are explicitly derived to characterize consensus conditions. The obtained criteria are closely related to the maximum eigenvalue of the Laplacian matrix versus the second minimum eigenvalue of the Laplacian matrix, which reveals the intrinsic effect of communication topologies on consensus performance. Finally, simulations are given to show the effectiveness of the proposed results.