
A new modification to the A* path-finding algorithm to improve its space and time performance
Vol 2, Issue 3, 2024
Download PDF
Abstract
We propose a new modification to the A* algorithm named AA* that significantly improves space and time complexities. In AA*’s forward pass, the node sets (open and closed) are not used, and only the local node neighborhood is saved to take the next move decision. AA* needs a backward pass to bridge and correct gaps and bad decisions made in the forward pass. The work of the backward pass is far less than that of the forward pass, as most of the task has been done. It is shown via empirical experimental work that our proposed AA* algorithm is superior to the classical A* algorithm in the typical three metrics: running time, number of probed nodes, and length of path. Furthermore, our experimental work showed that AA* is suboptimal in terms of length of path compared to the original Dijkstra’s algorithm with an accuracy of 96.95%.
Keywords
References
Refbacks
- There are currently no refbacks.
Copyright (c) 2024 Aaron Rasheed Rababaah
License URL: https://creativecommons.org/licenses/by/4.0/

Prof. Maode Ma
Qatar University, Qatar
The field of computer and telecommunications engineering is rapidly advancing, with the following being some of the latest developments.
more
We are pleased to congratulate the first anniversiry of the journal of Computer and Telecommunication Engineering (CTE).
more
Owing to the tireless dedication of the editor-in-chief, editorial board members, and the in-house editorial team, we are proud to announce the successful online launch of the first issue of Computer and Telecommunication Engineering.
Asia Pacific Academy of Science Pte. Ltd. (APACSCI) specializes in international journal publishing. APACSCI adopts the open access publishing model and provides an important communication bridge for academic groups whose interest fields include engineering, technology, medicine, computer, mathematics, agriculture and forestry, and environment.