MétaCan
Menu
Back to cohort

Computational and Robotic Pool

2009· book-chapter· en· W2478074252 on OpenAlexaff
Jean‐Pierre Dussault, Michael Greenspan, Jean-François Landry, Will Leckie, Marc Godard, Joseph Lam

Bibliographic record

VenueIGI Global eBooks · 2009
Typebook-chapter
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsNortel (Canada)Queen's UniversityUniversité de Sherbrooke
Fundersnot available
KeywordsTable (database)Computer scienceRobotArtificial intelligencePosition (finance)Human–computer interactionSimulationData mining

Abstract

fetched live from OpenAlex

We introduce pool and its variants, and describe the challenges of computationally simulating the game to create a robot capable of selecting and executing shots on a real table. A proficient pool player performs accurate shots and recovers good position with reasonable alternatives to play following each shot, which requires planning. The computational and robotic simulation of a high level player requires vision, calibration, and accurate robot positioning, as well as an ability to precisely anticipate the table arrangement through simulation of the planned shots. Such a system also requires strategic planning in order to recreate the human’s ability to clear table after table. Ultimately, the challenges associated with the creation of a pool robot will promote new ways of using existing AI methods and provide, if successful, a training tool for players wanting to improve their game.

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.000
metaresearch head score (Gemma)0.001
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.023
Threshold uncertainty score0.077

Distilled classifier scores by category (both heads)

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

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.019
GPT teacher head0.247
Teacher spread0.228 · 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

Citations1
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIGI Global eBooksSame topicRobotic Path Planning AlgorithmsFrench-language works237,207