New cut-balance conditions in networks of clusters

详细信息    查看全文

• 作者：Samuel Martin^a ; ^{samuel.martin@univ-lorraine.fr} ; Irinel-Constantin Morărescu^a ; ^{constantin.morarescu@univ-lorraine.fr} ; Dragan Ne&scaron ; ić^b ; ^{dnesic@unimelb.edu.au}
• 关键词：Multiagent systems ; Consensus ; Structured networks
• 刊名：Automatica
• 出版年：2017
• 出版时间：March 2017
• 年：2017
• 卷：77
• 期：Complete
• 页码：180-183
• 全文大小：397 K
• 卷排序：77

文摘

Existing results in the literature guarantee that the state of multi-agent systems interacting over networks that satisfy the cut-balance assumption asymptotically converges to a constant vector. Furthermore, when the network is persistently connected the agents reach a common value called consensus. Many real large-scale networks are obtained by sparsely connecting subnetworks of densely connected agents. In this context, our objective is to provide new cut-balance assumptions that are adapted to networks of clusters. They are useful for consensus and agreement in clusters in situations when network topology is such that clusters are given or can be easily identified. In this case our new cut-balance assumptions can be checked by realizing a smaller number of operations.