Framework encodes key-door precedence logic in a layered augmented graph of convex sets for simultaneous optimal sequence selection and continuous trajectory computation with STL specs.
Impl icit graph search for planning on graphs of convex sets,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Framework for Motion Planning with Temporal Logic Precedence Specifications via Augmented Graphs of Convex Sets
Framework encodes key-door precedence logic in a layered augmented graph of convex sets for simultaneous optimal sequence selection and continuous trajectory computation with STL specs.