{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:23:24Z","timestamp":1762957404055,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T00:00:00Z","timestamp":1709769600000},"content-version":"vor","delay-in-days":6,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62173220"],"award-info":[{"award-number":["62173220"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018625","name":"Science and Technology Innovation Plan Of Shanghai Science and Technology Commission","doi-asserted-by":"publisher","award":["19DZ1207305"],"award-info":[{"award-number":["19DZ1207305"]}],"id":[{"id":"10.13039\/501100018625","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Coverage path planning (CPP) is in great demand with applications in agriculture, mining, manufacturing, etc. Most research in this area focused on 2D CPP problems solving the coverage problem with irregular 2D maps. Comparatively, CPP on uneven terrains is not fully solved. When there are many slopy areas in the working field, it is necessary to adjust the path shape and make it adapt to the 3D terrain surface to save energy consumption. This article proposes a terrain-shape-adaptive CPP method with three significant features. First, the paths grow by themselves according to the local terrain surface shapes. Second, the growth rule utilizes the 3D terrain traversability analysis, which makes them automatically avoid entering hazardous zones. Third, the irregularly distributed paths are connected under an optimal sequence with an improved genetic algorithm. As a result, the method can provide an autonomously growing terrain-adaptive coverage path with high energy efficiency and coverage rate compared to previous research works. It is demonstrated on various maps and is proven to be robust to terrain conditions.<\/jats:p>","DOI":"10.1007\/s10846-024-02073-8","type":"journal-article","created":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T08:02:35Z","timestamp":1709798555000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Terrain-Shape-Adaptive Coverage Path Planning With Traversability Analysis"],"prefix":"10.1007","volume":"110","author":[{"given":"Wenwei","family":"Qiu","sequence":"first","affiliation":[]},{"given":"Dacheng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Wenbo","family":"Hui","sequence":"additional","affiliation":[]},{"given":"Afimbo Reuben","family":"Kwabena","sequence":"additional","affiliation":[]},{"given":"Yubo","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Yi","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Quan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Huayan","family":"Pu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6517-2917","authenticated-orcid":false,"given":"Yangmin","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,7]]},"reference":[{"key":"2073_CR1","doi-asserted-by":"crossref","unstructured":"Yang, S., Luo, C.: A neural network approach to complete coverage path planning. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics). 34(1), 718\u2013724 (2004)","DOI":"10.1109\/TSMCB.2003.811769"},{"issue":"1","key":"2073_CR2","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TRO.2019.2946891","volume":"36","author":"M Hassan","year":"2020","unstructured":"Hassan, M., Liu, D.: Ppcpp: A predator-prey-based approach to adaptive coverage path planning. IEEE Trans. Rob. 36(1), 284\u2013301 (2020)","journal-title":"IEEE Trans. Rob."},{"key":"2073_CR3","doi-asserted-by":"crossref","unstructured":"Hameed, I.A.: Coverage path planning software for autonomous robotic lawn mower using dubins\u2019 curve. In 2017 IEEE International Conference on Real-time Computing and Robotics (RCAR). pp. 517\u2013522 (2017)","DOI":"10.1109\/RCAR.2017.8311915"},{"issue":"3","key":"2073_CR4","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1002\/rob.20388","volume":"28","author":"J Jin","year":"2011","unstructured":"Jin, J., Tang, L.: Coverage path planning on three-dimensional terrain for arable farming. Journal of field robotic. 28(3), 424\u2013440 (2011)","journal-title":"Journal of field robotic."},{"key":"2073_CR5","doi-asserted-by":"crossref","unstructured":"Hameed, I.A.: Intelligent coverage path planning for agricultural robots and autonomous machines on three-dimensional terrain. Journal of Intelligent & Robotic Systems. 74(3), 965\u2013983 (2014)","DOI":"10.1007\/s10846-013-9834-6"},{"key":"2073_CR6","doi-asserted-by":"crossref","unstructured":"Zhao, J., Zhu, L., Liu, G., iu, G., Han, Z.: A modified genetic algorithm for global path planning of searching robot in mine disasters. In 2009 International Conference on Mechatronics and Automation. pp. 4936\u20134940 (2009)","DOI":"10.1109\/ICMA.2009.5246026"},{"key":"2073_CR7","doi-asserted-by":"crossref","unstructured":"Park, S.J., Yeu, T.K., Yoon, S.M., Hong, S., Sung, K.Y.: A study of sweeping coverage path planning method for deep-sea manganese nodule mining robot. In OCEANS\u201911 MTS\/IEEE KONA. pp. 1\u20135 (2011)","DOI":"10.23919\/OCEANS.2011.6107109"},{"issue":"2","key":"2073_CR8","doi-asserted-by":"publisher","first-page":"2123","DOI":"10.1109\/LRA.2020.2970650","volume":"5","author":"T Sasaki","year":"2020","unstructured":"Sasaki, T., Otsu, K., Thakker, R., Haesaert, S., Agha-mohammadi, A.: Where to Map? Iterative Rover-Copter Path Planning for Mars Exploration. IEEE Robotics and Automation Letters. 5(2), 2123\u20132130 (2020). https:\/\/doi.org\/10.1109\/LRA.2020.2970650","journal-title":"IEEE Robotics and Automation Letters."},{"key":"2073_CR9","doi-asserted-by":"crossref","unstructured":"Ye, X., Luo, L., Hou, L., Duan, Y., Wu, Y.: Laser ablation manipulator coverage path planning method based on an improved ant colony algorithm. Applied Sciences. 10(23) (2020)","DOI":"10.3390\/app10238641"},{"issue":"3","key":"2073_CR10","doi-asserted-by":"publisher","first-page":"2584","DOI":"10.1109\/LRA.2019.2899920","volume":"4","author":"C Wu","year":"2019","unstructured":"Wu, C., Dai, C., Gong, X., Liu, Y.J., Wang, J., Gu, X.D., Wang, C.C.L.: Energy-Efficient Coverage Path Planning for General Terrain Surfaces. IEEE Robotics and Automation Letters. 4(3), 2584\u20132591 (2019). https:\/\/doi.org\/10.1109\/LRA.2019.2899920","journal-title":"IEEE Robotics and Automation Letters."},{"issue":"1","key":"2073_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.3390\/drones3010004","volume":"3","author":"TM Cabreira","year":"2019","unstructured":"Cabreira, T.M., Brisolara, L.B., Ferreira, P.R., Jr.: Survey on Coverage Path Planning with Unmanned Aerial Vehicles. Drones. 3(1), 4 (2019). https:\/\/doi.org\/10.3390\/drones3010004","journal-title":"Drones."},{"key":"2073_CR12","doi-asserted-by":"publisher","first-page":"119310","DOI":"10.1109\/ACCESS.2021.31081","volume":"9","author":"CS Tan","year":"2021","unstructured":"Tan, C.S., Mohd-Mokhtar, R., Arshad, M.R.: A Comprehensive Review of Coverage Path Planning in Robotics Using Classical and Heuristic Algorithms. In IEEE Access. 9, 119310\u2013119342 (2021). https:\/\/doi.org\/10.1109\/ACCESS.2021.31081","journal-title":"In IEEE Access."},{"issue":"8","key":"2073_CR13","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1002\/rob.20300","volume":"26","author":"T Oksanen","year":"2009","unstructured":"Oksanen, T., Visala, A.: Coverage path planning algorithms for agricultural field machines. Journal of field robotics. 26(8), 651\u2013668 (2009)","journal-title":"Journal of field robotics."},{"issue":"1","key":"2073_CR14","doi-asserted-by":"publisher","first-page":"283","DOI":"10.13031\/2013.29488","volume":"53","author":"J Jin","year":"2010","unstructured":"Jin, J., Tang, L.: Optimal coverage path planning for arable farming on 2d surfaces. Trans. ASABE 53(1), 283\u2013295 (2010)","journal-title":"Trans. ASABE"},{"key":"2073_CR15","doi-asserted-by":"publisher","first-page":"2585","DOI":"10.3390\/s18082585","volume":"18","author":"AV Le","year":"2018","unstructured":"Le, A.V., Prabakaran, V., Sivanantham, V., Mohan, R.E.: Modified A-Star Algorithm for Efficient Coverage Path Planning in Tetris Inspired Self-Reconfigurable Robot with Integrated Laser Sensor. Sensors. 18, 2585 (2018). https:\/\/doi.org\/10.3390\/s18082585","journal-title":"Sensors."},{"key":"2073_CR16","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. Journal of Intelligent & Robotic Systems. 86, 663\u2013680 (2017)","journal-title":"Journal of Intelligent & Robotic Systems."},{"key":"2073_CR17","doi-asserted-by":"publisher","unstructured":"Zhang, J., Zu, P., Zhou, M.: A Herd Foraging-Based Adaptive Coverage Path Planning in Unbounded Environments. In 2022 IEEE International Conference on Systems, Man, and Cybernetics (SMC), pp. 2062\u20132066 (2022). https:\/\/doi.org\/10.1109\/SMC53654.2022.9945206","DOI":"10.1109\/SMC53654.2022.9945206"},{"key":"2073_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101171","volume":"75","author":"VP Tran","year":"2021","unstructured":"Tran, V.P., Garratt, M.A., Kasmarik, K.E., Anavatti, S.G., Abpeikar, S.: Frontier-led swarming: Robust multi-robot coverage of unknown environments. Swarm Evol. Comput. 75, 101171 (2021)","journal-title":"Swarm Evol. Comput."},{"key":"2073_CR19","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10846-018-0787-7","volume":"94","author":"D Zhu","year":"2019","unstructured":"Zhu, D., Tian, C., Sun, B., Luo, C.: Complete Coverage Path Planning of Autonomous Underwater Vehicle Based on GBNN Algorithm. Journal of Intelligent & Robotic Systems. 94, 237\u2013249 (2019)","journal-title":"Journal of Intelligent & Robotic Systems."},{"key":"2073_CR20","doi-asserted-by":"publisher","unstructured":"Wang, Y., He, Z., Cao, D., Ma, L., Li, K., Jia, L., Cui, Y.: Coverage path planning for kiwifruit picking robots based on deep reinforcement learning. Computers and Electronics in Agriculture. 205, p. 107593 (2023), ISSN: 0168\u20131699. https:\/\/doi.org\/10.1016\/j.compag.2022.107593","DOI":"10.1016\/j.compag.2022.107593"},{"key":"2073_CR21","doi-asserted-by":"publisher","unstructured":"Kyaw, P.T., Paing, A., Thu, T.T., Mohan, R.E., Le Vu, A., Veerajagadheswar, P.: Coverage Path Planning for Decomposition Reconfigurable Grid-Maps Using Deep Reinforcement Learning Based Travelling Salesman Problem. IEEE Access. 8, 225945\u2013225956 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3045027","DOI":"10.1109\/ACCESS.2020.3045027"},{"key":"2073_CR22","doi-asserted-by":"publisher","unstructured":"Kumar, K., Kumar, N.: Region coverage-aware path planning for unmanned aerial vehicles: A systematic review. Phys. Commun. 59(C), pp. 102073 (2023). https:\/\/doi.org\/10.1016\/j.phycom.2023.102073","DOI":"10.1016\/j.phycom.2023.102073"},{"key":"2073_CR23","doi-asserted-by":"crossref","unstructured":"Dogru, S., Marques, L.: Towards fully autonomous energy-efficient coverage path planning for autonomous mobile robots on 3d terrain. In 2015 European Conference on Mobile Robots (ECMR). pp. 1\u20136 (2015)","DOI":"10.1109\/ECMR.2015.7324206"},{"key":"2073_CR24","doi-asserted-by":"crossref","unstructured":"Shen, M., Wang, S., Wang, S., Su, Y.: Simulation study on coverage path planning of autonomous tasks in hilly farmland based on energy consumption model. Mathematical Problems in Engineering. 2020 (2020)","DOI":"10.1155\/2020\/4535734"},{"key":"2073_CR25","doi-asserted-by":"crossref","unstructured":"Apuroop, K.G.S., Le, A.V., Elara, M.R., Sheu, B.J.: Reinforcement learning-based complete area coverage path planning for a modified htrihex robot. Sensors. 21(4) (2021)","DOI":"10.3390\/s21041067"},{"key":"2073_CR26","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.robot.2015.11.009","volume":"76","author":"IA Hameed","year":"2016","unstructured":"Hameed, I.A., la Cour-Harbo, A., Osen, O.L.: Side-to-side 3d coverage path planning approach for agricultural robots to minimize skip\/overlap areas between swaths. Robot. Auton. Syst. 76, 36\u201345 (2016)","journal-title":"Robot. Auton. Syst."},{"issue":"4","key":"2073_CR27","first-page":"1","volume":"35","author":"H Zhao","year":"2016","unstructured":"Zhao, H., Gu, F., Huang, Q.X., Garcia, J., Chen, Y., Tu, C., Benes, B., Zhang, H., Cohen-Or, D., Chen, B.: Connected fermat spirals for layered fabrication. ACM Transactions on Graphics (TOG). 35(4), 1\u201310 (2016)","journal-title":"ACM Transactions on Graphics (TOG)."},{"key":"2073_CR28","doi-asserted-by":"crossref","unstructured":"Tang, Y., Cai, J., Chen, M., Yan, X., Xie, Y.: An autonomous exploration algorithm using environment-robot interacted traversability analysis. In 2019 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS). pp. 4885\u20134890 (2019)","DOI":"10.1109\/IROS40897.2019.8967940"},{"key":"2073_CR29","doi-asserted-by":"crossref","unstructured":"Arena, P., Blanco, C.F., Noce, A.L., Taffara, S., Patan\u00e8, L.: Learning traversability map of different robotic platforms for unstructured terrains path planning. In 2020 International Joint Conference on Neural Networks (IJCNN). pp. 1\u20138 (2020)","DOI":"10.1109\/IJCNN48605.2020.9207423"},{"issue":"1","key":"2073_CR30","first-page":"2","volume":"2","author":"K Deep","year":"2011","unstructured":"Deep, K., Mebrahtu, H.: New variations of order crossover for travelling salesman problem. International Journal of Combinatorial Optimization Problems and Informatics. 2(1), 2\u201313 (2011)","journal-title":"International Journal of Combinatorial Optimization Problems and Informatics."},{"key":"2073_CR31","doi-asserted-by":"publisher","unstructured":"Nelson city council, toit\u016b te whenua land information new zealand (linz). nelson, new zealand 2021. collected by aerial surveys, distributed by opentopography and linz (2021). https:\/\/doi.org\/10.5069\/G9R78CD4","DOI":"10.5069\/G9R78CD4"},{"issue":"8","key":"2073_CR32","doi-asserted-by":"publisher","first-page":"5275","DOI":"10.1109\/LRA.2023.3293319","volume":"8","author":"J Lu","year":"2023","unstructured":"Lu, J., Zeng, B., Tang, J., Lam, T.L., Wen, J.: TMSTC*: A Path Planning Algorithm for Minimizing Turns in Multi-Robot Coverage. In IEEE Robotics and Automation Letters. 8(8), 5275\u20135282 (2023). https:\/\/doi.org\/10.1109\/LRA.2023.3293319","journal-title":"In IEEE Robotics and Automation Letters."},{"key":"2073_CR33","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1631\/FITEE.1800551","volume":"20","author":"GQ Gao","year":"2019","unstructured":"Gao, G.Q., Xin, B.: A-STC: Auction-based Spanning Tree Coverage Algorithm for Motion Planning of Cooperative Robots. Frontiers of Information Technology & Electronic Engineering. 20, 18\u201331 (2019). https:\/\/doi.org\/10.1631\/FITEE.1800551","journal-title":"Frontiers of Information Technology & Electronic Engineering."},{"issue":"5","key":"2073_CR34","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1061\/(ASCE)0733-947X(2001)127:5(418)","volume":"127","author":"H Rakha","year":"2001","unstructured":"Rakha, H., Lucic, I., Demarchi, S.H., et al.: Vehicle dynamics model for predicting maximum truck acceleration levels. J. Transp. Eng. 127(5), 418\u2013425 (2001)","journal-title":"J. Transp. Eng."}],"container-title":["Journal of Intelligent &amp; Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-024-02073-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10846-024-02073-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-024-02073-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,13]],"date-time":"2024-11-13T23:02:57Z","timestamp":1731538977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10846-024-02073-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["2073"],"URL":"https:\/\/doi.org\/10.1007\/s10846-024-02073-8","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"type":"print","value":"0921-0296"},{"type":"electronic","value":"1573-0409"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"14 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2024","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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Informed consent was obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to publish"}}],"article-number":"41"}}