{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:16:51Z","timestamp":1777706211498,"version":"3.51.4"},"reference-count":33,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T00:00:00Z","timestamp":1752624000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100020950","name":"National Science and Technology Council","doi-asserted-by":"publisher","award":["112-2221-E007-065"],"award-info":[{"award-number":["112-2221-E007-065"]}],"id":[{"id":"10.13039\/501100020950","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:p>\n                    With the change of population structure, integrating the robotic systems into logistics, healthcare, caregiving, and search-and-rescue operations has become an inevitable trend. This research develops a multi-robot adaptive task allocation and path finding system to address dynamic pickup-and-delivery problem in complex environment, considering both robot capacity and heterogeneity in capabilities. In contrast to other techniques without considering the dynamic task allocation, the proposed IAACO algorithm that is built on a two-layer framework claims high-quality solutions in rapid response to unpredicted task quantity variation. The first layer integrates methods of\u00a0maximum weight matching, Voronoi Diagram classification and local optimization, to compute real-time allocation results in response to dynamic task changes. The second layer occurs in the task execution process, during which the system simultaneously employs an adaptive ant colony optimization algorithm for further optimization. Additionally, to provide the cost estimation during task assignment for each robot, this work also introduces the multi-robot path finding solved by the modified space-time A\n                    <jats:inline-formula>\n                      <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" overflow=\"scroll\">\n                        <mml:msup>\n                          <mml:mrow\/>\n                          <mml:mo>*<\/mml:mo>\n                        <\/mml:msup>\n                      <\/mml:math>\n                    <\/jats:inline-formula>\n                    to the system. In simulations, it is shown that IAACO improves the makespan and the total path length by up to 36% and 21% respectively, compared to the baseline algorithms. Finally, the experimental results are also delivered to validate the feasibility of the proposed methodology.\n                  <\/jats:p>","DOI":"10.1177\/18758967251356855","type":"journal-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T08:14:31Z","timestamp":1752653671000},"page":"705-729","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Task Completion System for Multiple Robots under Task Quantity Variation"],"prefix":"10.1177","volume":"50","author":[{"given":"Pokai","family":"Chiu","sequence":"first","affiliation":[{"name":"National Tsing Hua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4833-9068","authenticated-orcid":false,"given":"Weicheng","family":"Wang","sequence":"additional","affiliation":[{"name":"National Tsing Hua University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6590-8787","authenticated-orcid":false,"given":"Rongshun","family":"Chen","sequence":"additional","affiliation":[{"name":"National Tsing Hua University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"issue":"1","key":"e_1_3_3_2_1","first-page":"1","article-title":"A flexible framework for diverse multi-robot task allocation scenarios including multi-tasking","volume":"16","author":"Arif M. U.","year":"2022","unstructured":"Arif M. U., Haider S. (2022). A flexible framework for diverse multi-robot task allocation scenarios including multi-tasking. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 16(1), 1\u201323.","journal-title":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)"},{"key":"e_1_3_3_3_1","doi-asserted-by":"crossref","unstructured":"Aziz H. Chan H. Cseh A. Li B. Ramezani F. Wang C. (2021). Multi-robot task allocation-complexity and approximation. In Proceedings of the 20th International conference on autonomous agents and multiagent systems (pp. 133\u2013141). International Foundation for Autonomous Agents and Multiagent Systems.","DOI":"10.65109\/LVJU5196"},{"key":"e_1_3_3_4_1","doi-asserted-by":"crossref","unstructured":"Barboza V. G. R. L. Kniess J. (2024). Task allocation based on simulated annealing for edge industrial internet. In International conference on advanced information networking and applications (pp. 210\u2013221). Springer.","DOI":"10.1007\/978-3-031-57870-0_19"},{"key":"e_1_3_3_5_1","doi-asserted-by":"crossref","unstructured":"Brown K. Peltzer O. Sehr M. A. et\u00a0al. (2020). Optimal sequential task assignment and path finding for multi-agent robotic assembly planning. In 2020 IEEE International conference on robotics and automation (ICRA) (pp. 441\u2013447). IEEE.","DOI":"10.1109\/ICRA40945.2020.9197527"},{"key":"e_1_3_3_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3074883"},{"key":"e_1_3_3_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2021.101545"},{"key":"e_1_3_3_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-021-03940-z"},{"key":"e_1_3_3_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2022423"},{"key":"e_1_3_3_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2021.103905"},{"key":"e_1_3_3_11_1","doi-asserted-by":"crossref","unstructured":"Henkel C. Abbenseth J. Toussaint M. (2019). An optimal algorithm to solve the combined task allocation and path finding problem. In 2019 IEEE\/RSJ International conference on intelligent robots and systems (IROS) (pp. 4140\u20134146). IEEE.","DOI":"10.1109\/IROS40897.2019.8968096"},{"key":"e_1_3_3_12_1","doi-asserted-by":"crossref","unstructured":"Huang G. S. Lu Y. J. (2017). To build a smart unmanned restaurant with multi-mobile robots. In 2017 International automatic control conference (CACS) (pp. 1\u20136). IEEE.","DOI":"10.1109\/CACS.2017.8284256"},{"key":"e_1_3_3_13_1","doi-asserted-by":"crossref","unstructured":"Hussein A. Khamis A. (2013). Market-based approach to multi-robot task allocation. In 2013 International conference on individual and collective behaviors in robotics (ICBR) (pp. 69\u201374). IEEE.","DOI":"10.1109\/ICBR.2013.6729278"},{"key":"e_1_3_3_14_1","doi-asserted-by":"publisher","DOI":"10.3390\/s23020751"},{"key":"e_1_3_3_15_1","doi-asserted-by":"crossref","unstructured":"Kong X. Gao Y. Wang T. Liu J. Xu W. (2019). Multi-robot task allocation strategy based on particle swarm optimization and greedy algorithm. In 2019 IEEE 8th Joint international information technology and artificial intelligence conference (ITAIC) (pp. 1643\u20131646). IEEE.","DOI":"10.1109\/ITAIC.2019.8785472"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"e_1_3_3_17_1","doi-asserted-by":"crossref","unstructured":"Landry C. Henrion R. H\u00f6mberg D. et\u00a0al. (2013). Task assignment sequencing and path-planning in robotic welding cells. In 2013 18th International conference on methods & models in automation & robotics (MMAR) (pp. 252\u2013257). IEEE.","DOI":"10.1109\/MMAR.2013.6669915"},{"key":"e_1_3_3_18_1","doi-asserted-by":"crossref","unstructured":"Luna R. Bekris K. E. (2011). Efficient and complete centralized multi-robot path planning. In 2011 IEEE\/RSJ International conference on intelligent robots and systems (pp. 3268\u20133275). IEEE.","DOI":"10.1109\/IROS.2011.6095085"},{"key":"e_1_3_3_19_1","doi-asserted-by":"crossref","unstructured":"Ng C. Y. Yeh Y. W. Wang W. C. et\u00a0al. (2021). Dynamic task allocation and pathfinding under precedence and temporal constraints. In 2021 International automatic control conference (CACS) (pp. 1\u20135). IEEE.","DOI":"10.1109\/CACS52606.2021.9638700"},{"key":"e_1_3_3_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.10.008"},{"key":"e_1_3_3_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2016.09.054"},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.3390\/s22155637"},{"key":"e_1_3_3_23_1","doi-asserted-by":"crossref","unstructured":"Paul S. Ghassemi P. Chowdhury S. (2022). Learning scalable policies over graphs for multi-robot task allocation using capsule attention networks. In 2022 International conference on robotics and automation (ICRA) (pp. 8815\u20138822). IEEE.","DOI":"10.1109\/ICRA46639.2022.9812370"},{"key":"e_1_3_3_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2009.2014157"},{"key":"e_1_3_3_25_1","doi-asserted-by":"crossref","unstructured":"Schneider E. Sklar E. I. Parsons S. et\u00a0al. (2015). Auction-based task allocation for multi-robot teams in dynamic environments. In Towards autonomous robotic systems: 16th annual conference TAROS 2015 Liverpool UK September 8-10 2015 Proceedings 16 (pp. 246\u2013257). Springer.","DOI":"10.1007\/978-3-319-22416-9_29"},{"key":"e_1_3_3_26_1","doi-asserted-by":"crossref","unstructured":"Silver D. (2005). Cooperative pathfinding. In Proceedings of the AAAI conference on artificial intelligence and interactive digital entertainment Vol. 1 (pp. 117\u2013122). AAAI Press.","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"e_1_3_3_27_1","doi-asserted-by":"publisher","DOI":"10.3390\/s21186149"},{"key":"e_1_3_3_28_1","doi-asserted-by":"crossref","unstructured":"Stern R. (2019). Multi-agent path finding\u2013an overview. In Artificial Intelligence: 5th RAAI Summer School Dolgoprudny Russia July 4\u20137 2019 Tutorial Lectures (pp. 96\u2013115). Springer.","DOI":"10.1007\/978-3-030-33274-7_6"},{"key":"e_1_3_3_29_1","volume-title":"World Population Prospects 2022: Summary of Results","year":"2022","unstructured":"United Nations (2022). World Population Prospects 2022: Summary of Results. Population Division."},{"key":"e_1_3_3_30_1","doi-asserted-by":"publisher","DOI":"10.3390\/make5020025"},{"key":"e_1_3_3_31_1","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.7.9.2160-2167"},{"key":"e_1_3_3_32_1","doi-asserted-by":"crossref","unstructured":"Wong W. K. Chew I. M. (2019). A review on metaheuristic algorithms: recent trends benchmarking and applications. In 2019 7th International conference on smart computing & communications (ICSCC) (pp. 1\u20135). IEEE.","DOI":"10.1109\/ICSCC.2019.8843624"},{"key":"e_1_3_3_33_1","doi-asserted-by":"publisher","DOI":"10.3390\/s22062122"},{"key":"e_1_3_3_34_1","doi-asserted-by":"publisher","DOI":"10.3390\/machines10080622"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems: Applications in Engineering and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18758967251356855","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/18758967251356855","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/18758967251356855","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:46:19Z","timestamp":1777455979000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/18758967251356855"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1177\/18758967251356855"],"URL":"https:\/\/doi.org\/10.1177\/18758967251356855","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,16]]}}}