OAK

Matrix-weighted consensus and its applications

Metadata Downloads
Abstract
This paper proposes the matrix-weighted consensus algorithm, which is a generalization of the consensus algorithm. Given a networked dynamical system where the interconnections between agents are weighted by nonnegative definite matrices, it is shown that consensus and clustering phenomena naturally exist. We examine algebraic and algebraic graph conditions for achieving a consensus. (C) 2017 Elsevier Ltd. All rights reserved.
Author(s)
Minh Hoang TrinhChuong Van NguyenLim, Young-HunAhn, Hyo-Sung
Issued Date
2018-03
Type
Article
DOI
10.1016/j.automatica.2017.12.024
URI
https://scholar.gist.ac.kr/handle/local/13377
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Citation
Automatica, v.89, pp.415 - 419
ISSN
0005-1098
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.