Showing cs.AIShow all
2 papers · 1 filter
cs.AI2025
GHOST: Solving the Traveling Salesman Problem on Graphs of Convex Sets
Jingtao Tang, Hang Ma
We study GCS-TSP, a new variant of the Traveling Salesman Problem (TSP) defined over a Graph of Convex Sets (GCS) -- a powerful representation for trajectory planning that decompos…
cs.AI2024
Multi-Robot Connected Fermat Spiral Coverage
Jingtao Tang, Hang Ma
We introduce the Multi-Robot Connected Fermat Spiral (MCFS), a novel algorithmic framework for Multi-Robot Coverage Path Planning (MCPP) that adapts Connected Fermat Spiral (CFS) f…