MétaCan
Menu
Back to cohort
Record W2887052332 · doi:10.23919/acc.2018.8431516

A Follower-Based Control Allocation in Multi-Agent Networks

2018· article· en· W2887052332 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 institutionsConcordia University
Fundersnot available
KeywordsConvergence (economics)Control (management)Computer scienceSwarm intelligenceMathematical optimizationMulti-agent systemState (computer science)Control theory (sociology)Matrix (chemical analysis)MathematicsArtificial intelligenceParticle swarm optimizationAlgorithmEconomics

Abstract

fetched live from OpenAlex

This paper investigates the consensus problem in a multi-agent system with a leader, using the concept of swarm intelligence. Matrix equations are given to obtain equilibrium state of the network, and the average-based control input is defined accordingly. Two network control rules are subsequently developed, where in one of them the control input is only applied to the leader, and in the other one it is only applied to the neighbors of the leader (follower-based control allocation strategy or swarm intelligence approach). It is shown that the latter control strategy has a faster convergence rate. Simulations confirm the efficacy of the proposed follower-based control allocation strategy.

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

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.001
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.023
GPT teacher head0.261
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
Published2018
Admission routes1
Has abstractyes

Explore more

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