Abstract
In this chapter, we will discuss the Bellman Equation and the Markov Decision Process (MDP ), which are the basis for almost all the approaches that we will be discussing further. We will thereafter discuss some of the non-model-based approaches for Reinforcement Learning like Dynamic Programming. It is imperative to understand these concepts before going forward to discussing some advanced topics ahead. Finally, we will cover the algorithms like value iteration and policy iteration for solving the MDP.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Sewak, M. (2019). Mathematical and Algorithmic Understanding of Reinforcement Learning. In: Deep Reinforcement Learning. Springer, Singapore. https://doi.org/10.1007/978-981-13-8285-7_2
Download citation
DOI: https://doi.org/10.1007/978-981-13-8285-7_2
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-8284-0
Online ISBN: 978-981-13-8285-7
eBook Packages: Computer ScienceComputer Science (R0)