First-order average consensus for cooperative control problems using novel weighting strategies

In this paper we show how average consensus can be guaranteed in cooperative control schemes for multi-agent systems, even when normalised or weighted Laplacians are used. First we present weighting strategies for improving the performance that can be applied in a distributed manner (only local information is used), based on a recently proposed importance matrix. Then we modify the first-order consensus protocol, such that average consensus is guaranteed. It is then shown how this scheme can be used to improve the performance of cooperative control schemes. For this purpose, the effect of a formation reference on the consensus states is explicitly stated. A simulation result with second order LTI agent models illustrates the proposed approach.

Subjects

average consensus

cooperative control

distributed

Multi-agent systems

networks

DDC Class

600: Technik

Lizenz

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

Publication version

publishedVersion

Name

1-s2.0-S2405896317324916-main.pdf

Size

458.83 KB

Format

Adobe PDF

Options

First-order average consensus for cooperative control problems using novel weighting strategies