MétaCan
Menu
Back to cohort

Passivity-Based Gain-Scheduled Control with Scheduling Matrices

2024· article· en· W4402437041 on OpenAlex
Sepehr Moalemi, James Richard Forbes

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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Memory and Neural Computing
Canadian institutionsMcGill University
Fundersnot available
KeywordsComputer sciencePassivityScheduling (production processes)Gain schedulingAutomatic gain controlControl (management)Distributed computingControl theory (sociology)Computer networkMathematical optimizationMathematicsArtificial intelligenceEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

This paper considers gain-scheduling of very strictly passive (VSP) subcontrollers using scheduling matrices. The use of scheduling matrices, over scalar scheduling signals, realizes greater design freedom, which in turn can improve closed-loop performance. The form and properties of the scheduling matrices such that the overall gain-scheduled controller is VSP are explicitly discussed. The proposed gain-scheduled VSP controller is used to control a rigid two-link robot subject to model uncertainty where robust input-output stability is assured via the passivity theorem. Numerical simulation results highlight the greater design freedom, resulting in improved performance, when scheduling matrices are used over scalar scheduled signals.

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.000
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.656
Threshold uncertainty score0.434

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.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.008
GPT teacher head0.219
Teacher spread0.211 · 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

Quick stats

Citations1
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Memory and Neural ComputingFrench-language works237,207