Task assignment under constraint of timing sequential for cooperative air combat

According to the previous achievement, the task assignment under the constraint of timing continuity for a cooperative air combat is studied. An extensive task assignment scenario with the background of the cooperative air combat is proposed. The utility and time of executing a task as well as the continuous combat ability are defined. The concept of the matching method of weapon and target is modified based on the analysis of the air combat scenario. The constraint framework is also redefined according to a new objective function. The constraints of timing and continuity are formulated with a new method, at the same time, the task assignment and integer programming models of the cooperative combat are established. Finally, the assignment problem is solved using the integrated linear programming software and the simulation shows that it is feasible to apply this modified model in the cooperative air combat for tasks cooperation and it is also efficient to optimize the resource assignment.

UAVs cooperative task assignment and trajectory optimization with safety and time constraints

This paper proposes new methods and strategies for Multi-UAVs cooperative attacks with safety and time constraints in a complex environment.Delaunay triangle is designed to construct a map of the complex flight environment for aerial vehicles.Delaunay-Map,Safe Flight Corridor(SFC),and Relative Safe Flight Corridor(RSFC)are applied to ensure each UAV flight trajectory's safety.By using such techniques,it is possible to avoid the collision with obstacles and collision between UAVs.Bezier-curve is further developed to ensure that multi-UAVs can simultaneously reach the target at the specified time,and the trajectory is within the flight corridor.The trajectory tracking controller is also designed based on model predictive control to track the planned trajectory accurately.The simulation and experiment results are presented to verifying developed strategies of Multi-UAV cooperative attacks.

Power-Minimizing Resource Allocation in Multiuser Cooperative Relay Communications

In this paper, we investigate the power-minimizing resource allocation problem in multiuser cooperative relay communication systems. A joint optimization problem involving subcarrier assignment, relay selection and power allocation is formulated. Since the problem cannot be solved directly, we decompose it into three subproblems. According to the equivalent channel gains and the target rates of users, the subcarrier assignment and relay selection are conducted. Motivated by the water-filling algorithm, we propose a power allocation algorithm with cooperative features. Simulations results indicate that the proposed algorithm performs better in terms of the total transmit power consumption than the existing algorithms.

Cooperative task assignment of multiple heterogeneous unmanned aerial vehicles using a modifed genetic algorithm with multi-type genes

The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources （e.g., weapons） onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo- somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.

Cooperative task assignment of multi-UAV system

With the rapid development of Unmanned Aerial Vehicle(UAV)technology,one of the emerging fields is to utilize multi-UAV as a team under autonomous control in a complex environment.Among the challenges in fully achieving autonomous control,Cooperative task assignment stands out as the key function.In this paper,we analyze the importance and difficulties of multiUAV cooperative task assignment in characterizing scenarios and obtaining high-quality solutions.Furthermore,we present three promising directions for future research:Cooperative task assignment in a dynamic complex environment,in an unmanned-manned aircraft system and in a UAV swarm.Our goal is to provide a brief review of multi-UAV cooperative task assignment for readers to further explore.

Optimal Relay Assignment and Power Allocation for Cooperative Communications

Cooperative communication for wireless networks has gained a lot of recent interest due to its ability to mitigate fading with exploration of spatial diversity. In this paper, we study a joint optimization problem of jointly considering transmission mode selection, relay assignment and power allocation to maximize the capacity of the network through cooperative wireless communications. This problem is much more challenging than relay assignment considered in literature work which simply targets to maximize the transmission capacity for a single transmission pair. We formulate the problem as a variation of the maximum weight matching problem where the weight is a function over power values which must meet power constraints （VMWMC）. Although VMWMC is a non-convex problem whose complexity increases exponentially with the number of relay nodes, we show that the duality gap of VMWMC is virtual zero. Based on this result, we propose a solution using Lagrange dual decomposition to reduce the computation complexity. We do simulations to evaluate the performance of the proposed solution. The results show that our solution can achieve maximum network capacity with much less computation time compared with exhaustive search, and our solution outperforms existing sub-optimal solutions that can only achieve much lower network capacity.

