{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T11:43:13Z","timestamp":1780486993228,"version":"3.54.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"23","license":[{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,27]],"date-time":"2022-07-27T00:00:00Z","timestamp":1658880000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007950","name":"Tanta University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007950","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput &amp; Applic"],"published-print":{"date-parts":[[2022,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Today, mobile robot is used in most industrial and commercial fields. It can improve and carry out work complex tasks quickly and efficiently. However, using swarm robots to execute some tasks requires a complex system for assigning robots to these tasks. The main issue in the robot control systems is the limited facilities of robot embedded system components. Although, some researchers used cloud computing to develop robot services. They didn\u2019t use the cloud for solving robot control issues. In this paper, we have used cloud computing for controlling robots to solve the problem of limited robot processing components. The main advantage of using cloud computing is its intensive computing power. This advantage motivates us to propose a new autonomous system for multi-mobile robots as a services-based cloud computing. The proposed system consists of three phases: clustering phase, allocation phase, and path planning phase. It groups all tasks\/duties into clusters using the k-means algorithm. After that, it finds the optimal path for each robot to execute its duties in the cluster based on the Nearest neighbor and Harris Hawks Optimizer (HHO). The proposed system is compared with systems that use a genetic algorithm, simulated annealing algorithm, and HHO algorithm. From the finding, we find that the proposed system is more efficient than the other systems in terms of decision time, throughput, and the total distance of each robot.<\/jats:p>","DOI":"10.1007\/s00521-022-07605-7","type":"journal-article","created":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T01:38:22Z","timestamp":1658972302000},"page":"21223-21235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A new cloud autonomous system as a service for multi-mobile robots"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4996-5439","authenticated-orcid":false,"given":"Aida A.","family":"Nasr","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,7,27]]},"reference":[{"key":"7605_CR1","doi-asserted-by":"publisher","first-page":"39830","DOI":"10.1109\/ACCESS.2020.2975643","volume":"8","author":"MB Alatise","year":"2020","unstructured":"Alatise MB, Hancke GP (2020) A review on challenges of autonomous mobile robot and sensor fusion methods. IEEE Access 8:39830\u201339846","journal-title":"IEEE Access"},{"key":"7605_CR2","doi-asserted-by":"crossref","unstructured":"Hu B, Guo K, Wang X, Zhang J, Zhou D (2021) RRL-GAT: Graph attention network-driven multi-label image robust representation learning. IEEE Internet of Things Journal","DOI":"10.1109\/JIOT.2021.3089180"},{"issue":"7","key":"7605_CR3","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1177\/0278364920916531","volume":"39","author":"F Tingxiang","year":"2020","unstructured":"Tingxiang F, Long P, Liu W, Pan J (2020) Distributed multi-robot collision avoidance via deep reinforcement learning for navigation in complex scenarios. Int J Robot Res 39(7):856\u2013892","journal-title":"Int J Robot Res"},{"key":"7605_CR4","unstructured":"https:\/\/www.nasa.gov\/audience\/foreducators\/robotics\/home\/index.html. Accessed 24 Jan 2022"},{"key":"7605_CR5","doi-asserted-by":"publisher","first-page":"103866","DOI":"10.1016\/j.robot.2021.103866","volume":"145","author":"P Schillinger","year":"2021","unstructured":"Schillinger P, Garc\u00eda S, Makris A, Roditakis K, Logothetis M, Alevizos K, Ren W et al (2021) Adaptive heterogeneous multi-robot collaboration from formal task specifications. Robot Auton Syst 145:103866","journal-title":"Robot Auton Syst"},{"issue":"2","key":"7605_CR6","doi-asserted-by":"publisher","first-page":"2311","DOI":"10.1109\/LRA.2021.3060379","volume":"6","author":"Y Lei","year":"2021","unstructured":"Lei Y, Stouraitis T, Vijayakumar S (2021) Decentralized ability-aware adaptive control for multi-robot collaborative manipulation. IEEE Robot Autom Lett 6(2):2311\u20132318","journal-title":"IEEE Robot Autom Lett"},{"key":"7605_CR7","doi-asserted-by":"crossref","unstructured":"Kapitonov A, Lonshakov S, Bulatov V, Kia B, and White J (2021) Robot-as-a-service: from cloud to peering technologies. In: 2021 The 4th international conference on information science and systems, pp 126\u2013131","DOI":"10.1145\/3459955.3460611"},{"key":"7605_CR8","doi-asserted-by":"crossref","unstructured":"Mouradian C, Yangui S, Glitho RH (2018) Robots as-a-service in cloud computing: search and rescue in large-scale disasters case study. In 2018 15th IEEE annual consumer communications and networking conference (CCNC), pp. 1\u20137. IEEE, 2018","DOI":"10.1109\/CCNC.2018.8319200"},{"key":"7605_CR9","doi-asserted-by":"publisher","first-page":"101491","DOI":"10.1016\/j.is.2020.101491","volume":"91","author":"N Naghmeh","year":"2020","unstructured":"Naghmeh N, Ismail W, Ghani I, Nazari B, Bahari M (2020) Understanding Service-Oriented Architecture (SOA): a systematic literature review and directions for further investigation. Inf Syst 91:101491","journal-title":"Inf Syst"},{"key":"7605_CR10","doi-asserted-by":"crossref","unstructured":"Pignaton de Freitas E, Olszewska JI, Carbonera JL, Fiorini SR, Khamis A, Ragavan SV, Barreto ME, Prestes E, Habib MK, Redfield S and Chibani A (2020) Ontological concepts for information sharing in cloud robotics. J Ambient Intell Humaniz Comput, pp.1\u201312","DOI":"10.1007\/s12652-020-02150-4"},{"key":"7605_CR11","doi-asserted-by":"publisher","first-page":"115356","DOI":"10.1109\/ACCESS.2020.3002184","volume":"8","author":"A Alarifi","year":"2020","unstructured":"Alarifi A, Dubey K, Amoon M, Altameem T, Abd El-Samie FE, Altameem A, Sharma SC, Nasr AA (2020) Energy-efficient hybrid framework for green cloud computing. IEEE Access 8:115356\u2013115369","journal-title":"IEEE Access"},{"key":"7605_CR12","unstructured":"Mahbuba A, Jin J, Rahman A, Rahman A, Wan J, Hossain E (2021) Resource allocation and service provisioning in multi-agent cloud robotics: a comprehensive survey. IEEE Communications Surveys and Tutorials"},{"key":"7605_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.robot.2018.02.016","volume":"103","author":"L Dong-Hyun","year":"2018","unstructured":"Dong-Hyun L (2018) Resource-based task allocation for multi-robot systems. Robot Auton Syst 103:151\u2013161","journal-title":"Robot Auton Syst"},{"issue":"10","key":"7605_CR14","doi-asserted-by":"publisher","first-page":"1682","DOI":"10.3390\/sym12101682","volume":"12","author":"W Qiuzhen","year":"2020","unstructured":"Qiuzhen W, Mao X (2020) Dynamic task allocation method of swarm robots based on optimal mass transport theory. Symmetry 12(10):1682","journal-title":"Symmetry"},{"key":"7605_CR15","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, 2019","DOI":"10.1109\/ITAIC.2019.8785472"},{"key":"7605_CR16","doi-asserted-by":"crossref","unstructured":"Nasr AA, El-Bahnasawy NA, El-Sayed A (2021) Straight-line: a new global path planning algorithm for Mobile Robot. In: 2021 international conference on electronic Engineering (ICEEM), pp. 1\u20135. IEEE, 2021","DOI":"10.1109\/ICEEM52022.2021.9480376"},{"issue":"1","key":"7605_CR17","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s41315-020-00158-9","volume":"5","author":"M Soleimanpour-moghadam","year":"2021","unstructured":"Soleimanpour-moghadam M, Nezamabadi-pour H (2021) A multi-robot task allocation algorithm based on universal gravity rules. Int J Intell Robot Appl 5(1):49\u201364","journal-title":"Int J Intell Robot Appl"},{"key":"7605_CR18","doi-asserted-by":"crossref","unstructured":"Amer DA, Attiya G, Zeidan I, Nasr AA (2021) Employment of Task Scheduling based on water wave optimization in multi robot system. In: 2021 International conference on electronic engineering (ICEEM), pp. 1\u20136. IEEE, 2021","DOI":"10.1109\/ICEEM52022.2021.9480617"},{"issue":"76","key":"7605_CR19","doi-asserted-by":"publisher","first-page":"102306","DOI":"10.1016\/j.rcim.2021.102306","volume":"1","author":"ML Lee","year":"2022","unstructured":"Lee ML, Behdad S, Liang X, Zheng M (2022) Task allocation and planning for product disassembly with human\u2013robot collaboration. Robot Comput Integr Manuf 1(76):102306","journal-title":"Robot Comput Integr Manuf"},{"issue":"1","key":"7605_CR20","doi-asserted-by":"publisher","first-page":"272","DOI":"10.3390\/app12010272","volume":"12","author":"B Park","year":"2022","unstructured":"Park B, Kang C, Choi J (2022) Cooperative multi-robot task allocation with reinforcement learning. Appl Sci 12(1):272","journal-title":"Appl Sci"},{"key":"7605_CR21","doi-asserted-by":"crossref","unstructured":"Ghassemi P, Chowdhury S (2018) Decentralized task allocation in multi-robot systems via bipartite graph matching augmented with fuzzy clustering. In: International design engineering technical conferences and computers and information in engineering conference, vol. 51753, p. V02AT03A014. American Society of Mechanical Engineers","DOI":"10.1115\/DETC2018-86161"},{"key":"7605_CR22","doi-asserted-by":"publisher","first-page":"80716","DOI":"10.1109\/ACCESS.2020.2988796","volume":"8","author":"KP Sinaga","year":"2020","unstructured":"Sinaga KP, Yang M-S (2020) Unsupervised K-means clustering algorithm. IEEE Access 8:80716\u201380727","journal-title":"IEEE Access"},{"key":"7605_CR23","first-page":"10","volume":"14","author":"L Raya","year":"2020","unstructured":"Raya L, Saud SN, Shariff SH, Abu Bakar KN (2020) Exploring the performance of the improved nearest-neighbor algorithms for solving the euclidean travelling salesman problem. Adv Nat Appl Sci 14:10\u201319","journal-title":"Adv Nat Appl Sci"},{"key":"7605_CR24","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari AA, Mirjalili S, Faris H, Aljarah I, Mafarja M, Chen H (2019) Harris hawks optimization: algorithm and applications. Future Gener Comput Syst 97:849\u2013872","journal-title":"Future Gener Comput Syst"},{"key":"7605_CR25","doi-asserted-by":"publisher","first-page":"2793","DOI":"10.1007\/s11227-021-03977-0","volume":"78","author":"DA Amer","year":"2021","unstructured":"Amer DA, Attiya G, Zeidan I, Nasr AA (2021) Elite learning Harris hawks optimizer for multi-objective task scheduling in cloud computing. J Supercomput 78:2793\u20132818","journal-title":"J Supercomput"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07605-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07605-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07605-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T23:33:10Z","timestamp":1667863990000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07605-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,27]]},"references-count":25,"journal-issue":{"issue":"23","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["7605"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07605-7","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,27]]},"assertion":[{"value":"1 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interests"}}]}}