Cost-equivalencing discretization of a class of bang-bang guidance laws
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
Bang-bang guidance laws are encountered in several situations like in the saddle-point solution of some continuous-time pursuit-evasion games, and in the solution of time-optimal control problems. For the purpose of digital implementation, these continuous-time bang-bang control laws must be converted into digital control laws. The paper presents a novel technique for optimal digital implementation of a class of bang-bang control laws in linear systems. This technique delivers a discretization of the continuous-time laws and is shown: 1) to achieve the same cost as the optimal sample and hold (SH) approximation of the continuous-time laws, and 2) to be implementable (the optimal SH approximation is not). The cost-equivalencing technique is applied to the digital implementation of the continuous-time DGL/0, DGL/1, and DGL/C game theoretic guidance laws.
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