STL-GCS: A Planner-Controller Framework for Signal Temporal Logic via Graphs of Time-varying Convex Sets

• URL: http://arxiv.org/abs/2607.19196v1
• Date: Tue, 21 Jul 2026 15:30:55 GMT
• Title: STL-GCS: A Planner-Controller Framework for Signal Temporal Logic via Graphs of Time-varying Convex Sets
• Abstract summary: We present a unified trajectory planning and control framework for satisfaction of Signal Temporal Logic (STL) specifications defined over convex predicates.<n>At the planning layer, STL tasks are encoded as time-varying convex sets in space configuration.<n>At the control layer, the same time-varying sets used for planning are exploited to design a feedback controller that tracks the planned trajectory.
• Score: 1.1470070927586018
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a unified trajectory planning and control framework for the satisfaction of Signal Temporal Logic (STL) specifications defined over convex predicates. At the planning layer, STL tasks are encoded as time-varying convex sets in configuration space, specifically designed so that forward invariance of the system with respect to these sets implies satisfaction of the specification with a prescribed robustness margin. This representation is then lifted to the joint time--configuration space and combined with the Graphs of Convex Sets (GCS) framework, yielding a shortest-path formulation of the planning problem over convex spatio-temporal sets. Trajectories are parameterized by B-splines, which enable continuous-time enforcement of STL satisfaction, collision avoidance, and smoothness constraints. At the control layer, the same time-varying sets used for planning are exploited to design a feedback controller that tracks the planned trajectory while prioritizing satisfaction of the STL specification during execution in the presence of tracking errors and model mismatch. We validate the proposed approach in simulation and in real-world experiments on space robotic platforms.

Related papers

• Signal Temporal Logic Motion Planning via Graphs of Convex Sets [8.443328067924298]
  This paper investigates continuous-time motion planning under Signal Temporal Logic (STL) specifications.<n>We propose a framework that combines timed-automata reasoning with graphs of convex sets.<n> Numerical experiments on low-dimensional benchmarks, a $3$-Drotor, a $30$-DoF humanoid, and a hardware experiment on a UR-3 robot arm demonstrate that the proposed method efficiently solves complex STL motion-planning problems.
  arXiv  Detail & Related papers  (2026-05-22T05:19:43Z)
• Feedback Motion Planning for Stochastic Nonlinear Systems with Signal Temporal Logic Specifications [25.484834028091083]
  We study feedback motion planning for continuous-time nonlinear systems under signal temporal logic (STL) specifications.<n>We propose a framework that synthesizes control policies for chance-constrained STL trajectory optimization problems.
  arXiv  Detail & Related papers  (2026-05-04T09:02:16Z)
• Navigating the Clutter: Waypoint-Based Bi-Level Planning for Multi-Robot Systems [54.887871365121775]
  Multi-robot control in cluttered environments is a challenging problem that involves complex physical constraints.<n>We propose a hybrid multi-robot control framework that jointly optimize task and motion planning.<n>Our approach consistently improves task success over motion-agnostic and VLA-based baselines.
  arXiv  Detail & Related papers  (2026-04-22T22:58:47Z)
• DAG-STL: A Hierarchical Framework for Zero-Shot Trajectory Planning under Signal Temporal Logic Specifications [7.389002274709231]
  We study offline STL planning under unknown dynamics using only task-agnostic trajectory data.<n>We instantiate this idea in DAG-STL, a hierarchical framework that converts long-horizon STL planning into three stages.<n> Experiments in Maze2D, OGBench AntMaze, and the Cube domain show that DAG-STL substantially outperforms direct robustness-guided diffusion.
  arXiv  Detail & Related papers  (2026-04-20T14:41:37Z)
• SGA-MCTS: Decoupling Planning from Execution via Training-Free Atomic Experience Retrieval [74.1918709002557]
  We introduce textbfSGA-MCTS, a framework that casts LLM planning as non-parametric retrieval.<n>Online, a retrieval-augmented agent employs a hybrid symbolic-semantic mechanism to fetch relevant State-Goal-Action atoms.<n>By effectively amortizing the heavy computational cost of search, SGA-MCTS achieves System 2 reasoning depth at System 1 inference speeds, rendering autonomous planning both scalable and real-time feasible.
  arXiv  Detail & Related papers  (2026-04-16T07:22:36Z)
