基于MILP的多无人机对敌防空火力压制

建立了基于混合整数线性规划（Mixed Integer LinearProgram,MILP）的多无人机编队对敌防空火力压制协同任务分配模型,以0-1决策变量表征无人机一任务指派关系,引入连续时间决策变量来表示任务的执行时间,并通过对决策变量之间的线性等式和不等式的数学描述,建立无人机之间和无人机执行任务之间合理的协同约束关系。采用商用软件CPLEX对模型求解,仿真验证了模型的合理性。     

基于任务协同的有人机/无人机 对海攻击作战效能评估研究

通过分析攻击敌海上舰船目标过程中有人机/无人机编队的作战使用方式及影响其作战效能的主要因素,建立了有人机/无人机编队协同攻击海上目标的作战效能评估指标体系,运用ADC法构建了有人机/无人机混合编队攻击敌舰船目标作战效能评估模型,通过算例证明了该方法适应于有人机/无人机编队的作战效能评估,为有人机/无人机协同作战决策提供了有效的参考依据。     

Mission decision-making method of multi-aircraft cooperatively attacking multi-target based on game theoretic framework

Coordinated mission decision-making is one of the core steps to effectively exploit the capabilities of cooperative attack of multiple aircrafts. However, the situational assessment is an essential base to realize the mission decision-making. Therefore, in this paper, we develop a mission decision-making method of multi-aircraft cooperatively attacking multi-target based on situational assessment. We have studied the situational assessment mathematical model based on the Dempster-Shafer (D-S) evidence theory and the mission decision-making mathematical model based on the game theory. The proposed mission decision-making method of antagonized airfight is validated by some simulation examples of a swarm of unmanned combat aerial vehicles (UCAVs) that carry out the mission of the suppressing of enemy air defenses (SEAD).     

基于Nash均衡与进化计算的协调航迹规划

在对策论框架下研究多无人飞行器的协调航迹规划问题,提出了一种基于Nash平衡和进化计算的航迹规划算法.协调航迹规划是一个多目标合作优化问题,也是一个非合作对策问题.飞行器编队的分布结构提供了一种隐性偏好信息,有助于找到飞行器编队的最优协调航迹和最优飞行代价分配.本文算法使用特定的航迹个体表示方法和进化算子,按照层次方法处理各种航迹约束.不同飞行器间的协同和竞争关系定义在航迹评价函数里.仿真结果验证了基于博弈论航迹规划算法的可行性和优越性.     

STABC-IR: An air target intention recognition method based on bidirectional gated recurrent unit and conditional random field with space-time attention mechanism

The battlefield environment is changing rapidly, and fast and accurate identification of the tactical intention of enemy targets is an important condition for gaining a decision-making advantage. The current Intention Recognition (IR) method for air targets has shortcomings in temporality, interpretability and back-and-forth dependency of intentions. To address these problems, this paper designs a novel air target intention recognition method named STABC-IR, which is based on Bidirectional Gated Recurrent Unit (BiGRU) and Conditional Random Field (CRF) with Space-Time Attention mechanism (STA). First, the problem of intention recognition of air targets is described and analyzed in detail. Then, a temporal network based on BiGRU is constructed to achieve the temporal requirement. Subsequently, STA is proposed to focus on the key parts of the features and timing information to meet certain interpretability requirements while strengthening the timing requirements. Finally, an intention transformation network based on CRF is proposed to solve the back-and-forth dependency and transformation problem by jointly modeling the tactical intention of the target at each moment. The experimental results show that the recognition accuracy of the jointly trained STABC-IR model can reach 95.7%, which is higher than other latest intention recognition methods. STABC-IR solves the problem of intention transformation for the first time and considers both temporality and interpretability, which is important for improving the tactical intention recognition capability and has reference value for the construction of command and control auxiliary decision-making system.     

基于分支深度强化学习的非合作目标追逃博弈策略求解

为解决航天器与非合作目标的空间交会问题,缓解深度强化学习在连续空间的应用限制,提出了一种基于分支深度强化学习的追逃博弈算法,以获得与非合作目标的空间交会策略。对于非合作目标的空间交会最优控制,运用微分对策描述为连续推力作用下的追逃博弈问题;为避免传统深度强化学习应对连续空间存在维数灾难问题,通过构建模糊推理模型来表征连续空间,提出了一种具有多组并行神经网络和共享决策模块的分支深度强化学习架构。实现了最优控制与博弈论的结合,有效解决了微分对策模型高度非线性且难于利用经典最优控制理论进行求解的难题,进一步提升了深度强化学习对离散行为的学习能力,并通过算例仿真检验了该算法的有效性。     

