Name
Abstract | ||
|---|---|---|
In large directed complex networks, it may result unfeasible to successfully pinning control the whole network. Indeed, when the pinner node can be connected only to a limited number of nodes, it may be impossible to guarantee pinning controllability of all the network nodes. In this paper, we introduce the partial pinning control problem, which consists in determining the optimal selection of the nodes to be pinned so as to maximize the fraction of nodes of the whole network that can be asymptotically controlled to the pinner’s trajectory. A suboptimal solution to this problem is provided for a class of nonlinear node dynamics, together with the bounds on the minimum coupling and control gains required to “partially control” the network. The theoretical analysis is translated into an integer linear program (ILP), which is solved on a testbed network of 688 nodes. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.automatica.2017.11.025 | Automatica |
Field | DocType | Volume |
Integer,Mathematical optimization,Nonlinear system,Controllability,Node (networking),Testbed,Linear programming,Complex network,Trajectory,Mathematics | Journal | 89 |
Issue | ISSN | Citations |
1 | 0005-1098 | 3 |
PageRank | References | Authors |
0.38 | 15 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pietro De Lellis | 1 | 270 | 24.35 |
| Franco Garofalo | 2 | 101 | 9.65 |
| Francesco Lo Iudice | 3 | 13 | 5.67 |