On Approximate Dynamic Programming in Switching Systems
In order to simplify computational methods based on dynamic programming, an approximative procedure based on upper and lower bounds of the optimal cost was recently introduced. The convergence properties of this procedure are analyzed in this paper. In particular, it is shown that the computational effort in finding an approximately optimal control law by relaxed value iteration is related to the
