Sparsity Promotion in State Feedback Controller Design

被引:35
作者
Babazadeh, Maryam [1 ]
Nobakhti, Amin [1 ]
机构
[1] Sharif Univ Technol, Dept Elect Engn, Tehran, Iran
关键词
Control structure selection; H-2 performance index; l(1) norm; semi-definite programming; sparse optimal control; DISTRIBUTED CONTROL; SYSTEMS; DECOMPOSITION; RECOVERY;
D O I
10.1109/TAC.2016.2626371
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A globally convergent algorithm for synthesis of sparse optimal state feedback (SOSF) control of linear time-invariant (LTI) systems is proposed. This problem is known to be NP-hard due to its combinatorial nature. A structured H-2 norm controller design problem is intrinsically non-convex, even if a fixed structure is known in advance. The proposed algorithm minimizes the H-2 norm performance index, and simultaneously regularizes the sparsity of the control structure using the l(1) norm. It guarantees that the solution converges to a stationary point of the original problem. The algorithm is implemented using Linear Matrix Inequalities (LMIs) which are efficient, reliable and extendable to other control problems. The performance of the proposed algorithm is illustrated with application to several examples. The results are also compared with Alternating Direction Method of Multiplier (ADMM) for sparse LQR design (as a special case of the H-2 norm problem). In most instances, the appropriate selection of the control structure leads to a near optimal performance index with a substantially reduced number of communication links.
引用
收藏
页码:4066 / 4072
页数:7
相关论文
共 28 条
[1]  
[Anonymous], 1994, LINEAR MATRIX INEQUA
[2]  
[Anonymous], OPTIM ENG
[3]  
[Anonymous], 1999, NUMERICAL OPTIMIZATI
[4]  
[Anonymous], 2012, PROC IEEE 7 INT C IN
[5]  
[Anonymous], 1971, Linear Optimal Control by Brian DO Anderson
[6]   Synthesis of Sparse Dynamic Structures via Semidefinite Programming [J].
Babazadeh, Maryam ;
Nobakhti, Amin .
IEEE TRANSACTIONS ON CONTROL SYSTEMS TECHNOLOGY, 2016, 24 (03) :1028-1035
[7]   Distributed optimization and statistical learning via the alternating direction method of multipliers [J].
Boyd S. ;
Parikh N. ;
Chu E. ;
Peleato B. ;
Eckstein J. .
Foundations and Trends in Machine Learning, 2010, 3 (01) :1-122
[8]  
Boyd S, 2004, CONVEX OPTIMIZATION
[9]   Exploratory basis pursuit classification [J].
Brown, M ;
Costen, NP .
PATTERN RECOGNITION LETTERS, 2005, 26 (12) :1907-1915
[10]   Enhancing Sparsity by Reweighted l1 Minimization [J].
Candes, Emmanuel J. ;
Wakin, Michael B. ;
Boyd, Stephen P. .
JOURNAL OF FOURIER ANALYSIS AND APPLICATIONS, 2008, 14 (5-6) :877-905