Multi-Task Option Learning and Discovery for Stochastic Path Planning
Not on the map. Why?
Abstract (arXiv)
This paper addresses the problem of reliably and efficiently solving broad classes of long-horizon stochastic path planning problems. Starting with a vanilla RL formulation with a stochastic dynamics simulator and an occupancy matrix of the environment, our approach computes useful options with policies as well as high-level paths that compose the discovered options. Our main contributions are (1) data-driven methods for creating abstract states that serve as endpoints for helpful options, (2) methods for computing option policies using auto-generated option guides in the form of dense pseudo-reward functions, and (3) an overarching algorithm for composing the computed options. We show that this approach yields strong guarantees of executability and solvability: under fairly general conditions, the computed option guides lead to composable option policies and consequently ensure downward refinability. Empirical evaluation on a range of robots, environments, and tasks shows that this approach effectively transfers knowledge across related tasks and that it outperforms existing approaches by a significant margin.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 25 of its 51 references that are in the map. First posted on arXiv 30 Sep 2022.
Builds on
25 of 51 references.
References · 25
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,713
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2015Continuous control with deep reinforcement learningcited by 3,407
- 2017Hindsight Experience Replaycited by 1,136
- 2018Data-Efficient Hierarchical Reinforcement Learningcited by 455
- 2016The Option-Critic Architecturecited by 448
- 2016Hierarchical Deep Reinforcement Learning: Integrating Temporal Abstraction and Intrinsic Motivationcited by 286
- 2019Search on the Replay Buffer: Bridging Planning and Reinforcement Learningcited by 194
- 2016Value Iteration Networkscited by 160
- 2018Near-Optimal Representation Learning for Hierarchical Reinforcement Learningcited by 110
- 2018Temporal Difference Models: Model-Free Deep RL for Model-Based Controlcited by 89
13 more
- 2018SDRL: Interpretable and Data-efficient Deep Reinforcement Learning Leveraging Symbolic Planningcited by 78
- 2018Learning Plannable Representations with Causal InfoGANcited by 57
- 2018PEORL: Integrating Symbolic Planning and Hierarchical Reinforcement Learning for Robust Decision-Makingcited by 52
- 2021Landmark-Guided Subgoal Generation in Hierarchical Reinforcement Learningcited by 47
- 2020Sub-Goal Trees -- a Framework for Goal-Based Reinforcement Learningcited by 29
- 2019Learning from Trajectories via Subgoal Discoverycited by 28
- 2019Harnessing Reinforcement Learning for Neural Motion Planningcited by 21
- 2021Subgoal Search For Complex Reasoning Taskscited by 21
- 2018Finding Options that Minimize Planning Timecited by 17
- 2019Learn and Link: Learning Critical Regions for Efficient Planningcited by 7
- 2022Safely: Safe Stochastic Motion Planning Under Constrained Sensing via Dualitycited by 3
- 2021AMRA*: Anytime Multi-Resolution Multi-Heuristic A*cited by 2
- 2022Using Deep Learning to Bootstrap Abstractions for Hierarchical Robot Planningcited by 2
Built on by
Not cited yet.