2 papers
cs.RO2025
Mixed Discrete and Continuous Planning using Shortest Walks in Graphs of Convex Sets
Savva Morozov, Tobia Marcucci, Bernhard Paus Graesdal +3
We study the Shortest-Walk Problem (SWP) in a Graph of Convex Sets (GCS). A GCS is a graph where each vertex is paired with a convex program, and each edge couples adjacent program…
cs.RO2024
Multi-Query Shortest-Path Problem in Graphs of Convex Sets
Savva Morozov, Tobia Marcucci, Alexandre Amice +4
The Shortest-Path Problem in Graph of Convex Sets (SPP in GCS) is a recently developed optimization framework that blends discrete and continuous decision making. Many relevant pro…