Skip to content
arXiv Robotics — research abstracts· Kendra Givens, Taylor T. Johnson, Bryan C. Ward, Thomas Beckers·· 5 days agoSignalEditorial score75

ConDR: Conservative Reachability through Neural Hamilton-Jacobi Subsolutions

ConDR: Conservative Reachability through Neural Hamilton-Jacobi Subsolutions

Summary

This paper presents ConDR (Conservative DeepReach), a method for computing conservative reachability sets in dynamical systems using neural networks. Unlike previous approaches that may misclassify unsafe states as safe, ConDR enforces the learned value function to be a subsolution of the Hamilton-Jacobi-Isaacs variational inequality, ensuring safety guarantees by construction. The authors demonstrate ConDR on various benchmarks including Air3D, Air6D, multi-vehicle systems, and quadrotors, showing improved safety margins and robustness to model mismatch compared to baselines like DeepReach and MADR.

Editorial context

The authors introduce ConDR, a method that enforces conservative reachability by training a neural value function as a subsolution to the Hamilton-Jacobi-Isaacs variational inequality, thereby ensuring the identified unsafe set contains the true unsafe set within a bounded error margin.

Source: arXiv Robotics — research abstracts · Read original article ↗

Loading article text…

Source:arXiv Robotics — research abstracts · arxiv.org

Timezone · UTC

Article dates follow your selected timezone. Briefing editions use Hong Kong time (UTC+8).