MétaCan
Menu
Back to cohort
Record W1492911430 · doi:10.1002/acs.2401

Active fault tolerant control systems by the semi‐Markov model approach

2013· article· en· W1492911430 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueInternational Journal of Adaptive Control and Signal Processing · 2013
Typearticle
Languageen
FieldEngineering
TopicFault Detection and Control Systems
Canadian institutionsUniversity of Victoria
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsControl theory (sociology)Controller (irrigation)Markov chainMarkov processFault toleranceActuatorProcess (computing)Fault (geology)Control engineeringConvex optimizationStability (learning theory)Computer scienceMarkov modelMarkov decision processEngineeringFault detection and isolationRegular polygonControl (management)Distributed computingMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

SUMMARY This paper investigates the active fault tolerant control problem via the H ∞ state feedback controller. Because of the limitations of Markov processes, we apply semi‐Markov process in the system modeling. Two random processes are involved in the system: the failure process and the fault detection process. Therefore, two corresponding semi‐Markov processes are integrated in the closed‐loop system model. This framework can generally accommodate different types of system faults, including the randomly happening sensor faults and actuator faults. A controller is designed to guarantee the closed‐loop system stability with a prescribed noise/disturbance attenuation level. The controller can be readily solved by using convex optimization techniques. A vertical take‐off and landing vehicle example with actuation faults is used to demonstrate the effectiveness of the proposed technique. Copyright © 2013 John Wiley & Sons, Ltd.

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 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.964
Threshold uncertainty score0.590

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.008
GPT teacher head0.208
Teacher spread0.200 · 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