Model Predictive Control of Internal Combustion Engines: A Review and Future Directions
Bibliographic record
Abstract
An internal combustion engine (ICE) is a highly nonlinear dynamic and complex engineering system whose operation is constrained by operational limits, including emissions, noise, peak in-cylinder pressure, combustion stability, and actuator constraints. To optimize today’s ICEs, seven to ten control actuators and 10–20 feedback sensors are often used, depending on the engine applications and target emission regulations. This requires extensive engine experimentation to calibrate the engine control module (ECM), which is both cumbersome and costly. Despite these efforts, optimal operation, particularly during engine transients and to meet real driving emission (RDE) targets for broad engine speed and load conditions, has still not been obtained. Methods of model predictive control (MPC) have shown promising results for real-time multi-objective optimal control of constrained multi-variable nonlinear systems, including ICEs. This paper reviews the application of MPC for ICEs and analyzes the recent developments in MPC that can be utilized in ECMs. ICE control and calibration can be enhanced by taking advantage of the recent developments in the field of Artificial Intelligence (AI) in applying Machine Learning (ML) to large-scale engine data. Recent developments in the field of ML-MPC are investigated, and promising methods for ICE control applications are identified in this paper.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".