Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Zhai et al. (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: