Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.13014 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929281869807616 |
|---|---|
| author | Wang, Qi |
| author_facet | Wang, Qi |
| contents | H{\infty} control of nonlinear continuous-time system depends on the solution of the Hamilton-Jacobi-Isaacs (HJI) equation, which has been proved impossible to obtain a closed-form solution due to the nonlinearity of HJI equation. In order to solve HJI equation, many iterative algorithms were proposed, and most of the algorithms were essentially Newton method when the fixed-point equation was constructed in a Banach space. Newton method is a local optimization method, it has small convergence region and needs the initial guess to be sufficiently close to the solution. Whereas damped Newton method enhances the robustness with respect to initial condition and has larger convergence region. In this paper, a novel reinforcement learning method which is named α-policy iteration (α-PI) is introduced for solving HJI equation. First, by constructing a damped Newton iteration operator equation, a generalized Bellman equation (GBE) is obtained. The GBE is an extension of bellman equation. And then, by iterating on the GBE, an on-policy α-PI reinforcement learning method without using knowledge regarding to the system internal dynamics is proposed. Third, based on the on-policy α-PI reinforcement learning method, we develop an off-policy α-PI reinforcement learning method without requiring any knowledge of the system dynamics. Finally, the neural-network based adaptive critic implementation schemes of on-policy and off-policy α-PI algorithms are derived respectively, and the batch least-squares method is used for calculating the weight parameters of neural networks. The effectiveness of the off-policy α-PI algorithm is verified through computer simulation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_13014 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | A Novel Policy Iteration Algorithm for Nonlinear Continuous-Time H$\infty$ Control Problem Wang, Qi Systems and Control H{\infty} control of nonlinear continuous-time system depends on the solution of the Hamilton-Jacobi-Isaacs (HJI) equation, which has been proved impossible to obtain a closed-form solution due to the nonlinearity of HJI equation. In order to solve HJI equation, many iterative algorithms were proposed, and most of the algorithms were essentially Newton method when the fixed-point equation was constructed in a Banach space. Newton method is a local optimization method, it has small convergence region and needs the initial guess to be sufficiently close to the solution. Whereas damped Newton method enhances the robustness with respect to initial condition and has larger convergence region. In this paper, a novel reinforcement learning method which is named α-policy iteration (α-PI) is introduced for solving HJI equation. First, by constructing a damped Newton iteration operator equation, a generalized Bellman equation (GBE) is obtained. The GBE is an extension of bellman equation. And then, by iterating on the GBE, an on-policy α-PI reinforcement learning method without using knowledge regarding to the system internal dynamics is proposed. Third, based on the on-policy α-PI reinforcement learning method, we develop an off-policy α-PI reinforcement learning method without requiring any knowledge of the system dynamics. Finally, the neural-network based adaptive critic implementation schemes of on-policy and off-policy α-PI algorithms are derived respectively, and the batch least-squares method is used for calculating the weight parameters of neural networks. The effectiveness of the off-policy α-PI algorithm is verified through computer simulation. |
| title | A Novel Policy Iteration Algorithm for Nonlinear Continuous-Time H$\infty$ Control Problem |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2401.13014 |