2014
DOI: 10.1016/j.automatica.2014.07.012
|View full text |Cite
|
Sign up to set email alerts
|

A sparse collocation method for solving time-dependent HJB equations using multivariate B-splines

Abstract: a b s t r a c tThis paper presents a sparse collocation method for solving the time-dependent Hamilton-Jacobi-Bellman (HJB) equation associated with the continuous-time optimal control problem on a fixed, finite timehorizon with integral cost functional. Through casting the problem in a recursive framework using the value-iteration procedure, the value functions of every iteration step is approximated with a time-varying multivariate simplex B-spline on a certain state domain of interest. In the collocation sc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 24 publications
0
11
0
Order By: Relevance
“…in Equation 15, the state equation will be given as in Equation 20, and then, by considering the initial and final values, state and co-state differential equations can be solved together to find the reference trajectory and optimal control open-loop command.…”
Section: Example: Duffing Equationmentioning
confidence: 99%
See 1 more Smart Citation
“…in Equation 15, the state equation will be given as in Equation 20, and then, by considering the initial and final values, state and co-state differential equations can be solved together to find the reference trajectory and optimal control open-loop command.…”
Section: Example: Duffing Equationmentioning
confidence: 99%
“…In order to calculate the eigenvalues, one should linearize the nonlinear problem when Equation 23 is substituted into Equation 15. Then, the eigenvalues can be found easily using the characteristic equation.…”
Section: Example: Duffing Equationmentioning
confidence: 99%
“…The multiplex spline is a generalization of the tensor-product simplex spline presented by Govindarajan et al 6 In the latter framework the B-coefficients c κ are represented by a univariate simplex spline. In the current discussion c κ is instead described using a multivariate spline.…”
Section: B the Multivariate Multiplex Splinementioning
confidence: 99%
“…6,7 In this framework the B-coefficients of a multivariate simplex spline are defined using a univariate spline function of a different variable. This framework was used by Govindarajan et alto estimate autopilot safety margins, 7 and by Sun et alin an aircraft system identification framework.…”
Section: Introductionmentioning
confidence: 99%
“…A common strategy used to overcome these computational challenges is to use Adaptive Dynamic Programming (ADP) techniques [23] to find approximations of the value function with general function approximators. In this paper, we have used the method from Govindarajan et al [24], that uses multivariate simplex splines [25,26] to find an approximation of V i (t, x).…”
Section: Dynamic Programming and The Hamilton-jacobi-bellman Equationmentioning
confidence: 99%