Convergence analysis of first-order discrete multi-agent systems with cooperative-competitive mechanisms

作者：

Highlights：

• Our result greatly improves the famous Perron–Frobenius theorem in Olfati-Saber, et al. (2007).

• We present a method of constructing an interactively balanced graph and dividing MASs into m subgroups according to actual demand.

• MASs can achieve group consensus based on our multiple group weight design method.

摘要

•Our result greatly improves the famous Perron–Frobenius theorem in Olfati-Saber, et al. (2007).•We present a method of constructing an interactively balanced graph and dividing MASs into m subgroups according to actual demand.•MASs can achieve group consensus based on our multiple group weight design method.

论文关键词：Multi-agent systems,Interactively balanced topology,Directed complete graph,Cooperative-competitive mechanism

论文评审过程：Received 10 November 2020, Revised 27 May 2021, Accepted 15 June 2021, Available online 11 July 2021, Version of Record 12 July 2021.

论文官网地址：https://doi.org/10.1016/j.amc.2021.126462