Max-plus eigenvector representations for solution of nonlinear H/sub /spl infin// problems: basic concepts

The H/sub /spl infin// problem for a nonlinear system is considered. The corresponding dynamic programming equation is a fully nonlinear, first-order, steady-state partial differential equation (PDE), possessing a term which is quadratic in the gradient. The solutions are typically nonsmooth, and further, there is nonuniqueness among the class of viscosity solutions. In the case where one tests a feedback control to see if it yields an H/sub /spl infin// controller, the PDE is a Hamilton-Jacobi-Bellman equation. In the case where the "optimal" feedback control is being determined as well, the problem takes the form of a differential game, and the PDE is, in general, an Isaacs equation. The computation of the solution of a nonlinear, steady-state, first-order PDE is typically quite difficult. In this paper, we develop an entirely new class of methods for obtaining the "correct" solution of such PDEs. These methods are based on the linearity of the associated semigroup over the max-plus (or, in some cases, min-plus) algebra. In particular, solution of the PDE is reduced to solution of a max-plus (or min-plus) eigenvector problem for known unique eigenvalue 0 (the max-plus multiplicative identity). It is demonstrated that the eigenvector is unique, and that the power method converges to it. An example is included.