{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T15:54:04Z","timestamp":1776527644796,"version":"3.51.2"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,8,17]],"date-time":"2021-08-17T00:00:00Z","timestamp":1629158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100007631","name":"CIFAR","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007631","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,17]]},"DOI":"10.1109\/cog52621.2021.9618995","type":"proceedings-article","created":{"date-parts":[[2021,12,7]],"date-time":"2021-12-07T20:53:06Z","timestamp":1638910386000},"page":"01-05","source":"Crossref","is-referenced-by-count":4,"title":["Fast Synthesis of Algebraic Heuristic Functions for Video-game Pathfinding"],"prefix":"10.1109","author":[{"given":"Vadim","family":"Bulitko","sequence":"first","affiliation":[]},{"given":"Sergio Poo","family":"Hernandez","sequence":"additional","affiliation":[]},{"given":"Levi H.S.","family":"Lelis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2230632"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1609\/aaai.v25i1.7815","article-title":"Euclidean heuristic optimization","author":"rayner","year":"2011","journal-title":"AAAI"},{"key":"ref12","first-page":"357","article-title":"Learning from multiple heuristics","author":"samadi","year":"2008","journal-title":"AAAI"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.09.012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-019-0070-z"},{"key":"ref15","article-title":"Policy-guided heuristic search with guarantees","author":"orseau","year":"0","journal-title":"AAAI 2021"},{"key":"ref16","first-page":"1060","article-title":"Discovering reinforcement learning algorithms","volume":"33","author":"oh","year":"2020","journal-title":"NeurIPS"},{"key":"ref17","article-title":"Procedural content generation: Goals, challenges and actionable steps","volume":"6","author":"togelius","year":"2013","journal-title":"Dagstuhl Follow-Ups"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2015.2494596"},{"key":"ref19","first-page":"34","article-title":"Towards positively surprising non-player characters in video games","author":"bulitko","year":"2017","journal-title":"EXAG\/AIIDE"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/198"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.7551\/978-0-262-33936-0-ch024"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2241"},{"key":"ref6","article-title":"Speeding up heuristic function generation via automatically extending the formula grammar","author":"hernandez","year":"0","journal-title":"SoCS 2021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CoG47356.2020.9231637"},{"key":"ref8","first-page":"9","article-title":"Improved heuristics for optimal pathfinding on game maps","author":"bjarnsson","year":"2006","journal-title":"AIIDE"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/0824-7935.00065"},{"key":"ref2","first-page":"609","article-title":"Memory-based heuristics for explicit state spaces","author":"sturtevant","year":"2009","journal-title":"IJCAI"},{"key":"ref9","first-page":"31","article-title":"Memory-efficient abstractions for pathfinding","author":"sturtevant","year":"2007","journal-title":"AIIDE"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1609\/aiide.v15i1.5228","article-title":"Pathfinding and abstraction with dynamic terrain costs","author":"sturtevant","year":"2019","journal-title":"AIIDE"},{"key":"ref20","article-title":"Evolving NPC behaviours in A-life with player proxies","author":"bulitko","year":"0","journal-title":"EXAG\/AIIDE 2018"},{"key":"ref22","article-title":"Forza horizor 2: What's a drivatar, and why should I care?","author":"wire staff","year":"0","journal-title":"Xbox Wire 2014"},{"key":"ref21","article-title":"Com-bining search-based procedural content generation and social gaming in the petalz video game","author":"risi","year":"0","journal-title":"AIIDE 2012"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55849-3_29"},{"key":"ref23","author":"games","year":"2018","journal-title":"No Man's Sky Next"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(70)90007-X"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2197681"}],"event":{"name":"2021 IEEE Conference on Games (CoG)","location":"Copenhagen, Denmark","start":{"date-parts":[[2021,8,17]]},"end":{"date-parts":[[2021,8,20]]}},"container-title":["2021 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9618888\/9618891\/09618995.pdf?arnumber=9618995","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,17]],"date-time":"2023-01-17T15:42:49Z","timestamp":1673970169000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9618995\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,17]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/cog52621.2021.9618995","relation":{},"subject":[],"published":{"date-parts":[[2021,8,17]]}}}