Sample-Efficient Learning to Solve a Real-World Labyrinth Game Using Data-Augmented Model-Based Reinforcement Learning

Thomas Bi, Raffaello D'Andrea
12/15/2023
cs.ROcs.AI

No official code found. Best implementation: thomasbi1/cyberrunner (127 stars, AGPL-3.0, last commit 2026-04-07).

Abstract

Motivated by the challenge of achieving rapid learning in physical environments, this paper presents the development and training of a robotic system designed to navigate and solve a labyrinth game using model-based reinforcement learning techniques. The method involves extracting low-dimensional observations from camera images, along with a cropped and rectified image patch centered on the current position within the labyrinth, providing valuable information about the labyrinth layout. The learning of a control policy is performed purely on the physical system using model-based reinforcement learning, where the progress along the labyrinth's path serves as a reward signal. Additionally, we exploit the system's inherent symmetries to augment the training data. Consequently, our approach learns to successfully solve a popular real-world labyrinth game in record time, with only 5 hours of real-world training data.

View on arXivView PDF

Code Implementations(1)

AGPL-3.0

CyberRunner is an AI robot whose task is to learn how to play the popular and widely accessible labyrinth marble game.

1279C, C++Dec 15, 20236 months agoAGPL-3.0
machine-learningpythonreinforcement-learningrobotics

Similar Papers

Cite this paper

@article{bi2023sampleefficient,
  title  = {Sample-Efficient Learning to Solve a Real-World Labyrinth Game Using Data-Augmented Model-Based Reinforcement Learning},
  author = {Thomas Bi and Raffaello D'Andrea},
  year   = {2023},
  eprint = {2312.09906},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2312.09906v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2312.09906.svg)](https://codeofpaper.com/paper/2312.09906)

Discussion