Sampling-Based Planning Under STL Specifications: A Forward Invariance Approach
Gregorio Marchesini, Siyuan Liu, Lars Lindemann, Dimos V. Dimarogonas

TL;DR
This paper introduces a control-theoretic sampling-based planning method using a modified RRT* algorithm to synthesize trajectories satisfying STL specifications for linear systems, improving scalability and efficiency over existing optimization-based approaches.
Contribution
A novel framework encoding STL tasks into time-varying sets via linear programming, enabling efficient, scalable trajectory synthesis with formal guarantees.
Findings
Successfully applied to autonomous ISS inspection.
Achieved asymptotically optimal trajectories.
Ensured trajectories satisfy complex STL specifications.
Abstract
We propose a variant of the Rapidly Exploring Random Tree Star (RRT) algorithm to synthesize trajectories satisfying a given spatio-temporal specification expressed in a fragment of Signal Temporal Logic (STL) for linear systems. Previous approaches for planning trajectories under STL specifications using sampling-based methods leverage either mixed-integer or non-smooth optimization techniques, with poor scalability in the horizon and complexity of the task. We adopt instead a control-theoretic perspective on the problem, based on the notion of set forward invariance. Specifically, from a given STL task defined over polyhedral predicates, we develop a novel algorithmic framework by which the task is efficiently encoded into a time-varying set via linear programming, such that trajectories evolving within the set also satisfy the task. Forward invariance properties of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFormal Methods in Verification · AI-based Problem Solving and Planning · Robotic Path Planning Algorithms
MethodsADaptive gradient method with the OPTimal convergence rate · Sparse Evolutionary Training
