T4NMTD: Transition-Centric Reinforcement Learning for Non-Markovian Task Decomposition
Ruixuan Miao, Xu Lu, Cong Tian, Bin Yu, Zhenhua Duan
Abstract
Non-Markovian Tasks (NMTs) are distinguished by their dependence on long-term memory and state-dependent dynamics, setting them apart from the traditional Markovian models typically employed in Reinforcement Learning (RL). NMTs not only suffer from reward sparseness but also rely on historical information, making their resolution considerably more challenging. In this paper, we propose a novel RL framework T4NMTD (Transition-centric framework for NMT Decomposition), designed specifically for learning NMTs which are specified by temporal logic. The core of T4NMTD is a task decomposition mechanism along with a parallel training approach for NMTs. An NMT is first decomposed as basic units based on the transitions of the automata which are derived from temporal logic formulae. The units are then modularized into sub-tasks according to their semantic similarity under logical interpretation. The training strategy of T4NMTD adopts a dual-level structure: the high-level learns to shape the boundaries and coordinate arrangement of the sub-tasks from a global perspective, while the low-level learns those sub-tasks in parallel. In addition, we invent a dynamic policy intervention scheme to mitigate the policy myopic issue during parallel training. A comprehensive evaluation is conducted on benchmark problems with respect to various metrics. The experimental results demonstrate that T4NMTD effectively addresses NMTs, achieving significant performance improvements compared with related studies.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 6a630d25-798e-4dfa-83ec-cd67ff1727f1Builds on2
- Compositional Reinforcement Learning from Logical SpecificationsKishor Jothimurugan, Suguman Bansal, Osbert Bastani, Rajeev AlurNeurIPS 2021 · 112 citations
- Policy Optimization with Linear Temporal Logic ConstraintsCameron Voloshin, Hoang Minh Le, Swarat Chaudhuri, Yisong YueNeurIPS 2022 · 28 citations
Related papers
- Decomposing Temporal Equilibrium Strategy for Coordinated Distributed Multi-Agent Reinforcement LearningChenyang Zhu, Wen Si, Jinyu Zhu, Zhihao JiangAAAI 2024 · 2 citations
- Conditional Diffusion Model for Multi-Agent Dynamic Task DecompositionYanda Zhu, Yuanyang Zhu, Daoyi Dong, Caihua Chen et al.AAAI 2026
- Do It for HER: First-Order Temporal Logic Reward Specification in Reinforcement LearningPierriccardo Olivieri, Fausto Lasca, Alessandro Gianola, Matteo PapiniAAAI 2026 · 2 citations
- Meta-learning Parameterized SkillsHaotian Fu, Shangqun Yu, Saket Tiwari, Michael Littman et al.ICML 2023 · 8 citations
- DeepLTL: Learning to Efficiently Satisfy Complex LTL Specifications for Multi-Task RLMathias Jackermeier, Alessandro AbateICLR 2025
