MétaCan
Menu
Back to cohort
Record W1969114689 · doi:10.2514/1.52178

Gain Scheduling with Guardian Maps for Longitudinal Flight Control

2011· article· en· W1969114689 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Guidance Control and Dynamics · 2011
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsÉcole de Technologie SupérieurePolytechnique Montréal
Fundersnot available
KeywordsGain schedulingControl theory (sociology)Computer scienceScheduling (production processes)Controller (irrigation)A priori and a posterioriControl engineeringControl (management)EngineeringMathematicsMathematical optimizationArtificial intelligence

Abstract

fetched live from OpenAlex

A new approach to gain scheduling of linear controllers is proposed and applied to a longitudinal flight control pro-blem. Traditionally, gain scheduling is done a posteriori by the interpolation of controller gains designed for several operating points or conditions. The method proposed here is based on guardian maps and does not require as many linear controller syntheses as there are design points. Rather, it extends the performance of an initial single controller carried out on an arbitrary operating point to the entire domain while ensuring generalized stability all along the process. The method, which uses a given fixed architecture controller, is successfully applied on the longitudinal flight control of a business jet aircraft.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.923
Threshold uncertainty score0.697

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.011
GPT teacher head0.198
Teacher spread0.187 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it