Dynamic average consensus and consensusability of general linear multiagent systems with random packet dropout
type: Item
instance of: scholarly article
title: Dynamic average consensus and consensusability of general linear multiagent systems with random packet dropout
zbMATH Open document ID: 1291.93324
DOI: 10.1155/2013/412189
author: Wen-Min Zhou
author: Jiang-Wen Xiao
published in: Abstract and Applied Analysis
publication date: 2014-06-23T00:00:00Z
review text: Summary: 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.
Mathematics Subject Classification ID: 93E15
Mathematics Subject Classification ID: 93C55
Mathematics Subject Classification ID: 60C99
Mathematics Subject Classification ID: 93A14
zbMATH DE Number: 6306810
Wikidata QID: Q58916211
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2013/412189
OpenAlex ID: W2107002875
cites work: Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
cites work: Flocking in Fixed and Switching Networks
cites work: Consensus based formation control laws for systems on Lie groups
cites work: Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
cites work: Agreement over random networks
cites work: Consentability and protocol design of multi-agent systems with stochastic switching topology
cites work: Leader-following finite-time consensus for multi-agent systems with jointly-reachable leader
cites work: Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
cites work: Two consensus problems for discrete-time multi-agent systems with switching network topology
cites work: Multi-agent consensus with diverse time-delays and jointly-connected topologies
cites work: \(H_{\infty}\) consensus of second-order multi-agent systems with asymmetric delays
cites work: Consensus seeking in multiagent systems under dynamically changing interaction topologies
cites work: Consensus of second-order and high-order discrete-time multi-agent systems with random networks
cites work: Consensus of Data-Sampled Multi-Agent Systems With Random Communication Delay and Packet Loss
cites work: Maximum Allowable Loss Probability for Consensus of Multi-Agent Systems Over Random Weighted Lossy Networks
cites work: Matrix theory. Basic results and techniques
description: scientific article; zbMATH DE number 6306810