MétaCan
Menu
Back to cohort
Record W1564217487

Finite-time consensus of multi-agent systems with directed and intermittent links

2011· article· en· W1564217487 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

VenueChinese Control Conference · 2011
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsMulti-agent systemTopology (electrical circuits)Spanning treeConsensusSimple (philosophy)Network topologyComputer scienceTree (set theory)Protocol (science)State (computer science)Nonlinear systemMathematicsDistributed computingDiscrete mathematicsAlgorithmCombinatoricsArtificial intelligencePhysicsComputer network
DOInot available

Abstract

fetched live from OpenAlex

This paper considers the finite-time consensus problem in multi-agent systems with unidirectional and intermittent links. The interaction topology is indeed directed and time-varying. We propose a simple but effective distributed nonlinear protocol in the form of a continuous state feedback and show that if the union of the interaction topology over a period of time contains a spanning tree periodically, then all agents will reach an agreement on states asymptotically; and if the sum of time intervals, over which the interaction topology contains a spanning tree, is sufficiently large, then all agents will reach an agreement on states in a finite time.

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.000
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.922
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

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