Radio resource management in energy harvesting cooperative cognitive UAV assisted IoT networks:A multi-objective approach

Cooperative communication through energy harvested relays in Cognitive Internet of Things(CIoT)has been envisioned as a promising solution to support massive connectivity of Cognitive Radio(CR)based IoT devices and to achieve maximal energy and spectral efficiency in upcoming wireless systems.In this work,a cooperative CIoT system is contemplated,in which a source acts as a satellite,communicating with multiple CIoT devices over numerous relays.Unmanned Aerial Vehicles(UAVs)are used as relays,which are equipped with onboard Energy Harvesting(EH)facility.We adopted a Power Splitting(PS)method for EH at relays,which are harvested from the Radio frequency(RF)signals.In conjunction with this,the Decode and Forward(DF)relaying strategy is used at UAV relays to transmit the messages from the satellite source to the CIoT devices.We developed a Multi-Objective Optimization(MOO)framework for joint optimization of source power allocation,CIoT device selection,UAV relay assignment,and PS ratio determination.We formulated three objectives:maximizing the sum rate and the number of admitted CIoT in the network and minimizing the carbon dioxide emission.The MOO formulation is a Mixed-Integer Non-Linear Programming(MINLP)problem,which is challenging to solve.To address the joint optimization problem for an epsilon optimal solution,an Outer Approximation Algorithm(OAA)is proposed with reduced complexity.The simulation results show that the proposed OAA is superior in terms of CIoT device selection and network utility maximization when compared to those obtained using the Nonlinear Optimization with Mesh Adaptive Direct-search(NOMAD)algorithm.

通信约束下UAV集群协同拦截任务分配算法

针对多无人机协同拦截多机动目标的任务分配问题,同时考虑到真实战场环境中存在的通信约束以及探测范围约束条件,本文提出了分步一致性拍卖算法(SCBAA)。首先,对真实战场环境中存在的通信约束以及探测范围约束等问题进行了描述分析,构建了多无人机协同拦截任务分配模型,设计了综合效能函数以及相应约束条件。其次,为解决多无人机协同打击单一目标的不平衡任务分配以及冲突消解问题,将原任务分配过程分为主要任务分配以及次要任务分配两部分,通过多次拍卖以及冲突消解实现多无人机对单一目标的任务分配。仿真结果表明,该算法可有效解决通信约束条件下的分布式多无人机协同拦截问题,并适应动态环境中任务分配对实时性的要求。

协作频谱感知中的高效和公平认知节点分配方案

协作频谱感知是认知无线电网络的基础和关键阶段,频谱检测过程中的节点分配策略将直接决定联合频谱感知的结果。介绍了多种分配认知终端的方法,旨在提高频谱感知的效率和公平性。针对不同子频带的感知效率,提出了一种称为由频点占用导致的无效传输参数(inefficient transport parameter,ITP)指标来评估通信性能,给出了感知效率优化问题的闭式表达解,设计的场景包括终端对相同频带有不同的感知性能和相同的感知性能。针对不同子频带间的感知公平性,提出了两种分配算法:弓形分配算法和类划分分配算法。子频带间的公平性通过评估子带中最差的感知性能进行衡量。为了适用于实际场景,加入了频段属性参数来增强公平性,该参数考虑了主用户使用不同频段的优先级及抗干扰能力。仿真结果表明,所提出的策略显著改善了认知无线电网络中的ITP,特别是在子频带利用率不同的情况下,提出的弓形分配算法在公平性不明显降低的情况下,复杂度有明显改善。

基于不确定度的多智能体信用分配方法

