.png){kind=icon}
返回
Semi-explicit MPC based on subspace clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.automatica.2017.06.036.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a new strategy of simplifying the online computations in linear model predictive control (MPC). Employing a specific type of state dependent parameterization for the optimization variable in MPC, advantages of explicit MPC are combined with those of online optimization based MPC into an efficient MPC scheme. The parameterization is computed offline applying a tailored subspace clustering algorithm to training data consisting of states and corresponding solutions to the MPC optimization problem. It is then refined to guarantee feasibility of the parameterized optimization. During the offline design phase, complexity of the parameterization can be adjusted and control performance can be traded off against online computational effort and storage requirements. Numerical examples evaluate the presented methods and illustrate their benefits. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
MODEL-PREDICTIVE CONTROL
MOVE BLOCKING STRATEGIES
ALGORITHM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
分享收藏A Multiresolution Approximation Method for Fast Explicit Model Predictive Control用于快速显式模型预测控制的多分辨率逼近方法
OAAI
OAAI分享收藏Efficient suboptimal parametric solutions to predictive control for PLC applications用于PLC应用的预测控制的有效次优参数解决方案
OAAI
OAAI分享收藏分享收藏Real-Time Suboptimal Model Predictive Control Using a Combination of Explicit MPC and Online Optimization结合显式MPC和在线优化的实时次优模型预测控制OAAI
OAAI分享收藏
查看更多内容