53rd IEEE Conference on Decision and Control 2014
DOI: 10.1109/cdc.2014.7039666
|View full text |Cite
|
Sign up to set email alerts
|

Solving the Hamilton-Jacobi-Bellman equation for a stochastic system with state constraints

Abstract: We present a method for solving the Hamilton-Jacobi-Bellman (HJB) equation for a stochastic system with state constraints. A variable transformation is introduced which turns the HJB equation into a combination of a linear eigenvalue problem, a set of partial differential equations (PDE:s), and a point-wise equation. For a fixed solution to the eigenvalue problem, the PDE:s are linear and the point-wise equation is quadratic, indicating that the problem can be solved efficiently using an iterative scheme.As an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 13 publications
(19 reference statements)
0
6
0
Order By: Relevance
“…First and foremost, obtaining exact numerical solution of HJB function is still an academic issue, most of the solving mechanisms existing seek the approximation to viscosity solution instead [29]. Rutquist [30] proposed an approach to seek the approximate numerical solution of HJB equation with state constraints, which demands much less collocation points to give a good approximation, reduces the computing power requirements.…”
Section: B Public Information Setupmentioning
confidence: 99%
See 2 more Smart Citations
“…First and foremost, obtaining exact numerical solution of HJB function is still an academic issue, most of the solving mechanisms existing seek the approximation to viscosity solution instead [29]. Rutquist [30] proposed an approach to seek the approximate numerical solution of HJB equation with state constraints, which demands much less collocation points to give a good approximation, reduces the computing power requirements.…”
Section: B Public Information Setupmentioning
confidence: 99%
“…Although it is not common, for (28), the solving process can demand finer mesh or large number of collocation points if it has a large feasible domain together with a large initial condition (x i t0 − x i t ). Large amount of collocation points inevitably leads to knotty computational complexity even if it gets relieved by [30]. If it takes significantly long time to solve one PDE, a user may have no sufficient time to implement the control or come up with considerable error.…”
Section: B Public Information Setupmentioning
confidence: 99%
See 1 more Smart Citation
“…Therefore, the faster the PDE is solved, the better approximation to the optimum is yielded. A typical PDE is soved within 1 second by using the approach from [16] on a Intel I7-6600U processor. Although users cannot be expected to have such capability, three PDEs per minute are enough to give an admissible control, which will be illustrated in the case study.…”
Section: Control Implementationmentioning
confidence: 99%
“…Consequently, the solution Ψ * is a continuous function defined on a bounded domain. Hence, Ψ u and Ψ l can be made arbitrary close to Ψ * by the Stone-Weierstrass Theorem [21] in (12). However, this guarantee is lost when Ψ u and Ψ l are restricted to be SOS polynomials.…”
Section: B Controller Synthesismentioning
confidence: 99%