{"title":"一种基于非频繁通信的节能分布式平均共识方案","authors":"Ping Xu, Z. Tian, Yue Wang","doi":"10.1109/GlobalSIP.2018.8646657","DOIUrl":null,"url":null,"abstract":"Distributed average consensus finds extensive applications in multi-agent systems where a group of agents are required to agree upon a common value. Motivated by the need to conserve energy for large-scale multi-agent systems, we propose an infrequent communication scheme that allows the system to reach average consensus at low energy consumption. The proposed scheme divides the original large network into two smaller sub-networks with some overlapping nodes. Agents in the two sub-networks take turns to broadcast and update their local estimates, until reaching consensus. We prove that the proposed scheme guarantees asymptotic convergence when both subnetworks are connected and have overlapping nodes. Simulations corroborate the energy saving capability of the proposed scheme.","PeriodicalId":119131,"journal":{"name":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"AN ENERGY-EFFICIENT DISTRIBUTED AVERAGE CONSENSUS SCHEME VIA INFREQUENT COMMUNICATION\",\"authors\":\"Ping Xu, Z. Tian, Yue Wang\",\"doi\":\"10.1109/GlobalSIP.2018.8646657\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Distributed average consensus finds extensive applications in multi-agent systems where a group of agents are required to agree upon a common value. Motivated by the need to conserve energy for large-scale multi-agent systems, we propose an infrequent communication scheme that allows the system to reach average consensus at low energy consumption. The proposed scheme divides the original large network into two smaller sub-networks with some overlapping nodes. Agents in the two sub-networks take turns to broadcast and update their local estimates, until reaching consensus. We prove that the proposed scheme guarantees asymptotic convergence when both subnetworks are connected and have overlapping nodes. Simulations corroborate the energy saving capability of the proposed scheme.\",\"PeriodicalId\":119131,\"journal\":{\"name\":\"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GlobalSIP.2018.8646657\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Global Conference on Signal and Information Processing (GlobalSIP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GlobalSIP.2018.8646657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
AN ENERGY-EFFICIENT DISTRIBUTED AVERAGE CONSENSUS SCHEME VIA INFREQUENT COMMUNICATION
Distributed average consensus finds extensive applications in multi-agent systems where a group of agents are required to agree upon a common value. Motivated by the need to conserve energy for large-scale multi-agent systems, we propose an infrequent communication scheme that allows the system to reach average consensus at low energy consumption. The proposed scheme divides the original large network into two smaller sub-networks with some overlapping nodes. Agents in the two sub-networks take turns to broadcast and update their local estimates, until reaching consensus. We prove that the proposed scheme guarantees asymptotic convergence when both subnetworks are connected and have overlapping nodes. Simulations corroborate the energy saving capability of the proposed scheme.