A quantized-data based resilient consensus algorithm

Distributed consensus is an important class of distributed algorithms and has attracted great interests in recent years in multi-agent systems, but it introduces a new security issue that adversarial agents may manipulate false information to disrupt the correct operation of consensus process of the whole network. This paper institutes the resilient consensus problem of multi-agent networks under limited communication. The communication channels among the nodes are constrained in which the exchanged information is quantized. The objective is to design a quantized-data based control protocol so that the safe agents can withstand the attackers and acquire an agreement as time goes to infinity. Finally, an example and simulation results are given to illustrate the effectiveness of the algorithm.