GraSP-STL: A Graph-Based Framework for Zero-Shot Signal Temporal Logic Planning via Offline Goal-Conditioned Reinforcement Learning
Ancheng Hou, Ruijia Liu, Xiang Yin

TL;DR
GraSP-STL is a graph-based framework enabling zero-shot planning for unseen Signal Temporal Logic specifications using offline data, goal-conditioned value functions, and graph search, without environment interaction.
Contribution
It introduces a novel offline, zero-shot STL planning method that combines reachability learning with graph search, enabling generalization to new tasks without retraining.
Findings
Effective on various offline STL planning tasks
Achieves zero-shot generalization to unseen specifications
Utilizes offline data for long-horizon planning
Abstract
This paper studies offline, zero-shot planning under Signal Temporal Logic (STL) specifications. We assume access only to an offline dataset of state-action-state transitions collected by a task-agnostic behavior policy, with no analytical dynamics model, no further environment interaction, and no task-specific retraining. The objective is to synthesize a control strategy whose resulting trajectory satisfies an arbitrary unseen STL specification. To this end, we propose GraSP-STL, a graph-search-based framework for zero-shot STL planning from offline trajectories. The method learns a goal-conditioned value function from offline data and uses it to induce a finite-horizon reachability metric over the state space. Based on this metric, it constructs a directed graph abstraction whose nodes represent representative states and whose edges encode feasible short-horizon transitions. Planning…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
