Metraipolis › archive › dc_afc99af48637

Control Barrier Functions for Safety-Aware Latent-Space Motion Planning — arXiv:2611.01814

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01814
License (as archived)
CC0-1.0
Archived
2026-11-03T18:18:12.052Z
SHA-256 of the archived text
c402fea41b5b0ac43340d4d46ab163f2163d3302f63cacb3f969489e42b2b563
Stable URL of this page
https://metraipolis.com/documento/dc_afc99af48637

How to cite

Control Barrier Functions for Safety-Aware Latent-Space Motion Planning — arXiv:2611.01814 — arXiv (en), https://arxiv.org/abs/2611.01814 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_afc99af48637 (Metraipolis archive dc_afc99af48637, sha256 c402fea41b5b0ac43340d4d46ab163f2163d3302f63cacb3f969489e42b2b563)
BibTeX
@misc{dcafc99af48637,
  title = {Control Barrier Functions for Safety-Aware Latent-Space Motion Planning — arXiv:2611.01814},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01814},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_afc99af48637; sha256 c402fea41b5b0ac43340d4d46ab163f2163d3302f63cacb3f969489e42b2b563},
  year = {2026}
}

Archived text

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

Latent-space path planning (LSPP) compresses the configuration space of a robotic manipulator into a compact, differentiable manifold learned by a variational autoencoder, enabling fast gradient-based planning without explicit inverse kinematics. Existing LSPP frameworks enforce obstacle avoidance with a binary collision classifier, whose saturated gradients near obstacle boundaries and lack of temporal structure cause the optimizer to stall and provide no forward-invariance guarantee. We replace the classifier with a neural control barrier function (CBF) learned directly in the latent space. The barrier is trained with a three-term objective that combines safe and unsafe sign constraints with a discrete-time decrease condition evaluated on transitions of an obstacle-blind nominal planner, and it is enforced at planning time by a closed-form, first-order correction that projects each goal-directed latent step back onto the CBF constraint. On a 7-DoF Franka Panda manipulator, the CBF planner achieves a 75.6\% success rate on a fixed-obstacle task, 12.0 percentage points above the best of 35 tuned classifier configurations, and 83.8\% on a multi-position task. A sweep of the decay rate $\alpha$ characterizes the safety--performance trade-off, with the best operating points in $\alpha \in [0.10, 0.20]$. In a fully general random-obstacle setting, success drops to 33.0\%, which we trace to covariate shift between the obstacle-blind training transitions and the states visited by the corrected planner.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Robotics (cs.RO) ; Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2611.01814 — 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-11-03T18:09:53.628Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).