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

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

扫码查看
原文链接
  • NETL
  • NSTL
  • 万方数据
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 con-ditions 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 theoryvirtual systembipartite consensusLurie multi-agent systems

张晓娇、吴祥

展开 >

School of Mathematics and Information Science,Nanchang Normal University,Nanchang 330032,China

School of Mathematical Sciences,Guizhou Normal University,Guiyang 550001,China

National Natural Science Foundation of ChinaJiangxi Provincial Natural Science FoundationJiangxi Provincial Natural Science FoundationScience and Technology Research Project of Jiangxi Provincial Department of EducationScience and Technology Research Project of Jiangxi Provincial Department of Education

6236300520161BAB21203220232BAB202034GJJ202602GJJ202601

2024

10.1088/1674-1056/ad3dca

中国物理B(英文版)
中国物理学会和中国科学院物理研究所

中国物理B(英文版)

CSTPCDEI
影响因子：0.995
ISSN：1674-1056
年,卷(期)：2024.33(7)
  • 37