{"title":"为维护有向图的强连通性而进行的分散控制","authors":"Lorenzo Sabattini, C. Secchi, N. Chopra","doi":"10.1109/MED.2013.6608840","DOIUrl":null,"url":null,"abstract":"In order to accomplish cooperative tasks, decentralized systems are required to communicate among each other. Thus, maintaining the connectivity of the communication graph is a fundamental issue. Connectivity maintenance has been extensively studied in the last few years, but generally considering undirected communication graphs. In this paper we introduce a decentralized control and estimation strategy to maintain the strong connectivity property of directed communication graphs. The control strategy is initially developed for balanced digraphs, and is then extended to generic strongly connected digraphs, introducing a decentralized balancing algorithm. The control strategy is validated by means of analytical proofs and simulation results.","PeriodicalId":350383,"journal":{"name":"21st Mediterranean Conference on Control and Automation","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Decentralized control for maintenance of strong connectivity for directed graphs\",\"authors\":\"Lorenzo Sabattini, C. Secchi, N. Chopra\",\"doi\":\"10.1109/MED.2013.6608840\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to accomplish cooperative tasks, decentralized systems are required to communicate among each other. Thus, maintaining the connectivity of the communication graph is a fundamental issue. Connectivity maintenance has been extensively studied in the last few years, but generally considering undirected communication graphs. In this paper we introduce a decentralized control and estimation strategy to maintain the strong connectivity property of directed communication graphs. The control strategy is initially developed for balanced digraphs, and is then extended to generic strongly connected digraphs, introducing a decentralized balancing algorithm. The control strategy is validated by means of analytical proofs and simulation results.\",\"PeriodicalId\":350383,\"journal\":{\"name\":\"21st Mediterranean Conference on Control and Automation\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st Mediterranean Conference on Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MED.2013.6608840\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st Mediterranean Conference on Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MED.2013.6608840","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Decentralized control for maintenance of strong connectivity for directed graphs
In order to accomplish cooperative tasks, decentralized systems are required to communicate among each other. Thus, maintaining the connectivity of the communication graph is a fundamental issue. Connectivity maintenance has been extensively studied in the last few years, but generally considering undirected communication graphs. In this paper we introduce a decentralized control and estimation strategy to maintain the strong connectivity property of directed communication graphs. The control strategy is initially developed for balanced digraphs, and is then extended to generic strongly connected digraphs, introducing a decentralized balancing algorithm. The control strategy is validated by means of analytical proofs and simulation results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
