Table of Contents Author Guidelines Submit a Manuscript
Abstract and Applied Analysis
Volume 2013, Article ID 412189, 7 pages
Research Article

Dynamic Average Consensus and Consensusability of General Linear Multiagent Systems with Random Packet Dropout

1School of Automation, Huazhong University of Science and Technology, Wuhan 430074, China
2Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China, Wuhan 430074, China

Received 10 June 2013; Revised 19 August 2013; Accepted 27 August 2013

Academic Editor: Jianquan Lu

Copyright © 2013 Wen-Min Zhou and Jiang-Wen Xiao. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


This paper is concerned with the consensus problem of general linear discrete-time multiagent systems (MASs) with random packet dropout that happens during information exchange between agents. The packet dropout phenomenon is characterized as being a Bernoulli random process. A distributed consensus protocol with weighted graph is proposed to address the packet dropout phenomenon. Through introducing a new disagreement vector, a new framework is established to solve the consensus problem. Based on the control theory, the perturbation argument, and the matrix theory, the necessary and sufficient condition for MASs to reach mean-square consensus is derived in terms of stability of an array of low-dimensional matrices. Moreover, mean-square consensusable conditions with regard to network topology and agent dynamic structure are also provided. Finally, the effectiveness of the theoretical results is demonstrated through an illustrative example.