This paper deals with the consensus problem in network of agents with cooperative and antagonistic interactions subject to quantization. By employing the techniques from nonsmooth analysis, we prove that all agents can be guaranteed to asymptotically reach bipartite consensus for any logarithmic quantizer accuracy under connected and structurally balanced topology and the states of all agents asymptotically converge to zero under connected and structurally unbalanced topology. In addition, finite-time bipartite consensus is considered for single-integrator agents with binary quantized information. The simulation results are given to demonstrate the effectiveness of the theoretical results.
This article investigates the resilient bipartite consensus problem for continuous-time second-order multiagent systems in the presence of totally bounded malicious nodes under signed digraphs. An event-based resilient impulsive algorithm is employed, which cannot only mitigate the malicious nodes’ influence on the convergence of normal ones but also reduce the communication loads of agents. A necessary and sufficient condition related to the network topology is established for solving resilient bipartite consensus by using system transformation. A numerical simulation illustrates the effectiveness of the result.
2 April 2012 in International Journal of Systems Science
This article considers the finite-time consensus of multiple second-order dynamic agents without velocity measurements. A feasible protocol under which each agent can only obtain the measurements of its position relative to its neighbours is proposed. By applying the graph theory, Lyapunov theory and the homogeneous domination method, some sufficient conditions for finite-time consensus of second-order multi-agent systems are established under the different kinds of communication topologies. Some examples are presented to illustrate the effectiveness of the theoretical results.