Open AccessDynamic Average Consensus and Consensusability of General Linear Multiagent Systems with Random Packet Dropout
Author(s) -
Wen-Min Zhou,
JiangWen Xiao
Publication year - 2013
Publication title -
abstract and applied analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.228
H-Index - 56
eISSN - 1687-0409
pISSN - 1085-3375
DOI - 10.1155/2013/412189
Subject(s) - network packet , bernoulli's principle , mathematics , dropout (neural networks) , multi agent system , consensus , network topology , random graph , topology (electrical circuits) , control theory (sociology) , computer science , mathematical optimization , graph , control (management) , discrete mathematics , artificial intelligence , combinatorics , computer network , engineering , aerospace engineering , operating system , machine learning
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom