{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T12:46:08Z","timestamp":1766061968636,"version":"3.48.0"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"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","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,19]]},"DOI":"10.1109\/iros60139.2025.11246606","type":"proceedings-article","created":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:54:45Z","timestamp":1764269685000},"page":"20014-20019","source":"Crossref","is-referenced-by-count":0,"title":["Joint Optimization of Multi-Agent Task Allocation and Path Planning for Continuous Pickup and Delivery Tasks"],"prefix":"10.1109","author":[{"given":"Hongkai","family":"Fan","sequence":"first","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering"}]},{"given":"Bo","family":"Ouyang","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering"}]},{"given":"Qinjing","family":"Xie","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering"}]},{"given":"Yaonan","family":"Wang","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering"}]},{"given":"Zhi","family":"Yan","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering"}]},{"given":"Jiawen","family":"He","sequence":"additional","affiliation":[{"name":"Hunan University,College of Electrical and Information Engineering"}]},{"given":"Qin","family":"Tan","sequence":"additional","affiliation":[{"name":"Associated with China Mobile Group Hunan Company Limited,Changsha,China,410082"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/IROS58592.2024.10802813"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.05.374"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3115339"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10696-024-09563-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1108\/AA-10-2020-0152"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-020-09912-1"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle routing: problems, methods, and applications","author":"Toth","year":"2014"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.044"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.2914113"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0170-8"},{"key":"ref13","first-page":"294","article-title":"Push and swap: Fast cooperative path-finding with completeness guarantees","volume-title":"IJCAI","author":"Luna"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v3i1.18243"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4447"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103752"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103574"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v28i1.13883"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"article-title":"Conflict-based search with optimal task assignment","volume-title":"Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems","author":"H\u00f6nig","key":"ref21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561779"},{"key":"ref23","first-page":"574579","article-title":"Multirobot task allocation with real-time path planning","volume-title":"Proceedings of the Twenty-Sixth International Florida Artificial Intelligence Research Society Conference (FLAIRS-26 Conference)","volume":"2224","author":"Woosley"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3074883"}],"event":{"name":"2025 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2025,10,19]]},"location":"Hangzhou, China","end":{"date-parts":[[2025,10,25]]}},"container-title":["2025 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11245651\/11245652\/11246606.pdf?arnumber=11246606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T12:42:33Z","timestamp":1766061753000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11246606\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/iros60139.2025.11246606","relation":{},"subject":[],"published":{"date-parts":[[2025,10,19]]}}}