Abstract
In this chapter we will study dynamic programming. Starting with the fundamental equation of dynamic programming as defined by Bellman, we will further dive deep into its generalization. We will understand the class of problems that can be solved with the framework of dynamic programming. Then we will study reinforcement learning as one subcategory of dynamic programming in detail. We will study the concepts of exploration and exploitation and the optimal tradeoff between them to achieve the best performance. We will also look at some variation of the reinforcement learning in the form of Q-learning and SARSA.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Wikipedia - Dynamic Programming Applications https://en.wikipedia.org/wiki/Dynamic_programming#Algorithms_that_use_dynamic_programming
Shannon number https://en.wikipedia.org/wiki/Shannon_number
Deep Blue (chess computer) https://en.wikipedia.org/wiki/Deep_Blue_(chess_computer)
Setting up Mario Bros. in OpenAI’s gym https://becominghuman.ai/getting-mario-back-into-the-gym-setting-up-super-mario-bros-in-openais-gym-8e39a96c1e41
Open AI Gym http://gym.openai.com/
Richard Bellman, Dynamic Programming, (Dover Publications, Inc., New York, 2003).
David Silver, Thomas Hubert, Julian Schrittwieser, Ioannis Antonoglou, Matthew Lai, Arthur Guez, Marc Lanctot, Laurent Sifre, Dharshan Kumaran, Thore Graepel, Timothy Lillicrap, Karen Simonyan, Demis Hassabis, Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm, AxXiv e-prints, Dec 2017.
G. A. Rummery, Mahesh Niranjan On-Line Q-Learning using Connectionist Systems, volume 37. University of Cambridge, Department of Engineering.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Joshi, A.V. (2020). Dynamic Programming and Reinforcement Learning. In: Machine Learning and Artificial Intelligence. Springer, Cham. https://doi.org/10.1007/978-3-030-26622-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-030-26622-6_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26621-9
Online ISBN: 978-3-030-26622-6
eBook Packages: EngineeringEngineering (R0)