Developing cooperative policies for multi-stage reinforcement learning tasks
Not on the map. Why?
Abstract (arXiv)
Many hierarchical reinforcement learning algorithms utilise a series of independent skills as a basis to solve tasks at a higher level of reasoning. These algorithms don't consider the value of using skills that are cooperative instead of independent. This paper proposes the Cooperative Consecutive Policies (CCP) method of enabling consecutive agents to cooperatively solve long time horizon multi-stage tasks. This method is achieved by modifying the policy of each agent to maximise both the current and next agent's critic. Cooperatively maximising critics allows each agent to take actions that are beneficial for its task as well as subsequent tasks. Using this method in a multi-room maze domain and a peg in hole manipulation domain, the cooperative policies were able to outperform a set of naive policies, a single agent trained across the entire domain, as well as another sequential HRL algorithm.
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 24 of its 30 references that are in the map. First posted on arXiv 11 May 2022.
Builds on
24 of 30 references.
References · 24
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Trust Region Policy Optimizationcited by 2,580
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,240
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 455
- 2016The Option-Critic Architecturecited by 448
- 2019Relay Policy Learning: Solving Long-Horizon Tasks via Imitation and Reinforcement Learningcited by 384
- 2017FeUdal Networks for Hierarchical Reinforcement Learningcited by 337
- 2019Dynamics-Aware Unsupervised Discovery of Skillscited by 313
- 2018Actor-Attention-Critic for Multi-Agent Reinforcement Learningcited by 261
- 2016Modular Multitask Reinforcement Learning with Policy Sketchescited by 203
- 2017Stochastic Neural Networks for Hierarchical Reinforcement Learningcited by 124
- 2018Near-Optimal Representation Learning for Hierarchical Reinforcement Learningcited by 110
12 more
- 2019MCP: Learning Composable Hierarchical Control with Multiplicative Compositional Policiescited by 108
- 2017Zero-Shot Task Generalization with Multi-Task Deep Reinforcement Learningcited by 98
- 2017Meta Learning Shared Hierarchiescited by 93
- 2016A Deep Hierarchical Approach to Lifelong Learning in Minecraftcited by 90
- 2017Intrinsically Motivated Goal Exploration Processes with Automatic Curriculum Learningcited by 83
- 2019Why Does Hierarchy (Sometimes) Work So Well in Reinforcement Learning?cited by 68
- 2018Latent Space Policies for Hierarchical Reinforcement Learningcited by 67
- 2021Adversarial Skill Chaining for Long-Horizon Robot Manipulation via Terminal State Regularizationcited by 46
- 2019Hierarchical Reinforcement Learning with Advantage-Based Auxiliary Rewardscited by 40
- 2020Data-efficient Hindsight Off-policy Option Learningcited by 31
- 2019Hierarchical Soft Actor-Critic: Adversarial Exploration via Mutual Information Optimizationcited by 2
- 2019Hierarchical Reinforcement Learning for Concurrent Discovery of Compound and Composable Policiescited by 1
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 1.
4 papers.
- 2025Causality-Based Reinforcement Learning Method for Multi-Stage Robotic Tasks5 Mar 2025
- 2024Optimizing Risk-averse Human-AI Hybrid Teams13 Mar 2024
- 2024Optimizing Delegation in Collaborative Human-AI Hybrid Teams8 Feb 2024
- 2023Optimizing delegation between human and AI collaborative agents26 Sep 2023