Several Kinds Of Multi-agent System Consistency

Multi-agent system theory has been a research focus of control theory in recentyears. The research of coordination control among agents is one of the importantproblems in the field of multi-agent system research. In a multi-agent system, consensusmeans that some of the agents’ states reach at the same values, and consensus algorithmis a protocol for agents reach consensus based on local information.This paper studies three multi-agent systems. First, the eigenvalues of the cor-responding Laplacian matrix is used to study the consensus problem of second-orderdiscrete-time systems. Then some sufcient and necessary conditions are derived thatall agents reach consensus on their states. Secondly, by the frequency domain analysis,a sufcient and necessary condition of the second-order continue-time systems reachconsensus is derived and the largest tolerable delay is given. Finally, by the stability,the static consensus problem is considered for a class of high-order multi-agent systems.The simulation examples are provided to show the efectiveness of our theoretical re-sults in this paper.