多先导网络分数阶系统的分布式遏制控制

Xueliang Liu, Bugong Xu
{"title":"多先导网络分数阶系统的分布式遏制控制","authors":"Xueliang Liu, Bugong Xu","doi":"10.1109/WCICA.2012.6359140","DOIUrl":null,"url":null,"abstract":"This paper is concerned with a containment problem of networked fractional-order system with multiple leaders under a fixed directed interaction graph. Based on the neighbor rule, a distributed protocol is proposed in delayed communication channels. By employing the algebraic graph theory, matrix theory, Nyquist stability criterion and frequency domain method, it is analytically proved that the whole follower agents will flock to the convex hull which is formed by the leaders. Furthermore, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is obtained. As a special case, the interconnection topology under the undirected case is also discussed. Finally, some numerical examples with simulations are presented to demonstrate the effectiveness and correctness of the theoretical result.","PeriodicalId":114901,"journal":{"name":"Proceedings of the 10th World Congress on Intelligent Control and Automation","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed containment control of networked fractional-order systems with multiple leaders\",\"authors\":\"Xueliang Liu, Bugong Xu\",\"doi\":\"10.1109/WCICA.2012.6359140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is concerned with a containment problem of networked fractional-order system with multiple leaders under a fixed directed interaction graph. Based on the neighbor rule, a distributed protocol is proposed in delayed communication channels. By employing the algebraic graph theory, matrix theory, Nyquist stability criterion and frequency domain method, it is analytically proved that the whole follower agents will flock to the convex hull which is formed by the leaders. Furthermore, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is obtained. As a special case, the interconnection topology under the undirected case is also discussed. Finally, some numerical examples with simulations are presented to demonstrate the effectiveness and correctness of the theoretical result.\",\"PeriodicalId\":114901,\"journal\":{\"name\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2012.6359140\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th World Congress on Intelligent Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2012.6359140","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

研究了具有固定有向交互图的多导网络分数阶系统的包含问题。提出了一种基于邻居规则的延迟通信信道分布式协议。利用代数图论、矩阵论、奈奎斯特稳定性判据和频域方法,分析证明了整个跟随体会向由领导体形成的凸包聚集。此外,还得到了动态网络中可容忍的通信时延的紧上界。作为一种特殊情况,本文还讨论了无向情况下的互连拓扑。最后,通过数值算例验证了理论结果的有效性和正确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Distributed containment control of networked fractional-order systems with multiple leaders
This paper is concerned with a containment problem of networked fractional-order system with multiple leaders under a fixed directed interaction graph. Based on the neighbor rule, a distributed protocol is proposed in delayed communication channels. By employing the algebraic graph theory, matrix theory, Nyquist stability criterion and frequency domain method, it is analytically proved that the whole follower agents will flock to the convex hull which is formed by the leaders. Furthermore, a tight upper bound on the communication time-delay that can be tolerated in the dynamic network is obtained. As a special case, the interconnection topology under the undirected case is also discussed. Finally, some numerical examples with simulations are presented to demonstrate the effectiveness and correctness of the theoretical result.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信