{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:04:47Z","timestamp":1780052687457,"version":"3.53.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"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":[[2021,7]]},"DOI":"10.1109\/lra.2021.3074883","type":"journal-article","created":{"date-parts":[[2021,4,22]],"date-time":"2021-04-22T01:15:02Z","timestamp":1619054102000},"page":"5816-5823","source":"Crossref","is-referenced-by-count":182,"title":["Integrated Task Assignment and Path Planning for Capacitated Multi-Agent Pickup and Delivery"],"prefix":"10.1109","volume":"6","author":[{"given":"Zhe","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0058-570X","authenticated-orcid":false,"given":"Javier","family":"Alonso-Mora","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6782-5571","authenticated-orcid":false,"given":"Xiaoshan","family":"Bai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel D.","family":"Harabor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2186-0459","authenticated-orcid":false,"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/684"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/169"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-020-09912-1"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973594"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.044"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/TASE.2019.2914113","article-title":"Efficient routing for precedence-constrained package delivery for heterogeneous vehicles","volume":"17","author":"bai","year":"2019","journal-title":"IEEE Trans Automat Sci Eng"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0170-8"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.18.11.664"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90221-8"},{"key":"ref18","first-page":"101","article-title":"Agent coordination with regret clearing","author":"koenig","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref28","first-page":"3605","article-title":"Multi-Agent path finding with delay probabilities","author":"ma","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref4","first-page":"757","article-title":"Conflict-based search with optimal task assignment","author":"h\u00f6nig","year":"0","journal-title":"Proc Int Joint Conf Auton Agents Multiagent Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2894217"},{"key":"ref3","first-page":"151","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","author":"stern","year":"0","journal-title":"Proc Int Symp Combinatorial Search"},{"key":"ref6","article-title":"Haipick system","year":"2020"},{"key":"ref29","first-page":"1862","article-title":"Robust multi-agent path finding","author":"atzmon","year":"0","journal-title":"11th Annu Symp Combinatorial Search"},{"key":"ref5","first-page":"1152","article-title":"Task and path planning for multi-agent pickup and delivery","author":"liu","year":"0","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref8","first-page":"117","article-title":"Cooperative pathfinding","volume":"1","author":"silver","year":"0","journal-title":"Proc 1st Artif Intell Interactive Digit Entertainment Conf"},{"key":"ref7","first-page":"9925","article-title":"Idle time optimization for target assignment and path finding in sortation centers","author":"meng kou","year":"0","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49481-2_30"},{"key":"ref1","first-page":"837","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"ma","year":"0","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2010.07.008"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/164"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4171"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"ref23","first-page":"3067","article-title":"Improved solvers for bounded-suboptimal multi-agent path finding","author":"cohen","year":"0","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref26","article-title":"Lifelong multi-agent path finding in large-scale warehouses","author":"li","year":"2020"},{"key":"ref25","first-page":"88","article-title":"Multi-agent pathfinding with simultaneous execution of single-agent primitives","author":"sajid","year":"0","journal-title":"Proc 5th Annu Symp Combinatorial Search"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9399748\/09410352.pdf?arnumber=9410352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:58Z","timestamp":1652194438000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9410352\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":30,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3074883","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]}}}