Open AccessConsensus seeking for heterogeneous networks of agents with non‐convex constraints and switching topologies
Author(s) -
Xu Wentao,
Huang Yi,
Zhou Xiaojun
Publication year - 2020
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2019.0428
Subject(s) - convexity , correctness , mathematical optimization , network topology , multi agent system , computer science , set (abstract data type) , constraint (computer aided design) , convergence (economics) , convex combination , matrix (chemical analysis) , regular polygon , mathematics , convex optimization , control theory (sociology) , control (management) , algorithm , artificial intelligence , materials science , geometry , financial economics , economics , composite material , programming language , economic growth , operating system
This study focuses on the problem of constraint consensus of discrete‐time multi‐agent systems with high‐order heterogeneity. It is assumed that the agents are of different orders in such systems ranging from order 1 to l and the velocity of each agent is constrained to lie in a non‐convex set. This study proposes a distributed constraint control algorithm which guarantees the agents converge to a common point through the use of local information. Model transformations of the system matrix are performed in this study, so that the authors can utilise the properties of the stochastic matrix. Meanwhile, the boundness of state‐dependent stochastic matrices and the convexity of stochastic matrices are analysed and explored in detail. Finally, a numerical example is given to illustrate the correctness of the results.