Optimal confrontation position selecting games model and its application to one-on-one air combat

In the air combat process,confrontation position is the critical factor to determine the confrontation situation,attack effect and escape probability of UAVs.Therefore,selecting the optimal confrontation position becomes the primary goal of maneuver decision-making.By taking the position as the UAV’s maneuver strategy,this paper constructs the optimal confrontation position selecting games(OCPSGs)model.In the OCPSGs model,the payoff function of each UAV is defined by the difference between the comprehensive advantages of both sides,and the strategy space of each UAV at every step is defined by its accessible space determined by the maneuverability.Then we design the limit approximation of mixed strategy Nash equilibrium(LAMSNQ)algorithm,which provides a method to determine the optimal probability distribution of positions in the strategy space.In the simulation phase,we assume the motions on three directions are independent and the strategy space is a cuboid to simplify the model.Several simulations are performed to verify the feasibility,effectiveness and stability of the algorithm.

Weapon configuration, allocation and route planning with time windows for multiple unmanned combat air vehicles

Unmanned combat air vehicles(UCAVs) mission planning is a fairly complicated global optimum problem. Military attack missions often employ a fleet of UCAVs equipped with weapons to attack a set of known targets. A UCAV can carry different weapons to accomplish different combat missions. Choice of different weapons will have different effects on the final combat effectiveness. This work presents a mixed integer programming model for simultaneous weapon configuration and route planning of UCAVs, which solves the problem optimally using the IBM ILOG CPLEX optimizer for simple missions. This paper develops a heuristic algorithm to handle the medium-scale and large-scale problems. The experiments demonstrate the performance of the heuristic algorithm in solving the medium scale and large scale problems. Moreover, we give suggestions on how to select the most appropriate algorithm to solve different scale problems.

A Predator-prey Particle Swarm Optimization Approach to Multiple UCAV Air Combat Modeled by Dynamic Game Theory

Dynamic game theory has received considerable attention as a promising technique for formulating control actions for agents in an extended complex enterprise that involves an adversary. At each decision making step, each side seeks the best scheme with the purpose of maximizing its own objective function. In this paper, a game theoretic approach based on predatorprey particle swarm optimization(PP-PSO) is presented, and the dynamic task assignment problem for multiple unmanned combat aerial vehicles(UCAVs) in military operation is decomposed and modeled as a two-player game at each decision stage. The optimal assignment scheme of each stage is regarded as a mixed Nash equilibrium, which can be solved by using the PP-PSO. The effectiveness of our proposed methodology is verified by a typical example of an air military operation that involves two opposing forces: the attacking force Red and the defense force Blue.

A Multi-UCAV cooperative occupation method based on weapon engagement zones for beyond-visual-range air combat

Recent advances in on-board radar and missile capabilities,combined with individual payload limitations,have led to increased interest in the use of unmanned combat aerial vehicles(UCAVs)for cooperative occupation during beyond-visual-range(BVR)air combat.However,prior research on occupational decision-making in BVR air combat has mostly been limited to one-on-one scenarios.As such,this study presents a practical cooperative occupation decision-making methodology for use with multiple UCAVs.The weapon engagement zone(WEZ)and combat geometry were first used to develop an advantage function for situational assessment of one-on-one engagement.An encircling advantage function was then designed to represent the cooperation of UCAVs,thereby establishing a cooperative occupation model.The corresponding objective function was derived from the one-on-one engagement advantage function and the encircling advantage function.The resulting model exhibited similarities to a mixed-integer nonlinear programming(MINLP)problem.As such,an improved discrete particle swarm optimization(DPSO)algorithm was used to identify a solution.The occupation process was then converted into a formation switching task as part of the cooperative occupation model.A series of simulations were conducted to verify occupational solutions in varying situations,including two-on-two engagement.Simulated results showed these solutions varied with initial conditions and weighting coefficients.This occupation process,based on formation switching,effectively demonstrates the viability of the proposed technique.These cooperative occupation results could provide a theoretical framework for subsequent research in cooperative BVR air combat.

Trajectory online optimization for unmanned combat aerial vehicle using combined strategy

