Metraipolis › archive › dc_d5ea73d32391

Gradient-Free Neural Hamilton-Jacobi Reachability for Scalable Safety-Critical Control — arXiv:2609.14087

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14087
License (as archived)
CC0-1.0
Archived
2026-10-16T02:14:28.518Z
SHA-256 of the archived text
82b74cba445a6d7c7ba61f91c388c0a2098a1e32963970b510221b912663c475
Stable URL of this page
https://metraipolis.com/documento/dc_d5ea73d32391

How to cite

Gradient-Free Neural Hamilton-Jacobi Reachability for Scalable Safety-Critical Control — arXiv:2609.14087 — arXiv (en), https://arxiv.org/abs/2609.14087 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d5ea73d32391 (Metraipolis archive dc_d5ea73d32391, sha256 82b74cba445a6d7c7ba61f91c388c0a2098a1e32963970b510221b912663c475)
BibTeX
@misc{dcd5ea73d32391,
  title = {Gradient-Free Neural Hamilton-Jacobi Reachability for Scalable Safety-Critical Control — arXiv:2609.14087},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14087},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d5ea73d32391; sha256 82b74cba445a6d7c7ba61f91c388c0a2098a1e32963970b510221b912663c475},
  year = {2026}
}

Archived text

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

Hamilton-Jacobi (HJ) reachability provides a principled framework for synthesizing safety certificates and robust controllers for safety-critical robotic systems. However, applying reachability analysis to high-dimensional nonlinear systems remains challenging: classical grid-based solvers suffer from the curse of dimensionality, continuous-time neural solvers require accurate spatial value gradients, and reinforcement-learning-based approaches often suffer from weak boundary anchoring and non-stationary adversarial policy optimization. We propose a discrete-time neural reachability framework for control-disturbance-affine systems that learns backward reachable tubes (BRTs) and backward reach-avoid tubes (BRATs) through Bellman-Isaacs value propagation. Our key idea is to combine equation-driven self-supervision with structured policy learning: rather than computing explicit PDE-gradients, we exploit the bang-bang structure of optimal safety interventions to construct approximate teacher actions from gradient-free value probes, converting adversarial actor learning into supervised policy learning. To stabilize long-horizon value propagation, we leverage the learned actor to train the value function backward from the terminal boundary using a windowed temporal curriculum, where each window is used as the boundary condition for the next window. Across benchmark problems up to 80 dimensions, our method learns accurate reachability value functions while improving stability over existing learning-based solvers. We further demonstrate observation-space scalability on F1-tenth racing with over 16,000-dimensional egocentric inputs. The learned safety filter generalizes zero-shot to unseen tracks and transfers to a physical RC car, achieving real-time robust collision avoidance.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-15 in cs.RO).
Categorie arXiv: Robotics (cs.RO) ; Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2609.14087 — 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-16T01:52:32.311Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).