Back to Results
First PageMeta Content



EE365: Dynamic Programming Proof 1 Markov decision problem find policy µ = (µ0 , . . . , µT −1 ) that minimizes
Add to Reading List

Document Date: 2016-01-08 18:51:40


Open Document

File Size: 134,92 KB

Share Result on Facebook
UPDATE