{"type":"ScholarlyArticle","title":"Comparison of Different Grid Abstractions for Pathfinding on Maps","authors":[{"name":"Yngvi Björnsson","slug":"yngvi-bjornsson","given":"Yngvi","family":"Björnsson","affiliation":""},{"name":"Markus Enzenberger","slug":"markus-enzenberger","given":"Markus","family":"Enzenberger","affiliation":""},{"name":"Robert C. Holte","slug":"robert-c-holte","given":"Robert C.","family":"Holte","affiliation":""},{"name":"Jonathan Schaeffer","slug":"jonathan-schaeffer","given":"Jonathan","family":"Schaeffer","affiliation":""},{"name":"Peter Yap","slug":"peter-yap","given":"Peter","family":"Yap","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2003/254","pdf":"https://ijcai.org/proceedings/2003/0254.pdf","markdown":"https://ijcai.org/proceedings/2003/254.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/254","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":254,"pages":{"first":1511,"last":1511},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}