Exact Imposition of Safety Boundary Conditions in Neural Reachable Tubes (2404.00814v2)
Abstract: Hamilton-Jacobi (HJ) reachability analysis is a widely adopted verification tool to provide safety and performance guarantees for autonomous systems. However, it involves solving a partial differential equation (PDE) to compute a safety value function, whose computational and memory complexity scales exponentially with the state dimension, making its direct application to large-scale systems intractable. To overcome these challenges, DeepReach, a recently proposed learning-based approach, approximates high-dimensional reachable tubes using neural networks (NNs). While shown to be effective, the accuracy of the learned solution decreases with system complexity. One of the reasons for this degradation is a soft imposition of safety constraints during the learning process, which corresponds to the boundary conditions of the PDE, resulting in inaccurate value functions. In this work, we propose ExactBC, a variant of DeepReach that imposes safety constraints exactly during the learning process by restructuring the overall value function as a weighted sum of the boundary condition and the NN output. Moreover, the proposed variant no longer needs a boundary loss term during the training process, thus eliminating the need to balance different loss terms. We demonstrate the efficacy of the proposed approach in significantly improving the accuracy of the learned value function for four challenging reachability tasks: a rimless wheel system with state resets, collision avoidance in a cluttered environment, autonomous rocket landing, and multi-aircraft collision avoidance.
- S. Bansal, M. Chen, S. Herbert, and C. J. Tomlin, “Hamilton-jacobi reachability: A brief overview and recent advances,” in IEEE 56th Annual Conference on Decision and Control (CDC), 2017, pp. 2242–2253.
- I. M. Mitchell, A. M. Bayen, and C. J. Tomlin, “A time-dependent hamilton-jacobi formulation of reachable sets for continuous dynamic games,” IEEE Transactions on automatic control, vol. 50, no. 7, pp. 947–957, 2005.
- J. Lygeros, “On reachability and minimum cost optimal control,” Automatica, vol. 40, no. 6, pp. 917–927, 2004.
- J. F. Fisac, M. Chen, C. J. Tomlin, and S. S. Sastry, “Reach-avoid problems with time-varying dynamics, targets and constraints,” in Proceedings of the 18th international conference on hybrid systems: computation and control, 2015, pp. 11–20.
- W. Liao, T. Liang, P. Xiong, C. Wang, A. Song, and P. X. Liu, “An improved level set method for reachability problems in differential games,” IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2024.
- S. Bansal and C. J. Tomlin, “Deepreach: A deep learning approach to high-dimensional reachability,” in 2021 IEEE International Conference on Robotics and Automation (ICRA), pp. 1817–1824.
- V. Sitzmann, J. Martel, A. Bergman, D. Lindell, and G. Wetzstein, “Implicit neural representations with periodic activation functions,” in Advances in Neural Information Processing Systems, 2020, H. Larochelle, M. Ranzato, R. Hadsell, M. Balcan, and H. Lin, Eds., vol. 33. Curran Associates, Inc., pp. 7462–7473.
- M. Raissi, P. Perdikaris, and G. E. Karniadakis, “Physics-informed neural networks: A deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations,” Journal of Computational physics, vol. 378, pp. 686–707, 2019.
- J. Darbon and S. Osher, “Algorithms for overcoming the curse of dimensionality for certain hamilton–jacobi equations arising in control theory and elsewhere,” Research in the Mathematical Sciences, vol. 3, no. 1, p. 19, 2016.
- Y. T. Chow, J. Darbon, S. Osher, and W. Yin, “Algorithm for overcoming the curse of dimensionality for time-dependent non-convex hamilton–jacobi equations arising from optimal control and differential games problems,” Journal of Scientific Computing, vol. 73, pp. 617–643, 2017.
- D. Lee and C. J. Tomlin, “A hopf-lax formula in hamilton–jacobi analysis of reach-avoid problems,” IEEE Control Systems Letters, vol. 5, no. 3, pp. 1055–1060, 2020.
- S. Coogan and M. Arcak, “Efficient finite abstraction of mixed monotone systems,” in Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control, 2015, pp. 58–67.
- M. Chen and C. J. Tomlin, “Exact and efficient hamilton-jacobi reachability for decoupled systems,” in 54th IEEE Conference on Decision and Control (CDC), 2015, pp. 1297–1303.
- C. He, Z. Gong, M. Chen, and S. Herbert, “Efficient and guaranteed hamilton–jacobi reachability via self-contained subsystem decomposition and admissible control sets,” IEEE Control Systems Letters, vol. 7, pp. 3824–3829, 2023.
- J. Darbon, G. P. Langlois, and T. Meng, “Overcoming the curse of dimensionality for some hamilton–jacobi partial differential equations via neural network architectures,” Research in the Mathematical Sciences, vol. 7, pp. 1–50, 2020.
- K. Niarchos and J. Lygeros, “A neural approximation to continuous time reachability computations,” in Proceedings of the 45th IEEE Conference on Decision and Control, 2006, pp. 6313–6318.
- B. Djeridane and J. Lygeros, “Neural approximation of pde solutions: An application to reachability computations,” in Proceedings of the 45th IEEE Conference on Decision and Control, 2006, pp. 3034–3039.
- V. Rubies-Royo and C. Tomlin, “Recursive regression with neural networks: Approximating the hji pde solution,” arXiv preprint arXiv:1611.02739, 2016.
- F. Jiang, G. Chou, M. Chen, and C. J. Tomlin, “Using neural networks to compute approximate and guaranteed feasible hamilton-jacobi-bellman pde solutions,” arXiv preprint arXiv:1611.03158, 2016.
- N. Sukumar and A. Srivastava, “Exact imposition of boundary conditions with distance functions in physics-informed deep neural networks,” Computer Methods in Applied Mechanics and Engineering, vol. 389, p. 114333, 2022.
- S. Wang, Y. Teng, and P. Perdikaris, “Understanding and mitigating gradient pathologies in physics-informed neural networks,” arXiv preprint arXiv:2001.04536, 2020.
- J. Chen, R. Du, and K. Wu, “A comparison study of deep galerkin method and deep ritz method for elliptic problems with different boundary conditions,” arXiv preprint arXiv:2005.04554, 2020.
- N. Saad, G. Gupta, S. Alizadeh, and D. C. Maddix, “Guiding continuous operator learning through physics-based boundary constraints,” arXiv preprint arXiv:2212.07477, 2022.
- Z. Li, N. Kovachki, K. Azizzadenesheli, B. Liu, K. Bhattacharya, A. Stuart, and A. Anandkumar, “Fourier neural operator for parametric partial differential equations,” arXiv preprint arXiv:2010.08895, 2020.
- Z. Li, H. Zheng, N. Kovachki, D. Jin, H. Chen, B. Liu, K. Azizzadenesheli, and A. Anandkumar, “Physics-informed neural operator for learning partial differential equations,” arXiv preprint arXiv:2111.03794, 2021.
- I. E. Lagaris, A. Likas, and D. I. Fotiadis, “Artificial neural networks for solving ordinary and partial differential equations,” IEEE transactions on neural networks, vol. 9, no. 5, pp. 987–1000, 1998.
- A. Lin and S. Bansal, “Generating formal safety assurances for high-dimensional reachability,” in 2023 IEEE International Conference on Robotics and Automation (ICRA), pp. 10 525–10 531.
- M. Campi and S. Garatti, “A sampling-and-discarding approach to chance-constrained optimization: Feasibility and optimality,” Journal of Optimization Theory and Applications, vol. 148, pp. 257–280, 02 2011.
- M. Campi, S. Garatti, and M. Prandini, “The scenario approach for systems and control design,” Annual Reviews in Control, vol. 33, pp. 149–157, 12 2009.