This paper deals with the distributed consensus problem of high-order multi-agent systems with nonlinear dynamics subject to external disturbances. The network topology is assumed to be a fixed undirected graph. Some ...This paper deals with the distributed consensus problem of high-order multi-agent systems with nonlinear dynamics subject to external disturbances. The network topology is assumed to be a fixed undirected graph. Some sufficient conditions are derived, under which the consensus can be achieved with a prescribed norm bound. It is shown that the parameter matrix in the consensus algorithm can be designed by solving two linear matrix inequalities (LMIs). In particular, if the nonzero eigenvalues of the laplacian matrix ac-cording to the network topology are identical, the parameter matrix in the consensus algorithm can be de-signed by solving one LMI. A numerical example is given to illustrate the proposed results.展开更多
文摘This paper deals with the distributed consensus problem of high-order multi-agent systems with nonlinear dynamics subject to external disturbances. The network topology is assumed to be a fixed undirected graph. Some sufficient conditions are derived, under which the consensus can be achieved with a prescribed norm bound. It is shown that the parameter matrix in the consensus algorithm can be designed by solving two linear matrix inequalities (LMIs). In particular, if the nonzero eigenvalues of the laplacian matrix ac-cording to the network topology are identical, the parameter matrix in the consensus algorithm can be de-signed by solving one LMI. A numerical example is given to illustrate the proposed results.
