{"title":"有向图上多个双时间尺度智能体的二部一致性","authors":"Wu Yang, Yan-wu Wang, Jiang‐Wen Xiao, Wu‐Hua Chen","doi":"10.1109/ICARCV.2016.7838737","DOIUrl":null,"url":null,"abstract":"The bipartite consensus problem of multiple two-time scales agents over the signed digraph, where both cooperative and competitive interactions exist among the agents, is considered with a new distributed protocol. Sufficient conditions for bipartite consensus is presented in terms of easily checkable algebraic Riccati equation (ARE). Compared with the existing result on consensus of multiple two-time scales agents, the communication topology here is more generic. Moreover, the upper bound of the singular perturbation parameter is also presented. Simulation examples are given to illustrate the effectiveness of the proposed results.","PeriodicalId":128828,"journal":{"name":"2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Bipartite consensus for multiple two-time scales agents over the signed digraph\",\"authors\":\"Wu Yang, Yan-wu Wang, Jiang‐Wen Xiao, Wu‐Hua Chen\",\"doi\":\"10.1109/ICARCV.2016.7838737\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The bipartite consensus problem of multiple two-time scales agents over the signed digraph, where both cooperative and competitive interactions exist among the agents, is considered with a new distributed protocol. Sufficient conditions for bipartite consensus is presented in terms of easily checkable algebraic Riccati equation (ARE). Compared with the existing result on consensus of multiple two-time scales agents, the communication topology here is more generic. Moreover, the upper bound of the singular perturbation parameter is also presented. Simulation examples are given to illustrate the effectiveness of the proposed results.\",\"PeriodicalId\":128828,\"journal\":{\"name\":\"2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)\",\"volume\":\"136 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICARCV.2016.7838737\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 14th International Conference on Control, Automation, Robotics and Vision (ICARCV)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICARCV.2016.7838737","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Bipartite consensus for multiple two-time scales agents over the signed digraph
The bipartite consensus problem of multiple two-time scales agents over the signed digraph, where both cooperative and competitive interactions exist among the agents, is considered with a new distributed protocol. Sufficient conditions for bipartite consensus is presented in terms of easily checkable algebraic Riccati equation (ARE). Compared with the existing result on consensus of multiple two-time scales agents, the communication topology here is more generic. Moreover, the upper bound of the singular perturbation parameter is also presented. Simulation examples are given to illustrate the effectiveness of the proposed results.