{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T02:36:20Z","timestamp":1755225380502,"version":"3.43.0"},"reference-count":24,"publisher":"Emerald","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,4,30]]},"abstract":"<jats:sec>\n                  <jats:title>Purpose<\/jats:title>\n                  <jats:p>The purpose of this study is to address the challenge of task allocation in multi-robot systems by getting the minimum overall task completion time and task allocation scheme while also minimizing robot energy consumption. This study aims to move away from traditional centralized methods and validate a more scalable distributed approach.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Design\/methodology\/approach<\/jats:title>\n                  <jats:p>This paper proposes a distributed algorithm for the multi-robot task allocation problem, aimed at getting the minimum task completion time along with the task allocation scheme. The algorithm operates based on local interaction information rather than global information. By using the Consensus-Based Auction Algorithm (CBAA), it seeks to effectively minimize energy consumption without affecting the minimum completion time required for overall task allocation.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Findings<\/jats:title>\n                  <jats:p>The proposed distributed algorithm successfully reduces robot energy consumption while effectively obtaining the shortest overall task completion time and corresponding task allocation scheme. Numerical simulations conducted using MATLAB software demonstrated its superior performance, and empirical testing on the Turtlebot3-Burger robot platform further substantiated these findings.<\/jats:p>\n               <\/jats:sec>\n               <jats:sec>\n                  <jats:title>Originality\/value<\/jats:title>\n                  <jats:p>The original contribution of this study lies in the development of an enhanced distributed task allocation strategy using CBAA to improve efficiency in multi-robot environments. Its value extends to applications that require rapid and resource-aware coordination, such as automated logistics or search-and-rescue operations.<\/jats:p>\n               <\/jats:sec>","DOI":"10.1108\/ir-06-2024-0272","type":"journal-article","created":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T22:44:11Z","timestamp":1733265851000},"page":"334-342","source":"Crossref","is-referenced-by-count":1,"title":["A distributed algorithm for the multi-robot minimum time task allocation problem"],"prefix":"10.1108","volume":"52","author":[{"given":"Qing","family":"Zhang","sequence":"first","affiliation":[{"name":"Chongqing University , Chongqing,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yujuan","family":"Wang","sequence":"additional","affiliation":[{"name":"Chongqing University , Chongqing,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruping","family":"Cen","sequence":"additional","affiliation":[{"name":"Chongqing University of Posts and Telecommunications , Chongqing,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2024,12,6]]},"reference":[{"issue":"1","key":"2025081307182156500_ref001","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/TCCN.2021.3105133","article-title":"UAV-assisted cooperative & cognitive NOMA: deployment, clustering, and resource allocation","volume":"8","author":"Arzykulov","year":"2021","journal-title":"IEEE Transactions on Cognitive Communications and Networking"},{"issue":"3\/4","key":"2025081307182156500_ref002","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1007\/s10846-018-0910-9","article-title":"Coordinated target assignment and UAV path planning with timing constraints","volume":"94","author":"Babel","year":"2019","journal-title":"Journal of Intelligent & Robotic Systems"},{"issue":"1","key":"2025081307182156500_ref003","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02186476","article-title":"The auction algorithm: a distributed relaxation method for the assignment problem","volume":"14","author":"Bertsekas","year":"1988","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2025081307182156500_ref004","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/LWC.2020.3020003","article-title":"Pilot assignment in cell-free massive MIMO based on the Hungarian algorithm","volume":"10","author":"Buzzi","year":"2021","journal-title":"IEEE Wireless Communications Letters"},{"key":"2025081307182156500_ref005","article-title":"Mission planning and execution in heterogeneous teams of aerial robots supporting power line inspection operations","author":"Calvo","year":"2023","journal-title":"CoRR"},{"issue":"4","key":"2025081307182156500_ref006","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1109\/TRO.2009.2022423","article-title":"Consensus-based decentralized auctions for robust task allocation","volume":"25","author":"Choi","year":"2009","journal-title":"IEEE Transactions on Robotics"},{"issue":"1","key":"2025081307182156500_ref007","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10846-014-0154-2","article-title":"A distributed task allocation algorithm for a multi-robot system in healthcare facilities","volume":"80","author":"Das","year":"2015","journal-title":"Journal of Intelligent & Robotic Systems"},{"issue":"2","key":"2025081307182156500_ref008","doi-asserted-by":"crossref","DOI":"10.1007\/s43154-021-00048-3","article-title":"Multi-agent systems for search and rescue applications","volume":"2","author":"Drew","year":"2021","journal-title":"Current Robotics Reports"},{"key":"2025081307182156500_ref009","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.comcom.2021.06.018","article-title":"Path control of panoramic visual recognition for intelligent robots based- edge computing","volume":"178","author":"Fan","year":"2021","journal-title":"Computer Communications"},{"key":"2025081307182156500_ref010","first-page":"1","article-title":"A market-based task allocation framework for autonomous underwater surveillance networks","volume-title":"OCEANS 2017 \u2013 Aberdeen","author":"Ferri","year":"2017"},{"issue":"7","key":"2025081307182156500_ref011","doi-asserted-by":"crossref","first-page":"1747","DOI":"10.1287\/opre.19.7.1747","article-title":"An improved algorithm for the bottleneck assignment problem","volume":"19","author":"Garfinkel","year":"1971","journal-title":"Operations Research"},{"key":"2025081307182156500_ref012","article-title":"The bottleneck assignment problem","author":"Gross","year":"1959","journal-title":"Rand."},{"issue":"6","key":"2025081307182156500_ref013","doi-asserted-by":"crossref","first-page":"3502","DOI":"10.1109\/LRA.2023.3269295","article-title":"Velocity obstacle for polytopic collision avoidance for distributed multi-robot systems","volume":"8","author":"Huang","year":"2023","journal-title":"IEEE Robotics and Automation Letters"},{"issue":"4","key":"2025081307182156500_ref014","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0167-6377(86)90073-8","article-title":"Improving the Hungarian assignment algorithm","volume":"5","author":"Jonker","year":"1986","journal-title":"Operations Research Letters"},{"issue":"2","key":"2025081307182156500_ref015","doi-asserted-by":"crossref","DOI":"10.1109\/TAC.2023.3279336","article-title":"A distributed augmenting path approach for the bottleneck assignment problem","volume":"69","author":"Khoo","year":"2023","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2025081307182156500_ref016","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.cor.2018.04.004","article-title":"Tabu search and iterated local search for the cyclic bottleneck assignment problem","volume":"96","author":"Li","year":"2018","journal-title":"Computers & Operations Research"},{"key":"2025081307182156500_ref017","first-page":"974","article-title":"Optimizing computational and communication resources for MEC network empowered UAV-RIS communication","author":"Mahmood","year":"2022"},{"key":"2025081307182156500_ref018","article-title":"The dynamic Hungarian algorithm for the assignment problem with changing costs","author":"Mills-Tettey","year":"2007","journal-title":"Carnegie Mellon University."},{"key":"2025081307182156500_ref019","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.comcom.2023.04.025","article-title":"Trmaxalloc: maximum task allocation using reassignment algorithm in multi-UAV system","volume":"206","author":"Qamar","year":"2023","journal-title":"Computer Communications"},{"issue":"1","key":"2025081307182156500_ref020","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0305-0548(90)90031-2","article-title":"Speeding up the Hungarian algorithm","volume":"17","author":"Wright","year":"1990","journal-title":"Computers & Operations Research"},{"issue":"6","key":"2025081307182156500_ref021","doi-asserted-by":"crossref","DOI":"10.3390\/s22062122","article-title":"A dynamic task allocation algorithm for heterogeneous UUV swarms","volume":"22","author":"Wu","year":"2022","journal-title":"Sensors"},{"issue":"1\/2","key":"2025081307182156500_ref022","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/s10107-021-01627-0","article-title":"Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making","volume":"196","author":"Xie","year":"2022","journal-title":"Mathematical Programming"},{"issue":"8","key":"2025081307182156500_ref023","doi-asserted-by":"crossref","first-page":"907","DOI":"10.3390\/jmse9080907","article-title":"An exact algorithm for task allocation of multiple unmanned surface vehicles with minimum task time","volume":"9","author":"Xue","year":"2021","journal-title":"Journal of Marine Science and Engineering"},{"key":"2025081307182156500_ref024","first-page":"83","article-title":"Task allocation of multi-AUVs based on innovative auction algorithm","author":"Zhang","year":"2017"}],"container-title":["Industrial Robot: the international journal of robotics research and application"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/IR-06-2024-0272\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/ir\/article-pdf\/52\/3\/334\/10058772\/ir-06-2024-0272.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ir\/article-pdf\/52\/3\/334\/10058772\/ir-06-2024-0272.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T11:18:30Z","timestamp":1755083910000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ir\/article\/52\/3\/334\/1272505\/A-distributed-algorithm-for-the-multi-robot"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,4,30]]}},"URL":"https:\/\/doi.org\/10.1108\/ir-06-2024-0272","relation":{},"ISSN":["0143-991X","1758-5791"],"issn-type":[{"type":"print","value":"0143-991X"},{"type":"electronic","value":"1758-5791"}],"subject":[],"published":{"date-parts":[[2024,12,6]]}}}