.png){kind=icon}
返回
Clipping-Based Complexity Reduction in Explicit MPC
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2011.2179428.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The idea of explicit model predictive control (MPC) is to characterize optimal control inputs as an explicit piecewise affine (PWA) function of the initial conditions. The function, however, is often too complex and either requires too much processing power to evaluate on-line, or consumes a prohibitive amount of memory. The paper focuses on the memory issue and proposes a novel method of replacing a generic continuous PWA function by a different function of significantly lower complexity in such a way that the simple function guarantees the same properties as the original. The idea is based on eliminating regions of the PWA function over which the function attains a saturated value. An extensive case study is presented which confirms that a significant reduction of complexity is achieved in general.
Keyword:
Computational complexity
piecewise linear techniques
predictive control
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Plant Location and the Advent of Slab Casting by U.S. Steel Minimills: An Observation‐Based Analysis
PREAI
分享收藏Schlieren Visualization of Shaping Air during Operation of an Electrostatic Rotary Bell Sprayer: Impact of Shaping Air on Droplet Atomization and Transport.png)
Coatings
OAAI
CoatingsIF0
OAAI分享收藏
Electrolyte Solvation Manipulation Enables Unprecedented Room‐Temperature Calcium‐Metal Batteries
PREAI
分享收藏
查看更多内容