模型预测控制
计算机科学
利用
查阅表格
二次规划
表(数据库)
控制理论(社会学)
在线模型
控制(管理)
样品(材料)
最优控制
控制器(灌溉)
数学优化
数学
人工智能
数据挖掘
统计
化学
计算机安全
色谱法
农学
生物
程序设计语言
作者
Yang Wang,Stephen Boyd
标识
DOI:10.1109/tcst.2009.2017934
摘要
A widely recognized shortcoming of model predictive control (MPC) is that it can usually only be used in applications with slow dynamics, where the sample time is measured in seconds or minutes. A well-known technique for implementing fast MPC is to compute the entire control law offline, in which case the online controller can be implemented as a lookup table. This method works well for systems with small state and input dimensions (say, no more than five), few constraints, and short time horizons. In this paper, we describe a collection of methods for improving the speed of MPC, using online optimization. These custom methods, which exploit the particular structure of the MPC problem, can compute the control action on the order of 100 times faster than a method that uses a generic optimizer. As an example, our method computes the control actions for a problem with 12 states, 3 controls, and horizon of 30 time steps (which entails solving a quadratic program with 450 variables and 1284 constraints) in around 5 ms, allowing MPC to be carried out at 200 Hz.
科研通智能强力驱动
Strongly Powered by AbleSci AI