Metraipolis › archive › dc_f8be19293d39

GCS-Bridging: Restoring Connectivity of Disconnected Convex Sets for Graph-of-Convex-Sets Motion Planning — arXiv:2608.22326

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.22326
License (as archived)
CC0-1.0
Archived
2026-10-18T09:02:04.613Z
SHA-256 of the archived text
8f8250410218f96d048c9a90b73c4fbf0c6444e3efa2fa450cec6af4eb413648
Stable URL of this page
https://metraipolis.com/documento/dc_f8be19293d39

How to cite

GCS-Bridging: Restoring Connectivity of Disconnected Convex Sets for Graph-of-Convex-Sets Motion Planning — arXiv:2608.22326 — arXiv (en), https://arxiv.org/abs/2608.22326 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f8be19293d39 (Metraipolis archive dc_f8be19293d39, sha256 8f8250410218f96d048c9a90b73c4fbf0c6444e3efa2fa450cec6af4eb413648)
BibTeX
@misc{dcf8be19293d39,
  title = {GCS-Bridging: Restoring Connectivity of Disconnected Convex Sets for Graph-of-Convex-Sets Motion Planning — arXiv:2608.22326},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.22326},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f8be19293d39; sha256 8f8250410218f96d048c9a90b73c4fbf0c6444e3efa2fa450cec6af4eb413648},
  year = {2026}
}

Archived text

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

Graph-of-Convex-Sets (GCS)-based trajectory optimization represents collision-free regions in configuration space as a finite collection of convex sets and directly performs collision-free trajectory planning over these sets, substantially simplifying the planning process. However, existing GCS-based trajectory planning methods generally assume sufficient connectivity among the convex regions and do not explicitly address cases in which the start and goal regions belong to different connected components of the initial GCS map. To address this limitation, we propose GCS-Bridging, which reconnects disconnected convex regions through collision-free point paths followed by convex region inflation, thereby recovering the feasibility of otherwise disconnected GCS planning problems. Extensive simulations across multiple IRIS-related algorithms and scenarios demonstrate that GCS-Bridging restores missing start-to-goal connectivity in the initial GCS map with a 99.8% success rate. In addition, a hardware experiment on a single-arm Franka platform in a real-world scenario with initially disconnected start and goal regions validates the effectiveness of the proposed method in practical motion planning. Project website: this https URL

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-25 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2608.22326 — 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-18T08:57:47.857Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).