{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:22:48Z","timestamp":1771024968692,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2019R1A2C1011270"],"award-info":[{"award-number":["NRF-2019R1A2C1011270"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2997095","type":"journal-article","created":{"date-parts":[[2020,5,25]],"date-time":"2020-05-25T22:35:56Z","timestamp":1590446156000},"page":"97873-97889","source":"Crossref","is-referenced-by-count":20,"title":["Multi-Cleaning Robots Using Cleaning Distribution Method Based on Map Decomposition in Large Environments"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5317-195X","authenticated-orcid":false,"given":"Xu","family":"Miao","sequence":"first","affiliation":[]},{"given":"Hyun-Soon","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Bo-Yeong","family":"Kang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2792698"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2815988"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s11370-015-0193-y"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSCE.2014.7072698"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1013479"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CCDC.2017.7978395"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/rob.21636"},{"key":"ref36","first-page":"1","article-title":"Monte Carlo tree search with branch and bound for multi-robot task allocation","author":"kartal","year":"2016","journal-title":"Proc Workshop Auto Mobile Service Robots (IJCAI)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139357"},{"key":"ref34","first-page":"31","article-title":"Multi-robot task allocation: A review of the state-of-the-art","author":"khamis","year":"2015","journal-title":"Cooperative Robots and Sensor Networks"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-012-0406-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.20965\/jaciii.2013.p0883"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1177\/027836402320556368"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07551-8_39"},{"key":"ref1","first-page":"2117","article-title":"Complete coverage path planning for multi-robots employing flow networks","author":"nam","year":"2008","journal-title":"Proc Int Conf Control Autom Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1177\/0278364907085789"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1642065"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1308789"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008958800904"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9120-2"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2011.09.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2006.1641953"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-014-0571-8"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2003.1248885"},{"key":"ref40","first-page":"2110","article-title":"Multi-robot auctions for allocation of tasks with temporal constraints","author":"nunes","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2017.2780259"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.5772\/57313"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2853146"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016639210559"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2008.01.006"},{"key":"ref17","first-page":"1","article-title":"GM-VPC: An algorithm for multi-robot coverage of known spaces using generalized Voronoi partition","volume":"38","author":"nair","year":"2019","journal-title":"Robotica"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1049\/trit.2018.0009"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/70.795795"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2013.09.004"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2515165"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.5772\/26440"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2017.2767379"},{"key":"ref8","first-page":"101","article-title":"On complete coverage path planning algorithms for non-holonomic mobile robots: Survey and challenges","volume":"33","author":"khan","year":"2017","journal-title":"J Inf Sci Eng"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-015-0660-3"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.11.004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WI-IAT.2009.182"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.14257\/ijsh.2014.8.3.07"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2015.47"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.5772\/13241"},{"key":"ref47","first-page":"40","article-title":"Comparative analysis of search algorithms","volume":"179","year":"2018","journal-title":"Int J Comput Appl"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570413"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2003.1242189"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TCDS.2018.2810235"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-010-0404-5"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09099318.pdf?arnumber=9099318","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:52:16Z","timestamp":1639770736000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9099318\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":49,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2997095","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}