It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

In this paper we develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. We show that the computed value function converges quadratically ...

The project required bringing together years of research in approximate dynamic programming, merging math programming with machine learning, to solve dynamic programs with extremely high-dimensional ...

Dynamic Programming and Optimal Control is offered within DMAVT and attracts in excess of 300 students per year from a wide variety of disciplines. It is an integral part of the Robotics, System and ...