.png){kind=icon}
.png){kind=icon}
Return
Sensitivity-based link addition for robust linear dynamical networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2021.02.034.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A link addition problem is considered for a directed linear network in order to improve the network robustness. The robustness of network is quantified through a well-known measure of stability margin. Optimal identification of links such that the stability margin is maximized by their addition, requires solving a complex combinatorial problem. Here two efficient methods are proposed for suboptimal link addition by exploiting the sensitivity being embedded in the derivative of singular value and Lagrange multiplier. Numerical tests are presented to demonstrate the efficacy of the proposed methods. ? 2021 The Franklin Institute. Published by Elsevier Ltd. All rights reserved.
Keywords:
DESIGN
CONSENSUS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
J
IF:
3.7
Papers:
6.3K
Citations:
1.5W