Data-driven finite-horizon approximate optimal control for discrete-time nonlinear systems using iterative HDP approach
Document Type
Article
Date of Original Version
10-1-2018
Abstract
This paper presents a data-based finite-horizon optimal control approach for discrete-time nonlinear affine systems. The iterative adaptive dynamic programming (ADP) is used to approximately solve Hamilton-Jacobi-Bellman equation by minimizing the cost function in finite time. The idea is implemented with the heuristic dynamic programming (HDP) involved the model network, which makes the iterative control at the first step can be obtained without the system function, meanwhile the action network is used to obtain the approximate optimal control law and the critic network is utilized for approximating the optimal cost function. The convergence of the iterative ADP algorithm and the stability of the weight estimation errors based on the HDP structure are intensively analyzed. Finally, two simulation examples are provided to demonstrate the theoretical results and show the performance of the proposed method.
Publication Title, e.g., Journal
IEEE Transactions on Cybernetics
Volume
48
Issue
10
Citation/Publisher Attribution
Mu, Chaoxu, Ding Wang, and Haibo He. "Data-driven finite-horizon approximate optimal control for discrete-time nonlinear systems using iterative HDP approach." IEEE Transactions on Cybernetics 48, 10 (2018): 2948-2961. doi: 10.1109/TCYB.2017.2752845.