{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T17:26:44Z","timestamp":1763141204921},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030275402"},{"type":"electronic","value":"9783030275419"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27541-9_29","type":"book-chapter","created":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T10:02:43Z","timestamp":1564999363000},"page":"349-361","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Multi-robot Path Planning for Complete Coverage with Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Rongchuan","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunhua","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianying","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongzheng","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shumei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1008958800904","volume":"9","author":"H Choset","year":"2000","unstructured":"Choset, H.: Coverage of known spaces: the boustrophedon cellular decomposition. Auton. Robot. 9(3), 247\u2013253 (2000)","journal-title":"Auton. Robot."},{"issue":"4","key":"29_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1177\/027836402320556368","volume":"21","author":"EU Acar","year":"2002","unstructured":"Acar, E.U., Choset, H.: Sensor-based coverage of unknown environments: incremental construction of morse decompositions. Int. J. Robot. Res. 21(4), 345\u2013366 (2002)","journal-title":"Int. J. Robot. Res."},{"key":"29_CR3","unstructured":"Zelinsky, A., Jarvis, R.A., Byrne, J.C.: Planning paths of complete coverage of an unstructured environment by a mobile robot. In: Proceedings of International Conference on Advanced Robotics, pp. 533\u2013538 (1993)"},{"key":"29_CR4","unstructured":"Gabriely, Y., Rimon, E.: Spiral-STC: an on-line coverage algorithm of grid environments by a mobile robot. In: Proceedings of IEEE International Conference on Robotics and Automation, pp. 954\u2013960 (2002)"},{"issue":"7","key":"29_CR5","doi-asserted-by":"publisher","first-page":"1279","DOI":"10.1109\/TNN.2008.2000394","volume":"19","author":"C Luo","year":"2008","unstructured":"Luo, C., Yang, S.X.: A bioinspired neural network for real-time concurrent map building and complete coverage robot navigation in unknown environments. IEEE Trans. Neural Netw. 19(7), 1279\u20131298 (2008)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"6","key":"29_CR6","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1007\/s10514-015-9517-1","volume":"40","author":"A Bircher","year":"2016","unstructured":"Bircher, A., et al.: Three-dimensional coverage path planning via viewpoint resampling and tour optimization for aerial robots. Auton. Robot. 40(6), 1059\u20131078 (2016)","journal-title":"Auton. Robot."},{"key":"29_CR7","unstructured":"Janchiv, A., Batsaikhan, D., Kim, G.H., et al.: Complete coverage path planning for multi-robots based on. In: Proceedings of International Conference on Control, Automation and Systems pp. 824\u2013827 (2011)"},{"issue":"2\u20134","key":"29_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10472-009-9120-2","volume":"52","author":"I Rekleitis","year":"2008","unstructured":"Rekleitis, I., Ai, P.N., Rankin, E.S., et al.: Efficient boustrophedon multi-robot coverage: an algorithmic approach. Ann. Math. Artif. Intell. 52(2\u20134), 109\u2013142 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"29_CR9","unstructured":"Hazon, N., Kaminka, G.A.: Redundancy, efficiency and robustness in multi-robot coverage. In: Proceedings of IEEE International Conference on Robotics and Automation, pp. 735\u2013741 (2005)"},{"issue":"12","key":"29_CR10","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(12), 1102\u20131114 (2008)","journal-title":"Robot. Auton. Syst."},{"issue":"2","key":"29_CR11","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10489-012-0406-4","volume":"39","author":"HH Viet","year":"2013","unstructured":"Viet, H.H., Dang, V.H., Laskar, M.N.U., et al.: BA*: an online complete coverage algorithm for cleaning robots. Appl. Intell. 39(2), 217\u2013235 (2013)","journal-title":"Appl. Intell."},{"issue":"2","key":"29_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10489-014-0571-8","volume":"42","author":"HH Viet","year":"2015","unstructured":"Viet, H.H., Dang, V.H., Choi, S.Y., et al.: BoB: an online coverage approach for multi-robot systems. Appl. Intell. 42(2), 157\u2013173 (2015)","journal-title":"Appl. Intell."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/TRO.2006.889486","volume":"23","author":"G Grisetti","year":"2007","unstructured":"Grisetti, G., Stachniss, C., Burgard, W.: Improved techniques for grid mapping with rao-blackwellized particle filters. IEEE Trans. Robot. 23, 34\u201346 (2007)","journal-title":"IEEE Trans. Robot."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Kohlbrecher, S., Stryk, O.V., Meyer, J., Klingauf, U.: A flexible and scalable SLAM system with Full 3D motion estimation. In: Proceedings of IEEE International Symposium on Safety, Security and Rescue Robotics, pp. 155\u2013160 (2011)","DOI":"10.1109\/SSRR.2011.6106777"},{"issue":"3\u20134","key":"29_CR15","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10846-016-0375-7","volume":"82","author":"P Koch","year":"2016","unstructured":"Koch, P., et al.: Multi-robot localization and mapping based on signed distance functions. J. Intell. Robot. Syst. 82(3\u20134), 409\u2013428 (2016)","journal-title":"J. Intell. Robot. Syst."},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Hess, W., Kohler, D., Rapp, H., Andor, D.: Real-time loop closure in 2D LIDAR SLAM. In: Proceedings of IEEE International Conference on Robotics and Automation, pp. 1271\u20131278 (2016)","DOI":"10.1109\/ICRA.2016.7487258"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Yu, S., Sun, R., et al.: Topological segmentation for indoor environments from grid maps using an improved NJW algorithm. In: Proceedings of IEEE International Conference on Information and Automation, pp. 142\u2013147 (2017)","DOI":"10.1109\/ICInfA.2017.8078896"},{"key":"29_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7910-0","volume-title":"A Course in Topological Combinatorics","author":"MD Longueville","year":"2012","unstructured":"Longueville, M.D.: A Course in Topological Combinatorics. Springer, New York (2012). \n                      https:\/\/doi.org\/10.1007\/978-1-4419-7910-0"},{"issue":"1","key":"29_CR19","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1002\/nav.20053","volume":"52","author":"HW Kuhn","year":"2005","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. 52(1), 7\u201321 (2005)","journal-title":"Nav. Res. Logist."},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Lattarulo, V., Parks, G.T.: A preliminary study of a new multi-objective optimization algorithm. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2012)","DOI":"10.1109\/CEC.2012.6256437"},{"issue":"3","key":"29_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.orl.2010.02.004","volume":"38","author":"Z Xu","year":"2010","unstructured":"Xu, Z., Wen, Q.: Approximation hardness of min-max tree covers. Oper. Res. Lett. 38(3), 169\u2013173 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"29_CR22","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.orl.2004.03.007","volume":"33","author":"SC Sarin","year":"2005","unstructured":"Sarin, S.C., Sherali, H.D., Bhootra, A.: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper. Res. Lett. 33(1), 62\u201370 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"29_CR23","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2009","unstructured":"Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209\u2013219 (2009)","journal-title":"Omega"},{"issue":"2","key":"29_CR24","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10846-016-0400-x","volume":"85","author":"A Koubaa","year":"2017","unstructured":"Koubaa, A., et al.: Move and improve: a market-based mechanism for the multiple depot multiple travelling salesmen problem. J. Intell. Robot. Syst. 85(2), 307\u2013330 (2017)","journal-title":"J. Intell. Robot. Syst."},{"key":"29_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/b101880","volume-title":"Genetic Algorithms-Principles and Perspectives: A Guide to GA Theory","author":"CR Reeves","year":"2002","unstructured":"Reeves, C.R., Rowe, J.E.: Genetic Algorithms-Principles and Perspectives: A Guide to GA Theory. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"6","key":"29_CR26","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling salesman problems. Oper. Res. 6(6), 791\u2013812 (1958)","journal-title":"Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Intelligent Robotics and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27541-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T10:14:41Z","timestamp":1565000081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-27541-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030275402","9783030275419"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27541-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIRA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Robotics and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icira2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icira2019.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}