Based on adaptive dynamic programming(ADP),the fixed-point tracking control problem is solved by a value iteration(VI) algorithm. First, a class of discrete-time(DT)nonlinear system with disturbance is considered. Sec...Based on adaptive dynamic programming(ADP),the fixed-point tracking control problem is solved by a value iteration(VI) algorithm. First, a class of discrete-time(DT)nonlinear system with disturbance is considered. Second, the convergence of a VI algorithm is given. It is proven that the iterative cost function precisely converges to the optimal value,and the control input and disturbance input also converges to the optimal values. Third, a novel analysis pertaining to the range of the discount factor is presented, where the cost function serves as a Lyapunov function. Finally, neural networks(NNs) are employed to approximate the cost function, the control law, and the disturbance law. Simulation examples are given to illustrate the effective performance of the proposed method.展开更多
基金supported in part by the National Natural Science Foundation of China(61873300,61722312)in part by the Fundamental Research Funds for the Central Universities(FRF-GF-17-B45)
文摘Based on adaptive dynamic programming(ADP),the fixed-point tracking control problem is solved by a value iteration(VI) algorithm. First, a class of discrete-time(DT)nonlinear system with disturbance is considered. Second, the convergence of a VI algorithm is given. It is proven that the iterative cost function precisely converges to the optimal value,and the control input and disturbance input also converges to the optimal values. Third, a novel analysis pertaining to the range of the discount factor is presented, where the cost function serves as a Lyapunov function. Finally, neural networks(NNs) are employed to approximate the cost function, the control law, and the disturbance law. Simulation examples are given to illustrate the effective performance of the proposed method.
