摘要
针对标准启发式A*搜索算法所存在的规划速度慢以及受限于二维空间问题,提出了一种基于A*的快速三维航迹规划算法.该方法以基本A*算法为理论基础,并将约束条件结合在搜索算法中,在三维规划空间中将地形高度信息通过所确立的高度代价转换函数简化计算并达到快速规划要求.算法分析和实验表明,该方法能在三维环境空间中快速规划出所需航迹以满足任务需求.
In order to solve the problem that the standard-heuristic A ＊ search algorithm is so slow and only used in the two-dimensional space.We proposed a 3D route planning algorithm based on the A ＊ algorithm.The theoretical basis of the this algorithm is basic A ＊ algorithm,and the constraint conditions is included by the search algorithm.For the purpose of simplifying the calculation and achieving rapid planning requirements,plan the height information by building the height-cost conversion functions in the three-dimensional space.The algorithm＇s analysis and the result of the experiments show that this method can plan the route fast in the three-dimensional space to meet the demands of the task.
出处
《辽宁大学学报（自然科学版）》
CAS
2012年第4期295-299,共5页
Journal of Liaoning University：Natural Sciences Edition
基金
国家自然科学基金(61170185)
沈阳市人才项目"大规模网络游戏中玩家行为可信问题的研究"(Syrc201002)
中国航空工业第一集团公司航空科学基金大规模分布式协同空战仿真系统的研究"(2008ZC54008)