This paper presents a combined strategy to solve the trajectory online optimization problem for unmanned combat aerial vehicle (UCAV). Firstly, as trajectory directly optimizing is quite time costing, an online trajectory functional representation method is proposed. Considering the practical requirement of online trajectory, the 4-order polynomial function is used to represent the trajectory, and which can be determined by two independent parameters with the trajectory terminal conditions; thus, the trajectory online optimization problem is converted into the optimization of the two parameters, which largely lowers the complexity of the optimization problem. Furthermore, the scopes of the two parameters have been assessed into small ranges using the golden section ratio method. Secondly, a multi-population rotation strategy differential evolution approach (MPRDE) is designed to optimize the two parameters; in which, 'current-to-best/1/bin', 'current-to-rand/1/bin' and 'rand/2/bin' strategies with fixed parameter settings are designed, these strategies are rotationally used by three subpopulations. Thirdly, the rolling optimization method is applied to model the online trajectory optimization process. Finally, simulation results demonstrate the efficiency and real-time calculation capability of the designed combined strategy for UCAV trajectory online optimizing under dynamic and complicated environments.

Hybrid hierarchical trajectory planning for a fixed-wing UCAV performing air-to-surface multi-target attack

This paper considers the problem of generating a flight trajectory for a single fixed-wing unmanned combat aerial vehicle （UCAV） performing an air-to-surface multi-target attack （A/SMTA） mission using satellite-guided bombs. First, this problem is formulated as a variant of the traveling salesman problem （TSP）, called the dynamic-constrained TSP with neighborhoods （DCT- SPN）. Then, a hierarchical hybrid approach, which partitions the planning algorithm into a roadmap planning layer and an optimal control layer, is proposed to solve the DCTSPN. In the roadmap planning layer, a novel algorithm based on an updatable proba- bilistic roadmap （PRM） is presented, which operates by randomly sampling a finite set of vehicle states from continuous state space in order to reduce the complicated trajectory planning problem to planning on a finite directed graph. In the optimal control layer, a collision-free state-to-state trajectory planner based on the Gauss pseudospectral method is developed, which can generate both dynamically feasible and optimal flight trajectories. The entire process of solving a DCTSPN consists of two phases. First, in the offline preprocessing phase, the algorithm constructs a PRM, and then converts the original problem into a standard asymmet- ric TSP （ATSP）. Second, in the online querying phase, the costs of directed edges in PRM are updated first, and a fast heuristic searching algorithm is then used to solve the ATSP. Numerical experiments indicate that the algorithm proposed in this paper can generate both feasible and near-optimal solutions quickly for online purposes.

UCAV situation assessment method based on C-LSHADE-Means and SAE-LVQ

The unmanned combat aerial vehicle(UCAV)is a research hot issue in the world,and the situation assessment is an important part of it.To overcome shortcomings of the existing situation assessment methods,such as low accuracy and strong dependence on prior knowledge,a datadriven situation assessment method is proposed.The clustering and classification are combined,the former is used to mine situational knowledge,and the latter is used to realize rapid assessment.Angle evaluation factor and distance evaluation factor are proposed to transform multi-dimensional air combat information into two-dimensional features.A convolution success-history based adaptive differential evolution with linear population size reduc-tion-means(C-LSHADE-Means)algorithm is proposed.The convolutional pooling layer is used to compress the size of data and preserve the distribution characteristics.The LSHADE algorithm is used to initialize the center of the mean clustering,which over-comes the defect of initialization sensitivity.Comparing experi-ment with the seven clustering algorithms is done on the UCI data set,through four clustering indexes,and it proves that the method proposed in this paper has better clustering performance.A situation assessment model based on stacked autoen-coder and learning vector quantization(SAE-LVQ)network is constructed,and it uses SAE to reconstruct air combat data fea-tures,and uses the self-competition layer of the LVQ to achieve efficient classification.Compared with the five kinds of assess-ments models,the SAE-LVQ model has the highest accuracy.Finally,three kinds of confrontation processes from air combat maneuvering instrumentation(ACMI)are selected,and the model in this paper is used for situation assessment.The assessment results are in line with the actual situation.

基于分组教与学的无人战斗机自适应路径规划

针对无人战斗机(unmanned combat air vehicle,UCAV)处于存在威胁区域的战场中路径规划问题,提出一种基于分组教与学算法的UCAV自适应路径规划方法。通过分析UCAV路径评价指标,提出一种自适应的UCAV路径评价模型,根据作战环境规划出距离短、威胁小的任务路径。针对教与学算法寻优精度低、耗时长的问题,提出一种分组教与学算法,引入动态分组和高斯分布扰动策略,提高算法寻优性能。通过仿真实验,该方案求解的最优路径更短且安全。

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

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

