Perspectives on characteristics based curse-of-dimensionality-free numerical approaches for solving Hamilton-Jacobi equations

Abstract

This paper extends the considerations of the works [1, 2] regarding curse-of-dimensionality-free numerical approaches to solve certain types of Hamilton-Jacobi equations arising in optimal control problems, differential games and elsewhere. A rigorous formulation and justification for the extended Hopf-Lax formula of [2] is provided together with novel theoretical and practical discussions including useful recommendations. By using the method of characteristics, the solutions of some problem classes under convexity/concavity conditions on Hamiltonians (in particular, the solutions of Hamilton-Jacobi-Bellman equations in optimal control problems) are evaluated separately at different initial positions. This allows for the avoidance of the curse of dimensionality, as well as for choosing arbitrary computational regions. The corresponding feedback control strategies are obtained at selected positions without approximating the partial derivatives of the solutions. The results of numerical simulations demonstrate the high potential of the proposed techniques. It is also pointed out that, despite the indicated advantages, the related approaches still have a limited range of applicability, and their extensions to Hamilton-Jacobi-Isaacs equations in zero-sum two-player differential games are currently developed only for sufficiently narrow classes of control systems. That is why further extensions are worth investigating.

45 pages, 10 figures

References in corpus (1)

• Algorithm for Overcoming the Curse of Dimensionality for State-dependent Hamilton-Jacobi equations

Cited by in corpus (16)

• Adaptive Deep Learning for High-Dimensional Hamilton-Jacobi-Bellman Equations
• On some neural network architectures that can represent viscosity solutions of certain high dimensional Hamilton--Jacobi partial differential equations
• QRnet: optimal regulator design with LQR-augmented neural networks
• Optimal Feedback Law Recovery by Gradient-Augmented Sparse Polynomial Regression
• Neural network architectures using min-plus algebra for solving certain high dimensional optimal control problems and Hamilton-Jacobi PDEs
• Algorithms of Data Development For Deep Learning and Feedback Design
• Reliable optimal controls for SEIR models in epidemiology
• Deep neural network approximations for the stable manifolds of the Hamilton-Jacobi-Bellman equations
• Algorithm for Overcoming the Curse of Dimensionality for State-dependent Hamilton-Jacobi equations
• Overcoming the curse of dimensionality for some Hamilton--Jacobi partial differential equations via neural network architectures
• Algorithm for Hamilton-Jacobi equations in density space via a generalized Hopf formula
• Lax-Oleinik-type formulas and efficient algorithms for certain high-dimensional optimal control problems
• On representation formulas for optimal control: A Lagrangian perspective
• Density Propagation with Characteristics-based Deep Learning
• Hopf-type representation formulas and efficient algorithms for certain high-dimensional optimal control problems
• Exploiting characteristics in stationary action problems