首页> 外文会议>AIAA modeling and simulation technologies conference;AIAA aviation forum >Multi-UAVs Target Assignment Using Opposition-based Genetic Algorithm with Multiple Mutation Operators
【24h】

Multi-UAVs Target Assignment Using Opposition-based Genetic Algorithm with Multiple Mutation Operators

机译:使用带有多个变异算子的基于对立遗传算法的多无人机目标分配

获取原文

摘要

The article presents a novel heterogeneous target assignment method for multiple curvature-constrained UAV. The heterogeneous targets involve two kinds of search direction constraints, namely, a predefined seasrch direction and free search direction. The number of UAVs' kinematic constraints represented by Dubins vehicles are the same. In this work, maximization of the entire surveillance effectiveness is chosen as the objective of the target assignment problem, and the search benefit of each target is affected by the target value and the corresponding time of arrival. The problem could be formulated as a modified Dubins multiple travelling salesman problem with search constraints. To solve this challenging problem, the tailored genetic algorithm (GA) incorporated with the opposition-based learning technique and multiple mutation operators are proposed, denoted as OGA-MMO. By introducing the opposition-based learning technique into the evolutionary process, the global search capability is enhanced. Meanwhile, multiple mutation operators are developed to increase the probability of producing excellent genes. Besides, the double coding chromosomes are introduced to clearly describe the multi-UAVs target assignment problem, which can also make the decoding more easily. Finally, OGA-MMO is compared with regular GA on several multi-UAVs target assignment simulations. The comparison results show that the proposed method is more efficient and stronger in escaping from the local optimum in solving the multi-UAVs target assignment.
机译:本文提出了一种新的异构目标分配方法,用于多曲率约束的无人机。异构目标涉及两种搜索方向约束,即预定义的搜索方向和自由搜索方向。以杜宾斯飞行器为代表的无人机运动学约束的数量是相同的。在这项工作中,将整体监视效果的最大化作为目标分配问题的目标,并且每个目标的搜索利益都会受到目标值和相应到达时间的影响。可以将该问题表述为具有搜索约束的经过修改的Dubins多旅行商问题。为了解决这个挑战性问题,提出了结合基于对立的学习技术和多个变异算子的量身定制的遗传算法(GA),称为OGA-MMO。通过将基于对立的学习技术引入进化过程,可以增强全局搜索能力。同时,开发了多种突变算子以增加产生优良基因的可能性。此外,引入了双编码染色体以清楚地描述多无人机目标分配问题,这也使得解码更加容易。最后,将OGA-MMO与常规GA在多个多无人机目标分配模拟中进行了比较。比较结果表明,所提出的方法在解决多无人机目标分配问题上,能够更好地逃避局部最优。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号