{"title":"Prescribed-Time Sampled-Data Control for the Bipartite Consensus of Linear Multi-Agent Systems in Singed Networks","authors":"Mengke Liu, Wenbing Zhang, Guanglei Wu","doi":"10.1007/s12559-024-10319-8","DOIUrl":null,"url":null,"abstract":"<p>This article examines the prescribed-time sampled-data control problem for multi-agent systems in signed networks. A time-varying high gain-based protocol is devised to solve the prescribed-time bipartite consensus problem of the linear multi-agent systems with the control gain matrix being resolved through the utilization of the parametric Lyapunov equation. By using the method of scalarization, sufficient conditions are attained to ensure the prescribed-time bipartite consensus of linear multi-agent systems, where the maximum allowable sampling interval (MASI) ensuring the prescribed-time consensus is determined by the initial values of the system state, the linear dynamics of the system, and the maximum eigenvalue of the Laplacian matrix. Specifically, the MASI is inversely proportional to the maximum eigenvalue of the Laplacian matrix. Finally, the validity of the conclusion is ensured through numerical simulation.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":null,"pages":null},"PeriodicalIF":4.3000,"publicationDate":"2024-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cognitive Computation","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s12559-024-10319-8","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
This article examines the prescribed-time sampled-data control problem for multi-agent systems in signed networks. A time-varying high gain-based protocol is devised to solve the prescribed-time bipartite consensus problem of the linear multi-agent systems with the control gain matrix being resolved through the utilization of the parametric Lyapunov equation. By using the method of scalarization, sufficient conditions are attained to ensure the prescribed-time bipartite consensus of linear multi-agent systems, where the maximum allowable sampling interval (MASI) ensuring the prescribed-time consensus is determined by the initial values of the system state, the linear dynamics of the system, and the maximum eigenvalue of the Laplacian matrix. Specifically, the MASI is inversely proportional to the maximum eigenvalue of the Laplacian matrix. Finally, the validity of the conclusion is ensured through numerical simulation.
期刊介绍：
Cognitive Computation is an international, peer-reviewed, interdisciplinary journal that publishes cutting-edge articles describing original basic and applied work involving biologically-inspired computational accounts of all aspects of natural and artificial cognitive systems. It provides a new platform for the dissemination of research, current practices and future trends in the emerging discipline of cognitive computation that bridges the gap between life sciences, social sciences, engineering, physical and mathematical sciences, and humanities.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
