【24h】

A Rapid Computer Algorithm for the HAEUAV Route Planning

机译:一种快速的海奥瓦路线规划算法

获取原文

摘要

HAEUAV scout at the altitude of 20,000 meters and a key technique is to plan a route under the limitation of scheduled mission, distributed threats, mobile feature of the UAV itself, and the total fuel in the planning space in limited interval. A computer algorithm was proposed to find the route under some assumptions. The algorithm worked as: group the threats according their position relationship and then queue the groups according to their threat area. Shift the line between the local point and the destination point to bypass the first group, and then the second group till the last threat group is bypassed. Then the curve is the aviation route. Several simulation cases were introduced to prove the algorithm is feasible and effective.
机译:海奥瓦侦察在海拔了20,000米和一个关键技术是在计划的任务,分布式威胁,无人机本身的移动特征的限制下规划一条路线,以及在有限的间隔中规划空间中的总燃料。提出了一种计算机算法在某些假设下找到该路线。该算法的工作原理为:根据其位置关系进行威胁,然后根据其威胁区域划分组。将局部点与目标点之间的线路绕过第一个组,然后将第二组绕过最后一个威胁组。然后曲线是航道。引入了几种模拟案例以证明算法是可行的和有效的算法。

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号