Wernrud, Andreas (Lund Univ.)

Computation of Approximate Value Functions for Constrained Control Problems

Scheduled for presentation during the Regular Session "Convex Optimization I" (ThP12), Thursday, July 27, 2006, 17:25−17:50, Room 104b

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 19, 2024

Abstract

The paper discusses an iterative algorithm for computing approximations to the optimal value function for constrained control problems. The algorithm gives an explicit measure on the distance to the optimal value function. A major step in the course of constructing an algorithm for these problems is to choose an efficient parameterization. The choice has several implications. The main obstacle in the algorithm we consider is that it involves an infinite-dimensional optimization problem in each step, without approximations these problems are computationally infeasible. The choice of parameterization must thus be chosen accordingly. Multivariate polynomials are a good candidate parameterization. To obtain a feasible algorithm, we impose certain convexity properties and make use of recent results on the representation of positive polynomials.