Sign-consensus of linear multiagent systems under a state observer protocol (Q2280251): Difference between revisions

Summary: The sign-consensus problem for linear time-invariant systems under signed digraph is considered. The information of the agents' states is reconstructed, and then, a state observer-type sign-consensus protocol is proposed, whose performance is analyzed using matrix analysis and ordinary differential equation theory. Sufficient conditions for ensuring sign-consensus are given. It is proven that if the adjacency matrix of the signed digraph has strong Perron-Frobenius property or is eventually positive, sign-consensus can be achieved under the proposed protocol. In particular, conventional consensus is a special case of sign-consensus under mild conditions.