Robust performance analysis for time-varying multi-agent systems with stochastic packet loss

Recently, a scalable approach to system analysis and controller synthesis for homogeneous multi-agent systems with Bernoulli distributed packet loss has been proposed. As a key result of that line of work, it was shown how to obtain upper bounds on the H2-norm that are robust with respect to uncertain interconnection topologies. The main contribution of the current paper is to show that the same upper bounds hold not only for uncertain but also time-varying topologies that are superimposed on the stochastic packet loss. Because the results are formulated in terms of linear matrix inequalities that are independent of the number of agents, multi-agent systems of any size can be analysed efficiently. The applicability of the approach is demonstrated on a numerical first-order consensus example, on which the obtained upper bounds are compared to estimates from Monte-Carlo simulations.

Schlagworte

Consensus

Control over networks

Graph-based methods for networked systems

Multi-agent systems

Networked systems

Time-varying systems

DDC Class

620: Engineering

Publication version

publishedVersion

Lizenz

https://creativecommons.org/licenses/by-nc-nd/4.0/

Name

1-s2.0-S2405896323004111-main.pdf

Type

main article

Size

413.81 KB

Format

Adobe PDF

Options

Robust performance analysis for time-varying multi-agent systems with stochastic packet loss