Policy Iteration Adaptive Dynamic Programming Algorithm for Discrete-Time Nonlinear Systems

Citations Over TimeTop 1% of 2013 papers

Abstract

This paper is concerned with a new discrete-time policy iteration adaptive dynamic programming (ADP) method for solving the infinite horizon optimal control problem of nonlinear systems. The idea is to use an iterative ADP technique to obtain the iterative control law, which optimizes the iterative performance index function. The main contribution of this paper is to analyze the convergence and stability properties of policy iteration method for discrete-time nonlinear systems for the first time. It shows that the iterative performance index function is nonincreasingly convergent to the optimal solution of the Hamilton-Jacobi-Bellman equation. It is also proven that any of the iterative control laws can stabilize the nonlinear systems. Neural networks are used to approximate the performance index function and compute the optimal control law, respectively, for facilitating the implementation of the iterative ADP algorithm, where the convergence of the weight matrices is analyzed. Finally, the numerical results and analysis are presented to illustrate the performance of the developed method.

Related Papers

• → Dynamic programming principle for stochastic recursive optimal control problem with delayed systems(2012)25 cited
• → Optimal Control and the Dynamic Programming Principle(2021)1 cited
• → Reinforcement Learning for Approximate Optimal Control(2021)2 cited
• → Optimal Control and the Dynamic Programming Principle(2015)
• → Reinforcement Learning for Approximate Optimal Control(2020)