{"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}
引用次数: 0
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.