A Curse-of-Dimensionality-Free Numerical Method for Solution of Certain HJB PDEs

نویسنده

  • William M. McEneaney
چکیده

In previous work of the author and others, max-plus methods have been explored for solution of first-order, nonlinear Hamilton-Jacobi-Bellman partial differential equations (HJB PDEs) and corresponding nonlinear control problems. These methods exploit the max-plus linearity of the associated semigroups. In particular, although the problems are nonlinear, the semigroups are linear in the max-plus sense. These methods have been used successfully to compute solutions. Although they provide certain computational-speed advantages, they still generally suffer from the curse-of-dimensionality. Here we consider HJB PDEs where the Hamiltonian takes the form of a (pointwise) maximum of linear/quadratic forms. The approach to solution will be rather general, but in order to ground the work, we consider only constituent Hamiltonians corresponding to long-run average-cost-per-unit-time optimal control problems for the development. We obtain a numerical method not subject to the curse-of-dimensionality. The method is based on construction of the dual-space semigroup corresponding to the HJB PDE. This dual-space semigroup is constructed from the dual-space semigroups corresponding to the constituent linear/quadratic Hamiltonians. The dual-space semigroup is particularly useful due to its form as a max-plus integral operator with kernel obtained from the originating semigroup. One considers repeated application of the dual-space semigroup to obtain the solution.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convergence Rate for a Curse-of-Dimensionality-Free Method for a Class of HJB PDEs

In previous work of the first author and others, max-plus methods have been explored for solution of first-order, nonlinear Hamilton–Jacobi–Bellman partial differential equations (HJB PDEs) and corresponding nonlinear control problems. Although max-plus basis expansion and max-plus finite-element methods can provide substantial computational-speed advantages, they still generally suffer from th...

متن کامل

Convergence Rate for a Curse-of-dimensionality-free Method for Hjb Pdes Represented as Maxima of Quadratic Forms

In previous work of the author and others, max-plus methods have been explored for solution of first-order, nonlinear Hamilton-Jacobi-Bellman partial differential equations (HJB PDEs) and corresponding nonlinear control problems. Although max-plus basis expansion and max-plus finite-element methods provide computational-speed advantages, they still generally suffer from the curse-of-dimensional...

متن کامل

Max-plus summation of Fenchel-transformed semigroups for solution of nonlinear Bellman equations

Max-plus methods have been explored for solution of first-order, nonlinear HamiltonJacobi-Bellman partial differential equations (HJB PDEs) and corresponding nonlinear control problems. These methods exploit the max-plus linearity of the associated semigroups. In particular, although the problems are nonlinear, the semigroups are linear in the max-plus sense. These methods have been used succes...

متن کامل

Suboptimal Feedback Control of PDEs by Solving HJB Equations on Adaptive Sparse Grids

An approach to solve nite time horizon sub-optimal feedback control problems for partial di erential equations is proposed by solving dynamic programming equations on adaptive sparse grids. The approach is illustrated for the wave equation and an extension to equations of Schrödinger type is indicated. A semi-discrete optimal control problem is introduced and the feedback control is derived fro...

متن کامل

Error Analysis for POD Approximations of Infinite Horizon Problems via the Dynamic Programming Approach

In this paper infinite horizon optimal control problems for nonlinear high-dimensional dynamical systems are studied. Nonlinear feedback laws can be computed via the value function characterized as the unique viscosity solution to the corresponding Hamilton-Jacobi-Bellman (HJB) equation which stems from the dynamic programming approach. However, the bottleneck is mainly due to the curse of dime...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Control and Optimization

دوره 46  شماره 

صفحات  -

تاریخ انتشار 2007