.png){kind=icon}
返回
AN EFFICIENT POLICY ITERATION ALGORITHM FOR DYNAMIC PROGRAMMING EQUATIONS
.png){kind=icon}
OA
AI
DOI：10.1137/130932284.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an accelerated algorithm for the solution of static Hamilton-Jacobi-Bellman equations related to optimal control problems. Our scheme is based on a classic policy iteration procedure, which is known to have superlinear convergence in many relevant cases provided the initial guess is sufficiently close to the solution. This limitation often degenerates into a behavior similar to a value iteration method, with an increased computation time. The new scheme circumvents this problem by combining the advantages of both algorithms with an efficient coupling. The method starts with a coarse-mesh value iteration phase and then switches to a fine-mesh policy iteration procedure when a certain error threshold is reached. A delicate point is to determine this threshold in order to avoid cumbersome computations with the value iteration and at the same time to ensure the convergence of the policy iteration method to the optimal solution. We analyze the methods and efficient coupling in a number of examples in different dimensions, illustrating their properties.
Keyword:
policy iteration
dynamic programming
semi-Lagrangian schemes
Hamilton-Jacobi equations
optimal control
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Role of interfacial hydrophobicity in antimicrobial peptide magainin 2-induced nanopore formationOAAI
OAAI分享收藏分享收藏CAN LOCAL SINGLE-PASS METHODS SOLVE ANY STATIONARY HAMILTON-JACOBI-BELLMAN EQUATION?局部单程方法可以求解任何平稳的hamilton-jacobi-bellman方程吗？OAAI
OAAI分享收藏
查看更多内容