.png){kind=icon}
返回
Maximum turn-off control for discrete-time linear systems
.png){kind=icon}
OA
AI
DOI：10.1002/rnc.6283.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We aim to address the problem of finding a control input maximizing the time instants when all control channels take a zero-value (are turned off) while stabilizing the system to zero over a given horizon length. This problem is called the maximum turn-off control problem. To solve it, we reduce the problem into a block-sparse optimization problem with respect to the control input sequence, where the l2/l0$$ {\ell}_2/{\ell}_0 $$ norm of the control input sequence is the objective function that must be minimized. Because the problem is not convex, we introduce a relaxed problem based on the l2/l1$$ {\ell}_2/{\ell}_1 $$ norm, which is a convex function, and characterize the equivalence relation between the original and relaxed problems using the so-called block restricted isometry property (block-RIP). Based on the equivalence, the solution can be obtained by solving the convex relaxed problem. However, the block-RIP is not easy to interpret and verify. Thus, we propose the notion of sparse controllability Gramians, which is an extension of the controllability Gramians, and show that the block-RIP can be interpreted by the eigenvalues of the sparse controllability Gramian. This study presents an easy-to-check condition of the block-RIP. Moreover, the above control framework is extended to a model predictive control scheme. These results are demonstrated using numerical examples.
Keyword:
block-sparse optimization
block-sparsity
convex optimization
discrete-time control
linear control
model predictive control
sparse control
期刊
IF:
3.2
论文数:
7.0K
被引数:
1.4W
机构
引用论文
分享收藏Stability and robustness of the l2/lq-minimization for block sparse recovery.png)
SIGNAL PROCESSING
SIGNAL PROCESSINGIF3.6
PREAI
分享收藏
查看更多内容