Proceedings

Comparison of Different Grid Abstractions for Pathfinding on Maps

Download BibTeX Cite

Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 1511-1511.

Abstract

Pathfinding on a map is a fundamental problem in many applications, including robotics and computer games. Typically a grid is superimposed over the map where each cell in the grid forms a unique state. A state-space-based search algorithm, such as A* or IDA* , is then used for finding the optimal (shortest) path. In this paper we analyze the search behavior of both A* and IDA* using different grid representations, providing various new insights via analytical and empirical results.

Yngvi Björnsson, Markus Enzenberger, Robert C. Holte, Jonathan Schaeffer, and Peter Yap. 2003. Comparison of Different Grid Abstractions for Pathfinding on Maps. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03. IJCAI, 1511–1511. https://ijcai.org/proceedings/2003/254
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards