An Adjustable Parameter-Based Robust Distributed Fault Diagnosis for One-Sided Lipschitz Formation of Clustered Multi-Agent Systems
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.
Bibliographic record
Abstract
This paper addresses the challenge of distributed fault diagnosis in the context of the one-sided Lipschitz formation of agents. Each agent integrates an observer to detect and estimate both linear and non-linear faults in its attitude control subsystem. A robust design configuration is also developed to account for external perturbations. The robust observer utilized in this study is an unknown input observer (UIO), designed to mitigate the impact of disturbances on fault and state estimation errors. The observer’s parameters are determined using linear matrix inequalities (LMIs). Furthermore, a UIO incorporating an adjustable parameter (AP) is introduced to enhance fault diagnosis accuracy. Simulation results for two satellite clusters, consisting of five satellites with varying dynamics due to external disturbances, are presented to validate the approach. Instead of equipping every agent with an observer, specific agents can be equipped with observers to detect faults throughout the constellation, thereby reducing computational demands in configurations with numerous agents. Finally, a comparison is made between the proposed AP-based UIO and a standard UIO. The comparison findings reveal a noteworthy average of a substantial 56.61% reduction in root mean square error (RMSE) employing AP-based UIO compared to the utilization of standard robust UIO.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it