MétaCan
Menu
Back to cohort
Record W2009240858 · doi:10.1109/icsmc.2011.6083672

Internal topographical structure in training autonomous robot

2011· article· en· W2009240858 on OpenAlexaff
Pitoyo Hartono, Thomas Trappenberg

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicNeural Networks and Applications
Canadian institutionsDalhousie University
Fundersnot available
KeywordsRobotMobile robotComputer scienceUsabilityController (irrigation)Artificial intelligenceFocus (optics)Human–computer interactionArtificial neural networkRobot controlLayer (electronics)

Abstract

fetched live from OpenAlex

In this research we propose a trainable controller for a mobile robot based on a layered neural network, in which the hidden layer is a topographical map. In this study we focus not only on building a general controller that can be embedded to mobile robots running in physical environment, but also on building controllers with good internal plausibility. We consider that internal plausibility of the physical functionality acquired by robots during their learning phase is important in increasing their usability in real world tasks. The internal plausibility in this study can be obtained by associating the topographical map formed internally with the actions of the robots. Here, we run some experiments using a small robot, e-puck, and report the preliminary results of our study.

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.004
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.002
Threshold uncertainty score0.004

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.004
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.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.045
GPT teacher head0.240
Teacher spread0.194 · 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

Citations3
Published2011
Admission routes1
Has abstractyes

Explore more

Same topicNeural Networks and ApplicationsFrench-language works237,207