Document Type
Article
Publication Date
12-1-2021
Abstract
This paper examines the roles of the matrix weight elements in matrix-weighted consensus. The consensus algorithms dictate that all agents reach consensus when the weighted graph is connected. However, it is not always the case for matrix weighted graphs. The conditions leading to different types of consensus have been extensively analysed based on the properties of matrix-weighted Laplacians and graph theoretic methods. However, in practice, there is concern on how to pick matrix-weights to achieve some desired consensus, or how the change of elements in matrix weights affects the consensus algorithm. By selecting the elements in the matrix weights, different clusters may be possible. In this paper, we map the roles of the elements of the matrix weights in the systems consensus algorithm. We explore the choice of matrix weights to achieve different types of consensus and clustering. Our results are demonstrated on a network of three agents where each agent has three states.
Publication Source (Journal or Book title)
Network
First Page
233
Last Page
246
Recommended Citation
Ogbebor, J., & Meng, X. (2021). On the Role of Matrix-Weights Elements in Consensus Algorithms for Multi-Agent Systems. Network, 1 (3), 233-246. https://doi.org/10.3390/network1030014
