Sign-consensus of linear multiagent systems under a state observer protocol (Q2280251)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7144342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sign-consensus of linear multiagent systems under a state observer protocol |
scientific article; zbMATH DE number 7144342 |
Statements
Sign-consensus of linear multiagent systems under a state observer protocol (English)
0 references
18 December 2019
0 references
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.
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8020106554031372
0 references
0.7918504476547241
0 references
0.7847685217857361
0 references
0.784164309501648
0 references
0.7823985815048218
0 references
