z-logo
open-access-imgOpen Access
Leader–following consensus problem of networked multi‐agent systems under switching topologies and communication constraints
Author(s) -
Tan Chong,
Dong Xuyang,
Li Yanjiang,
Liu GuoPing
Publication year - 2020
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2020.0892
Subject(s) - network topology , control theory (sociology) , consensus , network packet , state (computer science) , computer science , multi agent system , telecommunications network , exponential stability , stability (learning theory) , enhanced data rates for gsm evolution , control (management) , topology (electrical circuits) , distributed computing , mathematical optimization , nonlinear system , mathematics , computer network , artificial intelligence , physics , algorithm , quantum mechanics , machine learning , combinatorics
The problem of leader–following consensus is investigated for heterogeneous discrete‐time linear networked multi‐agent systems with data packet losses and network delays. Two kinds of networked protocols are presented to derive the states of followers to reach an agreement on leader's state under the switching topologies, in the meanwhile, the asymptotic stability of all agents are guaranteed. Due to unavailable agents' states and communication constraints, the networked predictive control method is used to compensate network delays and data packet losses actively. Sufficient criteria of leader–following consensus and asymptomatic stability are obtained when at least one follower is connected to the leader by a directed edge. The simulation example is presented to illustrate that states of followers can track leader's state, and all agents' states also asymptotically converge to the equilibrium under the proposed theoretical results.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here