.png){kind=icon}
返回
Fast Model Predictive Control Using Online Optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TCST.2009.2017934.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Model predictive control (MPC)
real-time convex optimization
期刊
IF:
3.9
论文数:
4.9K
被引数:
1.7W
机构
引用论文
分享收藏Fast, large-scale model predictive control by partial enumeration通过部分枚举实现快速大规模模型预测控制.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏Suboptimal control of constrained nonlinear systems via receding horizon constrained control Lyapunov functions基于滚动时域约束控制Lyapunov函数的约束非线性系统次优控制
PREAI
分享收藏分享收藏分享收藏
查看更多内容