Mean square consensus of multi-agent systems over fading networks with directed graphs

Mean square consensus of multi-agent systems over fading networks with directed graphs

This paper studies the mean square consensus problem of discrete-time linear multi-agent systems (MASs) over analog fading networks with directed graphs. Compressed in-incidence matrix (CIIM), compressed incidence matrix (CIM) and compressed edge Laplacian (CEL) are firstly proposed to facilitate th...

Full description

Saved in:
Bibliographic Details
Main Authors: Xu, Liang, Zheng, Jianying, Xiao, Niao, Xie, Lihua
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2020
Subjects:
Engineering::Electrical and electronic engineering
Multi-agent Systems
Consensusability
Online Access:https://hdl.handle.net/10356/137866
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
Description
Summary:This paper studies the mean square consensus problem of discrete-time linear multi-agent systems (MASs) over analog fading networks with directed graphs. Compressed in-incidence matrix (CIIM), compressed incidence matrix (CIM) and compressed edge Laplacian (CEL) are firstly proposed to facilitate the modeling and consensus analysis. It is then shown that the mean square consensusability is solely determined by the edge state dynamics on a directed spanning tree. As a result, sufficient conditions are provided for mean square consensus over fading networks with directed graphs in terms of fading parameters, the network topology and the agent dynamics. Moreover, the role of network topology on the mean square consensusability is discussed. In the end, simulations are conducted to verify the derived results.

Similar Items