Due to the advantages of low cost, intelligence, and strong adaptability, Unmanned Aerial Vehicle (UAV) technology has developed rapidly. The development of heterogeneous UAV strategies with high autonomous capabilities has become the main development direction of UAVs. Heterogeneous UAVs have performance differences and asymmetric combat problems where the performance of a single unit is inferior to that of the opponent. It is necessary to cooperate appropriately to improve the performance of the UAV swarm. This paper proposes a conflict search-based strategy for heterogeneous UAV pursuit, which combines a double-layer selection matrix and a time window to plan occupancy based on known enemy information, and uses extended search and conflict resolution to screen feasible solutions in the double-layer matrix. Experimental results show that compared with particle swarm optimization and adaptive target prediction, the success rate of the algorithm is improved by 40.3% and 16%, respectively.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Pursuit Strategy of Heterogeneous UAVs Based on Conflict-Based Search

  • Ziqi Yang,
  • Yujia Guan,
  • Hongli Xu,
  • Jingyu Ru,
  • Cong Guan

摘要

Due to the advantages of low cost, intelligence, and strong adaptability, Unmanned Aerial Vehicle (UAV) technology has developed rapidly. The development of heterogeneous UAV strategies with high autonomous capabilities has become the main development direction of UAVs. Heterogeneous UAVs have performance differences and asymmetric combat problems where the performance of a single unit is inferior to that of the opponent. It is necessary to cooperate appropriately to improve the performance of the UAV swarm. This paper proposes a conflict search-based strategy for heterogeneous UAV pursuit, which combines a double-layer selection matrix and a time window to plan occupancy based on known enemy information, and uses extended search and conflict resolution to screen feasible solutions in the double-layer matrix. Experimental results show that compared with particle swarm optimization and adaptive target prediction, the success rate of the algorithm is improved by 40.3% and 16%, respectively.