OAK

Discrete-Time Matrix-Weighted Consensus

Metadata Downloads
Abstract
This article investigates discrete-time consensus of multiagent networks over undirected and connected graphs, whose edges are weighted by nonnegative definite matrices, under various scenarios. In particular, we first present consensus protocols for the agents in common networks of symmetric matrix weights with possibly different step sizes and switching network topologies. A special type of matrix-weighted consensus with nonsymmetric matrix weights that can render several consensus control scenarios, such as ones with scaled/rotated updates and affine motion constraints, is also considered. We employ Lyapunov stability theory for discrete-time systems and occasionally utilize convex optimization theory for Lyapunov functions with Lipschitz continuous gradients to show convergence to a consensus of the agents. Finally, simulation results are provided to illustrate the theoretical results.
Author(s)
Quoc Van TranMinh Hoang TrinhAhn, Hyo-Sung
Issued Date
2021-12
Type
Article
DOI
10.1109/TCNS.2021.3068367
URI
https://scholar.gist.ac.kr/handle/local/11125
Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
Citation
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS, v.8, no.4, pp.1568 - 1578
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.