Optimizing Network Controllability with Minimum Cost
In this paper, the issue of optimally modifying the structure of a directed network to guarantee its structural controllability is investigated. Given a directed network, in order to obtain a structurally controllable system, a framework for finding the minimum number of directed edges that need to...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/6657307 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1850158381332955136 |
|---|---|
| author | Xiao Wang Linying Xiang |
| author_facet | Xiao Wang Linying Xiang |
| author_sort | Xiao Wang |
| collection | DOAJ |
| description | In this paper, the issue of optimally modifying the structure of a directed network to guarantee its structural controllability is investigated. Given a directed network, in order to obtain a structurally controllable system, a framework for finding the minimum number of directed edges that need to be added to the network is proposed. After we get these edge-addition configurations, we further calculate the network cost of each optimization scheme and choose the one with the minimum cost. Our main contribution is twofold: first, we provide an algorithm able to find all optimal network modifications in polynomial time; second, we provide a way to calculate the cost of optimizing the network based on the node betweenness. Numerical simulations are given to illustrate the theoretical results. |
| format | Article |
| id | doaj-art-673c0232178f4c8286b6c4e6f5c706d1 |
| institution | OA Journals |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-673c0232178f4c8286b6c4e6f5c706d12025-08-20T02:23:53ZengWileyComplexity1076-27871099-05262021-01-01202110.1155/2021/66573076657307Optimizing Network Controllability with Minimum CostXiao Wang0Linying Xiang1School of Control Engineering, Northeastern University at Qinhuangdao, Qinhuangdao 066004, ChinaSchool of Control Engineering, Northeastern University at Qinhuangdao, Qinhuangdao 066004, ChinaIn this paper, the issue of optimally modifying the structure of a directed network to guarantee its structural controllability is investigated. Given a directed network, in order to obtain a structurally controllable system, a framework for finding the minimum number of directed edges that need to be added to the network is proposed. After we get these edge-addition configurations, we further calculate the network cost of each optimization scheme and choose the one with the minimum cost. Our main contribution is twofold: first, we provide an algorithm able to find all optimal network modifications in polynomial time; second, we provide a way to calculate the cost of optimizing the network based on the node betweenness. Numerical simulations are given to illustrate the theoretical results.http://dx.doi.org/10.1155/2021/6657307 |
| spellingShingle | Xiao Wang Linying Xiang Optimizing Network Controllability with Minimum Cost Complexity |
| title | Optimizing Network Controllability with Minimum Cost |
| title_full | Optimizing Network Controllability with Minimum Cost |
| title_fullStr | Optimizing Network Controllability with Minimum Cost |
| title_full_unstemmed | Optimizing Network Controllability with Minimum Cost |
| title_short | Optimizing Network Controllability with Minimum Cost |
| title_sort | optimizing network controllability with minimum cost |
| url | http://dx.doi.org/10.1155/2021/6657307 |
| work_keys_str_mv | AT xiaowang optimizingnetworkcontrollabilitywithminimumcost AT linyingxiang optimizingnetworkcontrollabilitywithminimumcost |