MétaCan
Menu
Back to cohort
Record W2322654826 · doi:10.2514/6.2010-8426

Decentralized Sliding Control of Cooperative Multi-Agent Systems Subject to Communication Delays

2010· article· en· W2322654826 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueAIAA Guidance, Navigation, and Control Conference · 2010
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsSubject (documents)Computer scienceMulti-agent systemControl (management)Control systemDecentralised systemControl theory (sociology)Distributed computingControl engineeringEngineeringArtificial intelligenceWorld Wide Web

Abstract

fetched live from OpenAlex

This paper investigates decentralized sliding mode control (SMC) of multi-agent cooperative systems when the inter-agent communication delay cannot be neglected. A new algorithm is proposed to control and maintain the cooperation objectives when large communication delays occur due to faulty network conditions. The faulty agents perform prediction of all other agents in order to perform decentralized SMC. An upper bound is also derived for the state prediction error. The new approach is applied to formation control of a group of wheeled mobile robots. Simulation results show that the proposed approach has good performance and stability properties for cases with large delay compared to centralized SMC.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.912
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.001
Open science0.0010.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.018
GPT teacher head0.262
Teacher spread0.244 · 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