Min–Plus Eigenvector Methods for Nonlinear $\rm H_\infty$ Problems with Active Control
We consider the H 4 problem for a nonlinear s y stem. The corresponding dynamic programming equation (DPE) is a fully nonlinear, first-order, steady-state partial differential equation (PDE), possessing a term which is quadratic in the gradient (for background, see [2], [4], [13], [25] among many notable others). The solutions are typically nonsmooth, and further, there are multiple viscosity solutions – that is, one does not even have uniqueness among the class of viscosity solutions (cf. [17]). Note that the nonuniqueness is not only due to an additive constant, but is much more difficult. If one removes the additive constant issue by requiring the solution to be zero at the origin, then, for example, the linear-quadratic case typically has two classical solutions and an infinite number of viscosity solutions [17]. Since the H 4 problem is a differential game, the PDE is, in general, a Hamilton-Jacobi-Isaacs (HJI) PDE. The computation of the solution of a nonlinear, steady-state, first-order PDE is typically quite difficult, and possibly even more so in the presence of the non-uniqueness mentioned above. Some previous works in the general area of numerical methods for these problems are [3], [6], [7], [14], and the references therein.KeywordsViscosity SolutionBasis ExpansionDynamic Programming PrincipleDynamic Program EquationEigenvector MethodThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Read more