English

Goal-oriented Trajectories for Efficient Exploration

Machine Learning 2018-07-06 v1 Machine Learning

Abstract

Exploration is a difficult challenge in reinforcement learning and even recent state-of-the art curiosity-based methods rely on the simple epsilon-greedy strategy to generate novelty. We argue that pure random walks do not succeed to properly expand the exploration area in most environments and propose to replace single random action choices by random goals selection followed by several steps in their direction. This approach is compatible with any curiosity-based exploration and off-policy reinforcement learning agents and generates longer and safer trajectories than individual random actions. To illustrate this, we present a task-independent agent that learns to reach coordinates in screen frames and demonstrate its ability to explore with the game Super Mario Bros. improving significantly the score of a baseline DQN agent.

Keywords

Cite

@article{arxiv.1807.02078,
  title  = {Goal-oriented Trajectories for Efficient Exploration},
  author = {Fabio Pardo and Vitaly Levdik and Petar Kormushev},
  journal= {arXiv preprint arXiv:1807.02078},
  year   = {2018}
}

Comments

ICML 2018 Exploration in RL Workshop, videos: https://sites.google.com/view/got-exploration

R2 v1 2026-06-23T02:52:07.815Z