MétaCan
Menu
Back to cohort

Ergodic Flocking

2019· article· en· W3004075126 on OpenAlexaff
Conan Veitch, Duncan Render, Alex Aravind

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversity of Northern British Columbia
Fundersnot available
KeywordsFlocking (texture)ErgodicityErgodic theoryComputer scienceRoboticsArtificial intelligenceRobotMobile robotDistributed computingMathematics

Abstract

fetched live from OpenAlex

Designing efficient control strategies is well studied. Due to recent technological advancements and applications to the field of robotics, exploring ways to design optimal control for multi robot systems is gaining interest. In this respect, ergodicity has been successfully applied as an effective control technique for tracking and coverage. Generating flocking behaviour is a problem with many interesting special cases that include both tracking and coverage. The main contribution of this paper is the application of ergodicity to emulate flocking behaviour. Our approach is appealing, as control and communication are all assumed to be local, and so this behaviour is self-organized. Simulation results show that the proposed approach is effective.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0020.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.005
GPT teacher head0.188
Teacher spread0.184 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations6
Published2019
Admission routes1
Has abstractyes

Explore more

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