A Spectral Property of a Graph Matrix and Its Application to the Leader-Following Consensus of Discrete-Time Multiagent Systems

DOI10.1109/TAC.2018.2867167MaRDI QIDQ5223769zbMATH OpenOpenAlexFDO

Authors

Publication date 18 July 2019

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2018.2867167

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Multi-agent systems (93A16) Discrete-time control/observation systems (93C55) Asymptotic stability in control theory (93D20)

Cited in

(4)

• Sequential predictors for delay compensation for discrete time systems with time-varying delays
• On the leader-following exponential consensus of discrete-time linear multi-agent systems over jointly connected switching networks
• Containment control of discrete‐time multi‐agent systems with application to escort control of multiple vehicles
• Distributed optimization of finite condition number for Laplacian matrix in multi-agent systems

This page was built for publication: A Spectral Property of a Graph Matrix and Its Application to the Leader-Following Consensus of Discrete-Time Multiagent Systems

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