MétaCan
Menu
Back to cohort
Record W2783679993 · doi:10.1109/cdc.2017.8264162

Consensus of heterogeneous multiple integrator agents on directed graphs

2017· article· en· W2783679993 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsLakehead University
Fundersnot available
KeywordsConsensusIntegratorComputer scienceMulti-agent systemSpanning treeGraphNetwork topologyDirected graphDouble integratorTopology (electrical circuits)State (computer science)Distributed computingTheoretical computer scienceStrongly connected componentUniform consensusMathematicsAlgorithmBandwidth (computing)Computer networkDiscrete mathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

This paper considers the consensus problem of heterogeneous high-order multi-agent systems, described by multiple integrator dynamics with mixed order, under general directed graphs. We propose a state-feedback-based distributed consensus algorithm that achieves consensus without topology-dependent conditions. It is shown that consensus is reached under a necessary and sufficient condition of an interconnection graph having a spanning tree. As a result, the proposed approach relaxes some restrictive assumptions, commonly considered in the literature, on the availability of global information for all agents and on the type of information shared among agents.

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.001
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.740
Threshold uncertainty score0.674

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.001
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.034
GPT teacher head0.272
Teacher spread0.238 · 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
Published2017
Admission routes1
Has abstractyes

Explore more

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