MétaCan
Menu
Back to cohort
Record W4254873127 · doi:10.24124/2019/59010

Conan Veitch

2019· dissertation· en· W4254873127 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
Typedissertation
Languageen
FieldComputer Science
TopicDistributed Control Multi-Agent Systems
Canadian institutionsUniversity of Northern British Columbia
Fundersnot available
KeywordsFlocking (texture)ErgodicityRoboticsComputer scienceArtificial intelligenceRobotDistributed computingMathematics

Abstract

fetched live from OpenAlex

The design of efficient control strategies is a well studied problem. Due to recent technological advancements and applications in the field of robotics, exploring novel ways to design optimal control for multi-robot systems has gained interest. In this respect, the concept of ergodicity has successfully been applied as an effective control technique for tracking and area coverage. The generation of flocking behaviour is a problem that involves both tracking and coverage, and as such is also suited for the use of ergodicity. The main contribution of this thesis is the application of ergodicity to emulate flocking behaviour. This approach is appealing because control and communication is assumed to be local, self-organized, and does not require separate algorithms in order to generate different behaviour. Simulation results show that the proposed approach is effective and a prototype provides evidence that flocking behaviour is possible using ergodicity in a real-life setting.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Other · Consensus signal: none
Teacher disagreement score0.758
Threshold uncertainty score0.997

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.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.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.004

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.009
GPT teacher head0.245
Teacher spread0.236 · 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

Citations0
Published2019
Admission routes1
Has abstractyes

Explore more

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