Bipartite consensus problems of Lurie multi-agent systems over signed graphs: A contraction approach  

作　　者：张晓娇 吴祥 Xiaojiao Zhang;Xiang Wu(School of Mathematics and Information Science,Nanchang Normal University,Nanchang 330032,China;School of Mathematical Sciences,Guizhou Normal University,Guiyang 550001,China)

机构地区：[1]School of Mathematics and Information Science,Nanchang Normal University,Nanchang 330032,China [2]School of Mathematical Sciences,Guizhou Normal University,Guiyang 550001,China

出　　处：《Chinese Physics B》2024年第7期137-145,共9页中国物理B（英文版）

基　　金：Project supported by the National Natural Science Foundation of China(Grant No.62363005);the Jiangxi Provincial Natural Science Foundation(Grant Nos.20161BAB212032 and 20232BAB202034);the Science and Technology Research Project of Jiangxi Provincial Department of Education(Grant Nos.GJJ202602 and GJJ202601)。

摘　　要：This paper examines the bipartite consensus problems for the nonlinear multi-agent systems in Lurie dynamics form with cooperative and competitive communication between different agents. Based on the contraction theory, some new conditions for the nonlinear Lurie multi-agent systems reaching bipartite leaderless consensus and bipartite tracking consensus are presented. Compared with the traditional methods, this approach degrades the dimensions of the conditions, eliminates some restrictions of the system matrix, and extends the range of the nonlinear function. Finally, two numerical examples are provided to illustrate the efficiency of our results.

关 键 词：contraction theory virtual system bipartite consensus Lurie multi-agent systems 

分 类 号：TP13[自动化与计算机技术—控制理论与控制工程]