Different path-finding algorithms are chosen in different environments, according to their advantages and disadvantages. This study investigates the characteristics of three of the popular heuristic path-finding algorithms — A*, IDA* and JPS. The investigation focuses on their performance of time efficiency, memory efficiency and performance on whether could give out optimal solution, and was carried out in 2D orthogonal grids. These algorithms are shown to be affected by density of barriers in grids, complexity of routes, map size and whether the map has boundary. This study analyzed the data of performance of three algorithms based on these aspects and concluded the environments that are suitable for each algorithm. In general, A* was found to be more universal when navigating, JPS was less universal and IDA* has the most limited universality.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.