Goal-Conditioned Reinforcement Learning: Problems and Solutions
Minghuan Liu, Menghui Zhu, Weinan Zhang
TL;DR
This survey analyzes goal-conditioned reinforcement learning (GCRL), where policies depend on explicit goals and the environment, introducing goal-augmented MDPs (GA-MDPs) to address generalization and sample-efficiency challenges under sparse rewards. It reviews goal representations (vectors, images, language, and other forms), and organizes solutions into optimization-based methods (e.g., UVFA, reward shaping, self-imitation, planning), sub-goal generation, and relabeling strategies (e.g., HER, curriculum relabeling, foresight). The paper synthesizes techniques for learning across multiple goals, generating intermediate objectives, and reusing data through relabeling to boost data efficiency and exploration. It also outlines future directions, including fully intrinsic skill learning, leveraging offline datasets, and developing large pre-trained goal-conditioned policies, to broaden GCRL applicability and scalability.
Abstract
Goal-conditioned reinforcement learning (GCRL), related to a set of complex RL problems, trains an agent to achieve different goals under particular scenarios. Compared to the standard RL solutions that learn a policy solely depending on the states or observations, GCRL additionally requires the agent to make decisions according to different goals. In this survey, we provide a comprehensive overview of the challenges and algorithms for GCRL. Firstly, we answer what the basic problems are studied in this field. Then, we explain how goals are represented and present how existing solutions are designed from different points of view. Finally, we make the conclusion and discuss potential future prospects that recent researches focus on.
