Game Development Assignment Help
The figure below shows a rectangular grid world representation of a simple finite MDP. The cells of the grid except two grey colored walls correspond to the states of the environment.
At each cell, five actions are possible: north, south, east, west, and south-east, which deterministically cause the agent to move one cell in the respective direction on the grid. Actions that would take the agent off the grid or that would make the agent hit a wall leave its location unchanged, but also result in a reward of ?1. Other actions result in a reward of 0, except those that move the agent out of the special states X and Y. From state X, all five actions yield a reward of +3 and take the agent to X?. From state Y, all actions yield a reward of +5 and take the agent to Y?.
Perform the following tasks;
1. Solve the given MDP using Policy Iteration (Policy Evaluation + Greedy Policy Improvement)
2. Solve the given MDP using Value Iteration
For both tasks, submit the optimal state-value, action-value functions, and optimal policy together with the number of iterations it takes to compute these functions. Besides, provide state value function for the equiprobable random policy.
This Game Development Assessment has been solved by our IT experts at TVAssignmentHelp. Our Assignment Writing Experts are efficient to provide a fresh solution to this question. We are serving more than 10000+ Students in Australia, UK & US by helping them to score HD in their academics. Our Experts are well trained to follow all marking rubrics & referencing style.
Be it a used or new solution, the quality of the work submitted by our assignment experts remains unhampered. You may continue to expect the same or even better quality with the used and new assignment solution files respectively. There’s one thing to be noticed that you could choose one between the two and acquire an HD either way. You could choose a new assignment solution file to get yourself an exclusive, plagiarism (with free Turnitin file), expert quality assignment or order an old solution file that was considered worthy of the highest distinction.