2007
DOI: 10.1007/978-3-540-73570-0_20
|View full text |Cite
|
Sign up to set email alerts
|

Patchy Solutions of Hamilton-Jacobi-Bellman Partial Differential Equations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Year Published

2012
2012
2019
2019

Publication Types

Select...
4
3
1

Relationship

1
7

Authors

Journals

citations
Cited by 38 publications
(22 citation statements)
references
References 22 publications
0
22
0
Order By: Relevance
“…In both D 1 and D 2 , the TPBVP (10) is solved at each gridpoint in G q sparse using a method based on four-stage Lobatto IIIa formula in Kierzenka-Shampine. 9 The hierarchical surpluses for interpolation are computed using (12). Then we check the accuracy of V (0, v, ω).…”
Section: Examplesmentioning
confidence: 99%
See 1 more Smart Citation
“…In both D 1 and D 2 , the TPBVP (10) is solved at each gridpoint in G q sparse using a method based on four-stage Lobatto IIIa formula in Kierzenka-Shampine. 9 The hierarchical surpluses for interpolation are computed using (12). Then we check the accuracy of V (0, v, ω).…”
Section: Examplesmentioning
confidence: 99%
“…Then the hierarchical surpluses for the interpolation are computed using (12). Similar to the previous example, we check the accuracy at 500 random points in D 1 .…”
Section: Examplesmentioning
confidence: 99%
“…To computex(t|t) given by (13) we assume that the polynomial π(x, t|t) is strictly convex in x in a neighborhood aroundx(t|t − 1) and thatx(t|t) is in this neighborhood. So we can use Newton's method to minimize (13) with initial guessx(t|t−1).…”
Section: (T Z(t)x) λ(T)xmentioning
confidence: 99%
“…But one drawback of this approach is that assumes the system is smooth with no active constraints. If these assumptions don't hold then one needs to go to a patchy approach [13], [5] which we will report on at a later date.…”
Section: Minimum Horizon Estimation Minimum Horizon Estimation (Mmentioning
confidence: 99%
“…This theoretically elegant approach suffers some difficulties in computation due to the curse of dimensionality, a term that was coined by Richard E. Bellman when considering problems in dynamic optimization, which relates to the fact that the size of the discretized problem in solving HJB equations increases exponentially with the dimension. Finding an approximate solution to the HJB-type of equations in a local neighborhood of a trajectory has been extensively studied [1], [6], [14], [20], [21]. Some of them can be applied to systems in high dimensions.…”
Section: Introductionmentioning
confidence: 99%