title: Finite-approximation-error-based discrete-time iterative adaptive dynamic programming.
abstract: In this paper, a new iterative adaptive dynamic programming (ADP) algorithm is developed to solve optimal control problems for infinite horizon discrete-time nonlinear systems with finite approximation errors. First, a new generalized value iteration algorithm of ADP is developed to make the iterative performance index function converge to the solution of the Hamilton-Jacobi-Bellman equation. The generalized value iteration algorithm permits an arbitrary positive semi-definite function to initialize it, which overcomes the disadvantage of traditional value iteration algorithms. When the iterative control law and iterative performance index function in each iteration cannot accurately be obtained, for the first time a new "design method of the convergence criteria" for the finite-approximation-error-based generalized value iteration algorithm is established. A suitable approximation error can be designed adaptively to make the iterative performance index function converge to a finite neighborhood of the optimal performance index function. Neural networks are used to implement the iterative ADP algorithm. Finally, two simulation examples are given to illustrate the performance of the developed method.
authors.forename: Qinglai
authors.initials: Q
authors.lastname: Wei
authors.forename: Fei-Yue
authors.initials: FY
authors.lastname: Wang
authors.forename: Derong
authors.initials: D
authors.lastname: Liu
authors.forename: Xiong
authors.initials: X
authors.lastname: Yang