AI, Artificial Intelligence, Markov Decision Process, Bellman Equation, Machine Learning.
states given an action. R represents the immediate rewards obtained by the agent for each state-action pair. The objective in an MDP is to find an optimal policy, which is a mapping from states to actions that maximizes the expected cumulative rewards over time. This is where the Bellman equation