Sign-Consensus of Linear Multiagent Systems under a State Observer Protocol
Keyword(s):
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.
2018 ◽
Vol 41
(8)
◽
pp. 2328-2337
◽
1998 ◽
Vol 120
(3)
◽
pp. 423-426
◽
2002 ◽
Vol 124
(3)
◽
pp. 375-381
◽
Keyword(s):
1991 ◽
Vol 01
(01)
◽
pp. 1-25
◽
2005 ◽
Vol 16
(1)
◽
pp. 56-59
2002 ◽
Vol 16
(10)
◽
pp. 709-728
◽