Signal Temporal Logic Motion Planning via Graphs of Convex Sets

• URL: http://arxiv.org/abs/2605.23240v1
• Date: Fri, 22 May 2026 05:19:43 GMT
• Title: Signal Temporal Logic Motion Planning via Graphs of Convex Sets
• Abstract summary: 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.
• Score: 8.443328067924298
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper investigates continuous-time motion planning under Signal Temporal Logic (STL) specifications. The goal is to generate smooth robot trajectories that satisfy high-level logical and timing requirements while respecting low-level motion constraints. To this end, we propose an efficient framework that combines timed-automata reasoning with graphs of convex sets (GCS). An STL specification is first represented by a timed automaton, which is then coupled with a convex decomposition of the configuration space to form a joint transition system encoding both task progress and region occupancy. Based on this joint transition system, the STL motion-planning problem is reformulated as a shortest-path problem over a GCS, whose solution induces a smooth Bézier-spline trajectory satisfying the STL specification, smoothness requirements, and velocity bounds. We establish the soundness of the proposed formulation and analyze its computational complexity, showing that, once the timed automaton and convex decomposition are fixed, the convex relaxation scales polynomially with the configuration-space dimension and the Bézier degree. We further develop a compact timed-automaton construction for an expressive STL fragment using dedicated templates and Boolean composition. Numerical experiments on low-dimensional benchmarks, a $3$-D quadrotor, 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 and produces smooth executable trajectories.

Related papers

• STL-GCS: A Planner-Controller Framework for Signal Temporal Logic via Graphs of Time-varying Convex Sets [1.1470070927586018]
  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.
  arXiv  Detail & Related papers  (2026-07-21T15:30:55Z)
• 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)
• STL-SVPIO: Signal Temporal Logic guided Stein Variational Path Integral Optimization [8.345095354174623]
  Signal Temporal Logic (STL) enables formal specification of complex constraints for robotic task planning.<n>We introduce Signal Vari Temporal Integral Optimization (STL-SVPIO), which reframes STL as a globally informative, differentiable reward-shaping mechanism.<n>We demonstrate that STL-SVPIO significantly outperforms existing methods in both robustness and efficiency for traditional STL tasks.
  arXiv  Detail & Related papers  (2026-03-06T00:53:38Z)
• RRT$^η$: Sampling-based Motion Planning and Control from STL Specifications using Arithmetic-Geometric Mean Robustness [7.121834057343983]
  We propose RRT$$, a sampling-based planning framework that integrates robustness measures across time points and subformulae.<n>We demonstrate superior performance over traditional STL robustness-based planners in multi-constraint scenarios with limited guidance signals.
  arXiv  Detail & Related papers  (2026-02-18T19:45:43Z)
• 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)
• Simultaneous Contact-Rich Grasping and Locomotion via Distributed Optimization Enabling Free-Climbing for Multi-Limbed Robots [60.06216976204385]
  We present an efficient motion planning framework for simultaneously solving locomotion, grasping, and contact problems. We demonstrate our proposed framework in the hardware experiments, showing that the multi-limbed robot is able to realize various motions including free-climbing at a slope angle 45deg with a much shorter planning time.
  arXiv  Detail & Related papers  (2022-07-04T13:52:10Z)
• Sketching as a Tool for Understanding and Accelerating Self-attention for Long Sequences [52.6022911513076]
  Transformer-based models are not efficient in processing long sequences due to the quadratic space and time complexity of the self-attention modules. We propose Linformer and Informer to reduce the quadratic complexity to linear (modulo logarithmic factors) via low-dimensional projection and row selection. Based on the theoretical analysis, we propose Skeinformer to accelerate self-attention and further improve the accuracy of matrix approximation to self-attention.
  arXiv  Detail & Related papers  (2021-12-10T06:58:05Z)
• Adaptive Machine Learning for Time-Varying Systems: Low Dimensional Latent Space Tuning [91.3755431537592]
  We present a recently developed method of adaptive machine learning for time-varying systems. Our approach is to map very high (N>100k) dimensional inputs into the low dimensional (N2) latent space at the output of the encoder section of an encoder-decoder CNN. This method allows us to learn correlations within and to track their evolution in real time based on feedback without interrupts.
  arXiv  Detail & Related papers  (2021-07-13T16:05:28Z)
• DiffPD: Differentiable Projective Dynamics with Contact [65.88720481593118]
  We present DiffPD, an efficient differentiable soft-body simulator with implicit time integration. We evaluate the performance of DiffPD and observe a speedup of 4-19 times compared to the standard Newton's method in various applications.
  arXiv  Detail & Related papers  (2021-01-15T00:13:33Z)

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.