基于威胁等效和改进PSO算法的UCAV实时航路规划方法

为解决无人战斗机(unmanned combat aerial vehicle,UCAV)实时航路规划问题,通过对各种威胁等效为雷达威胁,威胁分级和每级分层次的处理方法,得到每个威胁的击毁和击伤作用距离。建立UCAV简易的二维模型,利用其飞行姿态与雷达散射截面积(radar cross section,RCS)之间的关系,得出以探测概率为基础的威胁代价函数。最后运用自适应Meta-Lamarckian学习策略的粒子群优化(particle swarm optimization,PSO)算法对方法进行实时性仿真测试,结果表明此方法的有效性。

利用Radau伪谱法求解UCAV对地攻击轨迹研究

针对UCAV对地攻击轨迹规划问题,提出一种基于Radau伪谱法(RPM)的求解策略。首先,构建了最优控制问题的一般框架,分析了RPM求解最优控制问题的基本原理及实现方式;在充分考虑UCAV的气动力特性、发动机推力特性及大气环境特性的基础上建立了UCAV三自由度(3-DOF)质点模型,并详细分析了UCAV初始和终端位置、速度、姿态约束、飞行性能和战场环境等约束条件,在此基础上构建UCAV对地攻击轨迹规划问题框架;最后,利用RPM将轨迹规划的最优控制问题转化为非线性规划问题并求得最优解。仿真结果表明,该方法能以较高的精度和速度生成满足各种复杂约束要求、连续并且真实可行的最优轨迹。

基于自适应伪谱法的UCAV低可探测攻击轨迹规划研究

研究无人作战飞机(unmanned combat aerial vehicle,UCAV)对地攻击阶段轨迹规划问题。首先,在综合UCAV的气动力特性、发动机推力特性基础上建立UCAV质点模型和动力学模型,并结合UCAV平台初始条件、机动性以及武器投射条件构建约束条件;针对当前轨迹规划中没有考虑雷达散射截面(radar cross section,RCS)随UCAV姿态角改变而动态变化这一缺陷,建立综合考虑动态RCS的威胁概率和攻击时间的目标函数;然后利用可变低阶自适应伪谱法求得攻击轨迹最优解。对时间最短、RCS固定和考虑动态RCS 3种情况进行仿真。结果表明,考虑动态RCS时,UCAV将根据威胁进行轨迹和姿态调整,极大减小了被敌方威胁捕获的概率。该算法能够提供规划轨迹的高精度状态和控制量信息,有利于实现攻击过程的高精度精细规划控制。

基于FBNs的有人机/UCAV编队对地攻击威胁评估

信息化环境下的编队对地攻击过程中,所获取的地面兵力威胁信息具有高度不确定性。如何采用高效的不确定性信息推理方法快速准确地完成地面兵力对空中飞行编队的威胁评估建模成为一个亟待解决的问题。提出基于模糊贝叶斯网络的有人机/无人战斗机编队对地威胁评估建模方法,综合模糊逻辑与贝叶斯网络的优势,对战场的随机、模糊威胁信息进行综合处理。仿真结果表明,模糊贝叶斯网络不仅能够有效处理战场不确定信息,而且能够综合指挥员的主观判断,适合于不确定性战场环境下的威胁评估推理。

基于贝叶斯优化算法的UCAV编队对地攻击协同任务分配

针对UCAV编队对地攻击协同控制决策优化问题,首先构建了UCAV编队对地攻击任务分配的自主价值优势矩阵。在此基础上依据多人冲突理论分别对双方以及本机编队进行权重分配;建立了UCAV编队对地攻击协同任务分配的整体价值优势矩阵,由此根据决策变量与约束条件构建了任务分配问题的数学模型。然后应用贝叶斯优化算法对该模型进行了优化分析。仿真实例表明,所建协同任务分配模型能够反映编队协同控制决策的重要性,而且应用贝叶斯优化算法能够很快收敛到全局最优解,能有效地解决UCAV编队对地攻击的协同任务分配问题。

基于博弈论的多UCAV对地攻击目标分配

