arXivDaily arXiv每日学术速递 周一至周五更新
看起来今天可以划水了
arXiv 2009.09778eess.SYcs.SYmath.OC
收藏

性能保证的LPV模型的参数依赖鲁棒不变集计算

Computation of Parameter Dependent Robust Invariant Sets for LPV Models with Guaranteed Performance

Ankit Gupta, Manas Mejari, Paolo Falcone, Dario Piga

摘要:

针对线性变参数(LPV)系统,提出了一种计算鲁棒控制不变量(RCI)集的迭代算法和一种不变量诱导控制律。由于调度参数的实时测量通常是可用的,在所提出的公式中,我们允许RCI集描述以及不变性诱导控制器是调度参数相关的。所考虑的配方,从而导致参数依赖的条件下的集合不变性,这是取代充分的线性矩阵不等式(LMI)条件,通过波利亚的放松。这些LMI条件,然后结合一种新的体积最大化的方法在半定规划(SDP)的问题,其目的是在计算所需的大RCI集。除了确保不变性之外,还可以通过将所选择的二次性能水平作为SDP问题中的附加约束来保证RCI集合内的性能。数值算例表明,在不利用调度参数信息的情况下,该迭代算法可以生成大于最大RCI集的不变集.

英文摘要:

This paper presents an iterative algorithm to compute a Robust Control Invariant (RCI) set, along with an invariance-inducing control law, for Linear Parameter-Varying (LPV) systems. As the real-time measurements of the scheduling parameters are typically available, in the presented formulation, we allow the RCI set description along with the invariance-inducing controller to be scheduling parameter dependent. The considered formulation thus leads to parameter-dependent conditions for the set invariance, which are replaced by sufficient Linear Matrix Inequality (LMI) conditions via Polya's relaxation. These LMI conditions are then combined with a novel volume maximization approach in a Semidefinite Programming (SDP) problem, which aims at computing the desirably large RCI set. In addition to ensuring invariance, it is also possible to guarantee performance within the RCI set by imposing a chosen quadratic performance level as an additional constraint in the SDP problem. The reported numerical example shows that the presented iterative algorithm can generate invariant sets which are larger than the maximal RCI sets computed without exploiting scheduling parameter information.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