MétaCan
Menu
Back to cohort
Record W4387185559 · doi:10.1002/rnc.6913

Reinforced unscented Kalman filter for consensus achievement of uncertain multi‐agent systems subject to actuator faults

2023· article· en· W4387185559 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

VenueInternational Journal of Robust and Nonlinear Control · 2023
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsToronto Metropolitan University
Fundersnot available
KeywordsControl theory (sociology)Kalman filterComputer scienceActuatorArtificial neural networkLyapunov functionExtended Kalman filterFault detection and isolationFault toleranceFault (geology)Lyapunov stabilityNonlinear systemArtificial intelligenceControl (management)

Abstract

fetched live from OpenAlex

Abstract In this paper, actuator fault detection and reconstruction in consensus tracking of uncertain multi‐agent systems (MAS) is addressed. The communication is assumed to be connected undirected. An adaptive fault detection method is developed to detect actuator faults. A novel‐reinforced unscented Kalman filter (RUKF) is employed to reconstruct the faults by adjusting the noise covariance matrices of unscented Kalman filter (UKF) as well as to train neural network internal parameters by providing a set of previous measurements. A Chebyshev neural network (CNN) is incorporated to learn the uncertain plant. To prevent the neural network approximation errors a hyperbolic tangent function‐based robust control term is applied. The Lyapunov stability approach guarantees the stability of the proposed RUKF, which runs in conjunction with robust control method. Lastly, numerical simulations are presented to show the effectiveness of the proposed RUKF under actuator abrupt, intermittent, and transient fault conditions.

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: Empirical · Consensus signal: none
Teacher disagreement score0.743
Threshold uncertainty score0.686

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.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.295
Teacher spread0.257 · 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