Simple implementation of SARSA learning algorithm in python to solve a maze [1]
Data is fed into the algorithm as text file containing specifications about the maze e.g. -
sssssssssssssss
000000000000000
000000000000000
000000000000000
000000000000000
0000xxxxxxx0000
000000000000000
000000000000000
000000000000000
xxxxx00000xxxxx
000000000000000
000000000000000
000000000000000
0000xxxxxxx0000
000000000000000
000000000000000
fffffffffffffff
Where
- x - barrier
- s - start
- f - final
- Clone the repository to your local machine
git clone https://github.com/AshishSinha5/maze_runner/
- run main.py with apropiate args e.g. -
python main.py -f "data/maze2.txt" -a 0.4 -g 0.9 -e 0.1
The state space are the coordinates of the maze with (-1,-1) being the state when the agent goes out of bounds and action space are the two components of velocity with a constrint that it can have a absolute value of greater than 5.
The algorithm was tested for three mazes, and the outputs and plots are shown below. We can see that the algorithm(agent) starts to find the currect path after few iteration and also the proportion of successes keep on increasing with the number of episodes as the agent finds the optimal action value function.
| Maze 1 | Maze 2 | Maze 3 |
|---|---|---|
 |
 |
 |
 |
 |
 |
 |
 |
 |
[1]Reinforcement Learning: An Introduction, R. Sutton, and A. Barto., The MIT Press, Second edition, (2018)