Fast Dynamic Programming: A Numerical Method for Solving Dynamic Programming Problems

A well-established method for finding the optimal control policy for a given dynamical system is to solve the problem iteratively going from its terminal state "backwards" in time, known as Dynamic Programming Algorithm. For a generic problem with discrete state/action space, the algorithm has computational complexity of <i>O(NM)</i> for <i>N</i...