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

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".

@article{he2025_2505.10020,
  title={ Threshold Strategy for Leaking Corner-Free Hamilton-Jacobi Reachability with Decomposed Computations },
  author={ Chong He and Mugilan Mariappan and Keval Vora and Mo Chen },
  journal={arXiv preprint arXiv:2505.10020},
  year={ 2025 }
}