Dynamic programming using radial basis functions
From MaRDI portal
Abstract: We propose a discretization of the optimality principle in dynamic programming based on radial basis functions and Shepard's moving least squares approximation method. We prove convergence of the approximate optimal value function to the true one and present several numerical experiments.
Recommendations
- Suboptimal solutions to dynamic optimization problems via approximations of the policy functions
- Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results
- On a discrete approximation of the Hamilton-Jacobi equation of dynamic programming
- Continuous state dynamic programming via nonexpansive approximation
- scientific article; zbMATH DE number 3995473
Cites work
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 4061056 (Why is no real title available?)
- scientific article; zbMATH DE number 3509023 (Why is no real title available?)
- scientific article; zbMATH DE number 811904 (Why is no real title available?)
- A numerical approach to the infinite horizon problem of deterministic control theory
- A radial basis collocation method for Hamilton-Jacobi-Bellman equations
- A set oriented approach to global optimal control
- A set oriented approach to optimal feedback stabilization
- A unified theory of radial basis functions. Native Hilbert spaces for radial basis functions. II
- Adaptive greedy techniques for approximate solution of large RBF systems
- An adaptive grid scheme for the discrete Hamilton-Jacobi-Bellman equation
- An adaptive least-squares collocation radial basis function method for the HJB equation
- An efficient algorithm for Hamilton-Jacobi equations in high dimension
- Construction of a local and global Lyapunov function for discrete dynamical systems using radial basis functions
- Discrete dynamic programming and viscosity solutions of the Bellman equation
- Discrete time high-order schemes for viscosity solutions of Hamilton- Jacobi-Bellman equations
- Error estimation and adaptive discretization for the discrete stochastic Hamilton-Jacobi-Bellman equation
- Fast Sweeping Methods for Static Hamilton--Jacobi Equations
- Max-plus methods for nonlinear control and estimation.
- Meshfree approximation methods with Matlab. With CD-ROM.
- Numerical methods for high dimensional Hamilton-Jacobi equations using radial basis functions
- On a discrete approximation of the Hamilton-Jacobi equation of dynamic programming
- On the determination of the basin of attraction of discrete dynamical systems
- Optimal control and viscosity solutions of Hamilton-Jacobi-Bellman equations
- Ordered Upwind Methods for Static Hamilton--Jacobi Equations: Theory and Algorithms
- Piecewise polynomial, positive definite and compactly supported radial functions of minimal degree
- Relaxing Dynamic Programming
Cited in
(3)
This page was built for publication: Dynamic programming using radial basis functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255849)
