Robots Learn Increasingly Complex Tasks with Intrinsic Motivation and Automatic Curriculum Learning
Sao Mai Nguyen (Flowers, U2IS, IMT Atlantique - INFO,, Lab-STICC_RAMBO), Nicolas Duminy (Lab-STICC_RAMBO, IMT Atlantique - INFO,, UBS), Alexandre Manoury (IMT Atlantique - INFO, Lab-STICC_RAMBO), Dominique, Duhaut (UBS, Lab-STICC_RAMBO), C\'edric Buche (ENIB)

TL;DR
This paper introduces SGIM-SAHT, a hierarchical reinforcement learning framework enabling robots to learn complex, multi-task sequences through intrinsic motivation, curriculum inference, and active imitation, advancing lifelong learning capabilities.
Contribution
The paper presents a novel hierarchical reinforcement learning framework that learns task hierarchies and curricula autonomously for multi-task robot learning.
Findings
Successfully infers task hierarchies and curricula
Enables robots to learn sequences of unbounded complexity
Integrates imitation learning with intrinsic motivation
Abstract
Multi-task learning by robots poses the challenge of the domain knowledge: complexity of tasks, complexity of the actions required, relationship between tasks for transfer learning. We demonstrate that this domain knowledge can be learned to address the challenges in life-long learning. Specifically, the hierarchy between tasks of various complexities is key to infer a curriculum from simple to composite tasks. We propose a framework for robots to learn sequences of actions of unbounded complexity in order to achieve multiple control tasks of various complexity. Our hierarchical reinforcement learning framework, named SGIM-SAHT, offers a new direction of research, and tries to unify partial implementations on robot arms and mobile robots. We outline our contributions to enable robots to map multiple control tasks to sequences of actions: representations of task dependencies, an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
