Ripple-effect analysis for operational architecture of air defense systems with supernetwork modeling

In order to solve the problem that the ripple-effect analy- sis for the operational architecture of air defense systems （OAADS） is hardly described in quantity with previous modeling approaches, a supernetwork modeling approach for the OAADS is put for- ward by extending granular computing. Based on that operational units and links are equal to different information granularities, the supernetwork framework of the OAADS is constructed as a “four- network within two-layer” structure by forming dynamic operating coalitions, and measuring indexes of the ripple-effect analysis for the OAADS are given combining with Laplace spectral radius. In this framework, via analyzing multidimensional attributes which inherit relations between operational units in different granular scales, an extended granular computing is put forward integrating with a topological structure. Then the operation process within the supernetwork framework, including transformation relations be- tween two layers in the vertical view and mapping relations among functional networks in the horizontal view, is studied in quantity. As the application case shows, comparing with previous modeling approaches, the supernetwork model can validate and analyze the operation mechanism in the air defense architecture, and the ripple-effect analysis can be used to confirm the key operational unit with micro and macro viewpoints.

Fire Distribution of Integrated Missile-gun Air Defense System Based on Earlier Damage Criterion

The fire distribution can be divided into weapon assignment and firing time scheduling. The criterion of weapon allocation is that a target with greater threat has higher priority. And the criterion of firing time scheduling is that a target can be damaged with the expected probability before a specific time. A fire distribution scheme and a program for the integrated missile-gun air defense system based on a criterion of earlier damage were presented. An example was taken to illustrate its effectiveness.

Optimization of Air Defense System Deployment Against Reconnaissance Drone Swarms

Due to their advantages in flexibility,scalability,survivability,and cost-effectiveness,drone swarms have been increasingly used for reconnaissance tasks and have posed great challenges to their opponents on modern battlefields.This paper studies an optimization problem for deploying air defense systems against reconnaissance drone swarms.Given a set of available air defense systems,the problem determines the location of each air defense system in a predetermined region,such that the cost for enemy drones to pass through the region would be maximized.The cost is calculated based on a counterpart drone path planning problem.To solve this adversarial problem,we first propose an exact iterative search algorithm for small-size problem instances,and then propose an evolutionary framework that uses a specific encoding-decoding scheme for large-size problem instances.We implement the evolutionary framework with six popular evolutionary algorithms.Computational experiments on a set of different test instances validate the effectiveness of our approach for defending against reconnaissance drone swarms.

OPTIMIZATION FOR COMBAT CONFIGURATION OF AIR DEFENSE WEAPON SYSTEMS

At evaluating the combat effectiveness of the defense system, target′s probability to penetrate the defended area is a primary care taking index. In this paper, stochastic model to compete the probability that target penetrates the defended area along any flight path is established by the state analysis and statistical equilibrium analysis of stochastic service system theory. The simulated annealing algorithm is an enlightening random search method based on Monte Carlo recursion, and it can find global optimal solution by simulating annealing process. Combining stochastic model to compete the probability and simulated annealing algorithm, this paper establishes the method to solve problem quantitatively about combat configuration optimization of weapon systems. The calculated result shows that the perfect configuration for fire cells of the weapon is fast found by using this method, and this quantificational method for combat configuration is faster and more scientific than previous one based on principle via map fire field.

An Air Defense Weapon Target Assignment Method Based on Multi-Objective Artificial Bee Colony Algorithm

With the advancement of combat equipment technology and combat concepts,new requirements have been put forward for air defense operations during a group target attack.To achieve high-efficiency and lowloss defensive operations,a reasonable air defense weapon assignment strategy is a key step.In this paper,a multi-objective and multi-constraints weapon target assignment(WTA)model is established that aims to minimize the defensive resource loss,minimize total weapon consumption,and minimize the target residual effectiveness.An optimization framework of air defense weapon mission scheduling based on the multiobjective artificial bee colony(MOABC)algorithm is proposed.The solution for point-to-point saturated attack targets at different operational scales is achieved by encoding the nectar with real numbers.Simulations are performed for an imagined air defense scenario,where air defense weapons are saturated.The non-dominated solution sets are obtained by the MOABC algorithm to meet the operational demand.In the case where there are more weapons than targets,more diverse assignment schemes can be selected.According to the inverse generation distance(IGD)index,the convergence and diversity for the solutions of the non-dominated sorting genetic algorithm III(NSGA-III)algorithm and the MOABC algorithm are compared and analyzed.The results prove that the MOABC algorithm has better convergence and the solutions are more evenly distributed among the solution space.

