MétaCan
Menu
Back to cohort
Record W2086798521 · doi:10.1080/14626260701253622

Swarm grammars: growing dynamic structures in 3D agent spaces

2007· article· en· W2086798521 on OpenAlexaff
Christian Jacob, Sebastian von Mammen

Bibliographic record

VenueDigital Creativity · 2007
Typearticle
Languageen
FieldEngineering
TopicModular Robots and Swarm Intelligence
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsSwarm behaviourComputer scienceRule-based machine translationGrammar systems theoryGrammarSwarm roboticsSwarm intelligenceTheoretical computer scienceArtificial intelligenceGrammatical evolutionAlgorithmParticle swarm optimizationGenerative grammar

Abstract

fetched live from OpenAlex

We present a new way of dynamically growing and breeding structures in 3D space through swarming agents. Different agent types and the way they evolve over time is specified by a swarm grammar similar to Lindenmayer systems. We expand common L-system string interpretation from a single turtle to a multitude of turtles which behave like a swarm. By describing swarm agents within the framework of formal grammars, we build a bridge from symbolic production systems (rewrite systems) to three-dimensional real-time construction procedures that are executed by reactive and interacting agents which move in simulated physical 3D spaces. We introduce constructor agents, their formal representation in swarm grammars and demonstrate by examples how (1) the swarm rules, (2) the agent parameters and (3) the environ ment can influence the actual construction and growth processes that are initiated and directed by the swarms. In order to facilitate exploration of a large variety of swarm grammars, we apply interactive evolutionary design methods to create swarm grammar sculptures and 3D structures.

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.002
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.010

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.000
Science and technology studies0.0010.003
Scholarly communication0.0020.001
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

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

Citations27
Published2007
Admission routes1
Has abstractyes

Explore more

Same venueDigital CreativitySame topicModular Robots and Swarm IntelligenceFrench-language works237,207