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 |