mlsanityData to 14 Oct 2026

Learning to Bridge the Gap: Efficient Novelty Recovery with Planning and Reinforcement Learning

arXiv 2409.19226 ↗First posted 28 Sep 2024cs.RO cs.AIcited by 1

On the map: Deep reinforcement learning methods → Deep RL algorithms and representations

Abstract (arXiv)

The real world is unpredictable. Therefore, to solve long-horizon decision-making problems with autonomous robots, we must construct agents that are capable of adapting to changes in the environment during deployment. Model-based planning approaches can enable robots to solve complex, long-horizon tasks in a variety of environments. However, such approaches tend to be brittle when deployed into an environment featuring a novel situation that their underlying model does not account for. In this work, we propose to learn a ``bridge policy'' via Reinforcement Learning (RL) to adapt to such novelties. We introduce a simple formulation for such learning, where the RL problem is constructed with a special ``CallPlanner'' action that terminates the bridge policy and hands control of the agent back to the planner. This allows the RL policy to learn the set of states in which querying the planner and following the returned plan will achieve the goal. We show that this formulation enables the agent to rapidly learn by leveraging the planner's knowledge to avoid challenging long-horizon exploration caused by sparse reward. In experiments across three different simulated domains of varying complexity, we demonstrate that our approach is able to learn policies that adapt to novelty more efficiently than several baselines, including a pure RL baseline. We also demonstrate that the learned bridge policy is generalizable in that it can be combined with the planner to enable the agent to solve more complex tasks with multiple instances of the encountered novelty.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 24 of its 33 references that are in the map. First posted on arXiv 28 Sep 2024.

Builds on

24 of 33 references.

References · 24

  1. 2015Continuous control with deep reinforcement learningcited by 3,407
  2. 2013Playing Atari with Deep Reinforcement Learningcited by 3,274
  3. 2015Deep Reinforcement Learning with Double Q-learningcited by 1,745
  4. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
  5. 2017Hindsight Experience Replaycited by 1,136
  6. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
  7. 2020Integrated Task and Motion Planningcited by 290
  8. 2017Behavior Trees in Robotics and AI: An Introductioncited by 107
  9. 2018CURIOUS: Intrinsically Motivated Modular Multi-Goal Reinforcement Learningcited by 79
  10. 2021Augmenting Reinforcement Learning with Behavior Primitives for Diverse Manipulation Taskscited by 78
  11. 2015Reinforcement Learning with Parameterized Actionscited by 63
  12. 2021Learning Symbolic Operators for Task and Motion Planningcited by 58
12 more
  1. 2022Learning Neuro-Symbolic Skills for Bilevel Planningcited by 58
  2. 2022Predicate Invention for Bilevel Planningcited by 49
  3. 2020Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networkscited by 38
  4. 2022LEAGUE: Guided Skill Learning and Abstraction for Long-Horizon Manipulationcited by 34
  5. 2024Practice Makes Perfect: Planning to Learn Skill Parameter Policiescited by 23
  6. 2022Learning Efficient Abstract Planning Models that Choose What to Predictcited by 17
  7. 2023Embodied Lifelong Learning for Task and Motion Planningcited by 17
  8. 2020Elaborating on Learned Demonstrations with Temporal Logic Specificationscited by 14
  9. 2022RAPid-Learn: A Framework for Learning to Recover for Handling Novelties in Open-World Environmentscited by 13
  10. 2022Efficient Recovery Learning using Model Predictive Meta-Reasoningcited by 8
  11. 2022Cooperative Task and Motion Planning for Multi-Arm Assembly Systemscited by 7
  12. 2022Physically-Feasible Repair of Reactive, Linear Temporal Logic-based, High-Level Taskscited by 6

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2025DISCOVER: Automated Curricula for Sparse-Reward Reinforcement Learning
  2. 2026FARL: A Fully Automated Pipeline of RL Interface and Solver Design
  3. 2025Context-Sensitive Abstractions for Reinforcement Learning with Parameterized Actions
  4. 2023Bridging the Sim-to-Real Gap from the Information Bottleneck Perspective
  5. 2022Planning to Practice: Efficient Online Fine-Tuning by Composing Goals in Latent Space
  6. 2026Support-Constrained RL Enables Real-World Policy Improvement without Real-World Experience
  7. 2025Learning from Reward-Free Offline Data: A Case for Planning with Latent Dynamics Models
  8. 2026HARBOR: A Harness Framework for Agentic Robot Reinforcement Learning