Metraipolis › archive › dc_2115d56e137d
Planning along Differentiable Charts of Constraint Manifolds with General-Purpose IK Solvers — arXiv:2609.10905
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.10905
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:35:54.952Z
- SHA-256 of the archived text
136aeab1c22b36f85b8a01fa6511a55618fa77dab5bd45944318fee5c87ad161- Stable URL of this page
https://metraipolis.com/documento/dc_2115d56e137d
How to cite
Planning along Differentiable Charts of Constraint Manifolds with General-Purpose IK Solvers — arXiv:2609.10905 — arXiv (en), https://arxiv.org/abs/2609.10905 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2115d56e137d (Metraipolis archive dc_2115d56e137d, sha256 136aeab1c22b36f85b8a01fa6511a55618fa77dab5bd45944318fee5c87ad161)
BibTeX
@misc{dc2115d56e137d,
title = {Planning along Differentiable Charts of Constraint Manifolds with General-Purpose IK Solvers — arXiv:2609.10905},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.10905},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2115d56e137d; sha256 136aeab1c22b36f85b8a01fa6511a55618fa77dab5bd45944318fee5c87ad161},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.10905. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Planning trajectories for robot manipulators under kinematic equality constraints restricts feasible motions to a measure-zero submanifold of the configuration space, requiring special algorithmic treatment. A promising strategy is parametrizing the set of feasible configurations using analytic inverse kinematics (IK). Bespoke analytic IK functions can be written to be differentiable, a necessary property for gradient-based trajectory optimization. But the vast majority of IK functions are computed by automated meta-solvers like IKFast, and are difficult to modify for differentiability. We present a new approach for computing gradients of analytic IK parameterizations: we leverage the inverse function theorem to recover the desired gradients from the ordinary forward kinematic Jacobian. Furthermore, we present a least-squares domain extension and an optimization-amenable description of the reachability constraint, which preserves gradient signal outside the reachable workspace. We demonstrate the efficacy of our approach through numerical experiments and downstream tasks, including a hardware demonstration of an RB-Y1 picking up a box and placing it on a table. Project website: this https URL Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-11 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.10905 — 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-16T06:10:18.204Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).