Resilient Consensus of Multi-Agent Systems With Switching Topologies: A Trusted-Region-Based Sliding-Window Weighted Approach

The resilient consensus of multi-agent systems with trusted agents under switching topologies is addressed in this brief. A novel assumption on switching topologies is proposed, which is different from the existing works dependent on the classical graph robustness condition. Correspondingly, the tru...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on circuits and systems. II, Express briefs Vol. 68; no. 7; pp. 2448 - 2452
Main Authors Zhai, Yang, Liu, Zhi-Wei, Guan, Zhi-Hong, Wen, Guanghui
Format Journal Article
LanguageEnglish
Published New York IEEE 01.07.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects
Algorithms
Convergence
Heuristic algorithms
malicious attack
Multi-agent system
Multi-agent systems
Multiagent systems
resilient consensus
Robustness
Robustness (mathematics)
Sliding
Switches
Switching
Switching circuits
switching topologies
Topology
trusted agents
Online AccessGet full text

Cover

More Information
Summary:The resilient consensus of multi-agent systems with trusted agents under switching topologies is addressed in this brief. A novel assumption on switching topologies is proposed, which is different from the existing works dependent on the classical graph robustness condition. Correspondingly, the trusted-region-based sliding-window weighted (TSW) algorithm is proposed to filter the received sampled data. It is successfully shown that the resilient consensus can be guaranteed under the assumption on switching topologies and TSW algorithm. Finally, numerical examples are conducted to validate the results.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2021.3052919