Consensus protocol for multi-agent continuous systems

Based on the algebraic graph theory, the networked multi-agent continuous systems are investigated. Firstly, the digraph (directed graph) represents the topology of a networked system, and then a consensus convergence criterion of system is proposed. Secondly, the issue of stability of multi-agent systems and the consensus convergence problem of information states are all analysed. Furthermore, the consensus equilibrium point of system is proved to be global and asymptotically reach the convex combination of initial states. Finally, two examples are taken to show the effectiveness of the results obtained in this paper.