Planning Goals for Exploration
Edward S. Hu, Richard Chang, Oleh Rybkin, Dinesh Jayaraman

TL;DR
This paper introduces PEG, a goal-setting method for reinforcement learning that optimizes exploration by planning goals to reach high-potential states, improving learning efficiency in complex environments.
Contribution
PEG is a novel approach that learns world models and plans goal commands to enhance exploration in goal-conditioned reinforcement learning.
Findings
PEG enables an ant robot to navigate a maze efficiently.
PEG allows a robot arm to build a block stack successfully.
PEG outperforms baseline methods in exploration effectiveness.
Abstract
Dropped into an unknown environment, what should an agent do to quickly learn about the environment and how to accomplish diverse tasks within it? We address this question within the goal-conditioned reinforcement learning paradigm, by identifying how the agent should set its goals at training time to maximize exploration. We propose "Planning Exploratory Goals" (PEG), a method that sets goals for each training episode to directly optimize an intrinsic exploration reward. PEG first chooses goal commands such that the agent's goal-conditioned policy, at its current level of training, will end up in states with high exploration potential. It then launches an exploration policy starting at those promising states. To enable this direct optimization, PEG learns world models and adapts sampling-based planning algorithms to "plan goal commands". In challenging simulated robotics environments…
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.
Code & Models
Videos
Taxonomy
TopicsReinforcement Learning in Robotics · Robotic Path Planning Algorithms
