The STL motion-planning problem is reformulated as a shortest-path problem over a graph of convex sets to generate smooth Bézier-spline trajectories satisfying logical, timing, smoothness, and velocity constraints.
The benefits of relaxing punctuality,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.RO 2years
2026 2representative citing papers
Ternary logic encodings of temporal behavior trees enable mixed-integer linear programming for correct-by-construction control synthesis in linear systems.
citing papers explorer
-
Signal Temporal Logic Motion Planning via Graphs of Convex Sets
The STL motion-planning problem is reformulated as a shortest-path problem over a graph of convex sets to generate smooth Bézier-spline trajectories satisfying logical, timing, smoothness, and velocity constraints.
-
Ternary Logic Encodings of Temporal Behavior Trees with Application to Control Synthesis
Ternary logic encodings of temporal behavior trees enable mixed-integer linear programming for correct-by-construction control synthesis in linear systems.