MechE Colloquium: From Motion to Mission Planning via Augmented Graphs of Convex Sets
Tyler Summers · The University of Texas at Dallas
Tue, Oct 6, 2026 · 10:00 UTC
Robot missions require both collision-free trajectories and logical task ordering, such as collecting a resource before entering a restricted region. Augmented graphs of convex sets combine continuous trajectory optimization and discrete task sequencing in one problem. A layered graph constructed from an exact convex partition of free space selects an optimal task order and trajectory through a shortest-path calculation, exact up to finite Bézier parameterization. Its structure corresponds to Bellman–Held–Karp dynamic programming for the travelling-salesperson problem, retaining singly exponen