Network-Enabled Missile Deflection: Games and Correlation Equilibrium

The problem of deploying countermeasures (CM) against antiship missiles is investigated from a network centric perspective in which multiple ships coordinate to defend against a known missile threat. Using the paradigm of network enabled operations (NEOPS), the problem is formulated as a transient stochastic game with communication where the appropriate strategy takes the form of an optimal stationary correlated equilibrium. Under this strategy, ships cooperate through real-time communication to satisfy both local and collective interests. The use of communication results in a performance improvement over the noncommunicating, Nash equilibrium scenario. This framework allows us to develop a theoretical foundation for NEOPS and captures the trade-off between information exchange and performance, while generalizing the standard Nash equilibrium solution for the missile deflection game given in [1], The NEOPS equilibrium strategy is characterized as the solution to an optimization problem with linear objective and bilinear constraints, which can be solved calculating successive improvements starting from an initial noncooperative (Nash) solution. The communication overhead required to implement this strategy is associated with the mutual information between individual action probability distributions at equilibrium. Numerical results illustrate the trade-off between communication and performance.     

收益管理中的网络优化研究

介绍航空公司收益管理研究中针对航线网络进行座位优化的基本理论与研究现状,分析比较了概率数学规划、确定性数学规划、随机数学规划等常用方法,并对座位控制的嵌套策略与竞价机制研究现状进行了讨论,指出了研究中存在的问题。针对网络座位优化这一NP难问题,探讨了采用智能仿生算法与博弈技术的可行性。     

基于微分对策的临近空间飞行器机动突防策略

针对飞行器机动突防问题,基于微分对策理论对飞行器在攻防对抗中制导阶段的机动突防策略进行设计与分析。首先将攻防对抗问题转化为二人零和博弈问题,并设计了二次型目标函数;其次,考虑到飞行器计算能力不足的问题,采取了适当假设以得到博弈问题的解析解,便于实际应用;最后对该机动突防策略进行了仿真验证,结果表明在攻防对抗中制导阶段,飞行器采用微分对策制导律,相较于正弦机动不仅减少自身54.3%的能量消耗,而且增加了拦截器58.6%的能量消耗,将显著增加飞行器末制导段对抗突防能力。     

Application of frequency correlation function to radar target detection

Analysis of high-resolution 35 GHz synthetic aperture radar (SAR) imagery of terrain reveals that when point targets, such as vehicles, are viewed at angles close to grazing incidence, they are often difficult to distinguish from tree trunks because the radar cross section (RCS) intensities of the vehicles are comparable to the upper end of the RCS exhibited by tree trunks. To resolve the point target/tree trunk ambiguity problem, a detailed study was conducted to evaluate the use of new detection features based on the complex frequency correlation function (FCF). This paper presents an analytical examination of FCF and its physical meaning, the results of a numerical simulation study conducted to evaluate the performance of a detection algorithm that uses FCF, and the corroboration of theory with experimental observations conducted at 35 and 95 GHz. The FCF-based detection algorithm was found to correctly identify tree trunks as such in over 90% of the cases, while exhibiting a false alarm rate of only 3%.     

现代战机空战对策建模研究

分析了现代战机空战的种类,着重讨论了单机单目标空战对策的建模问题,分别从二维和三维的角度描述了空战双方的几何关系并建立了飞行器相对运动模型.在此基础上,针对单机单目标空战可能出现的两种情况,建立了追-逃微分对策模型和双目标对策模型.     

Cooperative task assignment of multiple heterogeneous unmanned aerial vehicles using a modified 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.     

Electronic warfare. [A century of powered flight: 1903-2003]

Electronic warfare (EW) is a term that includes a number of different electronic technologies for intelligence gathering and/or interfering with enemy operations. Electronic intelligence (ELINT), or eavesdropping, has been going on since the invention of the telephone and telegraph. Electronic countermeasures (ECM) deprive an enemy of the electronic spectrum by creating interference (jamming) that obscures their information or generates false information (spoofing). Electronic counter countermeasures (ECCM) is an effort designed to mitigate and overcome enemy ECM operations. ECM objectives include: search for signals in frequency, azimuth, and elevation; detect and identify radar signals via characteristics; and establish signal importance; commence appropriate countermeasures. It is only recently that these technologies have traditionally been categorized as EW, and are also referred to as electronic combat (EC). This section will focus on EW as it relates only to aviation.     

