Shortest walks in graphs of convex sets, guided by SDP-computed cost-to-go lower bounds, provide a unified approximate planner for robot motion, skill chaining, and hybrid control.
Survey of numerical methods for trajectory optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.RO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets
Shortest walks in graphs of convex sets, guided by SDP-computed cost-to-go lower bounds, provide a unified approximate planner for robot motion, skill chaining, and hybrid control.