MétaCan
Menu
Back to cohort
Record W7095215784

Executive summary

2005· article· en· W7095215784 on OpenAlexaboutno aff

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicRobotic Path Planning Algorithms
Canadian institutionsnot available
Fundersnot available
KeywordsExecutive summaryState (computer science)Adaptation (eye)Path (computing)Executive committee
DOInot available

Abstract

fetched live from OpenAlex

© Sa majesté la reine, représentée par le ministre de la Défense nationale, 2005 Following user defined paths and seeking goal locations is fundamental to Autonomous Unmanned Ground Vehicle (UGV) navigation. This paper summarizes the current state of the art in robotic path tracking for Ackerman steered vehicles and presents results of implementation and adaptation of the Pure Pursuit algorithm at Defence R&D Canada – Suffield. Résumé La poursuite de parcours configurés par l’utilisateur et la recherche de la location des buts sont fondamentales à la navigation autonome des Véhicules terrestres sans pilotes (UGV). Cet article résume l’état actuel de l’art de localiser des parcours avec la robotique en utilisant des véhicules munis d'un système de direction reposant sur le principe Ackerman et présente l’implémentation et l’adaptation de l’algorithme Pure Pursuit à R & D pour la défense Canada – Suffield. DRDC Suffield TM 2005-224 i This page intentionally left blank. ii DRDC Suffield TM 2005-224

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.002
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.484
Threshold uncertainty score0.690

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.008
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0030.003
Science and technology studies0.0020.000
Scholarly communication0.0060.004
Open science0.0020.002
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.5160.446

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.015
GPT teacher head0.247
Teacher spread0.232 · 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; the direct Gemma label and the distilled Codex classifier agree on what is shown here.

Study designNot applicable
Domainnot available
GenreOther

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

Citations0
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicRobotic Path Planning AlgorithmsFrench-language works237,207