基于优化A*算法的越野最短路径规划研究  

Research on Cross Country Shortest Path Planning Based on Optimized A* Algorithm

作　　者：范林林 邱德楠 曹震 华一新[2] FAN Linlin;QIU Denan;CAO Zhen;HUA Yixin(61175 Troops,Nanjing 210049,China;Information Engineering University,Zhengzhou 450052,China)

机构地区：[1]61175部队,江苏南京210049 [2]信息工程大学,河南郑州450001

出　　处：《地理空间信息》2022年第6期71-73,105,共4页Geospatial Information

基　　金：2020—2021年度军内自立科研项目。

摘　　要：综合考虑了地形要素和地貌对越野车辆机动的影响,并基于此,提出一种启发式A*算法的优化方案。首先将复杂的地形环境进行地形量化表达,然后通过对A*算法的估价函数进行优化,探讨在起点和终点确定前提下的时间最短路径规划问题。通过理论分析和实验结果表明,该算法在越野路径规划问题求解上具有可行性和准确性。研究结果可为相关工作提供参考。This paper proposed a heuristic A* algorithm based on comprehensive consideration of the influence of terrain elements and topography on off-road vehicle mobility. Firstly, the complex terrain environment was expressed quantitatively, and then the shortest time path planning problem was discussed under the premise of determining the starting point and end point by optimizing A* algorithm evaluation function. Theoretical analysis and experimental results show that the algorithm is feasible and accurate for solving cross-country path planning problems.

关 键 词：A*算法 越野最短路径规划 六角格网 履带式车辆 

分 类 号：P208[天文地球—地图制图学与地理信息工程]