.png){kind=icon}
返回
DATA-DRIVEN TENSOR TRAIN GRADIENT CROSS APPROXIMATION FOR HAMILTON-JACOBI-BELLMAN EQUATIONS
.png){kind=icon}
OA
AI
DOI：10.1137/22M1498401.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A gradient-enhanced functional tensor train cross approximation method for the resolution of the Hamilton-Jacobi-Bellman (HJB) equations associated with optimal feedback control of nonlinear dynamics is presented. The procedure uses samples of both the solution of the HJB equation and its gradient to obtain a tensor train approximation of the value function. The collection of the data for the algorithm is based on two possible techniques: Pontryagin Maximum Principle and State-Dependent Riccati Equations. Several numerical tests are presented in low and high dimension showing the effectiveness of the proposed method and its robustness with respect to inexact data evaluations, provided by the gradient information. The resulting tensor train approximation paves the way towards fast synthesis of the control signal in real-time applications.
Keyword:
dynamic programming
optimal feedback control
Hamilton-Jacobi-Bellman equations
tensor decomposition
high-dimensional approximation
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Approximation of optimal control problems for the Navier-Stokes equation via multilinear HJB-POD
OAAI
OAAI分享收藏ADAPTIVE DEEP LEARNING FOR HIGH-DIMENSIONAL HAMILTON-JACOBI-BELLMAN EQUATIONS高维hamilton-jacobi-bellman方程的自适应深度学习OAAI
OAAI分享收藏
查看更多内容