Premium
Consensus control of output‐constrained multiagent systems with unknown control directions under a directed graph
Author(s) -
Wang Gang,
Wang Chaoli,
Cai Xuan
Publication year - 2020
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.4852
Subject(s) - laplacian matrix , backstepping , multi agent system , directed graph , computer science , network topology , control theory (sociology) , transformation (genetics) , graph , mathematical optimization , consensus , control (management) , adaptive control , mathematics , algorithm , theoretical computer science , artificial intelligence , biochemistry , chemistry , gene , operating system
Summary This paper presents a novel distributed adaptive control algorithm for uncertain higher‐order nonlinear multiagent systems subject to output constraints and unknown control directions. Regarding the latter, a generic class of cases is considered, allowing completely unknown and even nonidentical control directions. Furthermore, the communication topology is only required to contain a fixed directed spanning tree. To guarantee the output constraints and address the asymmetric directed communication topology, a new reference output using the transformation strategy is introduced for each agent, benefiting from which the consensus problem of the multiagent system is recast as local tracking control problems of single agents. Then, the distributed control algorithm is recursively established based on the backstepping technique and the Nussbaum‐type function. By leveraging the unique properties of the Laplacian matrix on directed graphs and matrix theory, it is shown that, under the proposed distributed algorithm, uniform boundedness of all closed‐loop signals can be ensured, and asymptotic consensus is achieved without violation of the output constraints. Finally, simulation studies on the angle control of single‐link robots are given to verify the effectiveness of the proposed algorithm.