Feedback Motion Planning for Stochastic Nonlinear Systems with Signal Temporal Logic Specifications

• URL: http://arxiv.org/abs/2605.02361v1
• Date: Mon, 04 May 2026 09:02:16 GMT
• Title: Feedback Motion Planning for Stochastic Nonlinear Systems with Signal Temporal Logic Specifications
• Abstract summary: 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.
• Score: 25.484834028091083
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study feedback motion planning for continuous-time stochastic nonlinear systems under signal temporal logic (STL) specifications. We propose a framework that synthesizes control policies for chance-constrained STL trajectory optimization problems, with the goal of ensuring that the closed-loop stochastic system satisfies a given STL formula with high probability (e.g., 99.99\%). Our approach is based on a predicate erosion strategy that transforms the intractable stochastic problem into a deterministic STL trajectory optimization problem with tightened STL formula constraints. The amount of erosion is determined by a probabilistic reachable tube (PRT) that bounds the deviation between the stochastic trajectory and an associated nominal trajectory. To compute such bounds, we leverage contraction theory and feedback design, and develop several tracking controllers. This yields a complete feedback motion planning pipeline which can be implemented by numerical optimizations. We demonstrate the efficacy and versatility of the proposed framework through simulations on several robotic systems and through experiments on a real-world quadrupedal robot, and show that it is less conservative and achieves higher specification satisfaction probability than representative baselines.

Related papers

• pdSTL: Probabilistic Differentiable Signal Temporal Logic for Stochastic Systems [0.0]
  We introduce pdSTL (probabilistic differentiable Signal Temporal Logic), a framework that unifies probabilistic semantics with differentiable robustness over belief trajectories.<n>Results demonstrate that pdSTL efficient optimization with formal probabilistic guarantees, significantly outperforming deterministic differentiable STL in maintaining safety margins under real-world uncertainty.
  arXiv  Detail & Related papers  (2026-06-17T20:01:56Z)
• 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)
• Statistical Contraction for Chance-Constrained Trajectory Optimization of Non-Gaussian Stochastic Systems [0.0]
  Our framework employs conformal inference to generate confidence sets for the closed-loop dynamics around arbitrary reference trajectories.<n>Via appropriate constraint tightening, chance constraints can be reformulated into tractable, statistically valid deterministic constraints on the reference trajectories.<n>This enables a formal pathway to leverage and validate learning-based motion planners and controllers, such as those with neural contraction metrics, in safety-critical real-world applications.
  arXiv  Detail & Related papers  (2026-03-07T08:01:20Z)
• 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)
• Multi-Robot Trajectory Planning via Constrained Bayesian Optimization and Local Cost Map Learning with STL-Based Conflict Resolution [1.6243762297989983]
  We address multi-robot motion planning under Signal Temporal Logic (STL) specifications with kinodynamic constraints.<n>We propose a two-stage framework integrating sampling-based online learning with formal STL reasoning.
  arXiv  Detail & Related papers  (2026-03-06T00:03:18Z)
• 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)
• Directed Exploration in Reinforcement Learning from Linear Temporal Logic [59.707408697394534]
  Linear temporal logic (LTL) is a powerful language for task specification in reinforcement learning.<n>We show that the synthesized reward signal remains fundamentally sparse, making exploration challenging.<n>We show how better exploration can be achieved by further leveraging the specification and casting its corresponding Limit Deterministic B"uchi Automaton (LDBA) as a Markov reward process.
  arXiv  Detail & Related papers  (2024-08-18T14:25:44Z)
• A Unifying Variational Framework for Gaussian Process Motion Planning [44.332875416815384]
  We introduce a framework for robot motion planning based on variational Gaussian processes. Our framework provides a principled and flexible way to incorporate equality-based, inequality-based, and soft motion-planning constraints. Results show that our proposed approach yields a good balance between success rates and path quality.
  arXiv  Detail & Related papers  (2023-09-02T07:51:29Z)
• Provable Guarantees for Generative Behavior Cloning: Bridging Low-Level Stability and High-Level Behavior [51.60683890503293]
  We propose a theoretical framework for studying behavior cloning of complex expert demonstrations using generative modeling. We show that pure supervised cloning can generate trajectories matching the per-time step distribution of arbitrary expert trajectories.
  arXiv  Detail & Related papers  (2023-07-27T04:27:26Z)
• Formal Controller Synthesis for Markov Jump Linear Systems with Uncertain Dynamics [64.72260320446158]
  We propose a method for synthesising controllers for Markov jump linear systems. Our method is based on a finite-state abstraction that captures both the discrete (mode-jumping) and continuous (stochastic linear) behaviour of the MJLS. We apply our method to multiple realistic benchmark problems, in particular, a temperature control and an aerial vehicle delivery problem.
  arXiv  Detail & Related papers  (2022-12-01T17:36:30Z)
• Gaussian Process-based Min-norm Stabilizing Controller for Control-Affine Systems with Uncertain Input Effects and Dynamics [90.81186513537777]
  We propose a novel compound kernel that captures the control-affine nature of the problem. We show that this resulting optimization problem is convex, and we call it Gaussian Process-based Control Lyapunov Function Second-Order Cone Program (GP-CLF-SOCP)
  arXiv  Detail & Related papers  (2020-11-14T01:27:32Z)
• Reinforcement Learning Based Temporal Logic Control with Maximum Probabilistic Satisfaction [5.337302350000984]
  This paper presents a model-free reinforcement learning algorithm to synthesize a control policy. The effectiveness of the RL-based control synthesis is demonstrated via simulation and experimental results.
  arXiv  Detail & Related papers  (2020-10-14T03:49:16Z)
• Adaptive Control and Regret Minimization in Linear Quadratic Gaussian (LQG) Setting [91.43582419264763]
  We propose LqgOpt, a novel reinforcement learning algorithm based on the principle of optimism in the face of uncertainty. LqgOpt efficiently explores the system dynamics, estimates the model parameters up to their confidence interval, and deploys the controller of the most optimistic model.
  arXiv  Detail & Related papers  (2020-03-12T19:56:38Z)

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.