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.
Shortest paths in graphs of convex sets,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.RO 2years
2026 2representative citing papers
Lazy BPRC finds optimal solutions for MT-VRP-O up to 10x faster than ablations by deferring exact motion planning costs via relaxed-continuity lower bounds in branch-and-price.
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.
-
Optimal Solutions for the Moving Target Vehicle Routing Problem with Obstacles via Lazy Branch and Price
Lazy BPRC finds optimal solutions for MT-VRP-O up to 10x faster than ablations by deferring exact motion planning costs via relaxed-continuity lower bounds in branch-and-price.