【24h】

Multi-target oriented UAV reconnaissance path planning algorithm

机译:多目标导向UAV侦察路径规划算法

获取原文

摘要

Aiming at the problem of path planning when unmanned aerial vehicle (UAV) reconnoitre multiple targets, a UAV path planning algorithm for multi-target reconnaissance is proposed. Firstly, the optimal k-means clustering algorithm is used to cluster a plurality of closely related targets into one target, which reduces the scale of the problem. Then, in order to reduce the path cost of the algorithm, the coding method and crossover operation of the genetic algorithm (GA) are optimized to solve the reconnaissance sequence under the minimum path cost. Finally, the reconnaissance path is generated based on the reconnaissance sequence. The simulation results show that the algorithm can effectively reduce the path cost by 17.5%.
机译:针对路径规划问题,当无人空中车辆(UAV)重新编号多目标时,提出了一种多目标侦察的UAV路径规划算法。首先,最佳k-means聚类算法用于将多个与一个紧密相关的目标聚集成一个目标,这减少了问题的比例。然后,为了降低算法的路径成本,优化遗传算法(GA)的编码方法和交叉操作以在最小路径成本下解决侦察序列。最后,基于突变序列生成侦察路径。仿真结果表明,该算法可以有效地将路径成本降低17.5%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号