• Interleaving Scheduling and Motion Planning with Incremental Learning of Symbolic Space-Time Motion Abstractions [44.139198749024644]
  Task and Motion Planning combines high-level task sequencing with low-level motion planning to generate feasible, collision-free execution plans.<n>In this paper, we formalize this as the Scheduling and Motion Planning problem for multi-object navigation in shared workspaces.<n>We propose a novel solution framework that interleaves off-the-shelf schedulers and motion planners in an incremental learning loop.
  arXiv  Detail & Related papers  (2026-03-11T11:10:49Z)
• ColaVLA: Leveraging Cognitive Latent Reasoning for Hierarchical Parallel Trajectory Planning in Autonomous Driving [44.008287454538596]
  Vision-language models (VLMs) enrich this paradigm by introducing cross-modal priors and commonsense reasoning.<n>Current VLM-based planners face three key challenges: (i) a mismatch between discrete text reasoning and continuous control, (ii) high latency from autoregressive chain-of-thought decoding, and (iii) inefficient or non-causal planners that limit real-time deployment.<n>We propose ColaVLA, a unified vision-language-action framework that transfers reasoning from text to a unified latent space and couples it with a hierarchical, parallel trajectory decoder.
  arXiv  Detail & Related papers  (2025-12-28T14:06:37Z)
• Open-Vocabulary Spatio-Temporal Scene Graph for Robot Perception and Teleoperation Planning [55.90805559207812]
  In dynamic remote scenes, transmission latency during bidirectional communication creates gaps between remote perceived states and operator intent.<n>We present a representation that enriches open-vocabulary perception with temporal dynamics and lightweight latency annotations.<n>We show that our method achieves 74 percent node accuracy on the Replica benchmark, outperforming Concept.Graph.
  arXiv  Detail & Related papers  (2025-09-27T04:31:24Z)
• Space-Time Graphs of Convex Sets for Multi-Robot Motion Planning [2.3416394753138037]
  Multi-Robot Motion Planning (MRMP) is a problem of computing problem of collision-free trajectories for multiple robots in continuous environments.<n>We propose Space-Time Graphs of Convex Sets (ST-GCS), a novel planner that systematically covers the collision-free space-time domain with convex sets instead of relying on random sampling.<n>We also propose Convex Decomposition (ECD) to "reserve" trajectories astemporal obstacles, addressing maintaining a collision-free space-time graph sets for subsequent planning.
  arXiv  Detail & Related papers  (2025-03-01T18:28:57Z)
• Zero-Shot Trajectory Planning for Signal Temporal Logic Tasks [7.389002274709231]
  Signal Temporal Logic (STL) is a powerful specification language for describing complex temporal behaviors of continuous signals.<n> generating executable STL plans for STL tasks is challenging, as it requires consideration of the coupling between the task specification and the system dynamics.<n>We propose a hierarchical planning framework that enables zero-shot generalization to new STL tasks by leveraging only task-agnostic trajectory data during offline training.
  arXiv  Detail & Related papers  (2025-01-23T08:15:52Z)
• Towards Unified Token Learning for Vision-Language Tracking [65.96561538356315]
  We present a vision-language (VL) tracking pipeline, termed textbfMMTrack, which casts VL tracking as a token generation task. Our proposed framework serializes language description and bounding box into a sequence of discrete tokens. In this new design paradigm, all token queries are required to perceive the desired target and directly predict spatial coordinates of the target.
  arXiv  Detail & Related papers  (2023-08-27T13:17:34Z)
• Deep Reinforcement Learning for Wireless Scheduling in Distributed Networked Control [37.10638636086814]
  We consider a joint uplink and downlink scheduling problem of a fully distributed wireless control system (WNCS) with a limited number of frequency channels.<n>We develop a deep reinforcement learning (DRL) based framework for solving it.<n>To tackle the challenges of a large action space in DRL, we propose novel action space reduction and action embedding methods.
  arXiv  Detail & Related papers  (2021-09-26T11:27:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.