{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:39:59Z","timestamp":1743266399133,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/cig.2019.8848043","type":"proceedings-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:49:14Z","timestamp":1569548954000},"page":"1-4","source":"Crossref","is-referenced-by-count":9,"title":["Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search"],"prefix":"10.1109","author":[{"given":"Mohammad Sina","family":"Kiarostami","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Reza Daneshvaramoli","sequence":"additional","affiliation":[]},{"given":"Saleh Khalaj","family":"Monfared","sequence":"additional","affiliation":[]},{"given":"Dara","family":"Rahmati","sequence":"additional","affiliation":[]},{"given":"Saeid","family":"Gorgin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"19","article-title":"Accelerated a* trajectory plan-´ ning: Grid-based path planning comparison","author":"si? sl? ak","year":"2009","journal-title":"International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1990.126256"},{"key":"ref13","first-page":"1","article-title":"Monte-carlo fork search for cooperative path-finding","author":"bouzy","year":"2013","journal-title":"ICGA Computer Games Workshop"},{"article-title":"Numberlink","year":"1989","author":"nikoli","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2197\/ipsjjip.23.239"},{"key":"ref16","volume":"82","author":"kramer","year":"1982","journal-title":"Wire-routing is NP-complete"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.3390\/a5020176"},{"year":"2012","key":"ref18","article-title":"Flow Free"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1609\/aiide.v1i1.18726","article-title":"Cooperative pathfinding","volume":"1","author":"silver","year":"2005","journal-title":"AIIDE"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840371"},{"key":"ref5","article-title":"Rts games and real-time ai research","volume":"6370","author":"buro","year":"2004","journal-title":"Proceedings of the Behavior Representation in Modeling and Simulation Conference (BRIMS)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/cav.1427"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7767","article-title":"An optimization variant of multi-robot path planning is intractable","author":"surynek","year":"2010","journal-title":"AAAI Conference on Artificial Intelligence"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2014.2345842"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1038\/nature16961","article-title":"Mastering the game of go with deep neural networks and tree search","volume":"529","author":"silver","year":"2016","journal-title":"Nature"},{"key":"ref9","article-title":"Multi-agent path finding for self interested agents","author":"bnaya","year":"2013","journal-title":"Sixth Annual Symposium on Combinatorial Search"},{"key":"ref20","article-title":"Monte-carlo planning for pathfinding in real-time strategy games","author":"naveed","year":"2010","journal-title":"PLANS"}],"event":{"name":"2019 IEEE Conference on Games (CoG)","start":{"date-parts":[[2019,8,20]]},"location":"London, United Kingdom","end":{"date-parts":[[2019,8,23]]}},"container-title":["2019 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8844551\/8847948\/08848043.pdf?arnumber=8848043","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,20]],"date-time":"2023-09-20T23:15:58Z","timestamp":1695251758000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8848043\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/cig.2019.8848043","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}