MétaCan
Menu
Back to cohort
Record W1549676634

Real-time heuristic search with a priority queue

2007· article· en· W1549676634 on OpenAlexaff
David C. Rayner, Katherine Davison, Vadim Bulitko, K O Anderson, Jieshan Lu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicArtificial Intelligence in Games
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer sciencePriority queueQueueHeuristicBeam searchIncremental heuristic searchPath (computing)Search algorithmArtificial intelligenceMachine learningAlgorithmComputer network
DOInot available

Abstract

fetched live from OpenAlex

Learning real-time search, which interleaves plan-ning and acting, allows agents to learn from mul-tiple trials and respond quickly. Such algorithms require no prior knowledge of the environment and can be deployed without pre-processing. We introduce Prioritized-LRTA * (P-LRTA*), a learn-ing real-time search algorithm based on Prioritized Sweeping. P-LRTA * focuses learning on important areas of the search space, where the importance of a state is determined by the magnitude of the up-dates made to neighboring states. Empirical tests on path-planning in commercial game maps show a substantial learning speed-up over state-of-the-art real-time search algorithms. 1

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.001
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: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.684
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.027
GPT teacher head0.309
Teacher spread0.282 · 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.

Study designTheoretical or conceptual
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

Citations30
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicArtificial Intelligence in GamesFrench-language works237,207