Grid World

less than 1 minute read

Published:

Consider the classic problem of finding the shortest path between two locations on a grid containing obstacles.

Given

  • Grid Dimensions : Height $H$, Width $W$

  • Start location : $(h_{S},w_{S})$

  • Goal location : $(h_{G},w_{G})$

  • Obstacles : $\mathcal{X} = $ { $(h_{X}^{i},w_{X}^{i}): 1 \leq i \leq N_{X}$ }

  • Allowed moves : King’s moves

We consider two variations of value iteration,

Result

You can find the code used in these experiments here.