Dynamic average consensus and consensusability of general linear multiagent systems with random packet dropout
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.
- Consensus of discrete-time multi-agent systems over packet dropouts channels
- Multiagent consensus control under network-induced constraints
- The sampled-data consensus of multi-agent systems with probabilistic time-varying delays and packet losses
- Average consensus in multiagent systems with the problem of packet losses when using the second-order neighbors' information
- Robust consensus for multi-agent systems communicating over stochastic uncertain networks
- \(H_{\infty}\) consensus of second-order multi-agent systems with asymmetric delays
- Agreement over random networks
- Consensus based formation control laws for systems on Lie groups
- Consensus of Data-Sampled Multi-Agent Systems With Random Communication Delay and Packet Loss
- Consensus of Multiagent Systems and Synchronization of Complex Networks: A Unified Viewpoint
- Consensus of second-order and high-order discrete-time multi-agent systems with random networks
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Consensus seeking in multiagent systems under dynamically changing interaction topologies
- Consentability and protocol design of multi-agent systems with stochastic switching topology
- Distributed Consensus Algorithms in Sensor Networks: Quantized Data and Random Link Failures
- Flocking in Fixed and Switching Networks
- Leader-following finite-time consensus for multi-agent systems with jointly-reachable leader
- Matrix theory. Basic results and techniques
- Maximum Allowable Loss Probability for Consensus of Multi-Agent Systems Over Random Weighted Lossy Networks
- Multi-agent consensus with diverse time-delays and jointly-connected topologies
- Two consensus problems for discrete-time multi-agent systems with switching network topology
- Average consensus in multiagent systems with the problem of packet losses when using the second-order neighbors' information
- Multiagent consensus control under network-induced constraints
- Discrete-time consensus strategy for a class of high-order linear multiagent systems under stochastic communication topologies
- Consensus of discrete-time multi-agent systems over packet dropouts channels
- Consensusability of discrete-time multi-agent systems under binary encoding with bit errors
- RHC-based consensus of multi-agent systems with simultaneous packet dropout and input delay
- Quantised scaled consensus of linear multiagent systems on faulty networks
- Average Consensus with Packet Drop Communication
- Average-ILC-based consensus tracking of multiagent systems over wireless networks in presence of channel noise and data dropout
- External consensus in multi-agent systems with large consecutive data loss under unreliable networks
This page was built for publication: Dynamic average consensus and consensusability of general linear multiagent systems with random packet dropout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015515)
