{"title":"基于八卦增量成本共识算法的异步分布式协同能源管理","authors":"Ziang Zhang, Navid Rahbari-Asr, M. Chow","doi":"10.1109/NAPS.2013.6666854","DOIUrl":null,"url":null,"abstract":"The energy management problem in smart grid is a complex optimization problem of a Cyber-Physical System. Distributed cooperative energy management algorithms have great potential to solve this class of problems. In addition to the synchronous distributed algorithms, asynchronous distributed algorithms are more flexible, robust to packet loss and do not require global clock synchronization. In this paper, we have extended the synchronous Incremental Cost Consensus (ICC) algorithm to a gossip-based asynchronous version. The new algorithm is able to converge to the optimal solution in a distributed fashion with pairwise information exchange between neighbors without the need for any global synchronizing clock. The characteristics of the asynchronous ICC algorithm can be controlled by tuning the weighting of the updating matrix. Several case studies with different system configurations have been used to discuss the characteristics of the proposed algorithm.","PeriodicalId":421943,"journal":{"name":"2013 North American Power Symposium (NAPS)","volume":"241 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"19","resultStr":"{\"title\":\"Asynchronous distributed cooperative energy management through gossip-based incremental cost consensus algorithm\",\"authors\":\"Ziang Zhang, Navid Rahbari-Asr, M. Chow\",\"doi\":\"10.1109/NAPS.2013.6666854\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The energy management problem in smart grid is a complex optimization problem of a Cyber-Physical System. Distributed cooperative energy management algorithms have great potential to solve this class of problems. In addition to the synchronous distributed algorithms, asynchronous distributed algorithms are more flexible, robust to packet loss and do not require global clock synchronization. In this paper, we have extended the synchronous Incremental Cost Consensus (ICC) algorithm to a gossip-based asynchronous version. The new algorithm is able to converge to the optimal solution in a distributed fashion with pairwise information exchange between neighbors without the need for any global synchronizing clock. The characteristics of the asynchronous ICC algorithm can be controlled by tuning the weighting of the updating matrix. Several case studies with different system configurations have been used to discuss the characteristics of the proposed algorithm.\",\"PeriodicalId\":421943,\"journal\":{\"name\":\"2013 North American Power Symposium (NAPS)\",\"volume\":\"241 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"19\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 North American Power Symposium (NAPS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NAPS.2013.6666854\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 North American Power Symposium (NAPS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NAPS.2013.6666854","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Asynchronous distributed cooperative energy management through gossip-based incremental cost consensus algorithm
The energy management problem in smart grid is a complex optimization problem of a Cyber-Physical System. Distributed cooperative energy management algorithms have great potential to solve this class of problems. In addition to the synchronous distributed algorithms, asynchronous distributed algorithms are more flexible, robust to packet loss and do not require global clock synchronization. In this paper, we have extended the synchronous Incremental Cost Consensus (ICC) algorithm to a gossip-based asynchronous version. The new algorithm is able to converge to the optimal solution in a distributed fashion with pairwise information exchange between neighbors without the need for any global synchronizing clock. The characteristics of the asynchronous ICC algorithm can be controlled by tuning the weighting of the updating matrix. Several case studies with different system configurations have been used to discuss the characteristics of the proposed algorithm.