{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T00:19:22Z","timestamp":1772065162511,"version":"3.50.1"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC 61906207"],"award-info":[{"award-number":["NSFC 61906207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/tpds.2024.3408030","type":"journal-article","created":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T18:35:33Z","timestamp":1718130933000},"page":"2069-2086","source":"Crossref","is-referenced-by-count":3,"title":["CPLNS: Cooperative Parallel Large Neighborhood Search for Large-Scale Multi-Agent Path Finding"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4160-1024","authenticated-orcid":false,"given":"Kai","family":"Chen","sequence":"first","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha, Hunan, China"}]},{"given":"Qingjun","family":"Qu","sequence":"additional","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha, Hunan, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0263-6806","authenticated-orcid":false,"given":"Feng","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha, Hunan, China"}]},{"given":"Zhengming","family":"Yi","sequence":"additional","affiliation":[{"name":"College of Information and Intelligence, Hunan Agricultural University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7419-896X","authenticated-orcid":false,"given":"Wenjie","family":"Tang","sequence":"additional","affiliation":[{"name":"College of Systems Engineering, National University of Defense Technology, Changsha, Hunan, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v31i1.15994"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2853613"},{"key":"ref4","first-page":"151","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","volume-title":"Proc. Int. Symp. Combinatorial Search","author":"Stern"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v3i1.18243"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840371"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2021\/568"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21266"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26377"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2023\/28"},{"key":"ref14","first-page":"1501","article-title":"Engineering LaCAM*: Towards real-time, large-scale, and near-optimal multi-agent pathfinding","volume-title":"Proc. 23rd Int. Conf. Autonom. Agents Multiagent Syst.","author":"Okumura","year":"2024"},{"key":"ref15","article-title":"Parallel meta-heuristic search","volume-title":"Heuristic Search","author":"Crainic","year":"2015"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-019-00866-y"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24318-4_12"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2014.173"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2014.2346196"},{"issue":"4","key":"ref20","doi-asserted-by":"crossref","first-page":"7001","DOI":"10.1109\/LRA.2021.3096476","article-title":"Parallel hierarchical composition conflict-based search for optimal multi-agent pathfinding","volume":"6","author":"Lee","year":"2021","journal-title":"IEEE Robot. Automat. Lett."},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3550484"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106927"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.02.006"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.09.073"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2880256"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161124"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.08.010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430365"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/71.539732"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.04.002"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2019.2899096"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.11.024"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2861"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.05.004"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5949"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2020.2984546"},{"key":"ref37","first-page":"417","volume-title":"Proc. 4th Int. Conf. Princ. Pract. Constraint Program.","author":"Shaw"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v9i1.18469"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2010.08.004"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(70)90007-X"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"ref45","article-title":"Solving previously unsolved MIP instances with parascip on supercomputers by using up to 80,000 cores","author":"Shinano","year":"2020"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/71\/10670174\/10553642.pdf?arnumber=10553642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T17:26:54Z","timestamp":1726853214000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10553642\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":45,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2024.3408030","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"value":"1045-9219","type":"print"},{"value":"1558-2183","type":"electronic"},{"value":"2161-9883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}