{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T16:22:27Z","timestamp":1775665347818,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"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":[[2020,12,1]]},"DOI":"10.1109\/ssci47803.2020.9308584","type":"proceedings-article","created":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T23:12:38Z","timestamp":1609888358000},"page":"2647-2654","source":"Crossref","is-referenced-by-count":12,"title":["Combining Deep Reinforcement Learning with Search Heuristics for Solving Multi-Agent Path Finding in Segment-based Layouts"],"prefix":"10.1109","author":[{"given":"Robbert","family":"Reijnen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wim","family":"Nuijten","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caglar","family":"Senaras","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariana","family":"Goldak - Altgassen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Proximal policy optimization algorithms","author":"schulman","year":"2017","journal-title":"arXiv preprint arXiv 1707 06347"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"ref13","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":"ref14","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v24i1.7564","article-title":"Finding optimal solutions to cooperative pathfinding problems","author":"standley","year":"2010","journal-title":"Twenty-Fourth AAAI Conference on Artificial Intelligence"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-33274-7_6"},{"key":"ref16","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","author":"stern","year":"2019","journal-title":"Twelfth Annual Symposium on Combinatorial Search"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-307-3.50049-6"},{"key":"ref18","year":"2019","journal-title":"Bagage handling vanderlande"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref4","author":"egorov","year":"2016","journal-title":"Multi-Agent Deep Reinforcement Learning"},{"key":"ref3","author":"douglas","year":"2018","journal-title":"Automated Guided Vehicles"},{"key":"ref6","first-page":"45","article-title":"Multi-agent shared hierarchy reinforcement learning","author":"mehta","year":"2005","journal-title":"ICML Workshop on Rich Representations for Reinforcement Learning"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840371"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509582"},{"key":"ref7","author":"punma","year":"2018","journal-title":"Autonomous vehicle fleet coordination with deep reinforcement learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref1","article-title":"Suboptimal variants of the conflict-based search algorithm for the multi-agent pathfinding problem","author":"barer","year":"2014","journal-title":"Seventh Annual Symposium on Combinatorial Search"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2903261"}],"event":{"name":"2020 IEEE Symposium Series on Computational Intelligence (SSCI)","location":"Canberra, ACT, Australia","start":{"date-parts":[[2020,12,1]]},"end":{"date-parts":[[2020,12,4]]}},"container-title":["2020 IEEE Symposium Series on Computational Intelligence (SSCI)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9308061\/9308107\/09308584.pdf?arnumber=9308584","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,10]],"date-time":"2022-12-10T17:31:44Z","timestamp":1670693504000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9308584\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,1]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/ssci47803.2020.9308584","relation":{},"subject":[],"published":{"date-parts":[[2020,12,1]]}}}