Distributed $H_{\infty}$ Edge Weight Synthesis for Cooperative Systems

TL;DR

This paper introduces a distributed method for synthesizing edge weights in cooperative systems to enhance $H_{ {infty}}$ performance, reducing computation time while providing bounds on system norms.

Contribution

It proposes a novel distributed synthesis approach based on LMIs and dissipative systems, improving efficiency over traditional lumped methods.

Findings

Provides an upper bound for the induced $ {L}_2$ norm.

Reduces computation time compared to lumped approaches.

Validates effectiveness through comparative analysis.

Abstract

This paper studies distributed edge weight synthesis of a cooperative system for a fixed topology to improve $H_{\infty}$ performance, considering that disturbances are injected at interconnection channels. This problem is cast into a linear matrix inequality problem by replacing original cooperative system with an equivalent ideal cooperative system. Derivations of the method relies on dissipative system framework. Proposed method provides an upper bound for the induced $\mathcal{L}_{2}$ norm of the original lumped cooperative system while reducing the computation time. A comparison for computation time illustrates the advantage of the proposed method against the lumped counterpart.