摘要：AbstractWe consider a multi-agent network and study its resilient consensus taking account of cyber-security issues. In our setting, there may be some malicious agents whose aim is to prevent other normal agents from reaching consensus. They may do so by not complying with the given control laws and behaving arbitrarily. It is assumed that a bound on the number of such agents in the entire network or in each normal agent's neighborhood is known. The normal agents are equipped for such attacks with a simple algorithm where neighbors taking the largest and smallest values are ignored to avoid being influenced by malicious agents. We address this problem when the agents make updates asynchronously and the agents use bounded non-uniform time-varying delayed data. Topological conditions in terms of graph robustness are developed.
