MétaCan
Menu
Back to cohort
Record W2045880387 · doi:10.1002/rnc.1390

Kalman filter‐based adaptive control for networked systems with unknown parameters and randomly missing outputs

2008· article· en· W2045880387 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueInternational Journal of Robust and Nonlinear Control · 2008
Typearticle
Languageen
FieldEngineering
TopicStability and Control of Uncertain Systems
Canadian institutionsUniversity of Saskatchewan
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsKalman filterEstimatorControl theory (sociology)Autoregressive modelComputer scienceBernoulli's principleConvergence (economics)Filter (signal processing)Process (computing)Control (management)MathematicsEngineeringArtificial intelligenceStatistics

Abstract

fetched live from OpenAlex

Abstract This paper investigates the problem of adaptive control for networked control systems with unknown model parameters and randomly missing outputs. In particular, for a system with the autoregressive model with exogenous input placed in a network environment, the randomly missing output feature is modeled as a Bernoulli process. Then, an output estimator is designed to online estimate the missing output measurements, and further a Kalman filter‐based method is proposed for parameter estimation. Based on the estimated output and the available output, and the estimated model parameters, an adaptive control is designed to make the output track the desired signal. Convergence properties of the proposed algorithms are analyzed in detail. Simulation examples illustrate the effectiveness of the proposed method. Copyright © 2008 John Wiley & Sons, Ltd.

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.835
Threshold uncertainty score0.649

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.021
GPT teacher head0.216
Teacher spread0.194 · 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