MétaCan
Menu
Back to cohort

Continuous Action Learning Automata: A Strategy for Dynamic Optimization of Invariant Kalman Filter Covariances

2024· article· en· W4402474374 on OpenAlexafffund
Paulo Ricardo Marques de Araujo, Aboelmagd Noureldin, Sidney Givigi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsQueen's University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsKalman filterLearning automataAutomatonComputer scienceInvariant (physics)Control theory (sociology)Extended Kalman filterMathematical optimizationArtificial intelligenceMathematicsControl (management)

Abstract

fetched live from OpenAlex

Accurate state estimation in autonomous vehicle navigation heavily relies on the precise tuning of Kalman filter covariance matrices. This paper introduces a novel application of Continuous Action Learning Automata (CALA) for the dynamic optimization of the measurement covariance matrix in a Left-Invariant Extended Kalman Filter (LIEKF). The proposed method leverages CALA’s reinforcement learning capabilities to fine-tune the filter parameters in response to environmental feedback adaptively. Integrating CALA with LIEKF, especially when augmented with Global Navigation Satellite System (GNSS) corrections, enhances the filter’s robustness and reliability in urban navigation tasks. Experimental results demonstrate that the CALA-enhanced LIEKF significantly outperforms traditional static methods, achieving lower mean absolute errors and improved accuracy during GNSS outages.

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 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: Methods · Consensus signal: none
Teacher disagreement score0.783
Threshold uncertainty score0.424

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.0000.000
Scholarly communication0.0000.001
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.034
GPT teacher head0.300
Teacher spread0.266 · 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 teacher head, 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

Citations0
Published2024
Admission routes2
Has abstractyes

Explore more

Same topicReinforcement Learning in RoboticsFrench-language works237,207