MétaCan
Menu
Back to cohort
Record W4407666659 · doi:10.1051/itmconf/20257301007

Optimizing Robotic Arm Learning: Curiosity-Driven Deep Deterministic Policy Gradient

2025· article· en· W4407666659 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueITM Web of Conferences · 2025
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsCanada Research Chairs
Fundersnot available
KeywordsCuriosityArtificial intelligenceComputer scienceDeep learningPsychologyHuman–computer interactionNeuroscience

Abstract

fetched live from OpenAlex

This study explores the application of the Reinforcement Learning (RL) in training robotic arms, particularly using the Deep Deterministic Policy Gradient (DDPG) algorithm enhanced by a curiosity- driven mechanism. Robotic arms have various real-life applications, such as in the surgeries and assistive technologies. However, collecting the large- scale real-world data is costly and impractical, making simulation environments essential for optimization. The DDPG, well-suited for continuous action spaces, was employed to improve the robotic arm’s precision and adaptability. Integrating a curiosity mechanism allowed the system to explore and learn more efficiently, significantly improving the training time and success rate. The results demonstrate a 12% reduction in training time and an 18% increase in the success rate when using curiosity- driven exploration. These findings suggest that the enhanced DDPG algorithm not only accelerates learning but also enables better task execution, offering a promising approach for the real-world robotic applications.

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.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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.975
Threshold uncertainty score0.913

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.001
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.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.021
GPT teacher head0.281
Teacher spread0.259 · 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