2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) 2016
DOI: 10.1109/iros.2016.7759553
|View full text |Cite
|
Sign up to set email alerts
|

Sequential alternating least squares for solving high dimensional linear Hamilton-Jacobi-Bellman equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4

Citation Types

0
15
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(15 citation statements)
references
References 16 publications
0
15
0
Order By: Relevance
“…Iteration in policy space for second order HJB PDEs arising in stochastic control is discussed in [41]. Tensor calculus technique is used in [40] where the associated HJB equation becomes linear after using some exponential transformation and scaling factor. For an overview for numerical approximations to stochastic HJB equations, we refer to [31].…”
Section: Introductionmentioning
confidence: 99%
“…Iteration in policy space for second order HJB PDEs arising in stochastic control is discussed in [41]. Tensor calculus technique is used in [40] where the associated HJB equation becomes linear after using some exponential transformation and scaling factor. For an overview for numerical approximations to stochastic HJB equations, we refer to [31].…”
Section: Introductionmentioning
confidence: 99%
“…SOS-based controller synthesis methods are presented in [4], [5] and [6] for the continuous-time (CT) and discrete-time (DT) settings, respectively. Examples of computational methods based on approximating solutions of Hamilton-Jacobi-Bellman type of equations are found in [7], [8], [9]. Other, more recent works [10] (CT), [11] (DT) provide alternative formulations of optimal controller synthesis through occupation measures.…”
Section: Introductionmentioning
confidence: 99%
“…However, the design of numerical methods for the solution of high-dimensional HJ PDEs remains a daunting task. Along this direction, some encouraging results have been obtained over the last years in connection with the use of sparse grids [11,29], causality-free methods [34,22,48], machine learning techniques [40,39], tensor calculus [47], graph-tree structures [3], Taylor series expansions [17], and polynomial approximation [32]. In this latter work, we develop a numerical scheme based on a high-dimensional polynomial ansatz for the value function coupled with a Newton-type (policy iteration) method for the solution of the Galerkin residual equation associated to the HJB equation.…”
Section: Introductionmentioning
confidence: 99%