.png){kind=icon}
返回
Improving scenario decomposition algorithms for robust nonlinear model predictive control
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2015.04.024.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with the efficient computation of solutions of robust nonlinear model predictive control problems that are formulated using multi-stage stochastic programming via the generation of a scenario tree. Such a formulation makes it possible to consider explicitly the concept of recourse, which is inherent to any receding horizon approach, but it results in large-scale optimization problems. One possibility to solve these problems in an efficient manner is to decompose the large-scale optimization problem into several subproblems that are iteratively modified and repeatedly solved until a solution to the original problem is achieved. In this paper we review the most common methods used for such decomposition and apply them to solve robust nonlinear model predictive control problems in a distributed fashion. We also propose a novel method to reduce the number of iterations of the coordination algorithm needed for the decomposition methods to converge. The performance of the different approaches is evaluated in extensive simulation studies of two nonlinear case studies. (C) 2015 Elsevier Ltd. All rights reserved.
Keyword:
Economic model predictive control
Uncertainty
Robust control
Distributed computing
Optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
Robust model predictive control of constrained linear systems with bounded disturbances有界扰动约束线性系统的鲁棒模型预测控制.png)
AUTOMATICA
OAAI
AUTOMATICAIF5.9
OAAI分享收藏Economic Nonlinear Model Predictive Control for periodic optimal operation of gas pipeline networks
PREAI
分享收藏
查看更多内容