Back to search

Dublin City University

Sample and time efficient strategies for off-policy reinforcement learning in robotic manipulation tasks

Abstract

dc:description.abstract

In recent years, reinforcement learning algorithms have become very popular in solving robotic manipulation tasks. However, these algorithms usually suffer from sample inefficiency, meaning that they require extensive exploration to find an appropriate control policy capable of solving the robotic manipulation tasks targeted, and, consequently, this sample inefficiency leads to training time inefficiency. The work presented in this thesis aims to solve this problem through three main methods: (i) reward engineering; (ii) a sequential execution of primitive skills; and (iii) an automatic execution of primitive policies. In particular, a novel reward that encourages lifting behaviour is presented and evaluated in the context of the Real Robot Challenge competition problem. A novel learning framework for in-hand object 3D rotations based on sequentially executed primitives is proposed and evaluated in the Shadow Dexterous Hand simulated environment of the OpenAI Gym. Finally, a new algorithm is proposed that is capable of automatically deciding, during exploration, whether or not to use a primitive behaviour, with this approach evaluated in different tasks for different manipulators available in the OpenAI Gym.

Degree

thesis:*
Name dc:type.qualificationname
phd
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
Dublin City University
Year dc:date.issued
2025

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sanchez, Francisco Roldan

Rights

Language dc:language
en

Chain of custody

source
Harvested from
Dublin City University
Base URL
doras.dcu.ie/cgi/oai2
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Sanchez, Francisco Roldan. Sample and time efficient strategies for off-policy reinforcement learning in robotic manipulation tasks. doctoral thesis, Dublin City University, 2025.