Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets

Open in new window