A Decomposition Approach to Multi-Agent Systems with Bernoulli Packet Loss

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 $H_2$-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.

11 pages, 4 figures. Update to accepted version after minor revision

References in corpus (1)

• A Decomposition Approach to Multi-Agent Systems with Bernoulli Packet Loss

Cited by in corpus (3)

• A Decomposition Approach to Multi-Agent Systems with Bernoulli Packet Loss
• Robust Performance Analysis for Time-Varying Multi-Agent Systems with Stochastic Packet Loss
• A Scalable Approach for Analysing Multi-Agent Systems with Heterogeneous Stochastic Packet Loss