{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:38:19Z","timestamp":1750307899336,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,11,3]],"date-time":"2008-11-03T00:00:00Z","timestamp":1225670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,11,3]]},"DOI":"10.1145\/1496984.1496987","type":"proceedings-article","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T13:45:53Z","timestamp":1233236753000},"page":"9-16","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Combining heuristic and landmark search for path planning"],"prefix":"10.1145","author":[{"given":"Kevin","family":"Grant","sequence":"first","affiliation":[{"name":"University of Lethbridge, Lethbridge, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Mould","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Freeciv. www.freeciv.org.  Freeciv. www.freeciv.org."},{"key":"e_1_3_2_1_2_1","first-page":"269","volume-title":"Numerische Mathematik","author":"Dijkstra E. W.","year":"1959","unstructured":"E. W. Dijkstra . A Note on Two Problems in Connexion with Graphs . Numerische Mathematik , pages 269 -- 271 , 1959 . E. W. Dijkstra. A Note on Two Problems in Connexion with Graphs. Numerische Mathematik, pages 269--271, 1959."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/367766.368168"},{"key":"e_1_3_2_1_4_1","first-page":"156","volume-title":"SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the Shortest Path: A* Search meets Graph Theory . In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms , pages 156 -- 165 , 2005 . A. V. Goldberg and C. Harrelson. Computing the Shortest Path: A* Search meets Graph Theory. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 156--165, 2005."},{"key":"e_1_3_2_1_5_1","volume-title":"Eighteenth European Conference on Artificial Intelligence - Workshop on AI and Games","author":"Grant K.","year":"2008","unstructured":"K. Grant and D. Mould . LPI: Approximating Shortest Paths using Landmarks . In Eighteenth European Conference on Artificial Intelligence - Workshop on AI and Games , 2008 . K. Grant and D. Mould. LPI: Approximating Shortest Paths using Landmarks. In Eighteenth European Conference on Artificial Intelligence - Workshop on AI and Games, 2008."},{"key":"e_1_3_2_1_6_1","author":"Hart P. E.","year":"1968","unstructured":"P. E. Hart , N. J. Nilsson , and B. Raphael . A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs. IEEE Trans. Syst. Sci. and Cybernetics, SSC-4(2):100--107 , 1968 . P. E. Hart, N. J. Nilsson, and B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs. IEEE Trans. Syst. Sci. and Cybernetics, SSC-4(2):100--107, 1968.","journal-title":"IEEE Trans. Syst. Sci. and Cybernetics, SSC-4(2):100--107"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28633-2_13"},{"key":"e_1_3_2_1_9_1","volume-title":"Pearson Education","author":"Russell S. J.","year":"2003","unstructured":"S. J. Russell and P. Norvig . Artificial Intelligence: A Modern Approach . Pearson Education , 2003 . S. J. Russell and P. Norvig. Artificial Intelligence: A Modern Approach. Pearson Education, 2003."}],"event":{"name":"FuturePlay08: FuturePlay 2008 Academic Games Conference","sponsor":["SIGCHI ACM Special Interest Group on Computer-Human Interaction"],"location":"Toronto Ontario Canada","acronym":"FuturePlay08"},"container-title":["Proceedings of the 2008 Conference on Future Play: Research, Play, Share"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1496984.1496987","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1496984.1496987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:31Z","timestamp":1750258051000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1496984.1496987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,3]]},"references-count":9,"alternative-id":["10.1145\/1496984.1496987","10.1145\/1496984"],"URL":"https:\/\/doi.org\/10.1145\/1496984.1496987","relation":{},"subject":[],"published":{"date-parts":[[2008,11,3]]},"assertion":[{"value":"2008-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}