A distributed and cooperative supervisory estimation of multi-agent systems - Part I: Framework
Bibliographic record
Abstract
In this work, we propose a framework for supervisory cooperative estimation of multi-agent linear time-invariant (LTI) systems. We introduce a group of sub-observers, each estimating certain states that are conditioned on given input, output, and state information. The cooperation among the sub-observers is supervised by a discrete-event system (DES) supervisor. The supervisor makes decisions on selecting and configuring a set of sub-observers to successfully estimate all states of the system. Moreover, when certain anomalies are present, the supervisor reconfigures the set of selected sub-observers so that the impact of anomalies on the estimation performance is minimized. This framework is applicable to any multi-agent system including large-scale industrial processes. In this paper (Part I), our proposed framework for supervisory estimation is developed based on the notion of sub-observers and DES supervisory control. In the companion paper (Part II), a DES-based combinatorial optimization method for selection of an optimal set of sub-observers is presented, the feasibility of the overall integrated sub-observers is validated, and the application of our proposed method in a practical industrial process is demonstrated through numerical simulations.
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.002 | 0.002 |
| 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".