摘要
In recent years, structural controllability of complex network has aroused great interest. In literatures fruitful results have been achieved on finding the minimum number of driver nodes which guarantee the network structurally controllable.Algorithms for selecting a group of such driver nodes are also proposed. However, for practical applications, it is always desirable to have more possibilities for driver nodes selection such that additional requirements caused by network operation or control can be considered. This paper focuses on finding complete schemes of eliminating redundant driver nodes from a given available driver node set without destroying the structural controllability. We solve this problem according to the two algebraic conditions of structural controllability respectively and the effectiveness and efficiency of the algorithm are also discussed based on some related tests.
In recent years, structural controllability of complex network has aroused great interest. In literatures fruitful results have been achieved on finding the minimum number of driver nodes which guarantee the network structurally controllable.Algorithms for selecting a group of such driver nodes are also proposed. However, for practical applications, it is always desirable to have more possibilities for driver nodes selection such that additional requirements caused by network operation or control can be considered. This paper focuses on finding complete schemes of eliminating redundant driver nodes from a given available driver node set without destroying the structural controllability. We solve this problem according to the two algebraic conditions of structural controllability respectively and the effectiveness and efficiency of the algorithm are also discussed based on some related tests.
引文
[1]YY.Liu,JJ.Slotine,AL.Barabsi,Controllability of complex networks,Nature,vol.473,no.7346,pp.167-173,May.2011.
[2]Z.Yuan,C.Zhao,ZR.Di,WX.Wang,and YC.Lai,Exact controllability of complex networks,Nature Communications,vol.4,no.2447,Sept.2013.
[3]A.Olshevsky,Minimum input selection for structural controllability,IEEE ACC,Chicago,USA,pp.2218-2223,2015.
[4]R.Haghighi,HR.Namazi,Algorithm for identifying minimum driver nodes based on structural controllability,Math.Probl.Eng,vol.2015,Oct.2015.
[5]C.Luo,Local controllability of biological networks,Ph.D.dissertation,Dept.Math,NKU,Nanjing,CN,2015.
[6]A.Vinayagam,TE.Gibson,HJ.Lee,et al.,Controllability analysis of the directed human protein interaction network identifies disease genes and drug targets,ar Xiv preprint ar Xiv:1511.07768,Nov.2015.
[7]XC.Wang,Research on selection rule set for driver nodes guaranteeing network’s structural controllability,M.S.dissertation,Department of Automation,Shanghai Jiao Tong University,Shanghai,2017.
[8]M.Morari,G.Stephanopoulos,Studies in the synthesis of control structures for chemical processes:Part II:Structural aspects and the synthesis of alternative feasible control schemes,AICh E Journal,vol.26,no.2,pp.232-246,Mar.1980.
[9]GW.Barton,RD.Johnston,ML.Brisk,Comments on determining structural controllability,Int.J.Control,vol.38,no.5,pp.1081-1083,1983.
[10]RD.Johnston,GW.Barton,ML.Brisk,Determination of the generic rank of structural matrices,Int.J.Control,vol.40,no.2,pp.257-264,1984.
[11]XC.Wang,YG.Xi,Algorithms for determining networks’feasible control schemes,Chinese Control Conference,Hangzhou,China,pp.6685-6690,2015
[12]CT.Lin,Structural controllability,IEEE Trans.Autom.Control,vol.19,no.3,pp.201-208,Jun.1974.
