{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T15:20:14Z","timestamp":1781018414931,"version":"3.54.1"},"reference-count":28,"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"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1109\/lra.2024.3455787","type":"journal-article","created":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T18:33:41Z","timestamp":1725647621000},"page":"10137-10144","source":"Crossref","is-referenced-by-count":7,"title":["A Hierarchical Approach for Joint Task Allocation and Path Planning"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4703-7727","authenticated-orcid":false,"given":"Florence","family":"Ho","sequence":"first","affiliation":[{"name":"Data Science Laboratories, NEC Corporation, Kanagawa, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryota","family":"Higa","sequence":"additional","affiliation":[{"name":"Data Science Laboratories, NEC Corporation, Kanagawa, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3663-8375","authenticated-orcid":false,"given":"Takuro","family":"Kato","sequence":"additional","affiliation":[{"name":"TICO-AIST Cooperative Research Laboratory for Advanced Logistics, National Institute of Advanced Industrial Science and Technology (AIST), Tsukuba, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shinji","family":"Nakadai","sequence":"additional","affiliation":[{"name":"Data Science Laboratories, NEC Corporation, Kanagawa, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981570"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i16.29676"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2019.01.002"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3074883"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106242"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2022.3198020"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968096"},{"key":"ref9","first-page":"757","article-title":"Conflict-based search with optimal task assignment","volume-title":"Proc. 17th Int. Joint Conf. Auton. Agents Multiagent Syst.","author":"Hnig","year":"2018"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21170"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"ref13","first-page":"1152","article-title":"Task and path planning for multi-agent pickup and delivery","volume-title":"Proc. 18th Int. Conf. Auton. Agents Multi-Agent Syst.","author":"Liu","year":"2019"},{"key":"ref14","first-page":"1144","article-title":"Optimal target assignment and path finding for teams of agents","volume-title":"Proc. 15th Int. Conf. Auton. Agents Multi-Agent Syst.","author":"Ma","year":"2016"},{"key":"ref15","article-title":"Overview: Generalizations of multi-agent path finding to real-world scenarios","volume-title":"Proc. Workshop Multi-Agent Path Find.","author":"Ma","year":"2016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.26.3.185"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8140"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1082473.1082597"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17472"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MRS60187.2023.10416794"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989464"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v27i1.13814"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981785"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2019.8789895"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631084"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v12i1.18586"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/10683798\/10669228.pdf?arnumber=10669228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T05:17:48Z","timestamp":1728364668000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10669228\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":28,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/lra.2024.3455787","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]}}}