Value Approximation for Two-Player General-Sum Differential Games with State Constraints
Not on the map. Why?
Abstract (arXiv)
Solving Hamilton-Jacobi-Isaacs (HJI) PDEs numerically enables equilibrial feedback control in two-player differential games, yet faces the curse of dimensionality (CoD). While physics-informed neural networks (PINNs) have shown promise in alleviating CoD in solving PDEs, vanilla PINNs fall short in learning discontinuous solutions due to their sampling nature, leading to poor safety performance of the resulting policies when values are discontinuous due to state or temporal logic constraints. In this study, we explore three potential solutions to this challenge: (1) a hybrid learning method that is guided by both supervisory equilibria and the HJI PDE, (2) a value-hardening method where a sequence of HJIs are solved with increasing Lipschitz constant on the constraint violation penalty, and (3) the epigraphical technique that lifts the value to a higher dimensional state space where it becomes continuous. Evaluations through 5D and 9D vehicle and 13D drone simulations reveal that the hybrid method outperforms others in terms of generalization and safety performance by taking advantage of both the supervisory equilibrium values and costates, and the low cost of PINN loss gradients.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 27 of its 69 references that are in the map. First posted on arXiv 28 Nov 2023.
Builds on
27 of 69 references.
References · 27
- 2016Gaussian Error Linear Units (GELUs)cited by 3,502
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,238
- 2020Conservative Q-Learning for Offline Reinforcement Learningcited by 1,809
- 2017Solving high-dimensional partial differential equations using deep learningcited by 556
- 2019Frequency Principle: Fourier Analysis Sheds Light on Deep Neural Networkscited by 368
- 2017Learning with Opponent-Learning Awarenesscited by 222
- 2017Optimal approximation of piecewise smooth functions using deep ReLU neural networkscited by 179
- 2020DeepReach: A Deep Learning Approach to High-Dimensional Reachabilitycited by 91
- 2023The Safety Filter: A Unified View of Safety-Critical Control in Autonomous Systemscited by 88
- 2020Algorithms for Solving High Dimensional PDEs: From Nonlinear Monte Carlo to Machine Learningcited by 77
- 2018Deep Learning of Vortex Induced Vibrationscited by 76
- 2018Convergence of the Deep BSDE Method for Coupled FBSDEscited by 43
15 more
- 2020Reach-SDP: Reachability Analysis of Closed-Loop Systems with Neural Network Controllers via Semidefinite Programmingcited by 43
- 2021Reachability Analysis of Neural Feedback Loopscited by 41
- 2019Adaptive Deep Learning for High-Dimensional Hamilton-Jacobi-Bellman Equationscited by 40
- 2019Efficient Iterative Linear-Quadratic Approximations for Nonlinear Multi-Player General-Sum Differential Gamescited by 37
- 2020When Humans Aren't Optimal: Robots that Collaborate with Risk-Aware Humanscited by 34
- 2018Probabilistic Prediction of Interactive Driving Behavior via Hierarchical Inverse Reinforcement Learningcited by 28
- 2020On Infusing Reachability-Based Safety Assurance within Planning Frameworks for Human-Robot Vehicle Interactionscited by 25
- 2022Reachability Analysis of a General Class of Neural Ordinary Differential Equationscited by 13
- 2022OptimizedDP: An Efficient, User-friendly Library For Optimal Control and Dynamic Programmingcited by 11
- 2022Generating Formal Safety Assurances for High-Dimensional Reachabilitycited by 11
- 2018Bayesian Persuasive Drivingcited by 5
- 2020When Shall I Be Empathetic? The Utility of Empathetic Parameter Estimation in Multi-Agent Interactionscited by 5
- 2022Approximating Discontinuous Nash Equilibrial Values of Two-Player General-Sum Differential Gamescited by 5
- 2020Seeking Nash equilibrium in non-cooperative differential gamescited by 2
- 2022Automated Reachability Analysis of Neural Network-Controlled Systems via Adaptive Polytopescited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.