For this exercise we will have a look at n-step methods and eligibility trace. The environment under examination is given by the inverted pendulum, which is a popular system for toy examples of control theory.
- discretization of continuous state spaces in order to make corresponding systems available for tabular RL algorithms
- on-policy epsilon-greedy control using n-step Sarsa
- on-policy epsilon-greedy control using TD lambda