title: Discrete-time nonlinear HJB solution using approximate dynamic programming: convergence proof.
abstract: Convergence of the value-iteration-based heuristic dynamic programming (HDP) algorithm is proven in the case of general nonlinear systems. That is, it is shown that HDP converges to the optimal control and the optimal value function that solves the Hamilton-Jacobi-Bellman equation appearing in infinite-horizon discrete-time (DT) nonlinear optimal control. It is assumed that, at each iteration, the value and action update equations can be exactly solved. The following two standard neural networks (NN) are used: a critic NN is used to approximate the value function, whereas an action network is used to approximate the optimal control policy. It is stressed that this approach allows the implementation of HDP without knowing the internal dynamics of the system. The exact solution assumption holds for some classes of nonlinear systems and, specifically, in the specific case of the DT linear quadratic regulator (LQR), where the action is linear and the value quadratic in the states and NNs have zero approximation error. It is stressed that, for the LQR, HDP may be implemented without knowing the system A matrix by using two NNs. This fact is not generally appreciated in the folklore of HDP for the DT LQR, where only one critic NN is generally used.
authors.affiliation: The Hashemite University, Zarqa 13115, Jordan. altamimi@hu.edu.jo
authors.forename: Asma
authors.initials: A
authors.lastname: Al-Tamimi
authors.forename: Frank L
authors.initials: FL
authors.lastname: Lewis
authors.forename: Murad
authors.initials: M
authors.lastname: Abu-Khalaf
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D005246:Feedback; D008962:Models, Theoretical; D011382:Programming, Linear; D013598:Systems Theory