Sign-Consensus of Linear Multiagent Systems under a State Observer Protocol

Wei-Lu Diao and Cui-Qin Ma

Complexity, 2019, vol. 2019, 1-6

Abstract:

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.

Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2019/3010465.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2019/3010465.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:3010465

DOI: 10.1155/2019/3010465

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem (mohamed.abdelhakeem@hindawi.com).