Fault detection and isolation based on novel unknown input observer design
Bibliographic record
Abstract
With an emphasis on fault isolation and by treating fault detection as a byproduct of fault isolation, both actuator and sensor fault detection and isolation (FDI) problems for a class of uncertain Lipschitz nonlinear systems are studied using an unknown input observer (UIO) design technique. To solve the actuator fault detection and isolation problem, we develop a particular system structure by regrouping the system inputs, which is suitable for UIO design. By filtering the regrouped outputs properly, the same system structure can be developed for sensor fault detection and isolation problem, which allows us to treat the sensor fault detection and isolation problem as an actuator fault detection and isolation problem. To accomplish FDI efficiently, a novel full order nonlinear UIO is designed with a special property suitable for fault isolation purposes and a necessary and sufficient condition for its existence are presented. The LMI based sufficient condition enables the designers to use Matlab LMI toolbox and makes the computationally difficult UIO design much easier. For UIO based FDI, the following three problems are investigated: 1) under what conditions is it possible to isolate single and/or multiple faults? 2) What is the maximum number of faults that can be isolated simultaneously? 3) How to design fault isolation schemes to achieve multiple fault isolation (that is, to make decisions on how many faults have occurred and the location of each fault)? Conditions for problem 1) are derived and the maximum number of faults that can be isolated is determined for problem 2) to solve problem 3) an FDI scheme is designed using a bank of nonlinear UIOs and its design procedure is presented in a step by step fashion. An example is given to show how to use the proposed FDI scheme and simulations results illustrate that the proposed technique works well for FDI in uncertain Lipschitz nonlinear systems.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".