Construction of Robust NCR for Input-Constrained Discrete Nonlinear Systems Using Backward Reachability
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In this paper, we address the problem of constructing an under-approximation of the null-controllable region for input constrained discrete nonlinear systems with additive disturbances. The robust null-controllable region (RNCR) refers to the set of states for which robust stabilization is achievable subject to input constraints. In this paper, we propose a computationally tractable algorithm for computation of the robust null-controllable region which involves computation of backward reachable sets, i.e the set of states that can be driven to an given set of states in finite time, subject to disturbances and input constraints. The key ingredient in our RNCR region construction is the efficient computation of backward reachable sets without steps like sequential linearization, guessing of linearization error, etc which are essential part of state of the art backward reachability algorithms. Finally, we demonstrate the efficacy of our algorithm through numerical examples.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it