首页> 外文会议>International Workshop on Symbolic and Numerical Methods, Modeling and Applications to Circuit Design >GGP approach to solve non convex min-max robust model predictive controller for a class of constrained MIMO systems
【24h】

GGP approach to solve non convex min-max robust model predictive controller for a class of constrained MIMO systems

机译:用于解决一类约束MIMO系统的非凸即最大稳健模型预测控制器的GGP方法

获取原文

摘要

This paper proposes a new mathematical method to solve min-max predictive controller for a class of constrained linear Multi Input Multi Output (MIMO) systems. A parametric uncertainty state space model is adopted to describe the dynamic behavior of the real process. Since the resulting optimization problem is non convex, a deterministic global optimization technique is adopted to solve it which is the Generalized Geometric Programming (GGP). The key idea of this method is to transform the initial non convex optimization problem to a convex one by means of variable transformations. The main achievement is that the optimal control value found with the GGP shows successful set point tracking and constraints satisfaction. Moreover, an efficient implementation of this approach will lead to an algorithm with a low computational burden. The main features of the new algorithm are illustrated through a MIMO system.
机译:本文提出了一种解决了用于解决一类约束线性多输入多输出(MIMO)系统的MIN-MAX预测控制器的新数学方法。采用参数化不确定性状态空间模型来描述实际过程的动态行为。由于所得到的优化问题是非凸起,因此采用了确定性的全局优化技术来解决它是广义几何编程(GGP)。该方法的关键概念是通过可变变换将初始非凸优化问题转换为凸起一个。主要成就是,用GGP找到的最佳控制值显示成功的设定点跟踪和约束满足。此外,这种方法的有效实现将导致计算负担低的算法。新算法的主要特征通过MIMO系统说明。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号