{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:58:15Z","timestamp":1743073095160,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":23,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819913534"},{"type":"electronic","value":"9789819913541"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-981-99-1354-1_19","type":"book-chapter","created":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T14:03:27Z","timestamp":1680098607000},"page":"219-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multi-robot Online Complete Coverage Based on Collaboration"],"prefix":"10.1007","author":[{"given":"Leilei","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianming","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukuan","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,30]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s12555-011-0184-5","volume":"11","author":"A Janchiv","year":"2013","unstructured":"Janchiv, A., Batsaikhan, D., Kim, B., Lee, W.G., Lee, S.: Time-efficient and complete coverage path planning based on flow networks for multi-robots. Int. J. Control Autom. Syst. 11, 369\u2013376 (2013). https:\/\/doi.org\/10.1007\/s12555-011-0184-5","journal-title":"Int. J. Control Autom. Syst."},{"issue":"4","key":"19_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10514-013-9364-x","volume":"36","author":"A Xu","year":"2013","unstructured":"Xu, A., Viriyasuthee, C., Rekleitis, I.: Efficient complete coverage of a known arbitrary environment with applications to aerial operations. Auton. Robot. 36(4), 365\u2013381 (2013). https:\/\/doi.org\/10.1007\/s10514-013-9364-x","journal-title":"Auton. Robot."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10846-011-9560-x","volume":"65","author":"L Merino","year":"2012","unstructured":"Merino, L., Caballero, F., Dios, J.R., Maza, I., Ollero, A.: An unmanned aircraft system for automatic forest fire monitoring and measurement. J. Intell. Robot. Syst. 65, 533\u2013548 (2012). https:\/\/doi.org\/10.1007\/s10846-011-9560-x","journal-title":"J. Intell. Robot. Syst."},{"issue":"3-4","key":"19_CR4","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/s10846-016-0461-x","volume":"86","author":"AC Kapoutsis","year":"2017","unstructured":"Kapoutsis, A.C., Chatzichristofis, S.A., Kosmatopoulos, E.B.: DARP: divide areas algorithm for optimal multi-robot coverage path planning. J. Intell. Robot. Syst. 86(3\u20134), 663\u2013680 (2017). https:\/\/doi.org\/10.1007\/s10846-016-0461-x","journal-title":"J. Intell. Robot. Syst."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Gabriely, Y., Rimon, E.D.: Spanning-tree based coverage of continuous areas by a mobile robot. In: Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No. 01CH37164), vol. 2, pp. 1927\u20131933 (2001)","DOI":"10.1109\/ROBOT.2001.932890"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"5969","DOI":"10.1109\/LRA.2020.3010455","volume":"5","author":"X Kan","year":"2020","unstructured":"Kan, X., Teng, H., Karydis, K.: Online exploration and coverage planning in unknown obstacle-cluttered environments. IEEE Robot. Autom. Lett. 5, 5969\u20135976 (2020)","journal-title":"IEEE Robot. Autom. Lett."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10472-009-9120-2","volume":"52","author":"IM Rekleitis","year":"2009","unstructured":"Rekleitis, I.M., New, A.P., Rankin, E.S., Choset, H.: Efficient boustrophedon multi-robot coverage: an algorithmic approach. Ann. Math. Artif. Intell. 52, 109\u2013142 (2009). https:\/\/doi.org\/10.1007\/s10472-009-9120-2","journal-title":"Ann. Math. Artif. Intell."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1017\/S0263574718000292","volume":"36","author":"H Azp\u00farua","year":"2018","unstructured":"Azp\u00farua, H., Freitas, G.M., Macharet, D.G., Campos, M.F.: Multi-robot coverage path planning using hexagonal segmentation for geophysical surveys. Robotica 36, 1144\u20131166 (2018)","journal-title":"Robotica"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Gautam, A., Jatavallabhula, K., Kumar, G., Ram, S.P., Jha, B., Mohan, S.: Cluster, allocate, cover: an efficient approach for multi-robot coverage. In: 2015 IEEE International Conference on Systems, Man, and Cybernetics, pp. 197\u2013203 (2015)","DOI":"10.1109\/SMC.2015.47"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Modares, J., Ghanei, F., Mastronarde, N., Dantu, K.: UB-ANC planner: energy efficient coverage path planning with multiple drones. In: 2017 IEEE International Conference on Robotics and Automation (ICRA), pp. 6182\u20136189 (2017)","DOI":"10.1109\/ICRA.2017.7989732"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Hazon, N., Kaminka, G.A.: Redundancy, efficiency and robustness in multi-robot coverage. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, pp. 735\u2013741 (2005)","DOI":"10.1109\/ROBOT.2005.1570205"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1016\/j.robot.2008.01.006","volume":"56","author":"N Hazon","year":"2008","unstructured":"Hazon, N., Kaminka, G.A.: On redundancy, efficiency, and robustness in coverage for multiple robots. Robot. Auton. Syst. 56, 1102\u20131114 (2008)","journal-title":"Robot. Auton. Syst."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","volume":"17","author":"EM Arkin","year":"2000","unstructured":"Arkin, E.M., Fekete, S.P., Mitchell, J.B.: Approximation algorithms for lawn mowing and milling. Comput. Geom. 17, 25\u201350 (2000)","journal-title":"Comput. Geom."},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00138-007-0110-2","volume":"20","author":"WR Scott","year":"2007","unstructured":"Scott, W.R.: Model-based view planning. Mach. Vis. Appl. 20, 47\u201369 (2007). https:\/\/doi.org\/10.1007\/s00138-007-0110-2","journal-title":"Mach. Vis. Appl."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/641865.641868","volume":"35","author":"WR Scott","year":"2003","unstructured":"Scott, W.R., Roth, G., Rivest, J.: View planning for automated three-dimensional object reconstruction and inspection. ACM Comput. Surv. 35, 64\u201396 (2003)","journal-title":"ACM Comput. Surv."},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-27541-9_29","volume-title":"Intelligent Robotics and Applications","author":"R Sun","year":"2019","unstructured":"Sun, R., Tang, C., Zheng, J., Zhou, Y., Yu, S.: Multi-robot path planning for complete coverage with genetic algorithms. In: Yu, H., Liu, J., Liu, L., Ju, Z., Liu, Y., Zhou, D. (eds.) ICIRA 2019. LNCS (LNAI), vol. 11744, pp. 349\u2013361. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27541-9_29"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Reeves, C.R., Rowe, J.E.: Genetic Algorithms: Principles and Perspectives: A Guide to Ga Theory (2002)","DOI":"10.1007\/b101880"},{"key":"19_CR18","unstructured":"LaValle, S.M.: Rapidly-exploring random trees: a new tool for path planning. The annual research report (1998)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Umari, H., Mukhopadhyay, S.: Autonomous robotic exploration based on multiple rapidly-exploring randomized trees. In: 2017 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 1396\u20131402 (2017)","DOI":"10.1109\/IROS.2017.8202319"},{"key":"19_CR20","unstructured":"Warren, C.W.: Global path planning using artificial potential fields. In: Proceedings 1989 International Conference on Robotics and Automation, vol. 1, pp. 316\u2013321 (1989)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Yu, J., et al.: SMMR-explore: submap-based multi-robot exploration system with multi-robot multi-target potential field exploration method. In: 2021 IEEE International Conference on Robotics and Automation (ICRA), pp. 8779\u20138785 (2021)","DOI":"10.1109\/ICRA48506.2021.9561328"},{"key":"19_CR22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-1273-0_32","volume-title":"Field and Service Robotics","author":"H Choset","year":"1998","unstructured":"Choset, H., Pignon, P.: Coverage path planning: the boustrophedon cellular decomposition. In: Zelinsky, A. (ed.) Field and Service Robotics. Springer, London (1998). https:\/\/doi.org\/10.1007\/978-1-4471-1273-0_32"},{"issue":"3-4","key":"19_CR23","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10514-019-09870-3","volume":"44","author":"J Song","year":"2019","unstructured":"Song, J., Gupta, S.: CARE: cooperative autonomy for resilience and efficiency of robot teams for complete coverage of unknown environments under robot failures. Auton. Robot. 44(3\u20134), 647\u2013671 (2019). https:\/\/doi.org\/10.1007\/s10514-019-09870-3","journal-title":"Auton. Robot."}],"container-title":["Communications in Computer and Information Science","Web and Big Data. APWeb-WAIM 2022 International Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-1354-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T08:14:24Z","timestamp":1729152864000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-1354-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9789819913534","9789819913541"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-1354-1_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"30 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}