{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:08:16Z","timestamp":1758845296225,"version":"3.40.5"},"reference-count":46,"publisher":"Cambridge University Press (CUP)","issue":"11","license":[{"start":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T00:00:00Z","timestamp":1617840000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotica"],"published-print":{"date-parts":[[2021,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper considers the task allocation problem under the requirement that the assignments of some critical tasks must be maximized when the network capacity cannot accommodate all tasks due to the limited capacity for each unmanned aerial vehicle (UAV). To solve this problem, this paper proposes an extended performance impact algorithm with critical tasks (EPIAC) based on the traditional performance impact algorithm. A novel task list resizing phase is developed in EPIAC to deal with the constraint on the limited capacity of each UAV and maximize the assignments of critical tasks. Numerical simulations demonstrate the outstanding performance of EPIAC compared with other algorithms.<\/jats:p>","DOI":"10.1017\/s0263574721000102","type":"journal-article","created":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T08:47:48Z","timestamp":1617871668000},"page":"2008-2032","source":"Crossref","is-referenced-by-count":11,"title":["Distributed task allocation with critical tasks and limited capacity"],"prefix":"10.1017","volume":"39","author":[{"given":"An","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9856-575X","authenticated-orcid":false,"given":"Mi","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Wenhao","family":"Bi","sequence":"additional","affiliation":[]},{"given":"Fei","family":"Gao","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2021,4,8]]},"reference":[{"key":"S0263574721000102_ref29","doi-asserted-by":"crossref","unstructured":"Johnson, L. , Ponda, S. , Choi, H.-L. and How, J. , \u201cAsynchronous Decentralized Task Allocation for Dynamic Environments,\u201d In: Infotech@ Aerospace 2011 (2011), p. 1441.","DOI":"10.2514\/6.2011-1441"},{"key":"S0263574721000102_ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-016-0771-5"},{"key":"S0263574721000102_ref23","doi-asserted-by":"publisher","DOI":"10.5772\/13281"},{"key":"S0263574721000102_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2015.01.001"},{"key":"S0263574721000102_ref43","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)90065-5"},{"key":"S0263574721000102_ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2017.2679278"},{"key":"S0263574721000102_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-010-9536-2"},{"key":"S0263574721000102_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2006.08.005"},{"key":"S0263574721000102_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18299-5_2"},{"key":"S0263574721000102_ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2009.2022423"},{"key":"S0263574721000102_ref44","unstructured":"Guerrero, J. and Oliver, G. , \u201cAuction and swarm multi-robot task allocation algorithms in real time scenarios,\u201d Multi-Robot Syst. Trends Dev. 437\u2013456 (2011)."},{"key":"S0263574721000102_ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364904045564"},{"key":"S0263574721000102_ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2743164"},{"key":"S0263574721000102_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-017-0493-x"},{"key":"S0263574721000102_ref8","unstructured":"Kaminka, G. A. , \u201cAutonomous Agents Research in Robotics: A Report from the Trenches,\u201d In: 2012 AAAI Spring Symposium Series (2012)."},{"key":"S0263574721000102_ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2018.02.016"},{"key":"S0263574721000102_ref14","unstructured":"Huang, L. , Ding, Y. , Zhou, M. , Jin, Y. and Hao, K. , \u201cMultiple-solution optimization strategy for multirobot task allocation,\u201d IEEE Trans. Syst. Man Cybern. Syst. (2018)."},{"key":"S0263574721000102_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2016.10.008"},{"key":"S0263574721000102_ref12","doi-asserted-by":"publisher","DOI":"10.1145\/361011.361064"},{"key":"S0263574721000102_ref24","doi-asserted-by":"publisher","DOI":"10.1287\/inte.20.4.133"},{"key":"S0263574721000102_ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S0363012996307813"},{"key":"S0263574721000102_ref26","unstructured":"Choi, H.-L. , Whitten, A. K. and How, J. P. , \u201cDecentralized Task Allocation for Heterogeneous Teams with Cooperation Constraints,\u201d In: Proceedings of the 2010 American Control Conference, (IEEE 2010), pp. 3057\u20133062."},{"key":"S0263574721000102_ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2012.163"},{"key":"S0263574721000102_ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IRDS.2002.1041680"},{"key":"S0263574721000102_ref35","first-page":"1","article-title":"Minimizing Communications in Decentralized Greedy Task Allocation","author":"Kim","year":"2019","journal-title":"J. Aerosp. Inform. Syst.,"},{"key":"S0263574721000102_ref20","unstructured":"Bertsimas, D. and Weismantel, R. , Optimization Over Integers, Volume 13 (Dynamic Ideas Belmont, 2005)."},{"key":"S0263574721000102_ref5","doi-asserted-by":"publisher","DOI":"10.3390\/app9112184"},{"key":"S0263574721000102_ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-018-1169-3"},{"key":"S0263574721000102_ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.09.014"},{"key":"S0263574721000102_ref33","doi-asserted-by":"publisher","DOI":"10.2514\/1.I010461"},{"key":"S0263574721000102_ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2010.5531232"},{"key":"S0263574721000102_ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.06.007"},{"key":"S0263574721000102_ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3128584"},{"key":"S0263574721000102_ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2418052"},{"key":"S0263574721000102_ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2219061"},{"key":"S0263574721000102_ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2011.08.024"},{"key":"S0263574721000102_ref30","doi-asserted-by":"crossref","unstructured":"Buckman, N. , Choi, H.-L. and How, J. P. , \u201cPartial Replanning for Decentralized Dynamic Task Allocation,\u201d In: AIAA Scitech 2019 Forum (2019), p. 0915.","DOI":"10.2514\/6.2019-0915"},{"key":"S0263574721000102_ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(96)00041-0"},{"key":"S0263574721000102_ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2019.04.012"},{"key":"S0263574721000102_ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2011.5990917"},{"key":"S0263574721000102_ref13","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"S0263574721000102_ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2006.874022"},{"key":"S0263574721000102_ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.876939"},{"key":"S0263574721000102_ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2889858"},{"key":"S0263574721000102_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.07.008"},{"key":"S0263574721000102_ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2907544"}],"container-title":["Robotica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0263574721000102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T15:05:02Z","timestamp":1636124702000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0263574721000102\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,8]]},"references-count":46,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["S0263574721000102"],"URL":"https:\/\/doi.org\/10.1017\/s0263574721000102","relation":{},"ISSN":["0263-5747","1469-8668"],"issn-type":[{"type":"print","value":"0263-5747"},{"type":"electronic","value":"1469-8668"}],"subject":[],"published":{"date-parts":[[2021,4,8]]}}}