Resilient Consensus of Multi-Agent Systems With Switching Topologies: A Trusted-Region-Based Sliding-Window Weighted Approach
Yang Zhai, Zhi‐Wei Liu, Zhi‐Hong Guan, Guanghui Wen
Abstract
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.
Topics & Concepts
Network topologyRobustness (evolution)Computer scienceConsensus algorithmConsensusSliding window protocolMulti-agent systemFast switchingControl theory (sociology)Topology (electrical circuits)Window (computing)MathematicsAlgorithmEngineeringComputer networkArtificial intelligenceElectrical engineeringVoltageOperating systemGeneChemistryBiochemistryControl (management)CombinatoricsDistributed Control Multi-Agent SystemsAdvanced Memory and Neural ComputingSecurity in Wireless Sensor Networks