This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 4)( T (4 ,S,G ) R (4 ,S,G ) + T (4 ,S,M ) R (4 ,S,m )) = T (3 ,D, 4) T (4 ,S,G ) R (4 ,S,G ) = 2 3 y (c) (2 pt) Using y = 3 4 , complete the rst two iterations of value iteration. i V * i (1) V * i (2) V * i (3) V * i (4) 1 1 6 1 3 1 2 2 3 2 1 4 3 8 1 2 2 3 (d) (2 pt) After how many iterations will value iteration compute the optimal values for all states? After 3 iterations, the values will have converged when y = 3 4 . Above, only V * (1) has not yet converged. We note that for y > 3 4 , a fourth iteration would be required because a fast break has up to four transitions. (e) (2 pt) For what range of values of y is Q * (3 ,S ) Q * (3 ,D )? Q * (3 ,S ) Q * (3 ,D ) T (3 ,S,G ) 1 T (3 ,D, 4) T (4 ,S,G ) 1 1 2 y 2 3 3 4 y...
View
Full
Document
This note was uploaded on 08/30/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at University of California, Berkeley.
 Spring '08
 Staff
 Artificial Intelligence

Click to edit the document details