Reinforcement Learning: An Introduction

  • Johnson J
  • Li J
  • Chen Z
N/ACitations
Citations of this article
96Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Reinforcement learning, one of the most active research areas in artificial intelligence, is a computational approach to learning whereby an agent tries to maximize the total amount of reward it receives when interacting with a complex, uncertain environment. In Reinforcement Learning, Richard Sutton and Andrew Barto provide a clear and simple account of the key ideas and algorithms of reinforcement learning. Their discussion ranges from the history of the field's intellectual foundations to the most recent developments and applications. The only necessary mathematical background is familiarity with elementary concepts of probability.The book is divided into three parts. Part I defines the reinforcement learning problem in terms of Markov decision processes. Part II provides basic solution methods: dynamic programming, Monte Carlo methods, and temporal-difference learning. Part III presents a unified view of the solution methods and incorporates artificial neural networks, eligibility traces, and planning; the two final chapters present case studies and consider the future of reinforcement learning.

Cite

CITATION STYLE

APA

Johnson, J. D., Li, J., & Chen, Z. (2000). Reinforcement Learning: An Introduction. Neurocomputing, 35(1–4), 205–206. https://doi.org/10.1016/s0925-2312(00)00324-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free