{"title":"多领导导向共识网络中的集群","authors":"Jeong-Min Ma, Hyung-Gohn Lee, H. Ahn, K. Moore","doi":"10.23919/ICCAS50221.2020.9268254","DOIUrl":null,"url":null,"abstract":"In a directed graph a leader is a node that has no in-degree edges. If there are multiple leaders in a directed consensus network, the system will not reach consensus. In such systems the nodes will organize into clusters or groups of node that converge to the same value. These clusters are not dependent on initial conditions or edge weights. In this paper we study clusters in multi-leader directed consensus networks. Specifically, we present an algorithm to classify all clusters in the graph.","PeriodicalId":6732,"journal":{"name":"2020 20th International Conference on Control, Automation and Systems (ICCAS)","volume":"36 1","pages":"379-384"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Clusters in multi-leader directed consensus networks\",\"authors\":\"Jeong-Min Ma, Hyung-Gohn Lee, H. Ahn, K. Moore\",\"doi\":\"10.23919/ICCAS50221.2020.9268254\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a directed graph a leader is a node that has no in-degree edges. If there are multiple leaders in a directed consensus network, the system will not reach consensus. In such systems the nodes will organize into clusters or groups of node that converge to the same value. These clusters are not dependent on initial conditions or edge weights. In this paper we study clusters in multi-leader directed consensus networks. Specifically, we present an algorithm to classify all clusters in the graph.\",\"PeriodicalId\":6732,\"journal\":{\"name\":\"2020 20th International Conference on Control, Automation and Systems (ICCAS)\",\"volume\":\"36 1\",\"pages\":\"379-384\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 20th International Conference on Control, Automation and Systems (ICCAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ICCAS50221.2020.9268254\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 20th International Conference on Control, Automation and Systems (ICCAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ICCAS50221.2020.9268254","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Clusters in multi-leader directed consensus networks
In a directed graph a leader is a node that has no in-degree edges. If there are multiple leaders in a directed consensus network, the system will not reach consensus. In such systems the nodes will organize into clusters or groups of node that converge to the same value. These clusters are not dependent on initial conditions or edge weights. In this paper we study clusters in multi-leader directed consensus networks. Specifically, we present an algorithm to classify all clusters in the graph.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
