摘要
根据巡航导弹实时航迹规划时效性强、弹载计算设备的运算速度和内存容量有限等特点,将巡航导弹的机动性能约束与规划空间的划分结合起来,构造了一个较小的搜索空间,然后在此缩小了的搜索空间内利用A*算法具有的启发式特点,可在有效时间内搜索到满足要求的可行航迹.最后,通过一个例子对A*算法进行了验证.
According to the strict time-efficiency of real-time route planning for cruise missile and the finitude of the operation speed and memory capability of the computer on a cruise missile, this paper analyzes the maneuverability restriction of the cruise missile and the partition of planning space, constructs a lesser searching space, and then by using A* algorithm in the lesser searching space, the feasible route can be obtained to meet the requirement in the availability time. Finally, an example is used to check A* algorithm.
出处
《海军工程大学学报》
CAS
北大核心
2006年第5期79-82,共4页
Journal of Naval University of Engineering
关键词
巡航导弹
实时航迹规划方法
A*算法
规划空间
cruise missile
real-time route planning approach
A* algorithm
planning space