不确定环境下巡飞弹群动态资源管理  

Dynamic resource management of loitering munition group in uncertain environments

作　　者：李兵 刘正敏 赵新路 LI Bing;LIU Zhengmin;ZHAO Xinlu(Sichuan Aerospace Systems Engineering Research Institute,Chengdu 610100,China)

机构地区：[1]四川航天系统工程研究所,四川成都610100

出　　处：《系统工程与电子技术》2023年第8期2318-2324,共7页Systems Engineering and Electronics

基　　金：国家自然科学基金叶企荪基金(U2241214);中国航天科技集团青年拔尖人才项目资助课题。

摘　　要：巡飞弹群是未来智能化作战样式的重要发展方向,能够实现全覆盖地毯式的封控压制和毁伤攻击,对任务科学合理的管理是作战任务实现的重要基础。本文首先对动态资源管理问题进行分析;其次建立了巡飞弹群的动态目标分配模型,并给出了主要的计算步骤;然后利用Hungarian算法可快速高效地求解平衡匹配优化问题的优势,对于巡飞弹和目标动态加入与退出的战场情况,利用增补变量的方式将非平衡匹配问题变为平衡匹配问题;最后,对典型任务场景进行了分析,验证了所提方法的有效性。The loitering munition group is an important development direction for future intelligent combat styles,capable of achieving full coverage carpet style containment and damage attacks.Scientific and reasonable management of tasks is an important foundation for achieving combat tasks.This article analyzes the problem of dynamic resource management firstly,and then establishes a dynamic target allocation model for loitering munition groups,and provides the main calculation steps.The advantage of using the Hungarian algorithm to quickly and efficiently solve optimization problems for balanced matching is utilized.For the battlefield situation where loitering munition and targets dynamically join in and exit,the non equilibrium matching problem is transformed into an equilibrium matching problem by using supplementary variables.Finally,typical task scenarios are analyzed to verify the effectiveness of the proposed method.

关 键 词：巡飞弹群 资源管理 增补变量 任务分配 

分 类 号：N945.25[自然科学总论—系统科学]