This graduate course provides a comprehensive treatment of dynamic programm ing (DP) as the fundamental framework for staged optimization problems unde r uncertainty. Core topics include the principle of optimality, Bellman equ ations, value and policy iteration, deterministic and stochastic dynamic pr ogramming, and Markov decision processes. Applications span linear-quadrati c optimal control, inventory control, asset management, hypothesis testing, the Viterbi algorithm, among others. The course concludes with modern rein forcement learning topics including Q-learning, temporal difference learnin g, and value function approximation, demonstrating how classical DP princip les form the theoretical foundation for contemporary AI algorithms.
Grade distribution data hasn't been published for this course yet. Check back later as more terms become available.
University of California, Santa Barbara
Reviews, study tips, and grade data for ME 254 at UCSB. This graduate course provides a comprehensive treatment of dynamic programm ing (DP) as the fundamental…
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades