MétaCan
Menu
Back to cohort
Record W4410427548 · doi:10.1109/access.2025.3570922

A Biologically Inspired Program-Level Imitation Approach for Robots

2025· article· en· W4410427548 on OpenAlexafffund
Pourya Aliasghari, Moojan Ghafurian, Chrystopher L. Nehaniv, Kerstin Dautenhahn

Bibliographic record

VenueIEEE Access · 2025
Typearticle
Languageen
FieldComputer Science
TopicEvolutionary Algorithms and Applications
Canadian institutionsUniversity of Waterloo
FundersCanada Research Chairs
KeywordsComputer scienceRobotImitationArtificial intelligenceHuman–computer interactionPsychology

Abstract

fetched live from OpenAlex

Robots may learn new skills from humans to better assist us with everyday tasks. We propose a novel, biologically inspired imitation approach to enable robots to understand and perform complex actions using high-level programs that incorporate sequential regularities between sub-goals a robot can recognize and physically achieve. To learn a new task, human-provided demonstrations—obtained by a robot through different modalities such as kinesthetic teaching or behavioural observation—are processed by an algorithm to discover multiple possible arrangements of sub-goals that achieve the task goal. When performing the task, the robot first evaluates the available sequences in the program based on user-defined criteria, through mental simulation of the real task, to find the optimal sequence of actions. The selected sequence is then executed using the hierarchical structure of actions embedded in the program. We implemented the proposed learning architecture on an iCub humanoid robot and evaluated the effectiveness of the system in multiple scenarios. Our approach accommodates variations in human teaching styles and is expected to help robots perform tasks with greater flexibility and efficiency, opening the way to more adaptable and intelligent robots.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
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.0020.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.098
GPT teacher head0.364
Teacher spread0.267 · 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
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

Citations2
Published2025
Admission routes2
Has abstractyes

Explore more

Same venueIEEE AccessSame topicEvolutionary Algorithms and ApplicationsFrench-language works237,207