Abstract

In this paper, we present a new insight into the simultaneous policy update algorithm (SPUA) for solving H∞ control problems. From the perspective of practicability, a checkable criterion is presented for the initialization of SPUAs such that the initial guess can be chosen with clear rules and lie within a local domain of convergence. To further get a better convergence property, a novel initialization is developed such that the starting matrix does not need to lie in a neighborhood of the solution of H∞ control problems in some cases and its convergence is established rigorously by mathematical induction principle. Subsequently, an improved SPUA is proposed, and its model-free variant based on reinforcement learning (RL) is also able to learn the solution online without any system dynamics. Finally, numerical results illustrate the effectiveness of the proposed methods.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.