.png){kind=icon}
返回
Finite-time general function consensus for multi-agent systems over signed digraphs
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2023.05.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper solves the finite-time consensus problem for discrete time multi-agent systems (MASs) where agents update their values via linear iteration and the interactions between them are described by signed digraphs. A sufficient condition is presented that the agents can reach consensus on any given linear function of multiple initial signals in finite time, i.e., there exists an eventually positive Laplacianbased matrix associated with the underlying graph. We prove that the linear iterative framework ratio consensus developed for unsigned graphs in the literature can be extended to the computation for signed graphs with appropriate modifications. Our method weakens the limitation of the iterative framework on the marginal Schur stability of the weight matrix without increasing the computational complexity. Reaching average consensus on unsigned graphs as in the literature is regarded as a special case of our algorithm. Two illustrative examples are presented to demonstrate the correctness of the proposed results.& COPY; 2023 The Franklin Institute. Published by Elsevier Inc. All rights reserved.
Keyword:
NETWORKS
SYNCHRONIZATION
DYNAMICS
期刊
J
IF:
3.7
论文数:
6.4K
被引数:
1.5W
机构
引用论文
Fixed -time bipartite synchronization with a pre-appointed settling time over directed cooperative-antagonistic networks.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
Distributed Finite-Time Computation of Digraph Parameters: Left-Eigenvector, Out-Degree and Spectrum
PREAI
分享收藏Selective β2-adrenoceptor antagonists: derivatives of ICI 118,551 and a binary aryloxypropanolamine
PREAI
分享收藏
查看更多内容