SOURCE-LINKED INTELLIGENCE

Sampling-based Certified Planning with Graphs of Convex Sets

arXiv · AI, language, vision and robotics · article · Aug 30, 2026 · UTC

Planners on graphs of convex sets return trajectories that are collision-free by construction, provided the convex regions are collision-free. The region generator only promises that property probabilistically, and no planner in the family verifies it. We report the first measurement of what the gap costs. On a scaled 14-DOF bimanual library, $3.2\%$ of interface samples are in collision, and a search-based GCS planner (\gcsstar) turns that volume error into a $62\%$ answer error: $18$ of $29$ pick-and-place queries return trajectories that drive the arms through the shelves, up to $91$\,mm de

Read original source ↗ Open in workspace

recordType

paper

region

Global