Consensus of second-order multi-agent systems in the presence of locally bounded faults

Abstract We propose an algorithm for consensus of second-order sampled-data multi-agent systems in the presence of misbehaving agents. Each normal agent updates its states following a predetermined control law based on local information while some malicious agents make updates arbitrarily. The normal agents do not know the global topology of the network, but have prior knowledge on the maximum number of malicious agents in their neighborhood. Under the assumption that the network has sufficient connectivity in terms of robustness, we develop a resilient algorithm where each agent ignores the neighbors which have large and small position values to avoid being influenced by malicious agents.

[1]  Masafumi Yamashita,et al.  Erratum: Distributed Anonymous Mobile Robots: Formation of Geometric Patterns , 2006, SIAM J. Comput..

[2]  Maria Gradinariu Potop-Butucaru,et al.  Optimal Byzantine-resilient convergence in uni-dimensional robot networks , 2010, Theor. Comput. Sci..

[3]  Antonio Bicchi,et al.  Consensus Computation in Unreliable Networks: A System Theoretic Approach , 2010, IEEE Transactions on Automatic Control.

[4]  Yu-Ping Tian,et al.  Consentability and protocol design of multi-agent systems with stochastic switching topology , 2009, Autom..

[5]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[6]  Paul D. Ezhilchelvan,et al.  A timeout-based message ordering protocol for a lightweight software implementation of TMR systems , 2004, IEEE Transactions on Parallel and Distributed Systems.

[7]  Hideaki Ishii,et al.  Resilient consensus of double-integrator multi-agent systems , 2014, 2014 American Control Conference.

[8]  Maiko Shigeno,et al.  A new parameter for a broadcast algorithm with locally bounded Byzantine faults , 2010, Inf. Process. Lett..

[9]  Douglas M. Blough,et al.  Multistep Interactive Convergence: An Efficient Approach to the Fault-Tolerant Clock Synchronization of Large Multicomputers , 1998, IEEE Trans. Parallel Distributed Syst..

[10]  R. Kieckhafer,et al.  Low Cost Approximate Agreement In Partially Connected Networks , 1993 .

[11]  Shreyas Sundaram,et al.  Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents , 2011, IEEE Transactions on Automatic Control.

[12]  Xenofon Koutsoukos,et al.  Resilient Cooperative Control of Networked Multi-Agent Systems , 2012 .

[13]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[14]  Karl Henrik Johansson,et al.  Distributed fault detection for interconnected second-order systems , 2011, Autom..

[15]  Roger M. Kieckhafer,et al.  Reaching Approximate Agreement with Mixed-Mode Faults , 1994, IEEE Trans. Parallel Distributed Syst..

[16]  Hiroaki Nishino,et al.  Distributed Detection of Cyber Attacks and Faults for Power Systems , 2014 .

[17]  Hideaki Ishii,et al.  Resilient consensus of second-order agent networks: Asynchronous update rules over robust graphs , 2015, 2015 American Control Conference (ACC).

[18]  Steven X. Ding,et al.  Advanced design scheme for fault tolerant distributed networked control systems , 2008 .

[19]  Shreyas Sundaram,et al.  Resilient Asymptotic Consensus in Robust Networks , 2013, IEEE Journal on Selected Areas in Communications.

[20]  Lewis Tseng,et al.  Iterative approximate byzantine consensus in arbitrary directed graphs , 2012, PODC '12.

[21]  Yongcan Cao,et al.  Sampled-data discrete-time coordination algorithms for double-integrator dynamics under dynamic directed interaction , 2010, Int. J. Control.

[22]  Nancy A. Lynch,et al.  Reaching approximate agreement in the presence of faults , 1986, JACM.