Local Solutions of the Dynamic Programming Equations and the Hamilton Jacobi Bellman PDE

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

We present methods for locally solving the Dynamic Programming Equations (DPE) and the Hamilton Jacobi Bellman (HJB) PDE that arise in the infinite horizon optimal control problem. The method for solving the DPE is the discrete time version of Al'brecht's procedure for locally approximating the solution of the HJB. We also prove the existence of the smooth solutions to the DPE that has the same Taylor series expansions as the formal solutions. Our procedure for solving the HJB PDE numerically begins with Al'brecht's local solution as the initial approximation and uses some Lyapunov criteria to piece together polynomial estimates. The polynomials are generated using the method in the Cauchy-Kovalevskaya Theorem.
115 pages, 9 figures, PhD dissertation

Keywords

Optimization and Control, Dynamical Systems

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/64805

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0208240
 http://arxiv.org/abs/math/0208240

Collections

arXiv