Neural Network Based Online Simultaneous Policy Update Algorithm for Solving the HJI Equation in Nonlinear H infinity Control
It is well known that the nonlinear H infinity state feedback control problem relies on the solution of the Hamilton-Jacobi-Isaacs (HJI) equation, which is a nonlinear partial differential equation that has proven to be impossible to solve analytically. In this paper, a neural network (NN)-based onl...
Saved in:
| Published in | IEEE transaction on neural networks and learning systems Vol. 23; no. 12; pp. 1884 - 1895 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
01.12.2012
|
| Online Access | Get full text |
| ISSN | 2162-237X 2162-2388 |
| DOI | 10.1109/TNNLS.2012.2217349 |
Cover
| Summary: | It is well known that the nonlinear H infinity state feedback control problem relies on the solution of the Hamilton-Jacobi-Isaacs (HJI) equation, which is a nonlinear partial differential equation that has proven to be impossible to solve analytically. In this paper, a neural network (NN)-based online simultaneous policy update algorithm (SPUA) is developed to solve the HJI equation, in which knowledge of internal system dynamics is not required. First, we propose an online SPUA which can be viewed as a reinforcement learning technique for two players to learn their optimal actions in an unknown environment. The proposed online SPUA updates control and disturbance policies simultaneously; thus, only one iterative loop is needed. Second, the convergence of the online SPUA is established by proving that it is mathematically equivalent to Newton's method for finding a fixed point in a Banach space. Third, we develop an actor-critic structure for the implementation of the online SPUA, in which only one critic NN is needed for approximating the cost function, and a least-square method is given for estimating the NN weight parameters. Finally, simulation studies are provided to demonstrate the effectiveness of the proposed algorithm. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 2162-237X 2162-2388 |
| DOI: | 10.1109/TNNLS.2012.2217349 |