Threshold Strategy for Leaking Corner-Free Hamilton-Jacobi Reachability with Decomposed Computations

2025-05-15

AI Summary

High-dimensional Hamilton–Jacobi (HJ) reachability analysis commonly relies on dimensionality reduction via subsystem decomposition to mitigate the “curse of dimensionality,” yet this introduces the “leakage-angle problem”: decoupling subsystems distorts the value function near state-space boundaries, compromising safety verification and optimal control reliability. This work formally defines the leakage-angle problem and derives necessary conditions for its occurrence. We then propose a threshold-driven local reinitialization algorithm that selectively applies lightweight, provably convergent value-function corrections only in regions where leakage angles are detected—avoiding costly global recomputation while preserving theoretical accuracy. Numerical experiments demonstrate that the method fully eliminates leakage-angle errors while retaining the computational speedup of decomposition, thereby significantly enhancing the trustworthiness of safety verification and control synthesis for high-dimensional systems.

Technology Category

• Reasoning under Uncertainty: Stochastic Optimization
• Planning, Routing, and Scheduling: Replanning and Plan Repair
• Intelligent Robots: State Estimation

Application Category

• Responsible Web: Human-perceived consequences of algorithmic deployment on the web
• Security and Privacy: Large-scale security measurements
• Systems and Infrastructure for Web, Mobile and WoT: Experiences and lessons learnt from Web-based algorithms and system deployments

Abstract

Hamilton-Jacobi (HJ) Reachability is widely used to compute value functions for states satisfying specific control objectives. However, it becomes intractable for high-dimensional problems due to the curse of dimensionality. Dimensionality reduction approaches are essential for mitigating this challenge, whereas they could introduce the ``leaking corner issue", leading to inaccuracies in the results. In this paper, we define the ``leaking corner issue"in terms of value functions, propose and prove a necessary condition for its occurrence. We then use these theoretical contributions to introduce a new local updating method that efficiently corrects inaccurate value functions while maintaining the computational efficiency of the dimensionality reduction approaches. We demonstrate the effectiveness of our method through numerical simulations. Although we validate our method with the self-contained subsystem decomposition (SCSD), our approach is applicable to other dimensionality reduction techniques that introduce the ``leaking corners".

Problem

• Addresses intractability in high-dimensional Hamilton-Jacobi Reachability problems
• Identifies and corrects leaking corner issue in value functions
• Proposes efficient local updating method for dimensionality reduction

Innovation

• Defines leaking corner issue via value functions
• Proposes local updating method for corrections
• Maintains efficiency in dimensionality reduction