某类任务的无人作战飞机航路规划

Path Planning of UCAV for a Kind of Mission

讨论了对于包含了既是威胁又有价值的节点的任务模型,无人作战飞机航路规划问题解决的思路和关键环节,并构建了数学模型,然后应用A*启发算法求解各个目标点的最优航路,并依据作战指挥人员对作战方案的总体把握给出的权衡因子,计算每个目标点取得的费效比,确定满足一定条件下最先攻击目标。实例仿真表明该方法可以有效地解决这类任务的航路规划问题。

For a kind of mission model including some targets integrated threatens with attack value, how UCAV plans it path？ Firstly the idea and key points were discussed and mathematics model was constructed in this paper. Secondly A ＊ arithmetic was applied to calculate the best path planning of every target. Thirdly ratio of cost-efficiency of every target was calculated accounting as the two factors of weigh given by campaign commander after thinking of the project as a whole and the first target which satisfied some conditions was found. At last an example was emulated and the result indicated that this way can deal with path planning of UCAV on this mission.