A Decomposition Approach to Multiagent Systems With Bernoulli Packet Loss
Christian Hespe, Hamideh Saadabadi, Adwait Datar, Herbert Werner, Yang Tang
Abstract
In this paper, we extend the decomposable systems framework to multi-agent systems with Bernoulli distributed packet loss with uniform probability. The proposed sufficient analysis conditions for mean-square stability and <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">H<sub>2</sub></i> -performance – which are expressed in the form of linear matrix inequalities – scale linearly with increased network size and thus allow to analyse even very large-scale multi-agent systems. A numerical example demonstrates the potential of the approach by application to a first-order consensus problem.
Topics & Concepts
DecompositionBernoulli's principleComputer scienceNetwork packetMulti-agent systemPacket switchingDistributed computingComputer networkArtificial intelligenceEngineeringBiologyAerospace engineeringEcologyDistributed Control Multi-Agent SystemsNeural Networks Stability and SynchronizationGene Regulatory Network Analysis