Search

Target maneuver recognition is a prerequisite for air combat situation awareness, trajectory prediction, threat assessment and maneuver decision. To get rid of the dependence of the current target maneuver recognition method on empirical criteria and sample data, and automatically and adaptively complete the task of extracting the target maneuver pattern, in this paper, an air combat maneuver pattern extraction based on time series segmentation and clustering analysis is proposed by combining autoencoder, G-G clustering algorithm and the selective ensemble clustering analysis algorithm. Firstly, the autoencoder is used to extract key features of maneuvering trajectory to remove the impacts of redundant variables and reduce the data dimension; Then, taking the time information into account, the segmentation of Maneuver characteristic time series is realized with the improved FSTS-AEGG algorithm, and a large number of maneuver primitives are extracted; Finally, the maneuver primitives are grouped into some categories by using the selective ensemble multiple time series clustering algorithm, which can prove that each class represents a maneuver action. The maneuver pattern extraction method is applied to small scale air combat trajectory and can recognize and correctly partition at least 71.3% of maneuver actions，indicating that the method is effective and satisfies the requirements for engineering accuracy. In addition, this method can provide data support for various target maneuvering recognition methods proposed in the literature, greatly reduce the workload and improve the recognition accuracy.

Air combat situation assessment is the basis of target assignment and maneuver decisions. The current air combat situation assessment models, whether nonparametric or parametric, ignore the continuity and timing of situation changes, making the situation assessment results lose tactical significance. Aimed at the shortcomings of current air combat situation assessment, a dynamic air combat situation assessment model based on situation knowledge extraction and weight optimization was proposed by combining a multiple regression model of hidden logic process, a weight optimization model based on grey prospect theory, a weight mapping model based on autoencoder and extreme learning machine (AE-ELM) and an air combat situation characteristic parameter prediction model based on dynamic weight online extreme learning machine (DWOSELM). Firstly, considering the timing and continuity of air combat situation change, a hidden logic process multiple regression model was introduced to realize the segmentation of air combat situation time series data and the extraction of air combat situation primitives. Secondly, the weight optimization method based on grey prospect theory was used to obtain the weight of the evaluation index under different air combat situations. On this basis, the dynamic mapping model between air combat situation characteristic parameters and the weight of index was constructed by using AE-ELM. Then, the dynamic weighted extreme learning machine was used to build the target maneuver trajectory prediction model, and the future position information of the target was predicted. On this basis, the future situation information between the enemy and us was obtained. Finally, the time weight calculation model based on normal cumulative distribution was used to determine the importance of the situation at each time. The situation information at multiple times in the air combat process was fused to obtain the comprehensive air combat situation assessment results at the current time. The simulation results show that the model can fully exploit the influence of historical information, effectively integrate the air combat situation information at multiple moments, and generate the air combat situation assessment results with practical tactical significance according to the individual differences of different pilots.

The multi-objective weapon-target assignment problem, which aims to generate reasonable assignment to meet the objectives, is a typical optimization problem with complex constraints. In order to get close to the actual air combat, the game process between both sides at war is introduced to construct a three objective mathematical model, which includes the damage of the enemy, the cost of missiles, and the damage value of fighting capacity. Considering the NP-complete nature of multi-objective weapon-target assignment problem, an improved intelligent algorithm (named as D-NSGA-III-A) on the basis of non-dominated sorting genetic algorithm III (NSGA-III) is proposed. In this improved algorithm, first, the non-dominated sorting based on dominance degree matrix is proposed to reduce the unnecessary or repetitive comparisons in ranking schemes, so as to further decrease the time consumption. Second, diversity and convergence are taken into account resorting to the niching information and the dominance ratio when selecting individuals. Third, the adaptive operator selection mechanism, which selects the operators adaptively according to the information of generations from a pool where single point crossover and all bits crossover operators are included, is employed to seek a balance between intensification and diversification within the decision space and to improve the quality of Pareto solutions. From the experiments, the combination of above technologies obtains better Pareto solutions and time performance for solving the static multi-objective target assignment (SMWTA) problem than NSGA-III, MP-ACO, NSGA-II, MOPSO, MOEA/D, and DMOEA-εC.

