Subgoal graphs for eight-neighbor gridworlds

摘要: We propose a method for preprocessing an eightneighbor gridworld to generate subgoal graph and using this find shortest paths faster than A*, by first finding high-level through subgoals then low-level between consecutive on the path.