The Bellman Equation is a recursive formula that forms the basis for dynamic programming. It computes the expected total reward of taking an action from a state in a Markov decision process by breaking it into the immediate reward and the total future expected reward. See dynamic programming.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer Science+Business Media New York
About this entry
Cite this entry
(2017). Bellman Equation. In: Sammut, C., Webb, G.I. (eds) Encyclopedia of Machine Learning and Data Mining. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-7687-1_930
Download citation
DOI: https://doi.org/10.1007/978-1-4899-7687-1_930
Published:
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4899-7685-7
Online ISBN: 978-1-4899-7687-1
eBook Packages: Computer ScienceReference Module Computer Science and Engineering