MétaCan
Menu
Back to cohort
Record W2073818951 · doi:10.5555/2157848.2157850

AntReckoning: dead reckoning using interest modeling by pheromones

2011· article· en· W2073818951 on OpenAlexaff
Amir Yahyavi, Kévin Huguenin, Bettina Kemme

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPeer-to-Peer Network Technologies
Canadian institutionsMcGill University
Fundersnot available
KeywordsDead reckoningComputer scienceMotion (physics)InertiaKey (lock)Quake (natural phenomenon)Artificial intelligenceSimulationComputer securityTelecommunicationsGlobal Positioning System

Abstract

fetched live from OpenAlex

Abstract—In games, the goals and interests of players are key factors in their behavior. However, techniques used by networked games to cope with infrequent updates and message loss, such as dead reckoning, estimate a player’s movements based on previous observations only. The estimations are typically done using dynamics of motion, taking only inertia and external factors (e.g., gravity, wind) into account while completely ignoring the player’s goals (e.g., chasing other players or collecting objects). This paper proposes AntReckoning: a dead reckoning algo-rithm, inspired from ant colonies, which models the players’ interests to predict their movements. AntReckoning incorporates a player’s interest in specific locations, objects, and avatars in the equations of motion in the form of attraction forces. In practice, these points of interest generate pheromones, which fade and spread in the game world, and are a source of attraction. Our simulations using mobility traces from World of Warcraft and Quake III show that AntReckoning improves the accuracy by up to 30 % over traditional dead reckoning techniques. I.

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 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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.947
Threshold uncertainty score0.849

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0020.001
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.173
GPT teacher head0.278
Teacher spread0.105 · 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 teacher head, not a consensus.

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

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

Citations5
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicPeer-to-Peer Network TechnologiesFrench-language works237,207