MétaCan
Menu
Back to cohort
Record W4404414057 · doi:10.1080/00207721.2024.2427848

Distributed adaptive finite-time fault-tolerant cooperative control of heterogeneous multi-agent systems with saturation and disturbances

2024· article· en· W4404414057 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueInternational Journal of Systems Science · 2024
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsConcordia University
FundersAeronautical Science Foundation of ChinaNational Natural Science Foundation of China
KeywordsSaturation (graph theory)Control theory (sociology)Fault toleranceMulti-agent systemDistributed computingComputer scienceControl (management)MathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper, the issue of distributed adaptive finite-time fault-tolerant cooperative control (FT-FTCC) problem is investigated for multiple unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) with unknown parameter uncertainties, actuator faults, input saturation and external disturbances. Starting from the dynamic models of the UAVs and UGVs, an unified control model is presented. Then, a sliding-mode estimator is presented to estimate the position of the leader for the followers which only uses the information from neighbours. Next, a distributed adaptive FT-FTCC scheme, which can also deal with the uncertainties, actuator faults, input saturation and disturbances, is proposed by utilising disturbance observers and neural networks. Based on Lyapunov function approach, the tracking errors of all followers subject to the pre-defined desired positions are uniformly ultimately bounded. Finally, simulations are given to validate the efficiency of the developed FT-FTCC scheme.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.965
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.002
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.013
GPT teacher head0.249
Teacher spread0.236 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it