Premium
Optimal Controlled Nodes Selection for Fast Consensus
Author(s) -
Yang Wen,
Wang Ying,
Wang Xiaofan,
Shi Hongbo
Publication year - 2016
Publication title -
asian journal of control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.769
H-Index - 53
eISSN - 1934-6093
pISSN - 1561-8625
DOI - 10.1002/asjc.1157
Subject(s) - selection (genetic algorithm) , computer science , distributed computing , artificial intelligence
Motivated by the significance of optimizing network performance with limited resources in real applications, we investigate the problem of achieving fast and desired consensus in a complex network via pinning control a fraction of nodes in the network. An optimization problem is proposed to select p optimal pinned nodes to guarantee fastest consensus, which is relaxed to a Mixed‐Integer Semi‐Definite Program. In the single pinned node case ( i.e. , p = 1), we find that the optimal pinned node is the node with highest min‐max distance centrality within the nodes with highest closeness centrality in the network. In the multiple pinned nodes case ( i.e. , p > 1), we find that betweenness centrality could be used as a suboptimal index to select pinned nodes.