.png){kind=icon}
返回
Minimum-Gain Pole Placement With Sparse Static Feedback
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2020.3018615.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The minimum-gain eigenvalue assignment/pole placement problem (MGEAP) is a classical problem in linear time-invariant systems with static state feedback. In this article, we study the MGEAP when the state feedback has arbitrary sparsity constraints. We formulate the sparse MGEAP problem as an equality-constrained optimization problem and present an analytical characterization of its locally optimal solution in terms of eigenvector matrices of the closed-loop system. This result is used to provide a geometric interpretation of the solution of the nonsparse MGEAP, thereby providing additional insights for this classical problem. Furthermore, we develop an iterative projected gradient descent algorithm to obtain local solutions for the sparse MGEAP using a parameterization based on the Sylvester equation. We present a heuristic algorithm to compute the projections, which also provides a novel method to solve the sparse eigenvalue/pole assignment problem. Also, a relaxed version of the sparse MGEAP is presented and an algorithm is developed to obtain approximately sparse local solutions to the MGEAP. Finally, numerical studies are presented to compare the properties of the algorithms, which suggest that the proposed projection algorithm converges in most cases.
Keyword:
Sparse matrices
Eigenvalues and eigenfunctions
Approximation algorithms
Optimization
Linear systems
Heuristic algorithms
State feedback
Eigenvalue assignment
minimum-gain pole placement
optimization
sparse feedback
sparse linear systems
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale SystemsOAAI
OAAI分享收藏
查看更多内容