{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T19:27:24Z","timestamp":1775503644935,"version":"3.50.1"},"reference-count":49,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T00:00:00Z","timestamp":1676851200000},"content-version":"vor","delay-in-days":0,"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":["41871310"],"award-info":[{"award-number":["41871310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["N2124005"],"award-info":[{"award-number":["N2124005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["N2001020"],"award-info":[{"award-number":["N2001020"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Fundamental Research Funds for the Central Universities","award":["41871310"],"award-info":[{"award-number":["41871310"]}]},{"name":"Fundamental Research Funds for the Central Universities","award":["N2124005"],"award-info":[{"award-number":["N2124005"]}]},{"name":"Fundamental Research Funds for the Central Universities","award":["N2001020"],"award-info":[{"award-number":["N2001020"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IJGI"],"abstract":"<jats:p>Path planning is widely used in many domains, and it is crucial for the advancement of map navigation, autonomous driving, and robot path planning. However, existing path planning methods have certain limitations for complex field scenes with undulating terrain and diverse landcover types. This paper presents an energy-efficient 3D path planning algorithm based on an improved A* algorithm and the particle swarm algorithm in complex field scenes. The evaluation function of the A* algorithm was improved to be suitable for complex field scenes. The slope parameter and friction coefficient were respectively used in the evaluation function to represent different terrain features and landcover types. The selection of expanding nodes in the algorithm depends not only on the minimum distance but also on the minimum consumption cost. Furthermore, the turning radius factor and slope threshold factor of vehicles were added to the definition of impassable points in the improved A* algorithm, so that the accessibility of path planning could be guaranteed by excluding some bends and steep slopes. To meet the requirements for multi-target path planning, the improved A* algorithm was used as the fitness function of the particle swarm algorithm to solve the traveling salesman problem. The experimental results showed that the proposed algorithm is capable of multi-target path planning in complex field scenes. Furthermore, the path planned by this algorithm is more passable and more energy efficient. In this experimental environment model, the average energy-saving efficiency of the path planned by the improved algorithm is 14.7% compared to the traditional A* algorithm. This would be beneficial to the development of ecotourism and geological exploration.<\/jats:p>","DOI":"10.3390\/ijgi12020082","type":"journal-article","created":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T02:30:35Z","timestamp":1676946635000},"page":"82","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Energy-Efficient 3D Path Planning for Complex Field Scenes Using the Digital Model with Landcover and Terrain"],"prefix":"10.3390","volume":"12","author":[{"given":"Baodong","family":"Ma","sequence":"first","affiliation":[{"name":"Institute for Geoinformatics & Digital Mine Research, Northeastern University, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quan","family":"Liu","sequence":"additional","affiliation":[{"name":"Institute for Geoinformatics & Digital Mine Research, Northeastern University, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziwei","family":"Jiang","sequence":"additional","affiliation":[{"name":"Institute for Geoinformatics & Digital Mine Research, Northeastern University, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Defu","family":"Che","sequence":"additional","affiliation":[{"name":"Institute for Geoinformatics & Digital Mine Research, Northeastern University, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kehan","family":"Qiu","sequence":"additional","affiliation":[{"name":"Institute for Geoinformatics & Digital Mine Research, Northeastern University, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangxiang","family":"Shang","sequence":"additional","affiliation":[{"name":"Institute for Geoinformatics & Digital Mine Research, Northeastern University, Shenyang 110819, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,2,20]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"1407","DOI":"10.1080\/00207721.2014.929191","article-title":"UAV path planning using artificial potential field updated by optimal control theory","volume":"47","author":"Chen","year":"2016","journal-title":"Int. J. Syst. Sci."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"6523158","DOI":"10.1155\/2020\/6523158","article-title":"Improved Artificial Potential Field Method Applied for AUV Path Planning","volume":"2020","author":"Fan","year":"2020","journal-title":"Math. Probl. Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10846-012-9776-4","article-title":"A Probabilistically Robust Path Planning Algorithm for UAVs Using Rapidly-Exploring Random Trees","volume":"71","author":"Kothari","year":"2013","journal-title":"J. Intell. Robot. Syst."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.robot.2015.02.007","article-title":"Intelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments","volume":"68","author":"Qureshi","year":"2015","journal-title":"Robot. Auton. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"121","DOI":"10.3233\/ICA-190616","article-title":"A membrane parallel rapidly-exploring random tree algorithm for robotic motion planning","volume":"27","author":"Zhang","year":"2020","journal-title":"Integr. Comput. Aided Eng."},{"key":"ref_6","first-page":"59","article-title":"Path planning with modified A star algorithm for a mobile robot","volume":"96","author":"Duchon","year":"2014","journal-title":"Model. Mech. Mechatron. Syst."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Wang, C.B., Wang, L., Qin, J., Wu, Z.Z., and Duan, L.H. (2015, January 8\u201310). Path Planning of Automated Guided Vehicles Based on Improved A-Star. Proceedings of the CT IEEE International Conference on Information and Automation, Lijiang, China.","DOI":"10.1109\/ICInfA.2015.7279630"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/j.neucom.2014.09.092","article-title":"A hierarchical path planning approach based on A* and least-squares policy iteration for mobile robots","volume":"170","author":"Zuo","year":"2015","journal-title":"Neurocomputing"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"8091","DOI":"10.1007\/s11042-020-10139-6","article-title":"A review on genetic algorithm: Past, present, and future","volume":"80","author":"Katoch","year":"2021","journal-title":"Multimed. Tools Appl."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1016\/j.compeleceng.2012.06.016","article-title":"Dynamic path planning of mobile robots with improved genetic algorithm","volume":"38","author":"Tuncer","year":"2012","journal-title":"Comput. Electr. Eng."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.robot.2016.12.008","article-title":"Optimal path planning and execution for mobile robots using genetic algorithm and adaptive fuzzy-logic control","volume":"89","author":"Bakdi","year":"2017","journal-title":"Robot. Auton. Syst."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","article-title":"Ant system: Optimization by a colony of cooperating agents","volume":"26","author":"Dorigo","year":"1996","journal-title":"IEEE Trans. Syst. Man Cybern. Part B-Cybern."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","article-title":"Ant colony optimization\u2014Artificial ants as a computational intelligence technique","volume":"1","author":"Dorigo","year":"2006","journal-title":"IEEE Comput. Intell. Mag."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.ipl.2007.03.010","article-title":"Particle swarm optimization-based algorithms for TSP and generalized TSP","volume":"103","author":"Shi","year":"2007","journal-title":"Inf. Process. Lett."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.swevo.2018.12.009","article-title":"Particle swarm optimization based on dimensional learning strategy","volume":"45","author":"Xu","year":"2019","journal-title":"Swarm Evol. Comput."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/j.ins.2022.01.075","article-title":"Three-learning strategy particle swarm algorithm for global optimization problems","volume":"593","author":"Zhang","year":"2022","journal-title":"Inf. Sci."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.3389\/fnbot.2020.00063","article-title":"The Path Planning of Mobile Robot by Neural Networks and Hierarchical Reinforcement Learning","volume":"14","author":"Yu","year":"2020","journal-title":"Front. Neurorobotics"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1729881418784221","DOI":"10.1177\/1729881418784221","article-title":"Path planning for mobile robot based on modified rapidly exploring random tree method and neural network","volume":"15","author":"Zhang","year":"2018","journal-title":"Int. J. Adv. Robot. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/s10845-021-01867-z","article-title":"A review of motion planning algorithms for intelligent robots","volume":"33","author":"Zhou","year":"2022","journal-title":"J. Intell. Manuf."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Lin, S.W., Liu, A., Wang, J.G., and Kong, X.Y. (2022). A Review of Path-Planning Approaches for Multiple Mobile Robots. Machines, 10.","DOI":"10.3390\/machines10090773"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"2277","DOI":"10.1109\/TCYB.2015.2475174","article-title":"Genetic Learning Particle Swarm Optimization","volume":"46","author":"Gong","year":"2016","journal-title":"IEEE Trans. Cybern."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.swevo.2011.02.002","article-title":"A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms","volume":"1","author":"Derrac","year":"2011","journal-title":"Swarm Evol. Comput."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/EVCO_r_00180","article-title":"Particle Swarm Optimization for Single Objective Continuous Space Problems: A Review","volume":"25","author":"Bonyadi","year":"2017","journal-title":"Evol. Comput."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","article-title":"Harris hawks optimization: Algorithm and applications","volume":"97","author":"Heidari","year":"2019","journal-title":"Future Gener. Comput. Syst. Int. J. Escience"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1109\/TEVC.2004.826067","article-title":"Handling multiple objectives with particle swarm optimization","volume":"8","author":"Coello","year":"2004","journal-title":"IEEE Trans. Evol. Comput."},{"key":"ref_26","first-page":"979","article-title":"An Improved Real Hybrid Genetic Algorithm","volume":"21","author":"Ji","year":"2014","journal-title":"Teh. Vjesn. Tech. Gaz."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"1362","DOI":"10.1109\/TSMCB.2009.2015956","article-title":"Adaptive Particle Swarm Optimization","volume":"39","author":"Zhan","year":"2009","journal-title":"IEEE Trans. Syst. Man Cybernetics. Part B Cybern."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1177\/0278364911406761","article-title":"Sampling-based algorithms for optimal motion planning","volume":"30","author":"Karaman","year":"2011","journal-title":"Int. J. Robot. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"10","DOI":"10.5772\/59763","article-title":"Triangular Geometrized Sampling Heuristics for Fast Optimal Motion Planning","volume":"12","author":"Qureshi","year":"2015","journal-title":"Int. J. Adv. Robot. Syst."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Wu, Z.P., Meng, Z.J., Zhao, W.L., and Wu, Z. (2021). Fast-RRT: A RRT-Based Optimal Path Finding Method. Appl. Sci., 11.","DOI":"10.3390\/app112411777"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"59196","DOI":"10.1109\/ACCESS.2021.3070054","article-title":"Geometric A-Star Algorithm: An Improved A-Star Algorithm for AGV Path Planning in a Port Environment","volume":"9","author":"Tang","year":"2021","journal-title":"IEEE Access"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1729881420962263","DOI":"10.1177\/1729881420962263","article-title":"An improved A-Star based path planning algorithm for autonomous land vehicles","volume":"17","author":"Shang","year":"2020","journal-title":"Int. J. Adv. Robot. Syst."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"17298814211042730","DOI":"10.1177\/17298814211042730","article-title":"Autonomous land vehicle path planning algorithm based on improved heuristic function of A-Star","volume":"18","author":"Zhang","year":"2021","journal-title":"Int. J. Adv. Robot. Syst."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"20281","DOI":"10.1109\/ACCESS.2019.2897580","article-title":"An Improved Ant Colony Optimization Algorithm Based on Hybrid Strategies for Scheduling Problem","volume":"7","author":"Deng","year":"2019","journal-title":"IEEE Access"},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.asoc.2014.09.031","article-title":"A comparative study of the improvement of performance using a PSO modified by ACO applied to TSP","volume":"25","author":"Elloumi","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Ab Wahab, M.N., Nefti-Meziani, S., and Atyabi, A. (2015). A Comprehensive Review of Swarm Optimization Algorithms. PLoS ONE, 10.","DOI":"10.1371\/journal.pone.0122827"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.aei.2005.01.004","article-title":"Comparison among five evolutionary-based optimization algorithms","volume":"19","author":"Emad","year":"2005","journal-title":"Adv. Eng. Inform."},{"key":"ref_38","first-page":"46","article-title":"Coupling Mechanism of URTT Composite System in Yunnan Province Based on Structural Equation Model","volume":"39","author":"Ji","year":"2019","journal-title":"Econ. Geogr."},{"key":"ref_39","unstructured":"Xu, L., Shao, D., Wu, X., and Niu, T. (2021). Study on deformation and strain characteristics of Yunnan area based on least square configuration. Sci. Surv. Mapp., 46."},{"key":"ref_40","first-page":"5","article-title":"Land Use Classification of High Resolution Remote Sensing Image Based on Texture Feature","volume":"27","author":"Hu","year":"2011","journal-title":"Geogr. Geogr. Inf. Sci."},{"key":"ref_41","unstructured":"Xia, Q., Tang, Q., and Zhang, L. (2018). Quasi three dimensional robot path planning of the improved ant colony algorithm. Mod. Manuf. Eng., 4."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"21","DOI":"10.3901\/JME.2020.23.021","article-title":"Environmental Characterization and Path Planning for Legged Robots Considering Foot-terrain Interaction","volume":"56","author":"Xu","year":"2020","journal-title":"J. Mech. Eng."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.apor.2018.12.001","article-title":"Smoothed A* algorithm for practical unmanned surface vehicle path planning","volume":"83","author":"Song","year":"2019","journal-title":"Appl. Ocean. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.robot.2018.04.007","article-title":"An improved A* algorithm for the industrial robot path planning with high success rate and short length","volume":"106","author":"Bing","year":"2018","journal-title":"Robot. Auton. Syst."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","article-title":"A Formal Basis for the Heuristic Determination of Minimum Cost Paths","volume":"4","author":"Hart","year":"2007","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"ref_46","unstructured":"Beijing University of Civil Engineering and Architecture (2015). Garage Building Design Code JGJ100-2015, China Architecture and Building Press."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"961","DOI":"10.1080\/00423114.2012.659740","article-title":"Robust estimation of road friction coefficient using lateral and longitudinal vehicle dynamics","volume":"50","author":"Ahn","year":"2012","journal-title":"Veh. Syst. Dyn."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.asoc.2017.12.031","article-title":"A comparative study of improved GA and PSO in solving multiple traveling salesmen problem","volume":"64","author":"Hou","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/j.asoc.2015.01.068","article-title":"A new hybrid method based on Particle Swarm Optimization, Ant Colony Optimization and 3-Opt algorithms for Traveling Salesman Problem","volume":"30","author":"Mahi","year":"2015","journal-title":"Appl. Soft Comput."}],"container-title":["ISPRS International Journal of Geo-Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/2\/82\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:37:35Z","timestamp":1760121455000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2220-9964\/12\/2\/82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,20]]},"references-count":49,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,2]]}},"alternative-id":["ijgi12020082"],"URL":"https:\/\/doi.org\/10.3390\/ijgi12020082","relation":{},"ISSN":["2220-9964"],"issn-type":[{"value":"2220-9964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,20]]}}}