当前位置: X-MOL 学术Complexity › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Dynamic Programming and Hamilton–Jacobi–Bellman Equations on Time Scales
Complexity ( IF 2.3 ) Pub Date : 2020-11-19 , DOI: 10.1155/2020/7683082
Yingjun Zhu 1 , Guangyan Jia 1
Affiliation  

Bellman optimality principle for the stochastic dynamic system on time scales is derived, which includes the continuous time and discrete time as special cases. At the same time, the Hamilton–Jacobi–Bellman (HJB) equation on time scales is obtained. Finally, an example is employed to illustrate our main results.

中文翻译:

时间尺度上的动态规划和Hamilton–Jacobi–Bellman方程

推导了时间尺度上随机动态系统的贝尔曼最优原理,其中包括连续时间和离散时间作为特殊情况。同时,获得了时标上的汉密尔顿-雅各比-贝尔曼(HJB)方程。最后,通过一个例子来说明我们的主要结果。
更新日期:2020-11-19
down
wechat
bug