{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T03:10:45Z","timestamp":1778037045778,"version":"3.51.4"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":["Intel Serv Robotics"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s11370-025-00665-3","type":"journal-article","created":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T03:51:09Z","timestamp":1767585069000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A multi-UGV coverage path planning method with reduced the number of turns for structured obstacle-enclosed area"],"prefix":"10.1007","volume":"19","author":[{"given":"Chao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huajian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanlong","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renjie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1267-4550","authenticated-orcid":false,"given":"Yongzhuo","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"665_CR1","doi-asserted-by":"crossref","unstructured":"Agmon N, Hazon N, Kaminka GA, 2006. Constructing spanning trees for efficient multi-robot coverage. Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006 ICRA 2006, p.1698\u20131703.","DOI":"10.1109\/ROBOT.2006.1641951"},{"key":"665_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2021.110098","volume":"241","author":"B Ai","year":"2021","unstructured":"Ai B, Jia M, Xu H, Xu J, Wen Z, Li B, Zhang D (2021) Coverage path planning for maritime search and rescue using reinforcement learning. Ocean Eng 241:110098","journal-title":"Ocean Eng"},{"issue":"1","key":"665_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","volume":"17","author":"EM Arkin","year":"2000","unstructured":"Arkin EM, Fekete SP, Mitchell JS (2000) Approximation algorithms for lawn mowing and milling. Comput Geom 17(1):25\u201350","journal-title":"Comput Geom"},{"issue":"3","key":"665_CR4","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1137\/S0097539703434267","volume":"35","author":"EM Arkin","year":"2005","unstructured":"Arkin EM, Bender MA, Demaine ED et al (2005) Optimal covering tours with turn costs. SIAM J Comput 35(3):531\u2013566","journal-title":"SIAM J Comput"},{"issue":"11","key":"665_CR5","doi-asserted-by":"publisher","first-page":"3078","DOI":"10.1890\/04-1806","volume":"86","author":"F Bartumeus","year":"2005","unstructured":"Bartumeus F, da Luz MGE, Viswanathan GM et al (2005) Animal search strategies: a quantitative random-walk analysis. Ecology 86(11):3078\u20133087","journal-title":"Ecology"},{"key":"665_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2023.108353","volume":"215","author":"B Chen","year":"2023","unstructured":"Chen B, Gong L, Yu C et al (2023) Workspace decomposition based path planning for fruit-picking robot in complex greenhouse environment. Comput Electron Agric 215:108353","journal-title":"Comput Electron Agric"},{"issue":"4","key":"665_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.orl.2003.11.010","volume":"32","author":"G Even","year":"2004","unstructured":"Even G, Garg N, K\u00f6nemann J et al (2004) Min\u2013max tree covers of graphs. Oper Res Lett 32(4):309\u2013315","journal-title":"Oper Res Lett"},{"key":"665_CR8","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.actaastro.2022.04.038","volume":"198","author":"S Faghihi","year":"2022","unstructured":"Faghihi S, Tavana S, de Ruiter AH (2022) Kinodynamic on-orbit inspection path planning for full-coverage inspection in close proximity of space structures. Acta Astronaut 198:354\u2013365","journal-title":"Acta Astronaut"},{"key":"665_CR9","doi-asserted-by":"crossref","unstructured":"Fekete SP, Krupke D, 2019a. Covering tours and cycle covers with turn costs: Hardness and approximation. Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome, Italy, May 27\u201329, 2019, Proceedings 11, p.224\u2013236.","DOI":"10.1007\/978-3-030-17402-6_19"},{"key":"665_CR10","doi-asserted-by":"crossref","unstructured":"Fekete SP, Krupke D, 2019b. Practical methods for computing large covering tours and cycle covers with turn cost.2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX), p.186\u2013198.","DOI":"10.1137\/1.9781611975499.15"},{"key":"665_CR11","doi-asserted-by":"publisher","first-page":"17405","DOI":"10.1007\/s11042-016-3907-z","volume":"76","author":"J Feng","year":"2017","unstructured":"Feng J, Zhang J, Zhu X et al (2017) A novel chaos optimization algorithm. Multimedia Tools Appl 76:17405\u201317436","journal-title":"Multimedia Tools Appl"},{"key":"665_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1016610507833","volume":"31","author":"Y Gabriely","year":"2001","unstructured":"Gabriely Y, Rimon E (2001) Spanning-tree based coverage of continuous areas by a mobile robot. Ann Math Artif Intell 31:77\u201398","journal-title":"Ann Math Artif Intell"},{"issue":"3","key":"665_CR13","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0925-7721(02)00110-4","volume":"24","author":"Y Gabriely","year":"2003","unstructured":"Gabriely Y, Rimon E (2003) Competitive on-line coverage of grid environments by a mobile robot. Comput Geom 24(3):197\u2013224","journal-title":"Comput Geom"},{"issue":"12","key":"665_CR14","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E Galceran","year":"2013","unstructured":"Galceran E, Carreras M (2013) A survey on coverage path planning for robotics. Robot Auton Syst 61(12):1258\u20131276","journal-title":"Robot Auton Syst"},{"key":"665_CR15","doi-asserted-by":"crossref","unstructured":"Hameed IA, 2016. Motion planning for autonomous landmine detection and clearance robots. 2016 International Workshop on Recent Advances in Robotics and Sensor Technology for Humanitarian Demining and Counter-IEDs (RST), p.1\u20135.","DOI":"10.1109\/RST.2016.7869854"},{"key":"665_CR16","doi-asserted-by":"publisher","unstructured":"Hasan KM, Abdullah-Al-Nahid, Reza KJ, 2014. Path planning algorithm development for autonomous vacuum cleaner robots. 2014 International Conference on Informatics, Electronics & Vision (ICIEV), p.1\u20136. https:\/\/doi.org\/10.1109\/ICIEV.2014.6850799","DOI":"10.1109\/ICIEV.2014.6850799"},{"key":"665_CR17","doi-asserted-by":"crossref","unstructured":"Hazon N, Kaminka GA, 2005. Redundancy, efficiency and robustness in multi-robot coverage. Proceedings of the 2005 IEEE international conference on robotics and automation, p.735\u2013741.","DOI":"10.1109\/ROBOT.2005.1570205"},{"key":"665_CR18","doi-asserted-by":"crossref","unstructured":"Kegeleirs M, Garz\u00f3n Ramos D, Birattari M, 2019. Random walk exploration for swarm mapping. Towards Autonomous Robotic Systems, Cham, p.211\u2013222.","DOI":"10.1007\/978-3-030-25332-5_19"},{"key":"665_CR19","doi-asserted-by":"crossref","unstructured":"Krupke D, 2024. Near-optimal coverage path planning with turn costs. 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), p.118\u2013132.","DOI":"10.1137\/1.9781611977929.9"},{"key":"665_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2020.103078","volume":"112","author":"AK Lakshmanan","year":"2020","unstructured":"Lakshmanan AK, Mohan RE, Ramalingam B et al (2020) Complete coverage path planning using reinforcement learning for tetromino based cleaning and maintenance robot. Autom Constr 112:103078","journal-title":"Autom Constr"},{"key":"665_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2024.117501","volume":"301","author":"W Lan","year":"2024","unstructured":"Lan W, Jin X, Chang X, Zhou H (2024) Based on deep reinforcement learning to path planning in uncertain ocean currents for Underwater Gliders. Ocean Eng 301:117501","journal-title":"Ocean Eng"},{"issue":"19","key":"665_CR22","doi-asserted-by":"publisher","first-page":"4089","DOI":"10.3390\/s19194089","volume":"19","author":"G Li","year":"2019","unstructured":"Li G, Chen C, Geng C et al (2019) A pheromoneinspired monitoring strategy using a swarm of underwater robots. Sensors 19(19):4089","journal-title":"Sensors"},{"key":"665_CR23","doi-asserted-by":"publisher","unstructured":"Liu Y, Lin X, Zhu S, 2008. Combined coverage path planning for autonomous cleaning robots in unstructured environments. 2008 7th World Congress on Intelligent Control and Automation, p.8271\u20138276. https:\/\/doi.org\/10.1109\/WCICA.2008.4594223","DOI":"10.1109\/WCICA.2008.4594223"},{"key":"665_CR24","unstructured":"Lu J, Zeng B, Tang J, et al., 2022. Tmstc: A turnminimizing algorithm for multi-robot coverage path planning. arXiv preprint arXiv:221202231, 2212:02231."},{"key":"665_CR25","doi-asserted-by":"crossref","unstructured":"Martinez F, Jacinto E, Acero D, 2012. Brownian motion as exploration strategy for autonomous swarm robots. 2012 IEEE international conference on robotics and biomimetics (ROBIO), p.2375\u20132380.","DOI":"10.1109\/ROBIO.2012.6491325"},{"issue":"7","key":"665_CR26","doi-asserted-by":"publisher","first-page":"5189","DOI":"10.1007\/s10489-020-02060-0","volume":"51","author":"B Pang","year":"2021","unstructured":"Pang B, Song Y, Zhang C et al (2021) Effect of random walk methods on searching efficiency in swarm robots for area exploration. Appl Intell 51(7):5189\u20135199","journal-title":"Appl Intell"},{"key":"665_CR27","doi-asserted-by":"crossref","unstructured":"Senthilkumar K, Bharadwaj K, 2008. Spanning tree based terrain coverage by multi robots in unknown environments.2008 Annual IEEE India Conference, 1:120\u2013125.","DOI":"10.1109\/INDCON.2008.4768812"},{"key":"665_CR28","doi-asserted-by":"crossref","unstructured":"Sutantyo D, Levi P, M\u00f6slinger C, et al., 2013. Collectiveadaptive l\u00e9vy flight for underwater multi-robot exploration.2013 IEEE International Conference on Mechatronics and Automation, p.456\u2013462.","DOI":"10.1109\/ICMA.2013.6617961"},{"key":"665_CR29","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10489-012-0406-4","volume":"39","author":"HH Viet","year":"2013","unstructured":"Viet HH, Dang VH, Laskar MNU et al (2013) Ba*: an online complete coverage algorithm for cleaning robots. Appl Intell 39:217\u2013235","journal-title":"Appl Intell"},{"key":"665_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.105999","volume":"122","author":"DT Vo","year":"2023","unstructured":"Vo DT, Le AV, Ta TD et al (2023) Toward complete coverage planning using deep reinforcement learning by trapezoid-based transformable robot. Eng Appl Artif Intell 122:105999","journal-title":"Eng Appl Artif Intell"},{"key":"665_CR31","doi-asserted-by":"crossref","unstructured":"Wagner IA, Lindenbaum M, Bruckstein AM, 1998. Robotic exploration, brownian motion and electrical resistance. Randomization and Approximation Techniques in Computer Science, Berlin, Heidelberg, p.116\u2013130.","DOI":"10.1007\/3-540-49543-6_10"},{"key":"665_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.compag.2022.107593","volume":"205","author":"Y Wang","year":"2023","unstructured":"Wang Y, He Z, Cao D et al (2023) Coverage path planning for kiwifruit picking robots based on deep reinforcement learning. Comput Electron Agric 205:107593","journal-title":"Comput Electron Agric"},{"issue":"5","key":"665_CR33","doi-asserted-by":"publisher","first-page":"2257","DOI":"10.1109\/TAES.2018.2812538","volume":"54","author":"Y Wang","year":"2018","unstructured":"Wang Y, Kirubarajan T, Tharmarasa R et al (2018) Multiperiod coverage path planning and scheduling for airbornesurveillance. IEEE Trans Aerosp Electron Syst 54(5):2257\u20132273","journal-title":"IEEE Trans Aerosp Electron Syst"},{"key":"665_CR34","doi-asserted-by":"publisher","DOI":"10.1016\/j.oceaneng.2023.116403","volume":"291","author":"J Wu","year":"2024","unstructured":"Wu J, Cheng L, Chu S, Song Y (2024) An autonomous coverage path planning algorithm for maritime search and rescue of persons-in-water based on deep reinforcement learning. Ocean Eng 291:116403","journal-title":"Ocean Eng"},{"key":"665_CR35","doi-asserted-by":"crossref","unstructured":"Xie J, Jin L, Garcia Carrillo LR, 2019. Optimal path planning for unmanned aerial systems to cover multiple regions. AIAA scitech 2019 forum, p.1794.","DOI":"10.2514\/6.2019-1794"},{"issue":"4","key":"665_CR36","doi-asserted-by":"publisher","first-page":"2300970","DOI":"10.1002\/adts.202300970","volume":"7","author":"B Xing","year":"2024","unstructured":"Xing B, Wang X, Liu Z (2024) An algorithm of complete coverage path planning for deep-sea mining vehicle clusters based on reinforcement learning. Adv Theory Simul 7(4):2300970","journal-title":"Adv Theory Simul"},{"issue":"3","key":"665_CR37","doi-asserted-by":"publisher","first-page":"645","DOI":"10.3390\/jmse11030645","volume":"11","author":"B Xing","year":"2023","unstructured":"Xing B, Wang X, Yang L, Liu Z, Wu Q (2023) An algorithm of complete coverage path planning for unmanned surface vehicle based on reinforcement learning. J Mar Sci Eng 11(3):645","journal-title":"J Mar Sci Eng"},{"issue":"12","key":"665_CR38","doi-asserted-by":"publisher","first-page":"7700","DOI":"10.1109\/TII.2020.2974047","volume":"16","author":"T Yang","year":"2020","unstructured":"Yang T, Jiang Z, Sun R et al (2020) Maritime search and rescue based on group mobile computing for unmannedaerial vehicles and unmanned surface vehicles. IEEE Trans Ind Inform 16(12):7700\u20137708","journal-title":"IEEE Trans Ind Inform"},{"key":"665_CR39","doi-asserted-by":"crossref","unstructured":"Zhang J, Singh S. 2014 LOAM: Lidar odometry and mapping in real-time[C]. Robotics: Science and systems. 2(9): 1\u20139.","DOI":"10.15607\/RSS.2014.X.007"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00665-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11370-025-00665-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-025-00665-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T02:16:28Z","timestamp":1778033788000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11370-025-00665-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["665"],"URL":"https:\/\/doi.org\/10.1007\/s11370-025-00665-3","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"15 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2026","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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"18"}}