Consensus of linear multi-agent systems with reduced-order observer-based protocols

This paper considers the consensus problems for both continuous- and discrete-time linear multi-agent systems with directed communication topologies. Distributed reduced-order observer-based consensus protocols are proposed, based on the relative outputs of neighboring agents. A multi-step algorithm is presented to construct a reduced-order protocol, under which a continuous-time multi-agent system whose communication topology contains a directed spanning tree can reach consensus. This algorithm is further modified to achieve consensus with a prescribed convergence rate. These two algorithms have a favorable decoupling property. In light of the modified algebraic Riccati equation, an algorithm is then given to construct a reduced-order protocol for the discrete-time case.