z-logo
open-access-imgOpen Access
H-infinity bipartite consensus of multi-agent systems with external disturbance and probabilistic actuator faults in signed networks
Author(s) -
Hongjie Li
Publication year - 2022
Publication title -
aims mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.329
H-Index - 15
ISSN - 2473-6988
DOI - 10.3934/math.2022116
Subject(s) - bipartite graph , mathematics , probabilistic logic , control theory (sociology) , algebraic graph theory , topology (electrical circuits) , graph theory , computer science , discrete mathematics , graph , combinatorics , control (management) , statistics , artificial intelligence
The H-infinity bipartite consensus problem is addressed for a class of linear multi-agent systems with external disturbance, where the positive and negative links are allowed in communication topology. A novel event-triggered communication scheme is presented to save limited network resources, which dependents on information from neighboring agents at event-triggered instants, the given event-triggered condition is detected only at discrete sampling times, thus Zeno behavior can be excluded, two types of event-triggered matrices have been introduced in our event-triggered communication scheme, which can further reduce the sampled-data transmission compared with some existed results. Considering the probabilistic actuator faults, the reliable controller is designed based on sampled-data, then a new distribution-based fault model is constructed by using coordinate transform. Some H-infinity bipartite consensus criteria can be derived by the Lyapunov stability theory and algebraic graph theory, at the same time, the feedback matrices and event-triggered matrices can be obtained by solving some linear matrix inequalities. Finally, a numerical example is employed to show the validity and advantage of the proposed transmission scheme.

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