Modern Defense Technology ›› 2026, Vol. 54 ›› Issue (2): 69-81.DOI: 10.3969/j.issn.1009-086x.2026.02.006

• PAPERS • Previous Articles     Next Articles

Target Assignment and Fire Scheduling Method for Unmanned Combat Systems

Peilin LI1, Jie GUO1, Xifeng CHEN2, Yangyang WAN1, Shengjing TANG1   

  1. 1.School of Aerospace Engineering,Beijing Institute of Technology,Beijing 100081,China
    2.Huaihai Industrial Group Co. ,Ltd. ,Changzhi 046012,China
  • Received:2025-03-28 Revised:2025-05-19 Online:2026-04-28 Published:2026-04-30
  • Contact: Jie GUO

无人值守作战系统目标分配与发射时序规划方法

李沛璘1, 郭杰1, 陈西峰2, 万泱泱1, 唐胜景1   

  1. 1.北京理工大学 宇航学院,北京 100081
    2.淮海工业集团有限公司,山西 长治 046012
  • 通讯作者: 郭杰
  • 作者简介:李沛璘(2000-),女,傈僳族,云南昆明人。硕士生,研究方向为飞行器总体设计、协同制导与编队、飞行动力学与控制。

Abstract:

To address the real-time and efficiency requirements for multi-target cooperative interception by unmanned combat systems in dynamic battlefield scenarios, this paper proposes a greedy target assignment and fire scheduling method based on dynamic time window (GTAFS-DTW). By constructing a relative motion model between combat units and targets, the proposed method incorporates engagement distance constraints, task execution constraints, and target maneuver characteristics. a dynamic time window screening mechanism is designed with the optimization objective of minimizing engagement time and impact time difference. On this basis, a hierarchical greedy strategy is adopted to prioritize unit-target pairs with overlapping feasible engagement intervals, and temporal cooperative optimization is achieved through iterative adjustment of window boundaries and fire scheduling. Simulation results demonstrate that GTAFS-DTW effectively reduces impact time deviation to within 0.5 s in both lateral and longitudinal queue scenarios compared with traditional discrete particle swarm optimization (DPSO), significantly enhancing computational efficiency and satisfying real-time optimization requirements.

Key words: unmanned combat systems, target assignment, fire scheduling, freedy algorithm, time coordination, particle swarm optimization(PSO)

摘要:

针对无人值守作战系统在动态战场环境下多目标协同拦截的实时性与高效性需求,提出一种基于动态时间窗口的贪心目标分配与发射时序规划方法(greedy target assignment and fire scheduling method based on dynamic time window, GTAFS-DTW)。通过构建作战单元与目标的相对运动模型,结合攻击距离约束、任务执行约束及目标运动特性,以最小化攻击时间与命中时间差为优化目标,设计动态时间窗口筛选机制。在此基础上,采用分层贪心策略,优先选择可攻击时间区间交集的作战单元-目标对,并通过迭代调整窗口边界及发射时序规划实现时序协同优化。仿真实验表明,相较于传统离散粒子群(discrete particle swarm optimization,DPSO)算法,GTAFS-DTW在横向队列与纵向队列场景下均能够将命中时间差减小至0.5 s以内,降低了目标机动响应窗口,同时显著提升了计算效率,满足在线任务规划的实时性要求。

关键词: 无人值守作战系统, 目标分配, 发射时序规划, 贪心算法, 时间协同, 粒子群算法

CLC Number: