State Consensus for Discrete-time Multi-agent Systems over Time-varying Graphs

DOI10.1109/TAC.2020.2979750MaRDI QIDQ6292353arXivFDO

Authors Jilie Zhang, Xiang Chen, Guoxiang Gu

Publication date 10 October 2017

Published in arXiv

Full work available at URL https://doi.org/10.1109/TAC.2020.2979750

Mathematics Subject Classification ID

Multi-agent systems (93A16) Observability (93B07) Discrete-time control/observation systems (93C55) Consensus (93D50)

arXiv classification

math.OC

Abstract: We study the state consensus problem for linear shift-invariant discrete-time homogeneous multi-agent systems (MASs) over time-varying graphs. A novel approach based on the small gain theorem is proposed to design the consensus control protocols for both neutrally stable and neutrally unstable MASs, assuming the uniformly connected graphs. It is shown that the state consensus can be achieved for neutrally stable MASs under a weak uniform observability condition; for neutrally unstable MASs, the state consensus entails a strong uniform observability condition. Two numerical examples are worked out to illustrate our consensus results.

This page was built for publication: State Consensus for Discrete-time Multi-agent Systems over Time-varying Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6292353)