MétaCan
Menu
Back to cohort
Record W1994597642 · doi:10.1115/1.4006628

A New Robust Filtering Strategy for Linear Systems

2012· article· en· W1994597642 on OpenAlexaff
S. Andrew Gadsden, Saeid Habibi

Bibliographic record

VenueJournal of Dynamic Systems Measurement and Control · 2012
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMcMaster University
Fundersnot available
KeywordsSmoothingKalman filterControl theory (sociology)Robustness (evolution)CovarianceParametric statisticsMathematicsLinear systemGaussianComputer scienceMathematical optimizationAlgorithmApplied mathematicsStatisticsMathematical analysis

Abstract

fetched live from OpenAlex

Abstract For linear and well-defined estimation problems with Gaussian white noise, the Kalman filter (KF) yields the best result in terms of estimation accuracy. However, the KF performance degrades and can fail in cases involving large uncertainties such as modeling errors in the estimation process. The smooth variable structure filter (SVSF) is a relatively new estimation strategy based on sliding mode theory and has been shown to be robust to modeling uncertainties. The SVSF makes use of an existence subspace and of a smoothing boundary layer to keep the estimates bounded within a region of the true state trajectory. Currently, the width of the smoothing boundary layer is chosen based on designer knowledge of the upper bound of modeling uncertainties, such as maximum noise levels and parametric errors. This is a conservative choice, as a more well-defined smoothing boundary layer will yield more accurate results. In this paper, the state error covariance matrix of the SVSF is used for the derivation of an optimal time-varying smoothing boundary layer. The robustness and accuracy of the new form of the SVSF was validated and compared with the KF and the standard SVSF by testing it on a linear electrohydrostatic actuator (EHA).

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.001

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.053
GPT teacher head0.251
Teacher spread0.199 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations76
Published2012
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Dynamic Systems Measurement and ControlSame topicTarget Tracking and Data Fusion in Sensor NetworksFrench-language works237,207