近年来,部分可观测条件下多智能体协同受到广泛关注。中心化训练分布式执行作为处理这类任务的通用范式面临信用分配这一核心问题。值分解是该范式中的代表性方法,通过混合网络将联合状态动作值函数分解为多个局部观察动作值函数以实现信用分配,在很多问题中表现很好。然而这些方法维持对混合网络参数的单一点估计,因缺乏不确定度表示而难以有效应对环境中的随机因素导致只能收敛到次优策略。为缓解这一问题,对混合网络进行贝叶斯分析,提出一种基于不确定度的多智能体信用分配方法,通过显式地量化参数的不确定度来指导信用分配。考虑到智能体之间复杂的交互,利用贝叶斯超网络隐式地建模参数任意复杂的后验分布,以避免先验地指定分布类型而陷于局部最优解。在星际争霸微操环境中的多个地图上与代表性算法的性能进行对比与分析,验证了算法的有效性。

面向Ad-Hoc协作的局部观测重建方法

在多智能体强化学习的研究中,如何进行Ad-Hoc协作,也就是说如何适应种类和数量变化的队友,是一个关键问题。现有方法或者有很强的先验知识假设,或者使用硬编码的规则进行合作,缺乏通用性,无法泛化到更一般的Ad-Hoc协作场景。为解决该问题,提出一种面向Ad-Hoc协作的局部观测重建算法,利用注意力机制和采样网络对局部观测进行重建,使得算法认识到并充分利用不同局面中的高维状态表征,实现了在Ad-Hoc协作场景下的零样本泛化。在星际争霸微操环境和Ad-Hoc协作场景上与代表性算法的性能进行对比与分析,验证了算法的有效性。

基于深度确定性梯度学习的集群多目标分配方法

针对多弹协同作战进行目标分配时,存在敌方平台和反舰导弹数量不确定性和类型多样化,导致目标分配算法难以建模的问题,为提升高动态协同攻击条件下的攻击效能,建立动态战场环境模型和多目标分配的单回合马尔可夫决策模型,提出一种改进深度确定性策略梯度的分配算法.通过与模拟器的交互自动求解最佳分配策略,利用mask方法对动作空间进行掩码操作,实现算法对平台数量和类型的适应能力.实验结果表明,在各种不同舰船的防御配置和红蓝双方数量配置下,算法求解得到的攻击策略相对于随机策略的性能提升约为87.5%,模型推理时间约为0.04ms.研究结果将加速基于深度确定性梯度学习的方法在高动态环境下智能决策中的应用,对集群自主决策方法的研究具有推动作用.

基于γ随机搜索策略的无人机集群海上任务分配

针对无人机(UAV)集群海上作战态势复杂、作战任务多样、作战单元异构的特点,建立了海上无人机集群多目标任务分配优化模型,并针对该模型提出了一种基于γ随机搜索策略的改进离散粒子群算法(γ-DPSO)。将作战态势细节与复杂作战需求等引入无人机集群任务分配问题,建立契合作战场景的无人机集群任务分配作战模型;基于粒子编码矩阵,设计均衡搜索策略、γ随机搜索策略、分阶段自适应参数,提出基于γ随机搜索策略的改进离散粒子群算法,解决离散粒子群算法易陷入局部最优造成未成熟收敛的问题。仿真结果表明:针对所建立的符合海上作战特点的无人机集群多目标任务分配优化模型,所提算法可有效解决无人机集群多目标任务分配问题,所提改进策略提高了算法的收敛速度与算法精度。

基于A-HPSO算法的无人机集群协同目标分配

首先对透明态势下无人机集群近视距空战协同任务目标分配这一问题进行了数学建模。针对在建模后问题求解过程中时常产生的“算法易陷入局部极值而无法继续搜索”这一“算法早熟”问题,在混合粒子群算法(HPSO)基础上,提出了一种引入堵塞检测机制和强制打散操作的自打散混合粒子群算法(A-HPSO)。为验证研究思路及改进后算法性能,分别将HPSO算法及其两种改进型算法M-HPSO算法和I-HPSO算法与A-HPSO算法在六种标准测试目标优化函数及固定-随机两种空战态势下所建模问题上进行对比仿真。实验结果显示,在多约束多目标函数的优化求解上,改进后的A-HPSO算法显著避免了“算法早熟”问题的发生,并进一步提升了HPSO算法的收敛速度和收敛精度。

