VU Computer Science Dynamic Programming and Exercises
Description
1. Given the dynamic programming problem of finding the optimal way of carrying n people to the top floor. Problem Link: https://cses.fi/problemset/task/1653
a. Formulate this problem as a Markov Decision Process where the elevator takes the shortest path to get all people to the top floor. For simplicity, consider number of people [n = 4]. You do not need to write any code for this problem
i. State space: Explain the state space for your formulation
ii. Action space: Explain the action space for your formulation
iii. Reward space: What would the reward function be, for this given task, such that we find the shortest sequence of decisions
iv. Transition Probability: Given your current state from part (i) and an action from part (ii), what would be the next state(s)
2. Solve any 4 the following exercises from the book. Book Link: http://incompleteideas.net/book/RLbook2020.pdf
a. Exercise 3.6
b. Exercise 3.12
c. Exercise 5.3
d. Exercise 6.2
e. Exercise 6.11
f. Exercise 6.12
g. Exercise 9.4
Have a similar assignment? "Place an order for your assignment and have exceptional work written by our team of experts, guaranteeing you A results."
