Learning with Expert Abstractions for Efficient Multi-Task Continuous Control
Decision-making in complex, continuous multi-task environments is often hindered by the difficulty of obtaining accurate models for planning and the inefficiency of learning purely from trial and error. While precise environment dynamics may be hard to specify, human experts can often provide high-fidelity abstractions that capture the essential high-level structure of a task and user preferences in the target environment. Existing hierarchical approaches often target discrete settings and do not generalize across tasks. We propose a hierarchical reinforcement learning approach that addresses these limitations by dynamically planning over the expert-specified abstraction to generate subgoals to learn a goal-conditioned policy. To overcome the challenges of learning under sparse rewards, we shape the reward based on the optimal state value in the abstract model. This structured decision-making process enhances sample efficiency and facilitates zero-shot generalization. Our empirical evaluation on a suite of procedurally generated continuous control environments demonstrates that our approach outperforms existing hierarchical reinforcement learning methods in terms of sample efficiency, task completion rate, scalability to complex tasks, and generalization to novel scenarios.
Code (1)
Tasks
continuous-controlContinuous ControlDecision MakingHierarchical Reinforcement Learningreinforcement-learningReinforcement LearningZero-shot GeneralizationSimilar Papers 제목 키워드 기반
PRISE: LLM-Style Sequence Compression for Learning Temporal Action Abstractions in Control
Temporal action abstractions, along with belief state representations, are a powerful knowledge sharing mechanism for sequential decision making. In this work, we propose a novel view that treats inducing temporal action…
continuous-controlContinuous ControlDecision MakingFew-Shot Imitation Learning+3Learning State Abstractions for Transfer in Continuous Control
Can simple algorithms with a good representation solve challenging reinforcement learning problems? In this work, we answer this question in the affirmative, where we take "simple learning algorithm" to be tabular Q-Lear…
continuous-controlContinuous ControlQ-Learningreinforcement-learning+2Data-driven Construction of Finite Abstractions for Interconnected Systems: A Compositional Approach
Finite-state abstractions (a.k.a. symbolic models) present a promising avenue for the formal verification and synthesis of controllers in continuous-space control systems. These abstractions provide simplified models tha…
Approximately symbolic models for a class of continuous-time nonlinear systems
Discrete abstractions have become a standard approach to assist control synthesis under complex specifications. Most techniques for the construction of discrete abstractions are based on sampling of both the state and ti…
Data-Driven Yet Formal Policy Synthesis for Stochastic Nonlinear Dynamical Systems
The automated synthesis of control policies for stochastic dynamical systems presents significant challenges. A standard approach is to construct a finite-state abstraction of the continuous system, typically represented…