基于改进黑猩猩算法的异构多无人机协同任务分配

针对异构多无人机对地面多类型固定目标的任务分配问题,提出一种基于协同多任务分配模型和改进黑猩猩算法的任务分配方法。通过对四元组内元素的设定完成模型构建,建立总收益最高、威胁代价最低、总航程最短的多目标评价函数。使用改进黑猩猩算法完成模型求解,引入混沌反向学习策略提升初始种群分布的多样性,在迭代阶段使用抢食行为动态调整策略,提升了跳出局部最优解的能力。实验表明:相比原算法,改进黑猩猩算法所得任务分配方案在保持较高任务收益和较低威胁代价的同时,在两种规模场景下的平均总航程分别降低了22.6%和21.1%。

Role Assignment and Cooperation of Ontology and Object-Oriented Principle in Construction of Digital Product Model

Powerful expressive ability of semantic information, to be easily computed and flexibility are basic features of digital product model (DPM). Using ontology and object-oriented principle (OOP) together to cope with problems in modeling is brought forward in this paper. The two are widely used and do well in modeling, but they each alone cannot cope with all issues and new challenges. Three basic requests are pointed out in DPM modeling. Status, problems, and root of current non-semantic and semantic models are introduced. Ontology, OOP, and their difference are introduced. It is found that the two are entirely complementary with each other. How to assign the roles and to cooperate for the two in coping with the three basic issues in DPM modeling are explained in detail.

多UCAV协同目标分配算法研究

针对多无人作战飞机(unmanned combat aerial vehicle,UCAV)协同目标分配问题,提出了一种基于离散粒子群算法的多UCAV协同目标分配方法。根据多UCAV协同目标分配问题的特点,建立了粒子与实际问题间的映射,设计了新的粒子群位置和速度更新公式,并且对标准粒子群算法作了改进。充分利用粒子群优化算法的全局搜索能力,有效地解决多约束条件下多UCAV协同目标分配问题。仿真结果表明,离散粒子群算法能够稳定快速地找到较优分配方案,并且算法简单、灵活。

基于协同效能的反导作战任务分配模型

提出了一种基于效能最优的多个反导武器系统协同反导作战任务分配模型。阐明了任务分配与目标分配的关系,给出了任务生成原理,建立了考虑任务分配均匀性和一致性的静态任务分配优化模型;为建模方案之间的协同约束,定义了基本效能、自协同效能和互协同效能;基于粒子群优化算法进行了求解。仿真结果表明:建立的模型和方法适用于静态任务分配问题,所得结果合理有效,能够反映出任务协同在多个反导武器系统协同反导任务中的优势。

基于拍卖算法的多机协同火力分配

为解决超视距协同空战中的多机协同火力分配问题,首先建立了空战威胁估计和空战优势估计模型,构建了多机协同火力分配的数学模型。其次基于多智能体拍卖算法,提出了一种分布式的多机协同火力分配方法,该方法同时考虑了火力分配的效益和代价,能在较短的时间内给出较为合理的协同火力分配方案,具有计算量小、通信量低、动态性以及实时性好等特点,可应用于解决多机协同火力分配中的资源分配、冲突消解等协作问题。最后,通过仿真实验证明了该方法的合理性和有效性。

基于整数规划的多UCAV任务分配问题研究

在深入分析多UCAV任务分配问题的特点的基础上,提出了求解多UCAV协同任务分配的整数规划方法.通过设计决策变量和灵活地对各种约束条件形式化,建立了多UCAV任务分配问题的形式化模型.并以典型的UCAV任务SEAD为想定,进行了仿真验证与分析.仿真结果表明该模型可以较好地解决多UCAV协同作战的任务分配问题.*