MétaCan
Menu
Back to cohort
Record W1967806130 · doi:10.1109/acc.2014.6858838

Observer design for linear multi-rate sampled-data systems

2014· article· en· W1967806130 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

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsObserver (physics)Control theory (sociology)Convex optimizationConvergence (economics)Exponential stabilityAsynchronous communicationComputer scienceLinear systemStability (learning theory)Regular polygonRate of convergenceMathematicsSet (abstract data type)Linear matrix inequalityMathematical optimizationNonlinear system

Abstract

fetched live from OpenAlex

This paper addresses observer design for linear systems with multi-rate sampled output measurements. The sensors are assumed to be asynchronous and to have uncertain nonuniform sampling intervals. The contributions of this paper are twofold. Given the maximum allowable sampling period (MASP) for each sensor, the main contribution of the paper is to propose sufficient Krasovskii-based conditions for design of linear observers. The designed observers guarantee exponential convergence of the estimation error to the origin. Most importantly, the sufficient conditions are cast as a set of linear matrix inequalities (LMIs) that can be solved efficiently. As a second contribution, given an observer gain, the problem of finding MASPs that guarantee exponential stability of the estimation error is also formulated as a convex optimization program in terms of LMIs. The theorems are applied to a unicycle path following example.

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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.967
Threshold uncertainty score0.544

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.148
GPT teacher head0.276
Teacher spread0.128 · 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