Neural solution to the multitarget tracking data associationproblem

The problem of tracking multiple targets in the presence of clutter is addressed. The joint probabilistic data association (JPDA) algorithm has been previously reported to be suitable for this problem in that it makes few assumptions and can handle many targets as long as the clutter density is not very high. However, the complexity of this algorithm increases rapidly with the number of targets and returns. An approximation of the JPDA that uses an analog computational network to solve the data association problem is suggested. The problem is viewed as that of optimizing a suitably chosen energy function. Simple neural-network structures for the approximate minimization of such functions have been proposed by other researchers. The analog network used offers a significant degree of parallelism and thus can compute the association probabilities more rapidly. Computer simulations indicate the ability of the algorithm to track many targets simultaneously in the presence of moderately dense clutter     

Adaptive path planning for unmanned aerial vehicles based on bi-level programming and variable planning time interval

This paper presents an adaptive path planner for unmanned aerial vehicles (UAVs) to adapt a real-time path search procedure to variations and fluctuations of UAVs’ relevant performances, with respect to sensory capability, maneuverability, and flight velocity limit. On the basis of a novel adaptability-involved problem statement, bi-level programming (BLP) and variable planning step techniques are introduced to model the necessary path planning components and then an adaptive path planner is developed for the purpose of adaptation and optimization. Additionally, both probabilistic-risk-based obstacle avoidance and performance limits are described as path search constraints to guarantee path safety and navigability. A discrete-search-based path planning solution, embedded with four optimization strategies, is especially designed for the planner to efficiently generate optimal flight paths in complex operational spaces, within which different surface-to-air missiles (SAMs) are deployed. Simulation results in challenging and stochastic scenarios firstly demonstrate the effectiveness and efficiency of the proposed planner, and then verify its great adaptability and relative stability when planning optimal paths for a UAV with changing or fluctuating performances.     

JTIDS relative navigation and data registration

The Joint Tactical Information Distribution System (JTIDS), an integrated communication, navigation, and identification system, provides a solution to the critical data registration problem facing the joint US military services today, namely, the establishment, in real-time, of accurately correlated positions and tracks for all friendly, unknown, and hostile targets in an operational area, thus providing the total situation awareness required for tactical and C² operations. The fundamental relationships of JTIDS navigation and the error analysis for target registration and target hand-off in both geodetic and relative grid coordinates are presented. Simulation results are provided for two scenarios to demonstrate the level of improvement that JTIDS navigation can have on situation awareness, target acquisition, and weapon delivery. Specifically, it is shown that accurate data registration can be achieved by as few as two JTIDS members, with or without accurate knowledge of geodetic position     

Approximation of Corrected Slant Range in a Radar Surveillance System

Consideration is given to numerical procedures for evaluating the corrected slant range in a radar surveillance system. Applications include air traffic control operations in which such calculations must be performed repeatedly in real time for a multitude of targets without overtaxing available computational resources.     

Stereographic Projection in the National Airspace System

Consideration is given to the calculation of stereographic representations of airborne targets from observations of slant range, azimuth, amd altitude in a multiple radar tracking system. Emphasis is placed upon the translation of the accuracy of the surveillance information into the stereographic plane. Applications include air traffic control operations in which calculations must be performed repeatedly in real time for numerous targets without overtaxing available computational resources.     

Optimal Terminal Rendezvous as a Stochastic Differential Game Problem

The optimal terminal rendezvous of two satellites in orbit about the Earth is studied using a stochastic model and formulating the rendezvous as a game problem. Each satellite has noise-corrupted output measurements and uses a Kalman filter to generate the best estimate of the states describing the rendezvous. The optimal control for the satellites is determined. A comparison is made in terms of dimensionality and complexity to a deterministic solution of the rendezvous problem.     

Decentralized algorithms for netcentric force protection against antiship missiles

We model a decentralized network of decision makers charged with optimally deploying hardkill and/or softkill weapons (countermeasures (CMs)) to defend a task group from antiship missiles. Each platform (decision maker) observes missile threats using a combination of shipboard sensor measurement data and data from other ships, but acts independently when controlling its own weapon systems to cooperatively pursue the defensive objectives of the task group in a decentralized fashion. The main results are a formulation of the missile deflection problem as a stochastic shortest path Markovian game with constraints, a characterization of the Nash equilibrium solution, and a decentralized algorithm for computing the Nash equilibrium when the stochastic game is collaborative. Numerical examples are given to demonstrate the equilibrium policies and illustrate their sensitivity to the missile dynamics.