Differentiable SpaTiaL: Symbolic Learning and Reasoning with Geometric Temporal Logic for Manipulation Tasks

arXiv cs.RO / 4/6/2026

💬 OpinionIdeas & Deep AnalysisTools & Practical UsageModels & Research

Key Points

  • The paper introduces Differentiable SpaTiaL, a fully tensorized, autograd-compatible toolbox for spatio-temporal symbolic logic over polygonal sets, addressing the non-differentiability of prior SpaTiaL/temporal-logic approaches in gradient-based optimization.
  • It analytically derives smooth differentiable relaxations for key spatial predicates (e.g., signed distance, intersection, containment, and directional relations), avoiding external discrete geometry solvers that break gradient propagation.
  • The approach enables an end-to-end differentiable pipeline from high-level semantic spatio-temporal specifications to low-level geometric configurations for manipulation tasks in cluttered environments.
  • The framework supports massively parallel trajectory optimization under rigorous geometric and temporal constraints, and also allows learning spatio-temporal logic parameters directly from demonstrations using backpropagation.
  • Code is provided via the project repository, and experiments are reported to demonstrate effectiveness and scalability.

Abstract

Executing complex manipulation in cluttered environments requires satisfying coupled geometric and temporal constraints. Although Spatio-Temporal Logic (SpaTiaL) offers a principled specification framework, its use in gradient-based optimization is limited by non-differentiable geometric operations. Existing differentiable temporal logics focus on the robot's internal state and neglect interactive object-environment relations, while spatial logic approaches that capture such interactions rely on discrete geometry engines that break the computational graph and preclude exact gradient propagation. To overcome this limitation, we propose Differentiable SpaTiaL, a fully tensorized toolbox that constructs smooth, autograd-compatible geometric primitives directly over polygonal sets. To the best of our knowledge, this is the first end-to-end differentiable symbolic spatio-temporal logic toolbox. By analytically deriving differentiable relaxations of key spatial predicates--including signed distance, intersection, containment, and directional relations--we enable an end-to-end differentiable mapping from high-level semantic specifications to low-level geometric configurations, without invoking external discrete solvers. This fully differentiable formulation unlocks two core capabilities: (i) massively parallel trajectory optimization under rigorous spatio-temporal constraints, and (ii) direct learning of spatial logic parameters from demonstrations via backpropagation. Experimental results validate the effectiveness and scalability of the proposed framework.Code Available: https://github.com/plen1lune/DiffSpaTiaL