{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T18:53:26Z","timestamp":1764356006089,"version":"3.46.0"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Ministry of Trade, Industry and Energy (MOTIE, South Korea), through the Robot and Robot Service Digital Twinization Framework Technology","award":["RS-2024-00424974"],"award-info":[{"award-number":["RS-2024-00424974"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3634800","type":"journal-article","created":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T18:46:49Z","timestamp":1763578009000},"page":"198748-198761","source":"Crossref","is-referenced-by-count":0,"title":["Efficient TSP-Based Task Group Allocation for Multi-Task Multi-Agent Pickup and Delivery"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1013-8228","authenticated-orcid":false,"given":"Seungbeen","family":"Lee","sequence":"first","affiliation":[{"name":"Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9267-8507","authenticated-orcid":false,"given":"Chanyoung","family":"Lee","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5729-7931","authenticated-orcid":false,"given":"Wonpil","family":"Yu","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Creative Research Laboratory, ETRI, Daejeon, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2145-1161","authenticated-orcid":false,"given":"Soohwan","family":"Song","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Artificial Intelligence, Dongguk University, Seoul, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume":"29","author":"Wurman","year":"2007","journal-title":"AI Mag."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3058190"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00314"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3221352"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102397"},{"key":"ref6","first-page":"837","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","volume-title":"Proc. 16th Conf. Auto. Agents MultiAgent Syst.","author":"Ma"},{"key":"ref7","first-page":"1152","article-title":"Task and path planning for multi-agent pickup and delivery","volume-title":"Proc. 18th Int. Conf. Auto. Agents MultiAgent Syst.","author":"Liu"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017651"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3605098.3635955"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v29i1.3474"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981785"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3074883"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114897"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CASE56687.2023.10260587"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2023.102789"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2023.3301300"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18299-5_2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3175040"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3111888"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v6i1.18343"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3062803"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2903261"},{"key":"ref26","first-page":"1144","article-title":"Optimal target assignment and path finding for teams of agents","volume-title":"Proc. Int. Conf. Auto. Agents Multiagent Syst.","author":"Ma"},{"key":"ref27","first-page":"757","article-title":"Conflict-based search with optimal task assignment","volume-title":"Proc. Int. Joint Conf. Auto. Agents Multiagent Syst.","author":"H\u00f6nig"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2022.XVIII.058"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v12i1.18582"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3455787"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3266993"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3183183"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2024.3356514"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2021.3094190"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3471389"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3249471"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1050.0135"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2914113"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2018.6125"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9801-4"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/0206041"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2021.3082021"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11259046.pdf?arnumber=11259046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T18:44:25Z","timestamp":1764355465000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11259046\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":45,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3634800","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}