Review and Performance Analysis of Nonlinear Model Predictive Control—Current Prospects, Challenges and Future Directions
Bibliographic record
Abstract
Nonlinear model predictive control (NMPC) has been recognized as an influential control strategy for intricate dynamical systems due to its superior performance over conventional linear control systems.The complexity associated with nonlinear dynamics is a recurring issue in a multitude of engineering applications, rendering the development of nonlinear models a challenging endeavor.The construction of such models, either through correlating input and output data or applying fundamental energy conservation laws, presents considerable difficulties.The absence of an effective model suitable for fundamental nonlinear processes is a marked deficiency, one that NMPCs are poised to address.NMPCs demonstrate a pronounced advantage over linear MPCs, particularly in managing the complexities and nonlinearities inherent in various systems.They exhibit efficacy in controlling nonlinear dynamics, including input/output constraints, objective functions, and computationally demanding optimization problems integral to real-time applications in process industries, power systems, and autonomous vehicular systems.This capability has prompted extensive research into nonlinear dynamics, thereby diminishing the disparity between the analysis of linear and nonlinear MPCs.This review provides a thorough examination of NMPCs, encompassing the fundamental principle, mathematical formulation, and various algorithms associated with NMPCs.A concise overview of NMPC applications, along with the challenges they pose, is also discussed.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".