{"id":"https://openalex.org/W2976924632","doi":"https://doi.org/10.1109/cig.2019.8848077","title":"Parallel Nested Rollout Policy Adaptation","display_name":"Parallel Nested Rollout Policy Adaptation","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2976924632","doi":"https://doi.org/10.1109/cig.2019.8848077","mag":"2976924632"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2019.8848077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2019.8848077","pdf_url":null,"source":{"id":"https://openalex.org/S4306498491","display_name":"2019 IEEE Conference on Games (CoG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Conference on Games (CoG)","raw_type":"proceedings-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/A5036052429","display_name":"Andrzej Nag\u00f3rko","orcid":"https://orcid.org/0000-0001-6390-1402"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]},{"id":"https://openalex.org/I4210137370","display_name":"Institute of Mathematics","ror":"https://ror.org/04hrrh248","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210137370","https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Andrzej Nagorko","raw_affiliation_strings":["Institute of Mathematics, University of Warsaw, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613","https://openalex.org/I4210137370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036052429"],"corresponding_institution_ids":["https://openalex.org/I4210137370","https://openalex.org/I4654613"],"apc_list":null,"apc_paid":null,"fwci":2.477,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.89189189,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"818","issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9933000206947327,"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/computer-science","display_name":"Computer science","score":0.7813788652420044},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.747246503829956},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.7261973023414612},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7236136198043823},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.6072809100151062},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5724760890007019},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5035988688468933},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46517300605773926},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4300512671470642},{"id":"https://openalex.org/keywords/adaptation","display_name":"Adaptation (eye)","score":0.4211844503879547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42027565836906433},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14473789930343628}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7813788652420044},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.747246503829956},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7261973023414612},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7236136198043823},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.6072809100151062},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5724760890007019},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5035988688468933},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46517300605773926},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4300512671470642},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.4211844503879547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42027565836906433},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14473789930343628},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cig.2019.8848077","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2019.8848077","pdf_url":null,"source":{"id":"https://openalex.org/S4306498491","display_name":"2019 IEEE Conference on Games (CoG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Conference on Games (CoG)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W26351355","https://openalex.org/W89766480","https://openalex.org/W964191714","https://openalex.org/W1490004905","https://openalex.org/W1499159997","https://openalex.org/W1807280442","https://openalex.org/W2005815574","https://openalex.org/W2005839169","https://openalex.org/W2397074156","https://openalex.org/W2479244878","https://openalex.org/W2507373662","https://openalex.org/W2738669288","https://openalex.org/W2766447205","https://openalex.org/W2788830137","https://openalex.org/W2914215521","https://openalex.org/W2964295739","https://openalex.org/W4293396018","https://openalex.org/W6603574455","https://openalex.org/W6625267704","https://openalex.org/W6629337653","https://openalex.org/W6629871925","https://openalex.org/W6712425445","https://openalex.org/W6721219028"],"related_works":["https://openalex.org/W2058965144","https://openalex.org/W2164382479","https://openalex.org/W2146343568","https://openalex.org/W98480971","https://openalex.org/W2150291671","https://openalex.org/W2013643406","https://openalex.org/W2027972911","https://openalex.org/W2157978810","https://openalex.org/W2597809628","https://openalex.org/W3159037256"],"abstract_inverted_index":{"Nested":[0],"Rollout":[1],"Policy":[2],"Adaptation":[3],"(NRPA)":[4],"is":[5,76],"a":[6,26,47,77,112,123,135,140,147],"Monte":[7],"Carlo":[8],"tree":[9],"search":[10],"algorithm":[11],"that":[12,52,71],"excels":[13],"in":[14,80,162],"the":[15,56,74,81,99,103,119,144,179],"domain":[16],"of":[17,29,50,55,73,167],"single":[18,136],"agent":[19],"optimization":[20],"problems.":[21],"It":[22,159],"was":[23,157,160,174,183],"applied":[24,98],"to":[25,63,90,102],"wide":[27],"class":[28],"problems,":[30],"including":[31],"vehicle":[32],"routing,":[33],"DNA":[34],"alignment,":[35],"3D":[36],"packing,":[37],"travelling":[38],"salesman":[39],"problem,":[40],"combinatorial":[41],"puzzles":[42],"and":[43],"more.":[44],"We":[45,97],"develop":[46],"parallel":[48,88,100],"version":[49,101],"NRPA":[51,150],"replicates":[53],"results":[54],"sequential":[57],"version.":[58],"The":[59,67,170],"parallelization":[60,85],"allows":[61],"us":[62],"run":[64,91],"deeper":[65],"calculations.":[66,96],"experimental":[68],"data":[69],"shows":[70],"depth":[72],"calculation":[75],"deciding":[78],"factor":[79,141],"result":[82,115],"quality.":[83],"Earlier":[84],"attempts":[86],"used":[87,111],"architecture":[89,125],"wider,":[92],"but":[93],"not":[94],"deeper,":[95],"Morpion":[104],"Solitaire":[105],"benchmark.":[106],"To":[107],"aid":[108],"parallelization,":[109],"we":[110,129],"different":[113,171],"best":[114],"replacement":[116,172],"rule.":[117],"Using":[118],"new":[120],"rule,":[121],"on":[122],"distributed":[124],"with":[126,152],"768":[127],"cores":[128],"obtained":[130],"an":[131],"average":[132],"speedup":[133],"over":[134],"core":[137],"computation":[138,151],"by":[139],"547.48.":[142],"For":[143],"first":[145],"time":[146],"level":[148,156],"6":[149],"80":[153],"iterations":[154],"per":[155],"finished.":[158],"completed":[161],"less":[163],"than":[164],"20":[165],"hours":[166],"wall-clock":[168],"time.":[169],"rule":[173],"effective.":[175],"In":[176],"each":[177],"run,":[178],"record":[180],"178-move":[181],"sequence":[182],"found.":[184]},"counts_by_year":[{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}