Fault detection and estimation for a class of PIDE systems based on boundary observers
Bibliographic record
Abstract
Summary In this paper, we propose a simultaneous state estimation and fault estimation approach for a class of first‐order hyperbolic partial integral differential equation systems. Specifically, we consider the multiplicative boundary actuator and sensor faults, ie, unknown fault parameters multiplying by the boundary input or boundary state (ie, output). As a consequence, two difficulties arise immediately: (1) simultaneous estimation of both plant state and faults is a nonlinear problem due to the multiplication between fault parameters and plant signals; (2) no prior information is available to determine the type (actuator or sensor) of faults. To overcome these difficulties, this paper develops adaptive fault parameter update laws and embeds the resulting laws into the plant state observer design. First, we propose new approaches to estimate actuator fault and sensor fault, respectively. Next, we develop a novel method to simultaneously estimate actuator and sensor faults. The proposed observer and update laws, designed using only one boundary measurement, ensure both state estimation and fault parameter estimation. By choosing appropriate Lyapunov functions, we prove that the estimates of state and fault parameters converge to an arbitrarily small neighborhood of their true values. Numerical simulations are used to demonstrate the effectiveness of the proposed estimation approaches.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| 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".