Multiobjective weapon-target assignment is a type of NP-complete problem, and the reasonable assignment of weapons is beneficial to attack and defense. In order to simulate a real battlefield environment, we introduce a new objective—the value of fighter combat on the basis of the original two-objective model. The new three-objective model includes maximizing the expected damage of the enemy, minimizing the cost of missiles, and maximizing the value of fighter combat. To solve the problem with complex constraints, an improved nondominated sorting algorithm III is proposed in this paper. In the proposed algorithm, a series of reference points with good performances in convergence and distribution are continuously generated according to the current population to guide the evolution; otherwise, useless reference points are eliminated. Moreover, an online operator selection mechanism is incorporated into the NSGA-III framework to autonomously select the most suitable operator while solving the problem. Finally, the proposed algorithm is applied to a typical instance and compared with other algorithms to verify its feasibility and effectiveness. Simulation results show that the proposed algorithm is successfully applied to the multiobjective weapon-target assignment problem, which effectively improves the performance of the traditional NSGA-III and can produce better solutions than the two multiobjective optimization algorithms NSGA-II and MPACO.

The weapon-target assignment (WTA) problem, known as an NP-complete problem, aims at seeking a proper assignment of weapons to targets. The biobjective WTA (BOWTA) optimization model which maximizes the expected damage of the enemy and minimizes the cost of missiles is designed in this paper. A modified Pareto ant colony optimization (MPACO) algorithm is used to solve the BOWTA problem. In order to avoid defects in traditional optimization algorithms and obtain a set of Pareto solutions efficiently, MPACO algorithm based on new designed operators is proposed, including a dynamic heuristic information calculation approach, an improved movement probability rule, a dynamic evaporation rate strategy, a global updating rule of pheromone, and a boundary symmetric mutation strategy. In order to simulate real air combat, the pilot operation factor is introduced into the BOWTA model. Finally, we apply the MPACO algorithm and other algorithms to the model and compare the data. Simulation results show that the proposed algorithm is successfully applied in the field of WTA which improves the performance of the traditional P-ACO algorithm effectively and produces better solutions than the two well-known multiobjective optimization algorithms NSGA-II and SPEA-II.

Objectives To assess nuclear protein 1 (NUPR1) level in human gastric cancer (GC) cells, explore the effects of NUPR1 on GC progression, and investigate the possible regulatory mechanism. Methods Immunohistochemistry (IHC), Immunoblot and quantitative PCR assays were conducted to detect the NUPR1 level in human GC tissues and corresponding normal tissues. Also, NUPR1 expression level correlates with clinical features of GC patients. 3-(4,5-Dimethylthiazol-2-Yl)-2,5-Diphenyltetrazolium Bromide (MTT), transwell assays, Immunoblot assays, and flow cytometry (FCM) assays were used to evaluate the effects of NUPR1 on the proliferation, invasion, epithelialmesenchymal transformation (EMT) and apoptosis of GC cells in vitro. Immunoblot assays were performed to detect the potential mechanism in NUPR1-mediated drug resistance. Key findings We found the expression of NUPR1 was upregulated in human gastric cancer tissues and correlated with the clinical features including tumour size, tumour stage and, lymph node metastasis. We further noticed that the depletion of NUPR1 inhibited the invasion and EMT of gastric cancer cells and stimulated the apoptosis. In doxorubicin-resistant gastric cancer cells, yesassociated protein (YAP) activation was up-regulated, and YAP could regulate the expression of NUPR1 to affect drug-resistance. We further provided the evidence that overexpression of NUPR1 reversed the effect of YAP knockdown on cell malignancy and drug resistance via regulating AKT and p21 pathway. Conclusions Our findings indicated the involvement of NUPR1 in the progression of gastric cancer and elucidated its molecular mechanism in regulating drug resistance. [ABSTRACT FROM AUTHOR]