2021
DOI: 10.1137/19m1305136
|View full text |Cite
|
Sign up to set email alerts
|

Tensor Decomposition Methods for High-dimensional Hamilton--Jacobi--Bellman Equations

Abstract: A tensor decomposition approach for the solution of high-dimensional, fully nonlinear Hamilton-Jacobi-Bellman equations arising in optimal feedback control of nonlinear dynamics is presented. The method combines a tensor train approximation for the value function together with a Newton-like iterative method for the solution of the resulting nonlinear system. The tensor approximation leads to a polynomial scaling with respect to the dimension, partially circumventing the curse of dimensionality. A convergence a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
26
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 56 publications
(37 citation statements)
references
References 59 publications
0
26
0
Order By: Relevance
“…The solution of ( 13) is obtained by the SVD of the snapshots matrix Y = ΨΣV T , where we consider the first −columns {ψ i } i=1 of the orthogonal matrix Ψ. The selection of the rank of POD basis is based on the error computed in (13) which is related to the singular values neglected. We will choose such that E( ) ≈ 0.999, with…”
Section: Pod For the State Equationmentioning
confidence: 99%
See 1 more Smart Citation
“…The solution of ( 13) is obtained by the SVD of the snapshots matrix Y = ΨΣV T , where we consider the first −columns {ψ i } i=1 of the orthogonal matrix Ψ. The selection of the rank of POD basis is based on the error computed in (13) which is related to the singular values neglected. We will choose such that E( ) ≈ 0.999, with…”
Section: Pod For the State Equationmentioning
confidence: 99%
“…Other approaches to mitigate the curse of dimensionality are built upon the sparse grid method (see e.g. [16]), the spectral elements method (see [19]) and, more recently, a tensor decomposition (see [13]). For the sake of completeness, we mention that the control of PDEs can be solved with other methods such as, among others, open loop techniques (see e.g [22]) and model predictive control (see e.g [17]).…”
Section: Introductionmentioning
confidence: 99%
“…This poses a formidable computational computational challenge, as the HJB PDE is a nonlinear first order PDE cast over the state space of the system, with a dimension which can be arbitrarily high. Over the last years, the solution of large-scale optimal feedback synthesis problems has witnessed a tremendous development, in parallel with the development of sophisticated techniques for high-dimensional problems, such as tensor decomposition techniques Dolgov et al (2021), representation formulas for the HJB PDE Chow et al (2019), tree-structured algorithms Alla and Saluzzi (2020) and data-driven methods Han et al (2018); Azmi et al (2021); Nakamura-Zimmerer et al (2021), among others. An alternative approach, which can be interpreted as a relaxed dynamic programming, is provided by Nonlinear Model Predictive Control (NMPC) Grüne and Rantzer (2008).…”
Section: Introductionmentioning
confidence: 99%
“…With the aim of increasing the dimension of computable HJB equations a sparse grid approach was presented in [18]. More recently significant progress was made in solving high dimensional HJB equations by the of use policy iterations (Newton method applied to HJB) combined with tensor calculus techniques, [12,22]. The use of Hopf formulas was proposed in e.g.…”
Section: Introductionmentioning
confidence: 99%