Consensus For Complex Multi-Agent Systems With Quantization

In recent years, how to coordinate a group of spatially distributed dynamic systems or agents have become a hot area of research within the context of complex multi-agent systems. As a fundamental problem in the study of the distributed coordination for complex multi-agent systems, the consensus problem for complex multi-agent systems has attracted more and more attention recently. In a team of agents,"consensus" means that all the agents reach an agreement on their certain variables of common interest states, and consensus algorithm is a designed networked protocol for agents reach agreement based on local information exchange. An important control strategy is asynchronously consensus for complex multi-agent systems with quantization information communication.It is well known that in real complex multi-agents systems digital networks, due to the effect of communication environment, communication channels have a finite channel capacity will be one of bottlenecks to natural of complex multi-agent systems. The communication between different agents in finite channel systems digital networks can be viewed as such a process:At each time step, the sender encodes the quantized state and sends out the code. When the neighbors receive the code, they use a decoding algorithm to obtain an estimate of the sender's state. Thus, quantization information communication plays an important role in information communication exchange among agents.In this paper, we focus on investigating asynchronously consensus problem for complex multi-agent systems with quantization information communication. First, we study the static consensus problem of gossip algorithms for complex multi-agent systems with quantization information communication in undirected graph. Then, we analyze the dynamic and static consensus problem of broadcast gossip algorithms for multi-agent systems with quantization information communication in directed graph.