Bellman optimality equation mathematical notation

Bellman optimality equation is a recurring research-paper notation family. Defines optimal value recursively by selecting the action with the highest expected immediate reward plus discounted optimal continuation.

Bellman optimality equation: Defines optimal value recursively by selecting the action with the highest expected immediate reward plus discounted optimal continuation. Example: Use the best action value available in each state.