On feasible sets for MPC and their approximations
On feasible sets for MPC and their approximations
复制标题
关于 MPC 的可行集及其近似
DOI：
10.1016/j.automatica.2010.10.022
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
M. Hovd
中科院分区：
文献类型：
--
作者：
F. Scibilia;Sorin Olaru;M. Hovd
在本文中，我们感兴趣的线性模型预测控制技术的可行集的计算，基于集合关系，而不是传统的正交投影。此外，计算合适的内部近似的可行集的问题被认为是。这样的近似的特点是由更简单的多面体表示，并保持基本属性，如凸性，正不变性，包括一组预期的初始状态。
In this paper we are interested in the computation of feasible sets for linear model predictive control techniques, based on set relations and not on the conventional orthogonal projection. Further, the problem of computing suitable inner approximations of the feasible sets is considered. Such approximations are characterized by simpler polytopic representations, and preserve essential properties as convexity, positive invariance, inclusion of the set of expected initial states.