{"title":"关于随机共识网络的新结果","authors":"C. Somarakis, J. Baras","doi":"10.1137/1.9781611974072.17","DOIUrl":null,"url":null,"abstract":"We revisit the general linear consensus problem and provide new conditions for asymptotic consensus on two types of stochastic versions of the algorithm, in discrete and continuous time. We show that our method unifies a number of proposed models in the literature as well as it extends and generalizes existing results.","PeriodicalId":193106,"journal":{"name":"SIAM Conf. on Control and its Applications","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New Results On Stochastic Consensus Networks\",\"authors\":\"C. Somarakis, J. Baras\",\"doi\":\"10.1137/1.9781611974072.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We revisit the general linear consensus problem and provide new conditions for asymptotic consensus on two types of stochastic versions of the algorithm, in discrete and continuous time. We show that our method unifies a number of proposed models in the literature as well as it extends and generalizes existing results.\",\"PeriodicalId\":193106,\"journal\":{\"name\":\"SIAM Conf. on Control and its Applications\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIAM Conf. on Control and its Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611974072.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Conf. on Control and its Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611974072.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We revisit the general linear consensus problem and provide new conditions for asymptotic consensus on two types of stochastic versions of the algorithm, in discrete and continuous time. We show that our method unifies a number of proposed models in the literature as well as it extends and generalizes existing results.