{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T19:13:31Z","timestamp":1774466011591,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"vor","delay-in-days":1,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton. Intell. Syst."],"published-print":{"date-parts":[[2021,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper considers the scenario where multiple robots collaboratively cover a region in which the exact distribution of workload is unknown prior to the operation. The workload distribution is not uniform in the region, meaning that the time required to cover a unit area varies at different locations of the region. In our approach, we divide the target region into multiple horizontal stripes, and the robots sweep the current stripe while partitioning the next stripe concurrently. We propose a distributed workload partition algorithm and prove that the operation time on each stripe converges to the minimum under the discrete-time update law. We conduct comprehensive simulation studies and compare our method with the existing methods to verify the theoretical results and the advantage of the proposed method. Flight experiments on mini drones are also conducted to demonstrate the practicality of the proposed algorithm.<\/jats:p>","DOI":"10.1007\/s43684-021-00011-1","type":"journal-article","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T06:53:56Z","timestamp":1638428036000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Distributed multi-robot sweep coverage for a region with unknown workload distribution"],"prefix":"10.1007","volume":"1","author":[{"given":"Muqing","family":"Cao","sequence":"first","affiliation":[]},{"given":"Kun","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Xiuxian","family":"Li","sequence":"additional","affiliation":[]},{"given":"Shenghai","family":"Yuan","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Thien-Minh","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Lihua","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"M. S. Couceiro, D. Portugal, J. F. Ferreira, R. P. Rocha, in 2019 IEEE\/SICE International Symposium on System Integration (SII). SEMFIRE: Towards a new generation of forestry maintenance multi-robot systems, (2019), pp. 270\u2013276. https:\/\/doi.org\/10.1109\/SII.2019.8700403.","DOI":"10.1109\/SII.2019.8700403"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"A. J. Healey, in Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), 2. Application of formation control for multi-vehicle robotic minesweeping, (2001), pp. 1497\u20131502 vol.2. https:\/\/doi.org\/10.1109\/CDC.2001.981106.","DOI":"10.1109\/CDC.2001.981106"},{"key":"11_CR3","unstructured":"S. Bernardini, F. Jovan, Z. Jiang, S. Watson, A. Weightman, P. Moradi, T. Richardson, R. Sadeghian, S. Sareh, in Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS \u201920). A Multi-Robot Platform for the Autonomous Operation and Maintenance of Offshore Wind Farms (International Foundation for Autonomous Agents and Multiagent SystemsRichland, pp. 1696\u20131700."},{"issue":"12","key":"11_CR4","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E. Galceran","year":"2013","unstructured":"E. Galceran, M. Carreras, A survey on coverage path planning for robotics. Robot. Auton. Syst.61(12), 1258\u20131276 (2013).","journal-title":"Robot. Auton. Syst."},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"A. V. Savkin, T. M. Cheng, Z. Xi, F. Javed, A. S. Matveev, H. Nguyen, IntroductionJohn Wiley & Sons, Ltd, 2015). https:\/\/doi.org\/10.1002\/9781119058052.ch1.","DOI":"10.1002\/9781119058052.ch1"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.3390\/drones3010004","volume":"3","author":"T. M. Cabreira","year":"2019","unstructured":"T. M. Cabreira, L. B. Brisolara, P. R. Ferreira Jr, Survey on coverage path planning with unmanned aerial vehicles. Drones. 3(1), 4 (2019).","journal-title":"Drones"},{"issue":"1-2","key":"11_CR7","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10514-012-9292-1","volume":"33","author":"L. Doitsidis","year":"2012","unstructured":"L. Doitsidis, S. Weiss, A. Renzaglia, M. W. Achtelik, E. Kosmatopoulos, R. Siegwart, D. Scaramuzza, Optimal surveillance coverage for teams of micro aerial vehicles in gps-denied environments using onboard vision. Auton. Robot.33(1-2), 173\u2013188 (2012).","journal-title":"Auton. Robot."},{"issue":"11","key":"11_CR8","doi-asserted-by":"publisher","first-page":"27783","DOI":"10.3390\/s151127783","volume":"15","author":"G. S. Avellar","year":"2015","unstructured":"G. S. Avellar, G. A. Pereira, L. C. Pimenta, P. Iscold, Multi-uav routing for area coverage and remote sensing with minimum time. Sensors. 15(11), 27783\u201327803 (2015).","journal-title":"Sensors"},{"issue":"6","key":"11_CR9","doi-asserted-by":"publisher","first-page":"10686","DOI":"10.1109\/JIOT.2019.2940717","volume":"6","author":"L. Wu","year":"2019","unstructured":"L. Wu, Y. Xiong, M. Wu, Y. He, J. She, A task assignment method for sweep coverage optimization based on crowdsensing. IEEE Internet Things J.6(6), 10686\u201310699 (2019).","journal-title":"IEEE Internet Things J."},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"J. D. Kelly, D. M. Lofaro, D. Sofge, in 2020 17th International Conference on Ubiquitous Robots (UR). Persistent Area Coverage for Swarms Utilizing Deployment Entropy with Potential Fields, (2020), pp. 479\u2013486. https:\/\/doi.org\/10.1109\/UR49135.2020.9144917.","DOI":"10.1109\/UR49135.2020.9144917"},{"issue":"June","key":"11_CR11","first-page":"15","volume":"10","author":"D. W. Gage","year":"1992","unstructured":"D. W. Gage, Command Control for Many-Robot Systems. AUVS-92, Nineteenth Ann AUVS Tech. Symp.10(June), 15 (1992).","journal-title":"AUVS-92, Nineteenth Ann AUVS Tech. Symp."},{"issue":"14","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1983","DOI":"10.1049\/iet-cta.2017.0863","volume":"12","author":"M. Shi","year":"2018","unstructured":"M. Shi, K. Qin, J. Liu, Cooperative multi-agent sweep coverage control for unknown areas of irregular shape. IET Control Theory Appl.12(14), 1983\u20131994 (2018).","journal-title":"IET Control Theory Appl."},{"issue":"1","key":"11_CR13","first-page":"19","volume":"50","author":"C. Zhai","year":"2014","unstructured":"C. Zhai, Sweep coverage of discrete time multi-robot networks with general topologies. Kybernetika. 50(1), 19\u201331 (2014).","journal-title":"Kybernetika"},{"issue":"2-4","key":"11_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10472-009-9120-2","volume":"52","author":"I. Rekleitis","year":"2008","unstructured":"I. Rekleitis, A. P. New, E. S. Rankin, H. Choset, Efficient boustrophedon multi-robot coverage: an algorithmic approach. Ann. Math. Artif. Intell.52(2-4), 109\u2013142 (2008).","journal-title":"Ann. Math. Artif. Intell."},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-1-4471-1273-0_32","volume-title":"Field and Service Robotics","author":"H. Choset","year":"1998","unstructured":"H. Choset, P. Pignon, in Field and Service Robotics, ed. by A. Zelinsky. Coverage Path Planning: The Boustrophedon Cellular Decomposition (SpringerLondon, 1998), pp. 203\u2013209."},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/967900.967919","volume-title":"Proceedings of the 2004 ACM Symposium on Applied Computing (SAC \u201904)","author":"P. Vincent","year":"2004","unstructured":"P. Vincent, I. Rubin, in Proceedings of the 2004 ACM Symposium on Applied Computing (SAC \u201904). A Framework and Analysis for Cooperative Search Using UAV Swarms (Association for Computing MachineryNew York, 2004), pp. 79\u201386. https:\/\/doi.org\/10.1145\/967900.967919."},{"issue":"7","key":"11_CR17","doi-asserted-by":"publisher","first-page":"2154","DOI":"10.1016\/j.automatica.2013.03.017","volume":"49","author":"C. Zhai","year":"2013","unstructured":"C. Zhai, Y. Hong, Decentralized sweep coverage algorithm for multi-agent systems with workload uncertainties. Automatica. 49(7), 2154\u20132159 (2013). https:\/\/doi.org\/10.1016\/j.automatica.2013.03.017.","journal-title":"Automatica"},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1109\/JPROC.2006.887293","volume":"95","author":"R. Olfati-Saber","year":"2007","unstructured":"R. Olfati-Saber, J. A. Fax, R. M. Murray, Consensus and cooperation in networked multi-agent systems. Proc. IEEE. 95(1), 215\u2013233 (2007).","journal-title":"Proc. IEEE"},{"key":"11_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y. Nesterov","year":"2004","unstructured":"Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course (Springer US, Boston, 2004). https:\/\/doi.org\/10.1007\/978-1-4419-8853-9_2."},{"key":"11_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-635-1","volume-title":"Unmanned Rotorcraft Systems","author":"G. Cai","year":"2011","unstructured":"G. Cai, B. M. Chen, T. H. Lee, Unmanned Rotorcraft Systems (Springer London, London, 2011). https:\/\/doi.org\/10.1007\/978-0-85729-635-1_8."}],"container-title":["Autonomous Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43684-021-00011-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43684-021-00011-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43684-021-00011-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T07:23:23Z","timestamp":1638429803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43684-021-00011-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["11"],"URL":"https:\/\/doi.org\/10.1007\/s43684-021-00011-1","relation":{},"ISSN":["2730-616X"],"issn-type":[{"value":"2730-616X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]},"assertion":[{"value":"8 July 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2021","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 declare no conflicts of interest for this work.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"13"}}