Scholarlink

In modern warfare, decoy targets are often set up to interfere with enemy reconnaissance and operations. To avoid being disrupted by decoys during combat, it is necessary to consider the implementation of robust combat strategies. In this paper, we consider the problem of collaborative target assignment for unmanned aerial vehicle (UAV) swarms with decoy targets. We model it as a deletion-robust submodular maximization problem, and develop a two-stage algorithm that attains a \(1/(4+1/\beta )\) -approximation guarantee, where \(\beta \le 1\) is the approximation ratio for the unconstrained submodular function maximization algorithm.

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

UAV Swarm Collaborative Target Assignment Problem: A Deletion Robust Submodular Maximization Approach

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Jiaming Hu,
  • Chuangbo Hao,
  • Mengzhen Li,
  • Yuhao Wang,
  • Maowen Lu,
  • Dachuan Xu

摘要

In modern warfare, decoy targets are often set up to interfere with enemy reconnaissance and operations. To avoid being disrupted by decoys during combat, it is necessary to consider the implementation of robust combat strategies. In this paper, we consider the problem of collaborative target assignment for unmanned aerial vehicle (UAV) swarms with decoy targets. We model it as a deletion-robust submodular maximization problem, and develop a two-stage algorithm that attains a \(1/(4+1/\beta )\) -approximation guarantee, where \(\beta \le 1\) is the approximation ratio for the unconstrained submodular function maximization algorithm.