Abstract

Abstract This paper investigates the problem of resilient vector consensus for a group of dynamic agents against mobile malicious attacks. As real networks often operate under random environment and noises, we approach this problem by considering general random dynamic networks with weighted directed topologies. We propose three types of mobile attack models, which differ in the timing of moving of attackers and the capability of detecting such moving. By employing distributed discrete-time algorithms, the Lyapunov theory and martingale convergence theorem, resilient vector consensus is shown to be reached for all three models when the underlying network satisfies certain stochastic robustness conditions.

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 call

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.