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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
