.png){kind=icon}
Return
Feasibility issues in linear model predictive control
.png){kind=icon}
PRE
AI
DOI：10.1002/aic.690450805.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The problem of infeasibility caused by inconsistent hard stare constraints in model predictive control is considered. The difficulties that may arise am analyzed and the inherent trade-off a controller must address at times of infeasibility is shown. From a multiobjective viewpoint, it is demonstrated that the two approaches for handling infeasibility documented in the literature have significant limitations. Two new techniques for handling infeasibility that overcome the difficulties encountered with current approaches are presented.
Keywords:
DYNAMIC MATRIX CONTROL
STABILITY
CONSTRAINTS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4
Papers:
1.1W
Citations:
2.9W
Organization
No organization information available
Cited Papers
Discrete-time stability with perturbations: Application to model predictive control.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
ShareSaveShareSaveShareSaveShareSaveShareSaveShareSave no more
no more