2016 American Control Conference (ACC) 2016
DOI: 10.1109/acc.2016.7525499
|View full text |Cite
|
Sign up to set email alerts
|

Network composition for optimal disturbance rejection

Abstract: This paper investigates how the topology of a dynamical network affects its robustness against exogenous disturbances. We consider Laplacian-based network dynamics, and we adopt the H2 system norm to measure the robustness of the network against disturbances. For networks arising from the composition of atomic structures, we provide a closed-form expression of the robustness against disturbances, and we identify optimal composition rules. Specifically, we show that networks consisting of multiple atomic struct… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(6 citation statements)
references
References 14 publications
0
6
0
Order By: Relevance
“…Then, we divide use (7) to replace Ω i with 2n i H C (G i ) and divide (14) by 2N to finally obtain (10).…”
Section: B Coherence In General Composite Graphsmentioning
confidence: 99%
See 3 more Smart Citations
“…Then, we divide use (7) to replace Ω i with 2n i H C (G i ) and divide (14) by 2N to finally obtain (10).…”
Section: B Coherence In General Composite Graphsmentioning
confidence: 99%
“…The coherence of a composite graph with a ring backbone graph |V B | = n is derived from (10) by noting that in a ring graph with n nodes, r(l i , l j ) = (j−i)(n−(j−i)) n . We then get the following formula:…”
Section: Analysis Of Coherence In Backbone Graph Structuresmentioning
confidence: 99%
See 2 more Smart Citations
“…More recent work [22] considers an NoN model with noisy consensus dynamics and proposes methods to identify the optimal interconnection topology. And, in [23], the authors consider a similar NoN model, but with slightly different dynamics. They show that interconnection between the nodes of subgraphs with the highest degree maximizes the robustness of the NoN.…”
Section: Introductionmentioning
confidence: 99%