Bellman Value Iteration (VI) (Optimal Policies for MDPs Optimal Policies for MDPs)
Jump to navigation
Jump to search
Time Complexity
$O({2}^n)$
Space Complexity
$O(n)$ words
(Only needs to store values (V) and policy (pi), both size O(n))
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
1957