ROBUST CONTROL OF INTERVAL PLANTS USING GENETIC ALGORITHMS
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
Design of a robust controller which stabilizes an interval plant from the signal energy point of view via genetic algorithms (GAs) is proposed in this paper. When a controller is placed in series with the interval plant and closed under unity feedback, it is understood that the closed-loop system can also be characterized as an interval family via overbounding. Because stable systems always possess finite impulse response energy, we can obtain the continuous signal energy for each of the four closed-loop vertex systems associated with the four Kharitonov polynomials. With symbolic manipulation of the coefficients of the transfer function of the vertex systems, the parameter identification problem of a robust controller can be transformed into a multi-objective optimization problem. A proposed GA incorporating a fitness assignment mechanism is then used to search for a set of optimal parameters for the controller which stabilizes the interval plant by minimizing the aggregated continuous signal energy of the four vertex systems. The constraints on higher-order plants and controller order commonly encountered by conventional design methods are therefore removed. Several examples are illustrated to demonstrate the effectiveness of the proposed approach.
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.001 | 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