AI & ML
Reliable Conditioned Hamilton-Jacobi Reachability via Subsolution Learning on Exact Local Windows
arXiv cs.RO0 views
arXiv:2611.19088v1 Announce Type: cross Abstract: Hamilton-Jacobi (HJ) reachability computes the maximal safe set and a safety filter for a given obstacle configuration, but it must be re-solved whenever the obstacles change, which a deployed robot cannot afford. Learning a single value function conditioned on the obstacle set removes the re-solve, yet it sharpens the central weakness of learned reachability: one network must now cover a whole family of safety problems, and its approximation error carries no preferred sign, so rare obstacle configurations silently produce false-safe states. To address these challenges, we present a conditioned reachability model designed so that the remaining error falls on the conservative side. Specifically, our method caps the obstacle margin, which makes the value function provably local, in the sense that obstacles farther than a known threshold cannot affect it, so the model reads only a body-frame window, trains on small scenes, and transfers to scenes of any size with millisecond per-scene preparation. Moreover, the output structure builds the value bound into the model. By training with counterexample mining over the finite-dimensional window configuration space, we maximize the claimed safe volume subject to the HJ inequality, so the learned set grows toward the true safe set from the conservative side. Across all tested obstacle settings, ours is the only method that combines recovery comparable to per-scene DeepReach training with near-zero rollout collisions. We also extend the method to a 10D quadrotor, again with markedly lower collision rates than the baselines.
Source:https://arxiv.org/abs/2611.19088PreviousDependable Voice Command for Multi-UAV Swarms Using Small Language ModelsNextDistributed Shaping of Robot Swarms Through Spatial Moments of Arbitrary Order
Related posts
Microsoft Built Its Own Coding Model, and the Price Is the Point
0dev.to

El diario económico coreano Maeil Business cuenta 12 primeros puestos de Darwin en Hugging Face: cuéntalos tú con Python
0dev.to
Can Peer Review Survive AI-Generated Text? [pdf]
0Hacker News
Toward Planning Representations That Separate Task Structure from Visual Content
0arXiv cs.RO
Spectral Steering: Local Inverse Geometry for Frozen Diffusion Generators
0arXiv cs.RO
Representing Differential Inclusions as Monads: A Framework for Compositional Controller Synthesis
0arXiv cs.RO