MétaCan
Menu
Back to cohort
Record W2154610266 · doi:10.1109/mci.2009.933096

The evolution of swarm grammars- growing trees, crafting art, and bottom-up design

2009· article· en· W2154610266 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

VenueIEEE Computational Intelligence Magazine · 2009
Typearticle
Languageen
FieldEngineering
TopicArchitecture and Computational Design
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsSwarm behaviourComputer scienceRule-based machine translationSwarm intelligenceGrammarArtificial intelligenceGrammar systems theoryTheoretical computer scienceAlgorithmParticle swarm optimization

Abstract

fetched live from OpenAlex

We presented swarm grammars as an extension of Lindenmayer systems. Instead of applying a single ('turtle') agent to convert linear strings into 3D structures, we use a swarm of agents "which navigate in 3D space and-as a side effect-place structural building blocks into their environment. The swarm grammars are used to specify how the setup of agent types changes over time. Additional agent parameters determine the agents' behaviors and their interaction dynamics. Both the grammar rules and the agent parameters are evolvable and can change over time-either automatically at replication and collision events among the agents, or triggered by external 'tinkering' from a supervising breeder. When swarm grammars are applied to concrete problems, constraints on the developmental processes as "well as on the emerging structures may provide the basis for an automatic evolutionary algorithm.

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 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.950
Threshold uncertainty score0.609

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.0000.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.017
GPT teacher head0.239
Teacher spread0.222 · 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