Abstract
In this brief, we investigate the problem of resilient consensus in continuous-time second-order networks, where some nodes might be faulty or adversarial. Despite the existence of such malicious and unexpected behaviors, the normal agents still aim to reach an agreement. Towards this end, a resilient impulsive algorithm is proposed, in which the signal transmission among agents occurs with aperiodic intervals. At each sampling time, the normal agent removes the most extreme values in the neighborhood and then derives its control signal with the remaining ones. We show the influence of the malicious nodes on the normal ones would be limited by this manner. Sufficient conditions related to the network topology and tolerable number of misbehaving nodes are finally established to achieve the resilient consensus.
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.
