TY - GEN
T1 - The Closed List Is an Obstacle Too
AU - Felner, Ariel
AU - Shperberg, Shahaf S.
AU - Buzhish, Hadar
N1 - Funding Information:
This work was supported by Israel Science Foundation (ISF) grant #844/17 to Ariel Felner and Eyal Shimony, by BSF grant #2017692, by NSF grant #1815660 and by the Frankel center for CS at BGU.
Publisher Copyright:
Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2021/1/1
Y1 - 2021/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85124581676&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85124581676
T3 - 14th International Symposium on Combinatorial Search, SoCS 2021
SP - 121
EP - 125
BT - 14th International Symposium on Combinatorial Search, SoCS 2021
A2 - Ma, Hang
A2 - Serina, Ivan
PB - Association for the Advancement of Artificial Intelligence
T2 - 14th International Symposium on Combinatorial Search, SoCS 2021
Y2 - 26 July 2021 through 30 July 2021
ER -