期刊名称：IOP Conference Series: Earth and Environmental Science
印刷版ISSN：1755-1307
电子版ISSN：1755-1315
出版年度：2018
卷号：170
期号：4
页码：042110
DOI：10.1088/1755-1315/170/4/042110
语种：English
出版社：IOP Publishing
摘要：A* algorithm is a simple, scalable, and high reliable algorithm in the path planning algorithm. For the problem that service robots have high real-time characteristic and have short calculating time for algorithm, the A* algorithm is applied to the local path planning of service robots. To further improve the response speed of the algorithm, A* algorithm is improved by adjusting selection mechanism of the open update node choice and introducing the weight of Heuristics. The simulation and experimental results show that this new method has good planning performance. Adopting this new method can significantly reduce the searching time of algorithm and meet the high real-time need of service robots.
