arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0208240math.OCmath.DS

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

Carmeliza Luna Navasca

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