The DOI matches its Crossref record.
Instructing Goal-Conditioned Reinforcement Learning Agents with Temporal Logic Objectives
Abstract
Goal-conditioned reinforcement learning (RL) is a powerful approach for learning general-purpose skills by reaching diverse goals. However, it has limitations when it comes to task-conditioned policies, where goals are specified by temporally extended instructions written in the Linear Temporal Logic (LTL) formal language. Existing approaches for finding LTL-satisfying policies rely on sampling a large set of LTL instructions during training to adapt to unseen tasks at inference time. However, these approaches do not guarantee generalization to out-of-distribution LTL objectives, which may have increased complexity. In this paper, we propose a novel approach to address this challenge. We show that simple goal-conditioned RL agents can be instructed to follow arbitrary LTL specifications without additional training over the LTL task space. Unlike existing approaches that focus on LTL specifications expressible as regular expressions, our technique is unrestricted and generalizes to ω -regular expressions. Experiment results demonstrate the effectiveness of our approach in adapting goal-conditioned RL agents to satisfy complex temporal logic task specifications zero-shot.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Recently, there have been several implementations of goalconditioned agents that generalize zero-shot to arbitrary LTL goals (Qiu et al., 2023; Jackermeier & Abate, 2025; Vaezipoor et al., 2021; Kuo et al., 2020).”
From General agents contain world models (2025) · cites this paper as Qiu et al., 2023
Citations
Cites
Still being checked.
Cited by
General agents contain world models
Richens, J., Abel, D., Bellot, A., & Everitt, T. (2025) · arXiv · doi:10.48550/arxiv.2506.01622 · Cited by 30
Beyond Fixed Tasks: Unsupervised Environment Design for Task-Level Pairs
Furelos-Blanco, D., Pert, C., Kelbel, F., Spies, A. F., Russo, A., & Dennis, M. (2025) · arXiv
“Qiu, Mao, and Zhu (2023) propose a method that trains from randomly sampled propositions instead of LTL tasks—the policies are proposition-conditioned and then ensembled together to satisfy LTL specifications.”
Metadata
- Authors
- Qiu, W., Mao, W., & Zhu, H.
- ORCID
- Qiu, Wenjie
- Venue
- Advances in Neural Information Processing Systems 36
- Published
- 2023
- Pages
- 39147-39175
- ISSN
- 1049-5258 (ISSN-L)
- OpenAlex
- W7133188027
- Cited by
- 1
- References
- 0
- Citations by year
- 2026: 1
- FWCI
- 0.18
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- neural information processing systems (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
- Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Keywords
- goal-conditioned reinforcement learning, temporal logic, reinforcement learning agents
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Instructing Goal-Conditioned Reinforcement Learning Agents with Temporal Logic Objectives. https://app.cochat.ai/papers/10.52202/075280-1701
- The paper
- Qiu, W., Mao, W., & Zhu, H. (2023). Instructing Goal-Conditioned Reinforcement Learning Agents with Temporal Logic Objectives. Advances in Neural Information Processing Systems 36. https://doi.org/10.52202/075280-1701
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.