The Closed List Is an Obstacle Too

Ariel Felner, Shahaf S. Shperberg, Hadar Buzhish

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication14th International Symposium on Combinatorial Search, SoCS 2021
EditorsHang Ma, Ivan Serina
PublisherAssociation for the Advancement of Artificial Intelligence
Pages121-125
Number of pages5
ISBN (Electronic)9781713834557
StatePublished - 1 Jan 2021
Event14th International Symposium on Combinatorial Search, SoCS 2021 - Guangzhou, Virtual, China
Duration: 26 Jul 202130 Jul 2021

Publication series

Name14th International Symposium on Combinatorial Search, SoCS 2021

Conference

Conference14th International Symposium on Combinatorial Search, SoCS 2021
Country/TerritoryChina
CityGuangzhou, Virtual
Period26/07/2130/07/21

Fingerprint

Dive into the research topics of 'The Closed List Is an Obstacle Too'. Together they form a unique fingerprint.

Cite this