针对多架UCAV对地攻击目标分配问题,首先根据价值属性分别对目标和飞机进行权重分配,在此基础上构建了多UCAV对地攻击目标分配的自主决策函数和协同决策函数,提出了一种基于博弈论的目标分配方法。然后运用该算法进行了实例仿真,仿真结果证明了该算法的可行性和有效性。

多UCAV协同目标攻击决策

针对多无人作战飞机(unmanned combat aerial vehicle,UCAV)攻击多目标,研究了多UCAV协同攻击决策问题。建立了目标毁伤模型、UCAV损耗模型和时间协同模型,并通过加权求和将三者转化为单一目标函数,进而转化为单目标问题进行求解。提出了一种离散微粒群优化(discrete particle swarm optimization,DPSO)算法,在微粒群优化算法框架内重新定义了微粒的位置、速度及相关操作。建立了微粒与实际问题的映射关系,进而使DPSO算法适合于求解多UCAV协同目标攻击决策问题。仿真结果表明,DPSO算法易于实现,能够较好地解决基于时间协同的多UCAV目标攻击决策问题。

基于影响图的UCAV编队对地攻击战术决策研究

随着武器的高科技化、战场环境的复杂化、战斗节奏的加快,智能化的战术决策系统在现代战争中占有越来越重要的地位。基于影响图易于进行不确定性推理的优点,提出应用影响图来建立UCAV编队对地攻击智能战术决策系统。建立了UCAV编队对地攻击战术决策的影响图模型,并且对该模型进行了仿真分析。仿真结果表明,基于影响图的战术决策模型能够提高决策的准确度和智能化,而且推理简单,易于实现。

复杂不确定环境下UCAV自主攻击轨迹优化设计

针对不确定环境下无人作战飞机(UCAV)自主攻击关键问题,提出一种滚动伪谱法求解最优攻击轨迹的策略。首先设计出UCAV自主攻击过程总体框架,随后建立了UCAV三自由度质点模型,基于动态RCS构建统一威胁模型,采用威胁等效的方法快速处理突发威胁,以滚动优化策略解决大规模不确定环境下UCAV视野域范围有限、不易处理突发威胁以及因规划空间增大而产生的维数灾难等问题,以预测规划解决滚动方法带来的局部最优问题以及可能面临的有限时间内攻击轨迹解算困难而无解的问题。数字仿真结果表明,该算法能以较高的速度和精度在复杂不确定环境中快速规划出满足约束要求的最优对地攻击轨迹,且精度高、跟踪效果好,从而证明了该算法的有效性。

基于ABFCM模型框架的UCAV自主攻击决策

为发挥无人作战飞机(unmanned combat aerial vehicle,UCAV)的决策自主性、减轻UCAV操作员的任务负担,基于智能体模糊认知图(agent-based fuzzy cognitive map,ABFCM)模型框架,设计了包含信息处理、决策推理和人机交互的三层次UCAV自主攻击决策系统ABFCM模型。该模型将UCAV自主攻击决策内容合理地分解在不同层次和功能的Agent中,在分别建立各Agent因果推理模型的基础上,实现了合理有序地组织整个决策推理行为。通过仿真分析,验证了所建模型的合理性和可行性,同时也表明该自主攻击决策模型将有助于UCAV适应未来复杂的战场环境,提升监督控制模式下的自主作战能力。

基于有限忍耐度鸽群优化的无人机近距空战机动决策

由于对抗双方态势的快速变化,无人机近距空战机动自主决策困难且复杂,是空中对抗的一个难点。对此,提出一种基于有限忍耐度鸽群优化(FTPIO)算法的无人机近距空战机动决策方法。该方法主要包括基于机动动作库的对手行动预测和基于FTPIO算法的机动控制量和执行时间优化求解两个部分。为提升基本鸽群优化(PIO)算法的全局探索能力,引入有限忍耐度策略,在鸽子个体几次迭代中没有找到更优解时对其属性进行一次重置,避免陷入局部最优陷阱。该方法采用的优化变量是无人机运动模型控制变量的增量,打破了机动库的限制。通过和极小极大方法、基本PIO算法和粒子群优化(PSO)算法的仿真对抗测试结果表明,所提出的机动决策方法能够在近距空战中有效击败对手,产生更为灵活的欺骗性机动行为。