变节点数线性时变多智能体系统的一致性

IF 3.7 3区计算机科学 Q2 AUTOMATION & CONTROL SYSTEMS

Journal of The Franklin Institute-engineering and Applied Mathematics Pub Date : 2025-05-17 DOI:10.1016/j.jfranklin.2025.107725

Xiaolei Ji, Fei Hao

{"title":"变节点数线性时变多智能体系统的一致性","authors":"Xiaolei Ji, Fei Hao","doi":"10.1016/j.jfranklin.2025.107725","DOIUrl":null,"url":null,"abstract":"<div><div>This study explores the consensus problem for open multi-agent systems (MASs) characterized by agents with linear time-varying (LTV) dynamics under switching topology with a variable number of nodes. The consensus problem of MASs with different switching topologies and varying node numbers is solved by constructing the augmented Laplacian matrices and the averaging theory. Unlike most of the existing literature, the average uniform connectivity of the graph is only required in this paper, and the topology at any time can be disconnected. Furthermore, our solution extends to the simplified scenario of MASs with linear time-invariant (LTI) dynamics’ agents, as well as the switching topology with a fixed number of nodes. Finally, the effectiveness and superiority of our theoretical findings are validated through simulation examples.</div></div>","PeriodicalId":17283,"journal":{"name":"Journal of The Franklin Institute-engineering and Applied Mathematics","volume":"362 9","pages":"Article 107725"},"PeriodicalIF":3.7000,"publicationDate":"2025-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Consensus of linear time-varying multi-agent systems with a variable number of nodes\",\"authors\":\"Xiaolei Ji, Fei Hao\",\"doi\":\"10.1016/j.jfranklin.2025.107725\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>This study explores the consensus problem for open multi-agent systems (MASs) characterized by agents with linear time-varying (LTV) dynamics under switching topology with a variable number of nodes. The consensus problem of MASs with different switching topologies and varying node numbers is solved by constructing the augmented Laplacian matrices and the averaging theory. Unlike most of the existing literature, the average uniform connectivity of the graph is only required in this paper, and the topology at any time can be disconnected. Furthermore, our solution extends to the simplified scenario of MASs with linear time-invariant (LTI) dynamics’ agents, as well as the switching topology with a fixed number of nodes. Finally, the effectiveness and superiority of our theoretical findings are validated through simulation examples.</div></div>\",\"PeriodicalId\":17283,\"journal\":{\"name\":\"Journal of The Franklin Institute-engineering and Applied Mathematics\",\"volume\":\"362 9\",\"pages\":\"Article 107725\"},\"PeriodicalIF\":3.7000,\"publicationDate\":\"2025-05-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of The Franklin Institute-engineering and Applied Mathematics\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0016003225002182\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"AUTOMATION & CONTROL SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Franklin Institute-engineering and Applied Mathematics","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0016003225002182","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}

引用次数: 0

摘要

研究了节点数量可变的切换拓扑下，具有线性时变（LTV）动态特征的开放多智能体系统（MASs）的共识问题。通过构造增广拉普拉斯矩阵和平均理论，解决了具有不同切换拓扑和变节点数的质量的一致性问题。与现有的大多数文献不同，本文只要求图的平均均匀连通性，任何时候的拓扑都可以断开。此外，我们的解决方案扩展到具有线性时不变（LTI）动力学代理的简化MASs场景，以及具有固定数量节点的切换拓扑。最后，通过仿真算例验证了理论结果的有效性和优越性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Consensus of linear time-varying multi-agent systems with a variable number of nodes

This study explores the consensus problem for open multi-agent systems (MASs) characterized by agents with linear time-varying (LTV) dynamics under switching topology with a variable number of nodes. The consensus problem of MASs with different switching topologies and varying node numbers is solved by constructing the augmented Laplacian matrices and the averaging theory. Unlike most of the existing literature, the average uniform connectivity of the graph is only required in this paper, and the topology at any time can be disconnected. Furthermore, our solution extends to the simplified scenario of MASs with linear time-invariant (LTI) dynamics’ agents, as well as the switching topology with a fixed number of nodes. Finally, the effectiveness and superiority of our theoretical findings are validated through simulation examples.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of The Franklin Institute-engineering and Applied Mathematics 工程技术-工程：电子与电气

CiteScore

7.30

自引率

14.60%

发文量

586

审稿时长

6.9 months

期刊介绍： The Journal of The Franklin Institute has an established reputation for publishing high-quality papers in the field of engineering and applied mathematics. Its current focus is on control systems, complex networks and dynamic systems, signal processing and communications and their applications. All submitted papers are peer-reviewed. The Journal will publish original research papers and research review papers of substance. Papers and special focus issues are judged upon possible lasting value, which has been and continues to be the strength of the Journal of The Franklin Institute.