MétaCan
Menu
Back to cohort

Consensus Control of Multi-Agent Systems With Uncertain Communication Links

2022· article· en· W4308213901 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDigraphAsynchronous communicationComputer scienceController (irrigation)Multi-agent systemControl (management)Control theory (sociology)ConsensusDistributed computingMathematicsArtificial intelligenceComputer networkDiscrete mathematics

Abstract

fetched live from OpenAlex

This paper is devoted to the consensus control of a leader-follower multi-agent system (MAS) modeled by a random digraph. Due to the uncertainties in the environment, the communication links between distinct agents are represented by a time-varying probability matrix. We propose a novel robust control strategy to achieve approximate agreement among agents in the presence of an asynchronous network with uncertain communication links. The uncertainties are modeled as disturbances, and the controller is designed to debilitate them. Under the proposed controller, it is guaranteed that the global consensus error satisfies the L <inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</inf> -gain performance in the presence of uncertainties. The functionality of the proposed controller in reducing the impact of uncertainty is proved mathematically and verified by 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.

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 categoriesnone
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.986
Threshold uncertainty score0.648

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
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.027
GPT teacher head0.247
Teacher spread0.220 · 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

Quick stats

Citations2
Published2022
Admission routes2
Has abstractyes

Explore more

Same topicDistributed Control Multi-Agent SystemsFrench-language works237,207