Metraipolis › archive › dc_703bd3291efb

PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds — arXiv:2608.05586

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.05586
License (as archived)
CC0-1.0
Archived
2026-10-31T10:38:12.999Z
SHA-256 of the archived text
e17f126be2c63472e41139a6d407871978f52b30f2a968259a041454c2eba3da
Stable URL of this page
https://metraipolis.com/documento/dc_703bd3291efb

How to cite

PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds — arXiv:2608.05586 — arXiv (en), https://arxiv.org/abs/2608.05586 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_703bd3291efb (Metraipolis archive dc_703bd3291efb, sha256 e17f126be2c63472e41139a6d407871978f52b30f2a968259a041454c2eba3da)
BibTeX
@misc{dc703bd3291efb,
  title = {PathCover: A Fast Convex Decomposition along a Path via Randomized Iterative Space Partitioning (RISP) on Point Clouds — arXiv:2608.05586},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.05586},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_703bd3291efb; sha256 e17f126be2c63472e41139a6d407871978f52b30f2a968259a041454c2eba3da},
  year = {2026}
}

Archived text

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

Autonomous robot navigation requires rapid construction of obstacle-points-separated convex regions for trajectory planning. When obstacles are represented as point clouds from LiDAR or depth cameras, these regions must be constructed directly from finite obstacle samples while providing suitable constraints for downstream optimization. However, existing corridor-generation methods often struggle to meet real-time, sensor-rate computational requirements. To address this bottleneck, we introduce RISP, a randomized algorithm that constructs convex polytopes from finite point-cloud data, and PathCover, which chains these polytopes along a reference path to form an overlapping corridor. We prove finite termination, sequential intersection, and complete path coverage with respect to the supplied finite point set. Under a probabilistic elimination condition, the sampling-and-elimination stage of RISP has expected O(n) time and unconditional worst-case O(n^2) time. Extensive benchmarks on synthetic and real-world LiDAR datasets demonstrate an order-of-magnitude speedup over state-of-the-art methods in both corridor generation as well as trajectory optimization, while closed-loop quadrotor simulation and a physical quadruped traversal demonstrate integration with downstream motion planners. These results establish corridor separation from the supplied point-cloud representation and practical implementation feasibility. Source code of the entire pipeline is available at this https URL .

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