{"title":"Output consensus for networks of non-identical introspective agents","authors":"Tao Yang, A. Saberi, A. Stoorvogel, H. F. Grip","doi":"10.1109/CDC.2011.6160850","DOIUrl":null,"url":null,"abstract":"In this paper, we consider three problems, namely, the output consensus problem, the model-reference output consensus problem, and the regulation of output consensus problem, for a network of non-identical right-invertible linear agents. The network provides each agent with a linear combination of multiple agents' outputs. We assume that all the agents are introspective, meaning that they have access to their own local measurements. Under this assumption, we then propose a distributed linear protocol to solve each problem for a broad class of network topologies, including not only Laplacian topologies for a directed graph which contains a directed spanning tree, but a wide family of asymmetric topologies.","PeriodicalId":360068,"journal":{"name":"IEEE Conference on Decision and Control and European Control Conference","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Conference on Decision and Control and European Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.2011.6160850","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31
Abstract
In this paper, we consider three problems, namely, the output consensus problem, the model-reference output consensus problem, and the regulation of output consensus problem, for a network of non-identical right-invertible linear agents. The network provides each agent with a linear combination of multiple agents' outputs. We assume that all the agents are introspective, meaning that they have access to their own local measurements. Under this assumption, we then propose a distributed linear protocol to solve each problem for a broad class of network topologies, including not only Laplacian topologies for a directed graph which contains a directed spanning tree, but a wide family of asymmetric topologies.