Value iteration for (switched) homogeneous systems

Abstract

In this note, we prove that dynamic programming value iteration converges uniformly for discrete-time homogeneous systems and continuous-time switched homogeneous systems. For discrete-time homogeneous systems, rather than discounting the cost function (which exponentially decreases the weights of the cost of future actions), we show that such systems satisfy approximate dynamic programming conditions recently developed by Rantzer, which provides a uniform bound on the convergence rate of value iteration over a compact set. For continuous-time switched homogeneous system, we present a transformation that generates an equivalent discrete-time homogeneous system with an additional ldquosamplingrdquo input for which discrete-time value iteration is compatible, and we further show that the inclusion of homogeneous switching costs results in a continuous value function.