A Terminal State Feasibility Governor for Real-Time Nonlinear Model Predictive Control Over Arbitrary Horizons
Bibliographic record
Abstract
This article introduces a novel feasibility governor (FG), which enlarges the region of attraction (ROA) of a nonlinear model predictive control (NMPC) setpoint regulation law with an arbitrarily short prediction horizon. The efficient online FG is developed for nonlinear systems subject to pointwise-in-time state and input constraints and relies on a discrete-time solution of a trajectory-based explicit reference governor (ERG) with Lyapunov-based terminal energy constraint. It ensures the FG-NMPC scheme’s recursive feasibility to any target and asymptotic stability to constant targets by adaptively integrating the derivative of an auxiliary reference applied to the closed-loop NMPC. Compared to recently published FG schemes, this scheme scales better to higher-dimensional nonlinear systems with a priori unknown constraints, as it does not require expensive offline computations to construct the feasible set or the maximal output admissible set (MOAS) associated with the NMPC’s terminal control law. The scheme is implemented as a C++ algorithm and validated through simulations on a quadrotor that aggressively but safely flies through a priori unknown environments cluttered with obstacles. It is shown to satisfy all constraints for any piecewise-continuous reference, achieve asymptotic stability and zero-offset tracking to constant constraint-admissible targets, and require low computational effort. Supplementary video material can be found athttps://youtu.be/2LSYNwuYpzI.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".