Grid Pathfinding on the 2 k Neighborhoods

@inproceedings{Rivera2017GridPO,
  title={Grid Pathfinding on the 2 k Neighborhoods},
  author={Nicolas Rivera and Carlos Hern{\'a}ndez and Jorge A. Baier},
  booktitle={AAAI 2017},
  year={2017}
}
Grid pathfinding, an old AI problem, is central for the development of navigation systems for autonomous agents. A surprising fact about the vast literature on this problem is that very limited neighborhoods have been studied. Indeed, only the 4- and 8-neighborhoods are usually considered, and rarely the 16-neighborhood. This paper describes three contributions that enable the construction of effective grid path planners for extended 2 k -neighborhoods. First, we provide a simple recursive… CONTINUE READING

Similar Papers