Dynamic consensus of linear multi-agent systems

Abstract

This study concerns the consensus of a network of agents with general linear or linearised dynamics, whose communication topology contains a directed spanning tree. An observer-type consensus protocol based on the relative outputs of the neighbouring agents is adopted. The notion of consensus region is introduced, as a measure for the robustness of the protocol and as a basis for the protocol design. For neutrally stable agents, it is shown that there exists a protocol achieving consensus together with a consensus region that is the entire open right-half plane if and only if each agent is stabilisable and detectable. An algorithm is further presented for constructing such a protocol. For consensus with a prescribed convergence speed, a multi-step protocol design procedure is given, which yields an unbounded consensus region and at the same time maintains a favourable decoupling property. Finally, the consensus algorithms are extended to solve the formation control problems.