The Closed List Is an Obstacle Too

Ariel Felner; Shahaf S. Shperberg; Hadar Buzhish

The Closed List Is an Obstacle Too

Ariel Felner
, Shahaf S. Shperberg
, Hadar Buzhish

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

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.

Original language	English
Title of host publication	14th International Symposium on Combinatorial Search, SoCS 2021
Editors	Hang Ma, Ivan Serina
Publisher	Association for the Advancement of Artificial Intelligence
Pages	121-125
Number of pages	5
ISBN (Electronic)	9781713834557
State	Published - 2021
Externally published	Yes
Event	14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China Duration: 26 Jul 2021 → 30 Jul 2021

Publication series

Name	14th International Symposium on Combinatorial Search, SoCS 2021

Conference

Conference	14th International Symposium on Combinatorial Search, SoCS 2021
Country/Territory	China
City	Guangzhou, Virtual
Period	26/07/21 → 30/07/21

Bibliographical note

Publisher Copyright:
Copyright © 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Funding

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.

Funders	Funder number
National Science Foundation	1815660
United States-Israel Binational Science Foundation	2017692
Israel Science Foundation	844/17

Cite this

@inproceedings{5daaeec7d2c64f6d940af4c7df914347,

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",

language = "אנגלית",

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",

}

Felner, A, Shperberg, SS & Buzhish, H 2021, The Closed List Is an Obstacle Too. in H Ma & I Serina (eds), 14th International Symposium on Combinatorial Search, SoCS 2021. 14th International Symposium on Combinatorial Search, SoCS 2021, Association for the Advancement of Artificial Intelligence, pp. 121-125, 14th International Symposium on Combinatorial Search, SoCS 2021, Guangzhou, Virtual, China, 26/07/21.

The Closed List Is an Obstacle Too. / Felner, Ariel; Shperberg, Shahaf S.; Buzhish, Hadar.
14th International Symposium on Combinatorial Search, SoCS 2021. ed. / Hang Ma; Ivan Serina. Association for the Advancement of Artificial Intelligence, 2021. p. 121-125 (14th International Symposium on Combinatorial Search, SoCS 2021).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The Closed List Is an Obstacle Too

AU - Felner, Ariel

AU - Shperberg, Shahaf S.

AU - Buzhish, Hadar

PY - 2021

Y1 - 2021

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 - https://www.scopus.com/pages/publications/85124581676

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

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 -

The Closed List Is an Obstacle Too

Abstract

Publication series

Conference

Bibliographical note

Funding

Other files and links

Fingerprint

Cite this