A robust semi‐decentralized fault detection strategy for multi‐agent systems
Bibliographic record
Abstract
Purpose The aim of this paper is to address the problem of fault detection (FD) of linear continuous‐time multi‐agent systems. Design/methodology/approach A mixedH∞/H−formulation of the FD problem using semi‐decentralized filters is presented. Findings It is shown that through a decomposition approach the drawbacks of the existing distributed FD design methods in multi‐agent systems can be effectively tackled. An extended linear matrix inequality (LMI) characterization is used to reduce the conservativeness of the design solution by introducing additional matrices in order to eliminate the couplings of the Lyapunov matrices with the agent's matrices. Research limitations/implications It is shown that by applying the proposed decomposition approach the FD problem of multi‐agent systems can be solved by analyzing the problem of a set of decoupled systems whose order and complexity are equal to that of a single agent. This procedure will be useful for both simplifying the computational cost of the solution as well as for developing a fault detection filter having a semi‐decentralized architecture. Practical implications Application of this methodology to a network of micro‐air vehicles (MAVs) illustrates the effectiveness and capabilities of the proposed design methodology. Social implications The feasibility of the use of reliable and self‐healing network of unmanned systems, cooperative networks, and multi‐agent systems will be significantly enhanced and improved by the development of advanced fault detection and isolation (FDI) technologies. Originality/value A semi‐decentralized fault detection (FD) methodology is developed for linear multi‐agent networked systems to reduce the order and complexity of the observers at each agent. A mixedH∞/H−formulation of the FD problem by using semi‐decentralized filters is presented. Using this approach each agent can not only detect itsownfaults but also is able to detect itsnearest neighboragents’ faults.
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.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.002 | 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".