Cooperative Fault-Tolerant Reconfigurable Control of Heterogeneous Wireless and Networked Space Robotics and Satellite Systems
Bibliographic record
Abstract
Our main objective in this paper is to design distributed cooperative synchronization and reconfigurable control for a network of heterogeneous multi-agent nonlinear space robotics and satellite systems by taking into account constraints on control inputs and actuator saturation faults. We first develop bounded distributed cooperative synchronization (or consensus seeking) controllers under output feedback controllers for cooperative synchronization of wireless and networked multi-agent systems. Our second main objective is to design reconfigurable distributed controllers in presence of actuator saturation faults. Finally, our last objective is to present a switching-based distributed control reconfiguration strategy that is utilized in case of an actuator fault or an actuator saturation constraint to accomplish cooperative control of networked multi-agent systems. Towards the above end, we introduce two classes of distributed controllers used to maintain the overall control objectives of networked multi-agent systems in absence as well as presence of actuator faults and actuator constraints. We introduce a procedure that can be employed to switch between the two distributed constrained controllers. In presence of actuator faults and actuator saturations, a switching mechanism is introduced to provide a reconfigurable controller for the wireless and networked space robotics and satellite multi-agent systems to ensure and maintain the overall mission objectives and requirements.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| 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".