{"id":"https://openalex.org/W4312496691","doi":"https://doi.org/10.1109/tg.2022.3228401","title":"Go-Explore Complex 3-D Game Environments for Automated Reachability Testing","display_name":"Go-Explore Complex 3-D Game Environments for Automated Reachability Testing","publication_year":2022,"publication_date":"2022-12-12","ids":{"openalex":"https://openalex.org/W4312496691","doi":"https://doi.org/10.1109/tg.2022.3228401"},"language":"en","primary_location":{"id":"doi:10.1109/tg.2022.3228401","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tg.2022.3228401","pdf_url":null,"source":{"id":"https://openalex.org/S4210224842","display_name":"IEEE Transactions on Games","issn_l":"2475-1502","issn":["2475-1502","2475-1510"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Games","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040447924","display_name":"Cong Lu","orcid":"https://orcid.org/0000-0001-5564-838X"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]},{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Cong Lu","raw_affiliation_strings":["Microsoft Research, Cambridge, U.K","University of Oxford, Oxford, U.K"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, U.K","institution_ids":["https://openalex.org/I4210164937"]},{"raw_affiliation_string":"University of Oxford, Oxford, U.K","institution_ids":["https://openalex.org/I40120149"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102589439","display_name":"Raluca Georgescu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Raluca Georgescu","raw_affiliation_strings":["Microsoft Research, Cambridge, U.K"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, U.K","institution_ids":["https://openalex.org/I4210164937"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018762898","display_name":"Johan Verwey","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Johan Verwey","raw_affiliation_strings":["Microsoft Research, Cambridge, U.K"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Cambridge, U.K","institution_ids":["https://openalex.org/I4210164937"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5040447924"],"corresponding_institution_ids":["https://openalex.org/I40120149","https://openalex.org/I4210164937"],"apc_list":null,"apc_paid":null,"fwci":0.6895,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75815832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"16","issue":"1","first_page":"235","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8225497007369995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7742586731910706},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7503584623336792},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6639235019683838},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.48968103528022766},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.4248964190483093},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.41494399309158325},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36931174993515015},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.36548012495040894},{"id":"https://openalex.org/keywords/human\u2013computer-interaction","display_name":"Human\u2013computer interaction","score":0.33794844150543213}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8225497007369995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7742586731910706},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7503584623336792},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6639235019683838},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.48968103528022766},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.4248964190483093},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.41494399309158325},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36931174993515015},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.36548012495040894},{"id":"https://openalex.org/C107457646","wikidata":"https://www.wikidata.org/wiki/Q207434","display_name":"Human\u2013computer interaction","level":1,"score":0.33794844150543213},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tg.2022.3228401","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tg.2022.3228401","pdf_url":null,"source":{"id":"https://openalex.org/S4210224842","display_name":"IEEE Transactions on Games","issn_l":"2475-1502","issn":["2475-1502","2475-1510"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Games","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W41554520","https://openalex.org/W1518289491","https://openalex.org/W1969483458","https://openalex.org/W2075838427","https://openalex.org/W2124352385","https://openalex.org/W2144846415","https://openalex.org/W2151135734","https://openalex.org/W2604382266","https://openalex.org/W2736601468","https://openalex.org/W2953091398","https://openalex.org/W2963276097","https://openalex.org/W2980810656","https://openalex.org/W3018036994","https://openalex.org/W3093544082","https://openalex.org/W3094597259","https://openalex.org/W3129322645","https://openalex.org/W3135498145","https://openalex.org/W3136629921","https://openalex.org/W3175507369","https://openalex.org/W4296426214","https://openalex.org/W4298857966","https://openalex.org/W4300860537","https://openalex.org/W4301379554","https://openalex.org/W4312776598","https://openalex.org/W6637967152","https://openalex.org/W6717230150","https://openalex.org/W6735033012","https://openalex.org/W6741002519","https://openalex.org/W6748848655","https://openalex.org/W6756303580","https://openalex.org/W6756579311","https://openalex.org/W6845050213"],"related_works":["https://openalex.org/W2127267268","https://openalex.org/W2136512912","https://openalex.org/W2067910792","https://openalex.org/W2156446763","https://openalex.org/W2150194458","https://openalex.org/W2143461633","https://openalex.org/W4321471459","https://openalex.org/W2889071233","https://openalex.org/W2380814829","https://openalex.org/W2387511021"],"abstract_inverted_index":{"Modern":[0],"AAA":[1],"video":[2],"games":[3,23],"feature":[4],"huge":[5],"game":[6,110,159],"levels":[7],"and":[8,69,95,130],"maps,":[9],"which":[10,62],"are":[11],"increasingly":[12],"hard":[13],"for":[14,103,172],"level":[15],"testers":[16],"to":[17,74,141],"cover":[18,151],"exhaustively.":[19],"As":[20],"a":[21,152,165],"result,":[22],"often":[24],"ship":[25],"with":[26,82,121],"catastrophic":[27],"bugs,":[28],"such":[29],"as":[30],"the":[31,35,57,67,87,101,109,127,136],"player":[32],"falling":[33],"through":[34],"floor":[36],"or":[37,106],"being":[38],"stuck":[39],"in":[40,51,124],"walls.":[41],"We":[42,77],"propose":[43],"an":[44],"approach":[45],"specifically":[46],"targeted":[47],"at":[48],"reachability":[49],"bugs":[50,94],"simulated":[52],"3-D":[53],"environments":[54,99],"based":[55],"on":[56,164],"powerful":[58],"exploration":[59],"algorithm,":[60],"Go-Explore,":[61],"saves":[63],"unique":[64,133],"checkpoints":[65],"across":[66,135],"map":[68,137],"then":[70],"identifies":[71],"promising":[72,171],"ones":[73],"explore":[75],"from.":[76],"show":[78],"that":[79],"when":[80],"coupled":[81],"simple":[83],"heuristics":[84],"derived":[85],"from":[86],"game's":[88],"navigation":[89,128],"mesh,":[90],"Go-Explore":[91,112],"finds":[92],"challenging":[93],"comprehensively":[96],"explores":[97],"complex":[98],"without":[100],"need":[102],"human":[104],"demonstration":[105],"knowledge":[107],"of":[108,132,144],"dynamics.":[111],"vastly":[113],"outperforms":[114],"more":[115],"complicated":[116],"baselines":[117],"including":[118],"reinforcement":[119],"learning":[120],"intrinsic":[122],"curiosity":[123],"both":[125],"covering":[126],"mesh":[129],"number":[131],"positions":[134],"discovered.":[138],"Finally,":[139],"due":[140],"our":[142,147],"use":[143],"parallel":[145],"agents,":[146],"algorithm":[148],"can":[149],"fully":[150],"vast":[153],"1.5":[154,157],"km":[155,158],"\u00d7":[156],"world":[160],"within":[161],"10":[162],"h":[163],"single":[166],"machine":[167],"making":[168],"it":[169],"extremely":[170],"continuous":[173],"testing":[174],"suites.":[175]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}