机载多智能体任务系统研究

依据云架构背景下战斗机任务系统的作战需求,结合人工智能技术在航空领域的应用研究,提出了机载多智能体任务系统的概念。分析了任务系统的任务架构和功能架构,研究了多智能体任务系统的运行原理和基于OODA的并行任务管理机制,为战斗机智能化任务系统总体设计提供了参考思路,并可进一步推广至无人机领域。     

面向多平台多目标协同跟踪的指派问题

针对多平台多目标协同跟踪中要求多个无人地面平台尽可能均匀地协同跟踪多个目标的特点,提出了改进的离散粒子群优化算法。首先采用连续型粒子群优化算法中的速度和位置迭代公式,然后对粒子位置进行离散编码,使粒子编码对应于可行的指派方案;其次,在优化算法中引入局部搜索,提高算法寻优性能。最后将所提算法应用于多平台多目标协同跟踪中的指派问题,并与未加入局部搜索的粒子群优化算法比较,仿真结果表明,加入局部搜索后的离散粒子群优化算法具有较好的寻优性能。     

联合防空目标分配方案优化研究

目标分配是联合防空作战指挥决策的核心内容,是各级联合防空指挥中心的重要工作,其模型的合理性与可信性会对作战结局产生重大影响。为提高目标分配的合理性与可信性,对联合防空作战混合部署下的目标优化分配问题进行了详细分析,建立了相应的数学规划决策模型。为了有效获得问题的全局最优解,将改进遗传算法(GA)应用于数学规划决策模型的求解过程中,并给出了模型求解的方法和步骤,经实例应用,取得了满意的结果。     

CEC条件下舰艇编队目标武器分配研究

在分析CEC条件下舰艇编队目标武器分配模式的基础上,综合运用MAS理论与方法,建立了舰艇编队目标武器分配MAS模型,即利用Agent描述舰艇编队的各种物理资源或逻辑资源,通过网络及Agent通讯协议将多个Agent连接成一个整体系统,设计了映射实体功能的Agent结构,从而为舰艇编队目标武器分配决策提供了一条新途径.     

战场环境中多无人机任务分配的快速航路预估算法

战场环境中多无人机任务分配的航路预估是一个具有多路径和实时性双重要求的路径规划问题。采用概率路标图方法对多无人机多任务的航路预估问题开展研究,将航路预估分为离线学习和在线查询两个阶段。通过将战场中威胁的影响转化为各路标间航段的风险代价,提出了基于代价变换的概率路标图方法,当战场态势发生变化时,在不需重构路标图的条件下可以通过局部航段风险代价的调整快速规划出新的预估航路。根据规划条件采取不同的采样策略,可以在规划时间和航路质量之间实现协调以满足不同的战术要求。仿真结果表明该方法是一种快速有效的航路预估方法。     

美国海军水面舰艇导弹防空体系分析

分析了美国海军防空作战思想,在此前提下总结出美海军舰空导弹体系主要的作战任务,说明了美海军典型水面舰艇装备舰空导弹的情况,最后阐述了今后美舰空导弹的发展趋势。     

模糊匈牙利算法在舰艇抢修人员指派问题中的研究

分析了舰艇在执行任务或作战等紧急情况下的抢修人员指派问题,并对此建立了多目标广义指派问题的数学模型。在任务数少于工作人数的情况下,采用虚拟“工作”和“人员”的方法,得到适合经典匈牙利算法的拓展效益矩阵,并对此矩阵采用匈牙利算法求得最优指派。     

Doubly Stochastic Sequential Assignment Problem

This article introduces the Doubly Stochastic Sequential Assignment Problem (DSSAP), an extension of the Sequential Stochastic Assignment Problem (SSAP), where sequentially arriving tasks are assigned to workers with random success rates. A given number of tasks arrive sequentially, each with a random value coming from a known distribution. On a task arrival, it must be assigned to one of the available workers, each with a random success rate coming from a known distribution. Optimal assignment policies are proposed for DSSAP under various assumptions on the random success rates. The optimal assignment algorithm for the general case of DSSAP, where workers have distinct success rate distribution, has an exponential running time. An approximation algorithm that achieves a fraction of the maximum total expected reward in a polynomial time is proposed. The results are illustrated by several numerical experiments. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 124–137, 2016     

空天防御作战规划问题研究

从技术与作战结合的角度,系统分析空天防御作战系统和对抗特点等问题,构建了"态势组态—目标排序—目标分配—冲突动态最优预测"新型作战规划方法,提出"博弈控制理论与方法",论述了空天防御作战规划方法论。对空天防御作战规划理论研究有一定参考价值,为发展空天防御作战规划系统提供了研究思路和技术支撑。     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017