Bellman equations
Summary
The Bellman equations are a system of equations that provide a recursive definition of optimality associated with dynamic programming. Informally, the Bellman equations state that optimality is achieved by taking an optimal first action and recursively taking optimal subsequent actions.
Context
This concept has the prerequisites:
- optimization problems (the Bellman equations provide necessary conditions for a certain class of optimization problems)
- functions of several variables (the Bellman equations are functions of several variables)
Core resources (we're sorry, we haven't finished tracking down resources for this concept yet)
Supplemental resources (the following are optional, but you may find them useful)
-Free-
→ EdX Artificial Intelligence
Other notes:
- This short video segment focuses on the Bellman equations in the context of Markov decision processes.
- navigate between lecture material using the slider at the top
→ Wikipedia
See also
-No Additional Notes-