2009
DOI: 10.1016/j.automatica.2009.07.006
|View full text |Cite
|
Sign up to set email alerts
|

Synchronization in networks of identical linear systems

Abstract: The paper investigates the synchronization of a network of identical linear state-space models under a possibly time-varying and directed interconnection structure. The main result is the construction of a dynamic output feedback coupling that achieves synchronization if the decoupled systems have no exponentially unstable mode and if the communication graph is uniformly connected. The result can be interpreted as a generalization of classical consensus algorithms. Stronger conditions are shown to be sufficien… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
493
0
2

Year Published

2012
2012
2020
2020

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 736 publications
(495 citation statements)
references
References 25 publications
0
493
0
2
Order By: Relevance
“…The node of a directed graph G = (ν, ξ, A) is balanced if and only if its in-degree and out-degree are equal, i.e., din (vi) = dout (vi). A graph G = (ν, ξ, A) is called balanced if and only if all of its nodes are balanced, this definition is introduced in [18]. If there is a directed path from every node to every other node, the graph is said to be strongly connected (connected for undirected graph).…”
Section: Communication Graphsmentioning
confidence: 99%
See 1 more Smart Citation
“…The node of a directed graph G = (ν, ξ, A) is balanced if and only if its in-degree and out-degree are equal, i.e., din (vi) = dout (vi). A graph G = (ν, ξ, A) is called balanced if and only if all of its nodes are balanced, this definition is introduced in [18]. If there is a directed path from every node to every other node, the graph is said to be strongly connected (connected for undirected graph).…”
Section: Communication Graphsmentioning
confidence: 99%
“…But in [14][15][16][17], the consensus protocol is based upon all the states of neighboring agents. The output feedback consensus problem has been considered in [18], but all the states of the observer for each agent need to be transmitted to the neighbors, so the quantity of the transmitted information is the same as the case of state feedback. The recent work in [19] discussed various conditions for achieving consensus by output feedback, but it is limited to the cases of static output feedback.…”
Section: Introductionmentioning
confidence: 99%
“…Most of the literature focuses on identical or homogeneous agents [3][4][5][6]. However, from a practical point of view the consideration of non-identical or heterogeneous agents is more interesting.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, more attention has been paid to consensus or synchronization of higher-order general linear agents [3]- [7].…”
Section: Introductionmentioning
confidence: 99%