Skip to content
All tags

#mdp

3 posts

Reinforcement Learning: MDPs, Value Iteration, and Continuous States

Chapter 19 uses Bellman equations to turn long-horizon decisions into one-step updates, moving from value iteration in known MDPs to model learning and continuous-state approximation.

CS188 MDPs and Reinforcement Learning: From Value Iteration to Q-Learning

Lectures 9–12 and Project 3 use the same Gridworld to contrast value iteration with a known model, Q-learning from unknown dynamics, and approximate Q-learning that generalizes through features.

CMU 10-301 HW8: From MDPs to Reinforcement-Learning Updates

HW8 connects states, actions, rewards, transitions, and value updates while separating environment dynamics, policy, and estimation error.