Stable iterative adaptive dynamic programming algorithm with approximation errors for discrete-time nonlinear systems

In this paper, a novel iterative adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems. When the iterative control law and iterative performance index function in each iteration cannot be accurately obtained,...

Full description

Saved in:
Bibliographic Details
Published inNeural computing & applications Vol. 24; no. 6; pp. 1355 - 1367
Main Authors Wei, Qinglai, Liu, Derong
Format Journal Article
LanguageEnglish
Published London Springer London 01.05.2014
Springer
Subjects
Online AccessGet full text
ISSN0941-0643
1433-3058
DOI10.1007/s00521-013-1361-7

Cover

More Information
Summary:In this paper, a novel iterative adaptive dynamic programming (ADP) algorithm is developed to solve infinite horizon optimal control problems for discrete-time nonlinear systems. When the iterative control law and iterative performance index function in each iteration cannot be accurately obtained, it is shown that the iterative controls can make the performance index function converge to within a finite error bound of the optimal performance index function. Stability properties are presented to show that the system can be stabilized under the iterative control law which makes the present iterative ADP algorithm feasible for implementation both on-line and off-line. Neural networks are used to approximate the iterative performance index function and compute the iterative control policy, respectively, to implement the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the present method.
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-013-1361-7