Metraipolis › archive › dc_25a92563daf2

LARC: Lazy Adaptive Reachability Certification of Robot Manipulator Trajectories — arXiv:2608.29767

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.29767
License (as archived)
CC0-1.0
Archived
2026-10-17T10:06:49.962Z
SHA-256 of the archived text
69fd2fd66e65c835c2d91334c4448af30e6141df8fb57b27c443c6edabc174f5
Stable URL of this page
https://metraipolis.com/documento/dc_25a92563daf2

How to cite

LARC: Lazy Adaptive Reachability Certification of Robot Manipulator Trajectories — arXiv:2608.29767 — arXiv (en), https://arxiv.org/abs/2608.29767 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_25a92563daf2 (Metraipolis archive dc_25a92563daf2, sha256 69fd2fd66e65c835c2d91334c4448af30e6141df8fb57b27c443c6edabc174f5)
BibTeX
@misc{dc25a92563daf2,
  title = {LARC: Lazy Adaptive Reachability Certification of Robot Manipulator Trajectories — arXiv:2608.29767},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.29767},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_25a92563daf2; sha256 69fd2fd66e65c835c2d91334c4448af30e6141df8fb57b27c443c6edabc174f5},
  year = {2026}
}

Archived text

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

Discrete trajectory checks can miss collisions between sampled robot states. Reachability-based certification bounds motion between states, but uniform time partitions waste computation where clearance is large. We present lazy adaptive reachability certification (LARC), which checks a planned trajectory by bisecting only intervals with an inconclusive clearance test. For piecewise-cubic Hermite joint trajectories, the method bounds link occupancy using midpoint capsules inflated by exact componentwise speed maxima. Certified intervals covering the trajectory provide continuous-time external-obstacle clearance, subject to geometric containment, static obstacles, and a prescribed margin. On 160 AgileX PIPER trajectories from 80 start-goal pairs, LARC matched all decisions of the fixed-fine baseline at depth nine. It used 20328 interval evaluations (24.8% of baseline work), with a median paired speedup of 10.28x. A separate MoveIt/FCL audit checked 158051 states and detected collisions in 21 direct-interpolation controls, none of which LARC certified. The method reduced computation under a shared certificate model, but 27 of 139 sampled-clear trajectories remained uncertified. The sampled audit cannot independently prove continuous-time clearance.

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