{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-survey-of-parallel-a","title":"A Survey of Parallel A*","arxiv_id":"1708.05296","date":"2017-08-16","proceeding":null,"authors":["Alex Fukunaga","Adi Botea","Yuu Jinnai","Akihiro Kishimoto"],"abstract":"A* is a best-first search algorithm for finding optimal-cost paths in graphs.\nA* benefits significantly from parallelism because in many applications, A* is\nlimited by memory usage, so distributed memory implementations of A* that use\nall of the aggregate memory on the cluster enable problems that can not be\nsolved by serial, single-machine implementations to be solved. We survey\napproaches to parallel A*, focusing on decentralized approaches to A* which\npartition the state space among processors. We also survey approaches to\nparallel, limited-memory variants of A* such as parallel IDA*.","url_abs":"http://arxiv.org/abs/1708.05296v1","url_pdf":"http://arxiv.org/pdf/1708.05296v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"a-survey-of-parallel-a","repo_url":"https://github.com/narula2000/RustProject","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"survey","task_name":"Survey"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}