arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.4232math.OCcs.NAmath.NA
收藏

无限时域Hamilton-Jacobi-Bellman方程的patchy方法及其精度

The patchy Method for the Infinite Horizon Hamilton-Jacobi-Bellman Equation and its Accuracy

Naval Postgraduate School(海军研究生院)

Thomas Hunt, Arthur J. Krener

AI总结:

针对无限时域Hamilton-Jacobi-Bellman方程,提出一种改进的patchy方法,通过多项式近似最优代价和最优控制,并给出在最优代价为光滑严格Lyapunov函数假设下的误差界。

摘要:

我们对Navasca和Krener用于求解稳态Hamilton-Jacobi-Bellman方程的patchy方法进行了修改。我们生成的数值解是一组多项式,这些多项式在状态空间的一个划分上近似最优代价和最优控制。在最优代价为光滑严格Lyapunov函数的假设下,我们推导了数值方法的误差界。当划分中的子集数量不太大时,该误差界有效。

英文摘要:

We introduce a modification to the patchy method of Navasca and Krener for solving the stationary Hamilton Jacobi Bellman equation. The numerical solution that we generate is a set of polynomials that approximate the optimal cost and optimal control on a partition of the state space. We derive an error bound for our numerical method under the assumption that the optimal cost is a smooth strict Lyupanov function. The error bound is valid when the number of subsets in the partition is not too large.

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

↑