MétaCan
Menu
Back to cohort
Record W2885784061 · doi:10.1609/aiide.v14i1.13010

Generating Paths with WFC

2018· preprint· en· W2885784061 on OpenAlexaff
Hugo Scurti, Clark Verbrugge

Bibliographic record

VenueProceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · 2018
Typepreprint
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsMcGill University
Fundersnot available
KeywordsSketchMinor (academic)USablePath (computing)Computer scienceDynamic programmingSimple (philosophy)Motion (physics)AlgorithmArtificial intelligenceMathematical optimizationMathematicsProgramming language

Abstract

fetched live from OpenAlex

We describe a tool based on the Wave Function Collapse algorithm that performs example-based path generation on fixed maps. Our design aims at a practical system usable by non-programmers, and includes both easy input control and multiple post-processing steps. The design is implemented in Unity and enables users to easily visualize the results of experimenting with different path descriptions and game levels.

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.005
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.022
Threshold uncertainty score0.075

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0020.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0220.003

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.050
GPT teacher head0.285
Teacher spread0.235 · 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

Citations4
Published2018
Admission routes1
Has abstractyes

Explore more

Same venueProceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital EntertainmentSame topicRobotic Path Planning AlgorithmsFrench-language works237,207