{"id":"https://openalex.org/W2975355122","doi":"https://doi.org/10.1109/cig.2019.8848043","title":"Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search","display_name":"Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2975355122","doi":"https://doi.org/10.1109/cig.2019.8848043","mag":"2975355122"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2019.8848043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2019.8848043","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/A5052219877","display_name":"Mohammad Sina Kiarostami","orcid":"https://orcid.org/0000-0002-6100-6567"},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mohammad Sina Kiarostami","raw_affiliation_strings":["School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113884029","display_name":"Mohammad Reza Daneshvaramoli","orcid":null},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Reza Daneshvaramoli","raw_affiliation_strings":["School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021442954","display_name":"Saleh Khalaj Monfared","orcid":"https://orcid.org/0000-0001-5369-5270"},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Saleh Khalaj Monfared","raw_affiliation_strings":["School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043762973","display_name":"Dara Rahmati","orcid":"https://orcid.org/0000-0003-0104-4016"},"institutions":[{"id":"https://openalex.org/I4210146419","display_name":"Institute for Research in Fundamental Sciences","ror":"https://ror.org/04xreqs31","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210146419"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Dara Rahmati","raw_affiliation_strings":["School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"School of Computer Sciences, Institute for Research in Fundamental Sciences (IPM), Tehran, Iran","institution_ids":["https://openalex.org/I4210146419"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032446883","display_name":"Saeid Gorgin","orcid":"https://orcid.org/0000-0001-5898-4872"},"institutions":[{"id":"https://openalex.org/I2802500176","display_name":"Iranian Research Organization for Science and Technology","ror":"https://ror.org/017zx9g19","country_code":"IR","type":"facility","lineage":["https://openalex.org/I2802500176"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Saeid Gorgin","raw_affiliation_strings":["Iranian Research Organization for Science and Technology (IROST), Tehran, Iran","Iranian Research Organization for Science & Technology, IROST , Tehran , Iran"],"affiliations":[{"raw_affiliation_string":"Iranian Research Organization for Science and Technology (IROST), Tehran, Iran","institution_ids":["https://openalex.org/I2802500176"]},{"raw_affiliation_string":"Iranian Research Organization for Science & Technology, IROST , Tehran , Iran","institution_ids":["https://openalex.org/I2802500176"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5052219877"],"corresponding_institution_ids":["https://openalex.org/I4210146419"],"apc_list":null,"apc_paid":null,"fwci":1.443,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86632391,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9997000098228455,"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.9997000098228455,"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.9926000237464905,"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.9574999809265137,"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/pathfinding","display_name":"Pathfinding","score":0.7310295104980469},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6436544060707092},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6067285537719727},{"id":"https://openalex.org/keywords/combinatorial-search","display_name":"Combinatorial search","score":0.5410242676734924},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.5318750143051147},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.48797816038131714},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4563407003879547},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4482283890247345},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4459977149963379},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.3685694932937622},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36380714178085327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27451279759407043},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1902289092540741},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.112417072057724}],"concepts":[{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.7310295104980469},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6436544060707092},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6067285537719727},{"id":"https://openalex.org/C203208320","wikidata":"https://www.wikidata.org/wiki/Q5150830","display_name":"Combinatorial search","level":4,"score":0.5410242676734924},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.5318750143051147},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.48797816038131714},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4563407003879547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4482283890247345},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4459977149963379},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3685694932937622},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36380714178085327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27451279759407043},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1902289092540741},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.112417072057724},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cig.2019.8848043","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2019.8848043","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W10710988","https://openalex.org/W1524083731","https://openalex.org/W1553249180","https://openalex.org/W1559954218","https://openalex.org/W1588299616","https://openalex.org/W1969483458","https://openalex.org/W1989407213","https://openalex.org/W2022695169","https://openalex.org/W2022923563","https://openalex.org/W2126316555","https://openalex.org/W2147798571","https://openalex.org/W2161297112","https://openalex.org/W2166462345","https://openalex.org/W2223723585","https://openalex.org/W2257979135","https://openalex.org/W2914296650","https://openalex.org/W4285719527","https://openalex.org/W6600424691","https://openalex.org/W6633619901","https://openalex.org/W6682555068","https://openalex.org/W6689201166"],"related_works":["https://openalex.org/W4294048575","https://openalex.org/W2045617684","https://openalex.org/W2303512055","https://openalex.org/W3171665292","https://openalex.org/W3216780016","https://openalex.org/W3114120234","https://openalex.org/W2112583639","https://openalex.org/W2978000411","https://openalex.org/W4281784970","https://openalex.org/W4308847374"],"abstract_inverted_index":{"In":[0],"this":[1,83,189],"work,":[2],"we":[3,81,149],"propose":[4],"a":[5,16,56,87,101,112,166],"novel":[6],"implementation":[7,164],"of":[8,25,48,92,153,179,194],"Monte-Carlo":[9],"Tree":[10],"Search":[11],"(MCTS)":[12],"algorithm":[13],"to":[14,33,85,105],"solve":[15,107],"multiagent":[17],"pathfinding":[18,71],"(MAPF)":[19],"problem.":[20],"We":[21,60],"employ":[22],"an":[23],"optimization":[24],"MCTS":[26,98],"with":[27,38,73],"low":[28],"time-complexity":[29],"and":[30,46,89,136],"acceptable":[31],"reliability":[32],"approach":[34],"the":[35,44,49,52,63,78,108,151,154,158,177,192,195],"MAPF":[36,57],"problems":[37],"no":[39,74,184],"time":[40,120],"constraint.":[41],"To":[42,145,176],"examine":[43],"efficiency":[45,152],"performance":[47],"proposed":[50,155],"approach,":[51],"NumberLink":[53],"problem":[54,65,72,84,95,109,196],"as":[55,69],"is":[58,130,183,197],"investigated.":[59],"show":[61],"that":[62],"addressed":[64],"could":[66],"be":[67,86],"characterized":[68],"multi-agent":[70],"overlapping":[75],"paths":[76],"for":[77,157,188],"agents.":[79],"Furthermore,":[80],"define":[82],"simplified":[88],"special":[90],"case":[91],"Multi-commodity":[93],"flow":[94],"(MCFP).":[96],"Our":[97,163],"solution":[99,156,187],"utilizes":[100],"modified":[102],"search-tree":[103],"structure":[104],"efficiently":[106],"based":[110],"on":[111],"2-dimensional":[113],"search":[114],"space":[115],"which":[116],"performs":[117],"in":[118,173],"quadratic":[119],"complexity":[121,139],"(O(m":[122,140],"<sup":[123,132,141],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[124,133,142],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">4</sup>":[125],")":[126,135],"where":[127,191],"input":[128],"size":[129,193],"m":[131],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[134,143],"linear":[137],"memory":[138],")).":[144],"evaluate":[146],"our":[147,180],"algorithm,":[148],"investigate":[150],"well-known":[159],"Flow":[160],"Free":[161],"puzzle.":[162],"solves":[165],"large":[167],"40":[168,170],"\u00d7":[169],"Numberlink":[171],"puzzle":[172,190],"21":[174],"minutes.":[175],"best":[178],"knowledge,":[181],"there":[182],"other":[185],"efficient":[186],"considerably":[198],"large.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}