Summary
In this chapter, we have discussed the basic assumption of reinforcement learning and how Q-learning works by showing the simple MDP problem. Reinforcement learning is a powerful technique for solving a situation where we do not have complete knowledge of the environment itself. This leads to the desired result with a few sets of definitions naturally modeled from the environment observation. While we still carefully design the transition function between states, the deterministic transition also provides a good assumption of MDP as shown in our experiment.
Q-learning is a widely used algorithm to resolve the reinforcement learning problem. It is an iterative process to update the action-value function according to the Bellman equation. ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access