{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T10:51:56Z","timestamp":1777891916024,"version":"3.51.4"},"reference-count":34,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Qinghai Science and Technology Plan Project","award":["2020-QY-213"],"award-info":[{"award-number":["2020-QY-213"]}]},{"name":"Qinghai Science and Technology Plan Project","award":["2020-ZJ-913"],"award-info":[{"award-number":["2020-ZJ-913"]}]},{"name":"Qinghai Science and Technology Plan Project","award":["bdsys2021003"],"award-info":[{"award-number":["bdsys2021003"]}]},{"name":"Anhui Beidou Precision Agriculture Information Engineering Laboratory Open Fund","award":["2020-QY-213"],"award-info":[{"award-number":["2020-QY-213"]}]},{"name":"Anhui Beidou Precision Agriculture Information Engineering Laboratory Open Fund","award":["2020-ZJ-913"],"award-info":[{"award-number":["2020-ZJ-913"]}]},{"name":"Anhui Beidou Precision Agriculture Information Engineering Laboratory Open Fund","award":["bdsys2021003"],"award-info":[{"award-number":["bdsys2021003"]}]},{"name":"Special fund for Anhui modern agricultural industrial technology system","award":["2020-QY-213"],"award-info":[{"award-number":["2020-QY-213"]}]},{"name":"Special fund for Anhui modern agricultural industrial technology system","award":["2020-ZJ-913"],"award-info":[{"award-number":["2020-ZJ-913"]}]},{"name":"Special fund for Anhui modern agricultural industrial technology system","award":["bdsys2021003"],"award-info":[{"award-number":["bdsys2021003"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>The advancement of society and technology has promoted the development of modern agriculture. It has become a trend to replace traditional manpower with intelligent agricultural machinery that operates independently. As the core technology of intelligent agricultural machinery, complete coverage path planning technology has become more important. At present, the complete coverage path planning algorithms still suffer from problems such as sacrificing the coverage rate to obtain the minimum energy consumption, taking a long time to calculate the algorithm, and destroying crops across the covered region. In view of the above problems, an improved complete coverage path planning algorithms based on backtracking is proposed combined with the actual needs of intelligent agricultural machinery for planting seedlings to improve four aspects: repeated coverage, search efficiency, path planning, and sub-regional crossing. Firstly, the Morse decomposition method is used to divide a complex farmland region into simple sub-regions. Then an improved backtracking method based on a greedy algorithm is proposed in order to reduce the computational efficiency of the current region connection algorithms. The priority principle and the strategy of moving along the boundary are used to solve the problems of region crossing and sacrificing the coverage rate, thereby improving the performance of the current complete coverage path planning method. Compared with the traditional backtracking method, the experimental results show that the number of backtracking points is decreased by about 70% and the occurrence of crossing sub-regions has been significantly reduced. This proposed method can improve the coverage and operating efficiency of intelligent agricultural machinery operations and provide technical support for agricultural operations such as sowing, tillage, and harvesting, thus improving the quality and efficiency of agricultural production.<\/jats:p>","DOI":"10.3390\/info13070313","type":"journal-article","created":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T22:31:14Z","timestamp":1656369074000},"page":"313","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["An Improved Complete Coverage Path Planning Method for Intelligent Agricultural Machinery Based on Backtracking Method"],"prefix":"10.3390","volume":"13","author":[{"given":"Yonglian","family":"Han","sequence":"first","affiliation":[{"name":"Qinghai Institute of Science and Technology Information, Xining 810008, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Shao","sequence":"additional","affiliation":[{"name":"School of Information and Computers, Anhui Agricultural University, Hefei 230031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunzhi","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Information and Computers, Anhui Agricultural University, Hefei 230031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3134-9294","authenticated-orcid":false,"given":"Xiaoming","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Physical Science and Information Technology, Anhui University, Hefei 230031, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"key":"ref_1","first-page":"1","article-title":"Analysis on Status and Development Trend of Intelligent Control Technology for Agricultural Equipment","volume":"51","author":"Liu","year":"2020","journal-title":"Trans. Chin. Soc. Agric. Mach."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Le, A.V., Ku, P.C., Than, T.T., Huu, K.N.N., Shi, Y., and Mohan, R.E. (2019). Realization Energy Optimization of Complete Path Planning in Differential Drive Based Self-Reconfigurable Floor Cleaning Robot. Energies, 12.","DOI":"10.3390\/en12061136"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1017\/S2040470017000371","article-title":"Design of smart agriculture Japan model","volume":"8","author":"Morimoto","year":"2017","journal-title":"Adv. Anim. Biosci."},{"key":"ref_4","first-page":"1","article-title":"Development and prospect of key technologies on agricultural tractor","volume":"4","author":"Xie","year":"2018","journal-title":"Trans. Chin. Soc. Agric. Mach."},{"key":"ref_5","first-page":"1","article-title":"Development Situation and Prospects of Intelligent Design for Agricultural Machinery","volume":"50","author":"Du","year":"2019","journal-title":"Trans. Chin. Soc. Agric. Mach."},{"key":"ref_6","first-page":"1","article-title":"Research Progress of Agricultural Machinery Navigation Technology","volume":"51","author":"Zhang","year":"2020","journal-title":"Trans. Chin. Soc. Agric. Mach."},{"key":"ref_7","first-page":"1","article-title":"Research on intelligent agricultural machinery control platform based on multi-discipline technology integration","volume":"33","author":"Dong","year":"2017","journal-title":"Trans. Chin. Soc. Agric. Eng."},{"key":"ref_8","first-page":"1","article-title":"Review on Coverage Path Planning Algorithm for Intelligent Machinery","volume":"24","author":"Xu","year":"2016","journal-title":"Comput. Meas. Control"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Ma, Y.F., Sun, H., Ye, P., and Li, C. (2018, January 10\u201312). Mobile robot multi-resolution full coverage path planning algorithm. Proceedings of the 2018 5th International Conference on Systems and Informatics (ICSAI), Nanjing, China.","DOI":"10.1109\/ICSAI.2018.8599478"},{"key":"ref_10","first-page":"375","article-title":"Global Path Planning Algorithm of Multi-Bug","volume":"51","author":"Peng","year":"2020","journal-title":"Trans. Chin. Soc. Agric. Mach."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1002\/rob.20300","article-title":"Coverage path planning algorithms for agricultural field machines","volume":"26","author":"Oksanen","year":"2009","journal-title":"J. Field Robot."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"916","DOI":"10.4028\/www.scientific.net\/AMM.602-605.916","article-title":"Application of Improved Back Propagation Neural Network in Mowing Robot\u2019s Path Planning","volume":"602","author":"Deng","year":"2014","journal-title":"Appl. Mech. Mater."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s11370-017-0223-z","article-title":"Online complete coverage path planning using two-way proximity search","volume":"10","author":"Khan","year":"2017","journal-title":"Intell. Serv. Robot."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1049\/trit.2018.0009","article-title":"Sensor-based complete coverage path planning in dynamic environment for cleaning robot","volume":"3","author":"Hong","year":"2018","journal-title":"CAAI Trans. Intell. Technol."},{"key":"ref_15","unstructured":"Xu, B. (2017). Research on Route Planning for Plant Protection Unmanned Aerial Vehicles. [Ph.D. Thesis, China Agricultural University]."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Wang, J., Chen, J., Cheng, S., Cheng, S., and Xie, Y. (2016, January 16\u201319). Double Heuristic Optimization Based on Hierarchical Partitioning for Coverage Path Planning of Robot Mowers. Proceedings of the International Conference on Computational Intelligence and Security, Wuxi, China.","DOI":"10.1109\/CIS.2016.0051"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1007\/s10015-018-0481-7","article-title":"Robot sweep path planning with weak field constrains under large motion disturbance","volume":"23","author":"Nakamura","year":"2018","journal-title":"Artif. Life Robot."},{"key":"ref_18","first-page":"304","article-title":"Complete-coverage path planning algorithm of mobile robot based on belief function","volume":"13","author":"Cao","year":"2018","journal-title":"CAAI Trans. Intell. Syst."},{"key":"ref_19","first-page":"32","article-title":"Study on a complete coverage path planning method for indoor cleaning robots","volume":"37","author":"Jian","year":"2018","journal-title":"Transducer Microsyst. Technol."},{"key":"ref_20","first-page":"673","article-title":"Research on static path planning method of small obstacles for automatic navigation of agricultural machinery","volume":"51","author":"Liu","year":"2018","journal-title":"IFAC Pap."},{"key":"ref_21","first-page":"1227","article-title":"A complete coverage path planning algorithm based on backtracking method","volume":"41","author":"Li","year":"2019","journal-title":"Comput. Eng. Sci."},{"key":"ref_22","first-page":"945","article-title":"Coverage path planning method for service robot based on efficient template algorithm and dynamic window approach","volume":"30","author":"Chen","year":"2020","journal-title":"Chin. High Technol. Lett."},{"key":"ref_23","unstructured":"Wang, Y. (2020). Complete Coverage Path Planning of Mobile Robot for Abandoned Mine Land. [Master\u2019s Thesis, China University of Mining and Technology]."},{"key":"ref_24","first-page":"1200","article-title":"Complete coverage path planning of mobile robot on abandoned mine land","volume":"42","author":"Zhou","year":"2020","journal-title":"Chin. J. Eng."},{"key":"ref_25","first-page":"2166","article-title":"Robot Path Planning Based on Double-Layer Ant Colony Optimization Algorithm and Dynamic Environment","volume":"47","author":"Xu","year":"2019","journal-title":"Acta Electron. Sin."},{"key":"ref_26","first-page":"1","article-title":"Survey on Technology of Mobile Robot Path Planning","volume":"27","author":"Song","year":"2019","journal-title":"Comput. Meas. Control"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"2049","DOI":"10.1109\/TVT.2017.2706308","article-title":"Mobile Edge Computing via a UAV-Mounted Cloudlet: Optimization of Bit Allocation and Path Planning","volume":"67","author":"Jeong","year":"2017","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Samaniego, F., Sanchis, J., Garc\u00eda, N.S., and Simarro, R. (2019). Recursive Rewarding Modified Adaptive Cell Decomposition (RR-MACD): A Dynamic Path Planning Algorithm for UAVs. Electronics, 8.","DOI":"10.3390\/electronics8030306"},{"key":"ref_29","first-page":"621","article-title":"Sensor-Based Incremental Boustrophedon Decomposition for Coverage Path Planning of a Mobile Robot","volume":"12","author":"Janchiv","year":"2013","journal-title":"Intell. Syst. Comput."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1427","DOI":"10.1007\/s10884-018-9648-0","article-title":"The Selgrade Decomposition for Linear Semiflows on Banach Spaces","volume":"31","author":"Blumenthal","year":"2019","journal-title":"J. Dyn. Differ. Equ."},{"key":"ref_31","unstructured":"Zhang, H.T., and Ji, M. (2018). Research on Coordinate Transformation from Local Plane Coordinate System to CGCS2000 Based on Plane Four Parameter Model. Bull. Surv. Mapp., 74\u201377."},{"key":"ref_32","first-page":"219","article-title":"Research of the Coordinate Conversion between WGS84 and CGCS2000","volume":"35","author":"Peng","year":"2015","journal-title":"J. Geod. Geodyn."},{"key":"ref_33","first-page":"697","article-title":"Comparison of Calculation Methods of Several Coordinate Transformation","volume":"35","author":"Gong","year":"2015","journal-title":"J. Geod. Geodyn."},{"key":"ref_34","first-page":"162","article-title":"2D Coordinate Transformations with Improved Total Least Square Method","volume":"36","author":"Deng","year":"2016","journal-title":"J. Geod. Geodyn."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/7\/313\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:38:56Z","timestamp":1760139536000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/13\/7\/313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,27]]},"references-count":34,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["info13070313"],"URL":"https:\/\/doi.org\/10.3390\/info13070313","relation":{},"ISSN":["2078-2489"],"issn-type":[{"value":"2078-2489","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6,27]]}}}