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

Nearly optimal control laws for nonlinear systems with saturating actuators using a neural network HJB approach

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

4
636
0
3

Year Published

2006
2006
2017
2017

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 1,136 publications
(643 citation statements)
references
References 27 publications
4
636
0
3
Order By: Relevance
“…Since the function approximation error ε HJB is generated by the error ε c , the error ε HJB can be kept very small. Therefore, in this paper, based on the Weierstrass higher-order approximation theorem [38], the LS-SVM approximator, rather than the NNs approximator, is proposed to approximate the gradient of the cost function. Compared with traditional NNs-based adaptive dynamic programming, the LS-SVM can converge more quickly towards the optimal position and enhance the generalization performance of the model.…”
Section: (Policy Evaluation Step) Solve For the Value Functionmentioning
confidence: 99%
“…Since the function approximation error ε HJB is generated by the error ε c , the error ε HJB can be kept very small. Therefore, in this paper, based on the Weierstrass higher-order approximation theorem [38], the LS-SVM approximator, rather than the NNs approximator, is proposed to approximate the gradient of the cost function. Compared with traditional NNs-based adaptive dynamic programming, the LS-SVM can converge more quickly towards the optimal position and enhance the generalization performance of the model.…”
Section: (Policy Evaluation Step) Solve For the Value Functionmentioning
confidence: 99%
“…For the infinite final time case, the NN weights are constant [1]. The NN weights will be selected to minimize a residual error in a least-squares sense over a set of points sampled from a compact set Ω inside the RAS of the initial stabilizing control [10].…”
Section: Nonlinear Fixed-final-time Hjb Solution By Nn Least-squmentioning
confidence: 99%
“…Specifically, policy iteration represents a class of algorithms containing two basic iterations, i.e., policy evaluation and policy improvement [41]- [46]. Abu-Khalaf and Lewis [41] derived an offline optimal control scheme for nonlinear systems with saturating actuators.…”
Section: Introductionmentioning
confidence: 99%
“…Specifically, policy iteration represents a class of algorithms containing two basic iterations, i.e., policy evaluation and policy improvement [41]- [46]. Abu-Khalaf and Lewis [41] derived an offline optimal control scheme for nonlinear systems with saturating actuators. Then, Vrabie and Lewis [42] and Vamvoudakis and Lewis [43] used online policy iteration algorithm to study the infinite horizon optimal control of continuous-time nonlinear systems, respectively.…”
Section: Introductionmentioning
confidence: 99%