Metraipolis › archive › dc_ace3f46344fe

Accelerating Optimization over Graphs of Convex Sets via Neural Network Approximations — arXiv:2608.15440

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15440
License (as archived)
CC0-1.0
Archived
2026-10-18T23:05:48.151Z
SHA-256 of the archived text
5bd4778d812dd156507a09f7f4b6a8e2d0e016d8c4ea6e9be9fad233a12f181c
Stable URL of this page
https://metraipolis.com/documento/dc_ace3f46344fe

How to cite

Accelerating Optimization over Graphs of Convex Sets via Neural Network Approximations — arXiv:2608.15440 — arXiv (en), https://arxiv.org/abs/2608.15440 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ace3f46344fe (Metraipolis archive dc_ace3f46344fe, sha256 5bd4778d812dd156507a09f7f4b6a8e2d0e016d8c4ea6e9be9fad233a12f181c)
BibTeX
@misc{dcace3f46344fe,
  title = {Accelerating Optimization over Graphs of Convex Sets via Neural Network Approximations — arXiv:2608.15440},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15440},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ace3f46344fe; sha256 5bd4778d812dd156507a09f7f4b6a8e2d0e016d8c4ea6e9be9fad233a12f181c},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15440. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Motion planning problems such as collision-free navigation and contact-rich manipulation can be naturally formulated as optimization problems that couple discrete decisions with continuous trajectories. The Graphs of Convex Sets (GCS) framework offers a practical solution to these problems. It represents discrete decisions as nodes of a graph and encodes continuous trajectories in the edges connecting them. However, the resulting optimization subproblems can become computationally prohibitive for online replanning. In this work, we propose a learning-based strategy to mitigate this limitation. Specifically, we replace the costly convex relaxation step required by nominal GCS with a single forward pass through a Graph Attention Network that predicts a set of highly probable candidate paths through the graph. A lightweight ranking network then orders these candidates by their estimated trajectory cost. Evaluating them in this order, we terminate our search early while still recovering a near-optimal motion plan. We validate the resulting pipeline across diverse robotic tasks, including collision-free motion planning for a 3D quadrotor and a 7-DoF manipulator, and planning through contact for planar pushing. Across both convex and non-convex cost and constraint settings, our approach yields up to two orders of magnitude speedup over nominal GCS while maintaining a 100% success rate, at the cost of some suboptimality in the recovered solutions. Code implementations and video demonstrations can be found at this https URL .

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-18 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2608.15440 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T23:01:50.352Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).