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

Lin Shi, Kuixiang Gou and Dongmei Xie

Applied Mathematics and Computation, 2021, vol. 410, issue C

Abstract: This paper focuses on the convergence analysis of first-order discrete multi-agent systems (MASs) with cooperative-competitive mechanisms. Firstly, compared with the existing results, our paper uses the condition of containing a directed spanning to replace that of strong connectivity, and gets a lager range of ε to guarantee that limk→+∞Pk exists, which greatly improves the famous Perron–Frobenius theorem in Olfati-Saber et al. (2007)[24]. Subsequently, we can divide all the agents into m subgroups according to the actual demand, and give the design method of weights so that system can achieve different consensus. We further generalize the results from first-order MASs to second-order MASs. Finally, numerical examples are given to verify the effectiveness of our results.

Keywords: Multi-agent systems; Interactively balanced topology; Directed complete graph; Cooperative-competitive mechanism (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300321005518
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:410:y:2021:i:c:s0096300321005518

DOI: 10.1016/j.amc.2021.126462

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().