MétaCan
Menu
Back to cohort
Record W2161699417 · doi:10.1109/acc.2011.5990990

Relaxed convergence conditions for multi-agent systems under a class of consensus algorithms

2011· article· en· W2161699417 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
KeywordsConvergence (economics)Intersection (aeronautics)Convex hullComputer scienceMulti-agent systemMathematical optimizationClass (philosophy)GraphProperty (philosophy)MathematicsAlgorithmRegular polygonTheoretical computer scienceArtificial intelligenceEngineering

Abstract

fetched live from OpenAlex

This paper presents sufficient conditions for the convergence for a group of single integrator agents with a directed and static information flow graph, under a special class of control inputs. Using a novel approach based on the smallest order of the nonzero derivative, it is shown that under some mild conditions the convex hull of the agents will be contracting. The finite intersection property is then used to prove the convergence of the agents to a common fixed point. The results obtained in this work are more general than the ones reported in the literature. An illustrative example is provided to verify the proposed convergence conditions.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.983
Threshold uncertainty score0.945

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.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.115
GPT teacher head0.298
Teacher spread0.183 · 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

Citations1
Published2011
Admission routes2
Has abstractyes

Explore more

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