Lecture Slides
6.231 Fall 2015 Lecture 10: Infinite Horizon Problems, Stochastic Shortest Path (SSP) Problems, Bellman’s Equation, Dynamic Programming – Value Iteration, Discounted Problems as a Special Case of SSP
Description:
This resource contains the information regarding 6.231 fall 2015 lecture 10: Infinite horizon problems, stochastic shortest path (SSP) problems, bellman’s equation, dynamic programming – value iteration, discounted problems as a special case of SSP.
Resource Type:
Lecture Notes
pdf
600 kB
6.231 Fall 2015 Lecture 10: Infinite Horizon Problems, Stochastic Shortest Path (SSP) Problems, Bellman’s Equation, Dynamic Programming – Value Iteration, Discounted Problems as a Special Case of SSP
Course Info
Instructor
Departments
As Taught In
Fall
2015
Level
Topics
Learning Resource Types
grading
Exams with Solutions
notes
Lecture Notes
theaters
Other Video
assignment
Problem Sets
