An Approximation Scheme for Uncertain Minimax Optimal Control Problems

ARAGONE, LAURA S.; GIANATTI, JUSTINA; LOTITO, PABLO A.; PARENTE, LISANDRO A.

SET-VALUED AND VARIATIONAL ANALYSIS

SPRINGER

Año: 2017 vol. 26 p. 843 - 866

1877-0533

In this work, we address an uncertain minimax optimal control problem with lin- ear dynamics where the objective functional is the expected value of the supremum of the running cost over a time interval. By taking an independently drawn random sample, the expected value function is approximated by the corresponding sample average function. We study the epi-convergence of the approximated objective functionals as well as the con- vergence of their global minimizers. Then we define an Euler discretization in time of the sample average problem and prove that the value of the discrete time problem converges to the value of the sample average approximation. In addition, we show that there exists a sequence of discrete problems such that the accumulation points of their minimizers are optimal solutions of the original problem. Finally, we propose a convergent descent method to solve the discrete time problem, and show some preliminary numerical results for two simple examples.