OAK

From Matrix-Weighted Consensus to Multipartite Average Consensus

Metadata Downloads
Abstract
This article studies a consensus protocol, which is called a multipartite average consensus, of a multiagent system over signed undirected networks in which all agents could be partitioned into multiple subgroups and all agents in the same group converge to the average of their initial values. The proposed protocol is based on results from a matrix-weighted consensus. It is shown that a matrix-weighted consensus can be transformed into a multipartite average consensus. We then discuss a method to combine some subgroups or all subgroups into a union group in order that all agents in the union group reach an average consensus. Finally, we provide examples and simulations to validate the statement. © 2014 IEEE.
Author(s)
Kwon, S.-H.Bae, Y.-B.Liu, J.Ahn, Hyo-Sung
Issued Date
2020-12
Type
Article
DOI
10.1109/TCNS.2020.2988223
URI
https://scholar.gist.ac.kr/handle/local/11810
Publisher
IEEE CONTROL SYSTEMS SOCIETY
Citation
IEEE Transactions on Control of Network Systems, v.7, no.4, pp.1609 - 1620
ISSN
2325-5870
Appears in Collections:
Department of Mechanical and Robotics Engineering > 1. Journal Articles
공개 및 라이선스
  • 공개 구분공개
파일 목록
  • 관련 파일이 존재하지 않습니다.

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.