Zero-Shot Signal Temporal Logic Planning with Disjunctive Branch Selection in Dynamic Semantic Maps

arXiv cs.AI / 5/5/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper proposes a zero-shot Signal Temporal Logic (STL) planning solver designed for variable, dynamic semantic map environments without requiring retraining.
  • It combines a map-conditioned Transformer architecture with a lightweight heuristic to generate feasible trajectories, particularly for complex disjunctive (OR) subformulas.
  • To maintain correct timing and logic across decomposed sub-tasks, the method uses Transitive Reinforcement Learning (TRL) for consistent temporal grounding and logical coherence.
  • Experiments on dynamic semantic maps with varied obstacle layouts show consistent improvements, indicating strong zero-shot generalization and broader STL coverage than prior approaches.

Abstract

Signal Temporal Logic (STL) offers verifiable task specifications and is crucial for safety-critical control. Yet STL planning remains challenging: exact optimization-based methods are often too slow, and learning-based methods struggle to generalize across varying environments. We propose a zero-shot STL planning solver for variable-map environments that generates feasible trajectories without retraining. By integrating a map-conditioned Transformer architecture with a lightweight heuristic, our approach effectively handles complex disjunctive (OR) subformulas. Furthermore, we leverage Transitive Reinforcement Learning (TRL) to ensure consistent temporal grounding and logical coherence across decomposed sub-tasks. Experiments on dynamic semantic maps with diverse obstacle layouts demonstrate consistent gains, highlighting the framework's superior zero-shot generalization to changing environments and broad STL coverage.