{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T02:31:10Z","timestamp":1783823470173,"version":"3.55.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"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":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1109\/lra.2021.3139145","type":"journal-article","created":{"date-parts":[[2021,12,29]],"date-time":"2021-12-29T23:44:42Z","timestamp":1640821482000},"page":"1455-1462","source":"Crossref","is-referenced-by-count":74,"title":["Learning Selective Communication for Multi-Agent Path Finding"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4768-1531","authenticated-orcid":false,"given":"Ziyuan","family":"Ma","sequence":"first","affiliation":[{"name":"School of Computing Science, Simon Fraser University, Burnaby, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0145-703X","authenticated-orcid":false,"given":"Yudong","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Waterloo, Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9003-2054","authenticated-orcid":false,"given":"Jia","family":"Pan","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The University of Hong Kong, Hong Kong, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2715406"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631084"},{"key":"ref4","first-page":"810","article-title":"Efficient SAT approach to multi-agent path finding under the sum of costs objective","volume-title":"Proc. Eur. Conf. Artif. Intell.","author":"Surynek","year":"2016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4171"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/63"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2903261"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.3026638"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2020.2994035"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9340876"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IROS45743.2020.9341668"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3077863"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9560748"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-335-6.50027-1"},{"key":"ref17","article-title":"Learning when to communicate at scale in multiagent cooperative and competitive tasks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Singh","year":"2019"},{"key":"ref18","article-title":"Learning to schedule communication in multi-agent reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kim","year":"2019"},{"key":"ref19","first-page":"3230","article-title":"Efficient communication in multi-agent reinforcement learning via variance based control","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang","year":"2019"},{"key":"ref20","article-title":"Succinct and robust multi-agent communication with temporal message control","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang","year":"2020"},{"key":"ref21","first-page":"2020","article-title":"Learning nearly decomposable value functions via communication minimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Wang"},{"key":"ref22","article-title":"Learning individually inferred communication for multi-agent cooperation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ding","year":"2020"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593871"},{"issue":"PMLR","key":"ref24","first-page":"1928","article-title":"Asynchronous methods for deep reinforcement learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mnih","year":"2016"},{"issue":"PMLR","key":"ref25","first-page":"1538","article-title":"Tarmac: Targeted multi-agent communication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Das","year":"2019"},{"key":"ref26","article-title":"Graph convolutional reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Jiang","year":"2020"},{"key":"ref27","article-title":"Multi-agent graph-attention communication and teaming","volume-title":"Proc. Int. Conf. Auton. Agents MultiAgent Syst.","author":"Niu","year":"2021"},{"key":"ref28","first-page":"5998","article-title":"Attention is all you need","volume-title":"Proc. Adv. neural Inf. Process. Syst.","author":"Vaswani","year":"2017"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"issue":"PMLR","key":"ref31","first-page":"4295","article-title":"QMIX: Monotonic value function factorisation for deep multi-agent reinforcement learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rashid","year":"2018"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3062803"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-307-3.50049-6"},{"key":"ref35","first-page":"2085","article-title":"Value-decomposition networks for cooperative multi-agent learning based on team reward","volume-title":"Proc. Int. Conf. Auton. Agents MultiAgent Syst.","author":"Sunehag","year":"2018"},{"key":"ref36","volume-title":"Information Theory and Statistics","author":"Kullback","year":"1997"},{"key":"ref37","article-title":"Empirical evaluation of gated recurrent neural networks on sequence modeling","author":"Chung","year":"2014"},{"issue":"PMLR","key":"ref38","first-page":"1995","article-title":"Dueling network architectures for deep reinforcement learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang","year":"2016"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553380"},{"key":"ref40","article-title":"Recurrent experience replay in distributed reinforcement learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kapturowski","year":"2018"},{"key":"ref41","article-title":"Distributed prioritized experience replay","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Horgan","year":"2018"},{"key":"ref42","first-page":"561","article-title":"Ray: A distributed framework for emerging AI applications","volume-title":"Proc. USENIX Symp. Operating Syst. Des. Implementation","author":"Moritz","year":"2018"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9647862\/09665278.pdf?arnumber=9665278","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T22:08:17Z","timestamp":1705183697000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9665278\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":42,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3139145","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}