Abstract
In this paper, we present error bound analysis of the ${Q}$ -function for the action-dependent adaptive dynamic programming for solving discounted optimal control problems of unknown discrete-time nonlinear systems. The convergence of ${Q}$ -functions derived by a policy iteration algorithm under ideal conditions is given. Considering the approximated errors of the ${Q}$ -function and control policy in the policy evaluation step and policy improvement step, we establish error bounds of approximate ${Q}$ -functions in each iteration. With the given boundedness conditions, the approximate ${Q}$ -function will converge to a finite neighborhood of the optimal ${Q}$ -function. To implement the presented algorithm, two three-layer neural networks are employed to approximate the ${Q}$ -function and the control policy, respectively. Finally, a simulation example is utilized to verify the validity of the presented algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: IEEE Transactions on Systems, Man, and Cybernetics: Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.