A Receding Horizon Sliding Controller for Automotive Engine Coldstart: Design and Hardware‐in‐the‐Loop Testing With an Echo State Network High‐Fidelity Model
Bibliographic record
Abstract
Abstract The aim of the current study is to probe the potential of receding horizon sliding control (RHSC) technique for reducing the coldstart hydrocarbon (HC) emissions of automotive spark‐ignited (SI) engines. The RHSC approach incorporates the potentials of sliding control (SC) and nonlinear model predictive control (NMPC) to employ the future information of the considered engine to keep the system's trajectories close to a stable manifold. To calculate the control commands, the authors adopt an efficient optimization technique, known as the multivariate quadratic fit sectioning algorithm (MQFSA), and also, define three different objective functions, based on l1, l2, and l∞ norms. To demonstrate the efficacy of RHSC controller, its performance is compared with two other well‐known controllers extracted from the literature, namely NMPC and Pontryagin's minimum principle (PMP)‐based controllers. Through numerical simulations for three distinctive operating conditions, it is demonstrated that the RHSC controller is very effective for reducing the total tailpipe HC emissions over the coldstart period of the considered engine system. Moreover, by conducting a hardware‐in‐the‐loop (HIL) test using an echo state network high‐fidelity model, it is indicated that the computational speed of calculating control commands is fast enough to enable RHSC to be used for real‐time implementations in practice.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".