MétaCan
Menu
Back to cohort
Record W1996579463 · doi:10.1115/1.2363202

Convex Optimization Approach to Observer-Based Stabilization of Uncertain Linear Systems

2005· article· en· W1996579463 on OpenAlex
Salim Ibrir

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 Dynamic Systems Measurement and Control · 2005
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsObserver (physics)Linear matrix inequalityConvex optimizationControl theory (sociology)MathematicsLinear systemMathematical optimizationRegular polygonStability (learning theory)Controller (irrigation)Optimization problemMatrix (chemical analysis)Full state feedbackComputer scienceControl (management)Artificial intelligence

Abstract

fetched live from OpenAlex

New sufficient linear matrix inequality conditions guaranteeing the stability of uncertain linear systems by means of dynamic output feedbacks are presented. It is shown that the search of an observer-based controller for this class of systems is fundamentally decomposed into two main problems: robust stability with a memoryless state feedback and observer design with measured uncertainties. Under the fulfilment of the developed linear matrix inequalities conditions, we show that the observer-based problem is solvable without any need for some equality constraints or iterative computational algorithms. Examples showing the potential of the results are presented.

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.002
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.958
Threshold uncertainty score0.873

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.023
GPT teacher head0.211
Teacher spread0.188 · 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