Nianyin Zeng

All articles published by MDPI are made immediately available worldwide under an open access license. No special permission is required to reuse all or part of the article published by MDPI, including figures and tables. For articles published under an open access Creative Common CC BY license, any part of the article may be reused without permission provided that the original article is clearly cited. For more information, please refer to https://www.mdpi.com/openaccess.

Open AccessArticle by Yang Lu 1,*, Xianpeng Tao 1, Nianyin Zeng 2, Jiaojiao Du 1 and Rou Shang 3 1 College of Information and Electrical Engineering, Heilongjiang Bayi Agricultural University, Daqing 163319, China 2 Department of Instrumental and Electrical Engineering, Xiamen University, Xiamen 361005, China 3 College of Electrical Engineering and Information, Northeast Petroleum University, Daqing 163318, China * Author to whom correspondence should be addressed. Remote Sens.

Abstract : In terms of mobile robot path planning, the traditional A* algorithm has the following problems: a long searching time, an excessive number of redundant nodes, and too many path-turning points. As a result, the shortest path obtained from planning may not be the optimal movement route of actual robots, and it will accelerate the hardware loss of robots.