Sparsity-Constrained Controllability Maximization With Application to Time-Varying Control Node Selection

In this letter, we consider the maximization of a quantitative metric of controllability with a constraint of $L^{0}$ norm of the control input. Since the optimization problem contains a combinatorial structure, we introduce a convex relaxation problem for the sake of reducing computation burden. We prove the existence of solutions to the main problem and also give a simple condition under which the relaxed problem gives a solution to the main problem. It should be emphasized that the main problem can formulate time-varying control node selection, which attempts to extract when and where exogenous inputs should be provided in order to achieve high controllability of multi-agent systems.

[1]  R. G. Cooke.  Functional Analysis and Semi-Groups , 1949, Nature.

[2]  Wen Yang,et al.  Optimal Control Nodes Selection for Consensus in Multi-agent Systems , 2014 .

[3]  H. Weber,et al.  Analysis and optimization of certain qualities of controllability and observability for linear dynamical systems , 1972 .

[4]  Alexander Olshevsky,et al.  Minimal Controllability Problems , 2013, IEEE Transactions on Control of Network Systems.

[5]  S. Khanna,et al.  Complexity of the Minimum Input Selection Problem for Structural Controllability , 2015 .

[6]  Karl Kunisch,et al.  Measure Valued Directional Sparsity for Parabolic Optimal Control Problems , 2014, SIAM J. Control. Optim..

[7]  Jorge Cortés,et al.  Scheduling of control nodes for improved network controllability , 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

[8]  Fu Lin,et al.  Sparse quadratic regulator , 2013, 2013 European Control Conference (ECC).

[9]  Debasish Chatterjee,et al.  A jammer's perspective of reachability and LQ optimal control , 2016, Autom..

[10]  Jorge Cortés,et al.  Time-invariant versus time-varying actuator scheduling in complex networks , 2017, 2017 American Control Conference (ACC).

[11]  Roland Herzog,et al.  Directional Sparsity in Optimal Control of Partial Differential Equations , 2012, SIAM J. Control. Optim..

[12]  Masaaki Nagahara,et al.  Value function in maximum hands-off control for linear systems , 2016, Autom..

[13]  F. Clarke.  Functional Analysis, Calculus of Variations and Optimal Control , 2013 .

[14]  Francesco Bullo,et al.  Controllability Metrics, Limitations and Algorithms for Complex Networks , 2013, IEEE Transactions on Control of Network Systems.

[15]  S. Liberty,et al.  Linear Systems , 2010, Scientific Parallel Computing.

[16]  Radha Poovendran,et al.  On leader selection for performance and controllability in multi-agent systems , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[17]  Daniel E. Quevedo,et al.  Maximum Hands-Off Control: A Paradigm of Control Effort Minimization , 2014, IEEE Transactions on Automatic Control.

[18]  John Lygeros,et al.  On Submodularity and Controllability in Complex Dynamical Networks , 2014, IEEE Transactions on Control of Network Systems.

[19]  Daniel E. Quevedo,et al.  Sparse Packetized Predictive Control for Networked Control Over Erasure Channels , 2013, IEEE Transactions on Automatic Control.

[20]  R. Kálmán.  Mathematical description of linear dynamical systems , 1963 .

[21]  Harold R. Parks,et al.  A Primer of Real Analytic Functions , 1992 .

[22]  Stephen P. Boyd,et al.  Plenary talk: Performance bounds and suboptimal policies for multi-period investment , 2013, 22nd Mediterranean Conference on Control and Automation.

[23]  Georg Stadler,et al.  Elliptic optimal control problems with L1-control cost and applications for the placement of control devices , 2009, Comput. Optim. Appl..