MétaCan
Menu
Back to cohort
Record W2763651857 · doi:10.1109/ccta.2017.8062647

Norm- and linear-inequality-constrained state estimation: An LMI approach

2017· article· en· W2763651857 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

Venue2017 IEEE Conference on Control Technology and Applications (CCTA) · 2017
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsMcGill University
Fundersnot available
KeywordsLinear matrix inequalityNorm (philosophy)Control theory (sociology)Convex optimizationMathematicsObserver (physics)Regular polygonFilter (signal processing)State (computer science)Mathematical optimizationInequalityComputer scienceAlgorithmControl (management)Artificial intelligence

Abstract

fetched live from OpenAlex

This paper proposes a method for state estimation that incorporates norm- and linear-inequality constraints using Linear Matrix Inequalities (LMIs). This is accomplished by adopting a prediction-correction filter form and calculating the observer gain matrix by solving a convex optimization problem with LMI constraints where the state constraints are expressed as LMIs. The state constraints considered in this study include norm and linear inequalities. Simulation results are included to assess the performance of the proposed filter in a scenario involving a mobile robot moving within a constrained area taking range and bearing measurements of known landmarks. The filter's performance is compared with a traditional EKF.

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 categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.933
Threshold uncertainty score1.000

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.0010.001
Scholarly communication0.0000.001
Open science0.0010.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.037
GPT teacher head0.302
Teacher spread0.264 · 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