@inproceedings{7507c598528b47f8bd657f194416ebe7,
title = "The Closed List Is an Obstacle Too",
abstract = "The baseline approach for optimal path finding in 4-connected grids is A* with Manhattan Distance. In this paper we introduce an enhancement to A* (called BOXA*) on grids which does not need any preprocessing and only needs negligible additional memory. The main idea is to treat the closed-list as a dynamic obstacle. We maintain rectangles which surround CLOSED nodes and calculate an admissible heuristic using the fact that an optimal path from a given node must go around these rectangles. We experimentally show the benefits of this approach on a variety of grid domains.",
author = "Ariel Felner and Shperberg, {Shahaf S.} and Hadar Buzhish",
note = "Publisher Copyright: Copyright {\textcopyright} 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 14th International Symposium on Combinatorial Search, SoCS 2021 ; Conference date: 26-07-2021 Through 30-07-2021",
year = "2021",
month = jan,
day = "1",
language = "English",
series = "14th International Symposium on Combinatorial Search, SoCS 2021",
publisher = "Association for the Advancement of Artificial Intelligence",
pages = "121--125",
editor = "Hang Ma and Ivan Serina",
booktitle = "14th International Symposium on Combinatorial Search, SoCS 2021",
}