{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:26:30Z","timestamp":1755998790341,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Microsoft Research, Cambridge"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Games"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1109\/tg.2022.3228401","type":"journal-article","created":{"date-parts":[[2022,12,12]],"date-time":"2022-12-12T19:40:58Z","timestamp":1670874058000},"page":"235-240","source":"Crossref","is-referenced-by-count":4,"title":["Go-Explore Complex 3-D Game Environments for Automated Reachability Testing"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5564-838X","authenticated-orcid":false,"given":"Cong","family":"Lu","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, U.K."}]},{"given":"Raluca","family":"Georgescu","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, U.K."}]},{"given":"Johan","family":"Verwey","sequence":"additional","affiliation":[{"name":"Microsoft Research, Cambridge, U.K."}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v4i1.18697"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/1527476414525241"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1822348.1822363"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE43902.2021.00073"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tg.2020.3032796"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TG.2019.2947597"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/AST52587.2021.00018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/cog52621.2021.9619048"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/tg.2022.3226910"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CoG51982.2022.9893630"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-03157-9"},{"key":"ref12","article-title":"Atari VCS\/2600 easter egg list, 2018a"},{"key":"ref13","article-title":"Exploration by random network distillation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Burda","year":"2019"},{"key":"ref14","article-title":"Simplified 3D movement and pathfinding using navigation meshes","volume-title":"Game Programming Gems","author":"Snook","year":"2000"},{"key":"ref15","first-page":"298","article-title":"Building a near-optimal navigation mesh","volume-title":"AI Game Program. Wisdom","volume":"1","author":"Tozour","year":"2002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1201\/b11152"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"article-title":"Playing Atari with deep reinforcement learning","year":"2013","author":"Mnih","key":"ref18"},{"volume-title":"Reinforcement Learning: An Introduction","year":"2018","author":"Sutton","key":"ref19"},{"key":"ref20","first-page":"2721","article-title":"Count-based exploration with neural density models","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Ostrovski","year":"2017"},{"article-title":"Unifying count-based exploration and intrinsic motivation","year":"2016","author":"Bellemare","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3054912"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/93597.98741"},{"article-title":"Proximal policy optimization algorithms","year":"2017","author":"Schulman","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553441"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CoG47356.2020.9231552"},{"key":"ref27","first-page":"26","article-title":"Taking the scenic route: Automatic exploration for videogames","volume":"2313","author":"Zhan","year":"2019","journal-title":"Proc. 2nd Workshop Knowl. Extraction Games co-located 33rd AAAI Conf. Artif. Intell."},{"article-title":"Efficient exploration via first-person behavior cloning assisted rapidly-exploring random trees","year":"2022","author":"Zuo","key":"ref28"},{"key":"ref29","article-title":"Semi-parametric topological memory for navigation","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Savinov","year":"2018"}],"container-title":["IEEE Transactions on Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782673\/10474491\/09980423.pdf?arnumber=9980423","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,30]],"date-time":"2024-04-30T20:10:52Z","timestamp":1714507852000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9980423\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":29,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tg.2022.3228401","relation":{},"ISSN":["2475-1502","2475-1510"],"issn-type":[{"type":"print","value":"2475-1502"},{"type":"electronic","value":"2475-1510"}],"subject":[],"published":{"date-parts":[[2024,3]]}}}