MétaCan
Menu
Back to cohort
Record W2987167661 · doi:10.1109/jas.2019.1911765

Finite-time adaptive fault-tolerant control for nonlinear systems with multiple faults

2019· article· en· W2987167661 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

VenueIEEE/CAA Journal of Automatica Sinica · 2019
Typearticle
Languageen
FieldEngineering
TopicAdaptive Control of Nonlinear Systems
Canadian institutionsCarleton University
Fundersnot available
KeywordsBacksteppingControl theory (sociology)Nonlinear systemFault toleranceActuatorController (irrigation)Tracking errorFault (geology)Computer scienceAdaptive controlArtificial neural networkScheme (mathematics)Control (management)Control engineeringEngineeringMathematicsDistributed computingArtificial intelligence

Abstract

fetched live from OpenAlex

This paper focuses on the problem of adaptive finitetime fault-tolerant control for a class of non-lower-triangular nonlinear systems. The faults encountered in the control system include the actuator faults and the abrupt system fault. By applying backstepping design and neural networks approximation, an adaptive finite-time fault-tolerant control scheme is developed. It is shown that the proposed controller ensures that all signals in the closed-loop system are semi-globally practically finite-time stable and the tracking error converges to a small neighborhood around the origin within finite time. The simulation is carried out to explain the validity of the developed strategy.

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 categoriesMeta-epidemiology (narrow)
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.521
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0020.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.001
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.010
GPT teacher head0.219
Teacher spread0.209 · 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