Dynamic WTA optimization model of air defense operation of warships' formation

WTA （weapon-target allocation） of air defense operation is a very complicated problem and current models focus on static and restricted WTA problem mostly. Based on the dynamic characteristics of air defense operational command and decision of warships＇ formation, a dynamic WTA model is established. Simulation results show that switch fire and repetition fire of anti-air weapon system affect the result of the air defense operation remarkably and the dynamic model is more satisfying than static ones. Related results are gained based on the analysis of the simulation results and the results are accordant with the intuitionistic tactical judgment. The model is some reference for the research of air defense C^3I system of warships＇ formation.

AN ANALYSIS OF THE COST-EFFECTIVENESS OF AIR DEFENSE SURVEILLANCE RADARS

This paper is a study of the quantitative evaluation on the cost-effectiveness of air defense surveillance radars. The composition of life cycle cost of the radar is analysed at first. Then the radar performance and effectiveness formulas are derived. By calculating the values of many radars' cost, performance and effectiveness, tendency curves are plotted. The application of cost-effectiveness calculation and the tendency curves in radar system analysis is discussed at last.

Air and Missile Defense Under Spatial Grasp Technology

A novel control ideology and technology for solving tasks in large distributed networked systems will be briefed. Based on active scenarios self-navigating and self-matching distributed spaces in a highly organized super-virus mode, it can effectively establish global control over large systems of any natures. The technology can use numerous scattered and dissimilar facilities in an integral and holistic way, allowing them to work together in goal-driven supercomputer mode. The approach can be useful for advanced air and missile defense in a variety of ways which is described and explained in this paper.

Distributed Control Technology for Air and Missile Defence Operations

This paper relates to accepted presentation at international conference Air and Missile Defence Technology,November 16-17,2022,London UK(day two),reflecting contents of the presentation slides.It describes applications of the patented and internationally tested Spatial Grasp Technology(SGT)and its Spatial Grasp Language(SGL)for Integrated Air and Missile Defense(IAMD).Based on holistic space navigation and processing by recursive mobile code self-spreading in distributed words,SGT differs radically from traditional management of large systems as consisting of parts exchanging messages.The dynamic network of SGL interpreters can be arbitrarily large and cover terrestrial and celestial environments as powerful spatial engines.The paper contains an example of tracking and destruction of multiple cruise missiles by self-evolving spatial intelligence in SGL using networks of radar stations.It also briefs the growing multiple satellite constellation in Low Earth Orbits(LEO)for potential IAMD applications.Starting from Strategic Defense Initiative(SDI)of the past and then briefing the latest project of Space Development Agency,the paper shows SGL solutions for discovery,tracking,and destroying ballistic missiles and hypersonic gliders with the use of collectively behaving constellations of LEO satellites.It also shows how to organize higher levels of supervision of groups of mobile chasers fighting multiple targets(both potentially as missiles or drones),by providing their global awareness even consciousness in SGL which can drastically improve their performance.The latest version of SGT can be implemented on any platforms and put into operation in a short time,similarly to its previous versions in different countries.

Intermediate carriers for UAV swarms:problem of fleet composition

This article introduces a fleet composition algorithm for a fleet of intermediate carriers, which should deliver a swarm of miniature unmanned aerial vehicles （mini-UAVs） to a mission area. The algorithm is based on the sequential solution of several knapsack problems with various constraints. The algorithm allows both to form an initial set of required types of intermediate carriers, and to generate a fleet of intermediate carriers. The formation of a fleet of intermediate carriers to solve a suppression of enemy air defense （SEAD） problem is presented to illustrate the proposed algorithm.