An evaluation method of contribution rate based on fuzzy Bayesian networks for equipment system-of-systems architecture

The contribution rate of equipment system-of-systems architecture(ESoSA)is an important index to evaluate the equipment update,development,and architecture optimization.Since the traditional ESoSA contribution rate evaluation method does not make full use of the fuzzy information and uncertain information in the equipment system-of-systems(ESoS),and the Bayesian network is an effective tool to solve the uncertain information,a new ESoSA contribution rate evaluation method based on the fuzzy Bayesian network(FBN)is proposed.Firstly,based on the operation loop theory,an ESoSA is constructed considering three aspects:reconnaissance equipment,decision equipment,and strike equipment.Next,the fuzzy set theory is introduced to construct the FBN of ESoSA to deal with fuzzy information and uncertain information.Furthermore,the fuzzy importance index of the root node of the FBN is used to calculate the contribution rate of the ESoSA,and the ESoSA contribution rate evaluation model based on the root node fuzzy importance is established.Finally,the feasibility and rationality of this method are validated via an empirical case study of aviation ESoSA.Compared with traditional methods,the evaluation method based on FBN takes various failure states of equipment into consideration,is free of acquiring accurate probability of traditional equipment failure,and models the uncertainty of the relationship between equipment.The proposed method not only supplements and improves the ESoSA contribution rate assessment method,but also broadens the application scope of the Bayesian network.

Operational requirements analysis method based on question answering of WEKG

The weapon and equipment operational requirement analysis(WEORA) is a necessary condition to win a future war,among which the acquisition of knowledge about weapons and equipment is a great challenge. The main challenge is that the existing weapons and equipment data fails to carry out structured knowledge representation, and knowledge navigation based on natural language cannot efficiently support the WEORA. To solve above problem, this research proposes a method based on question answering(QA) of weapons and equipment knowledge graph(WEKG) to construct and navigate the knowledge related to weapons and equipment in the WEORA. This method firstly constructs the WEKG, and builds a neutral network-based QA system over the WEKG by means of semantic parsing for knowledge navigation. Finally, the method is evaluated and a chatbot on the QA system is developed for the WEORA. Our proposed method has good performance in the accuracy and efficiency of searching target knowledge, and can well assist the WEORA.

Weapons system portfolio selection based on the contribution rate evaluation of system of systems

The weapons system portfolio selection problem arises at the equipment demonstration stage and deals with the military application requirements.Further,the contribution rate of the system is one of the important indicators to evaluate the role of a system,which can facilitate the weapons system portfolio selection.Therefore,combining the system contribution rate with system portfolio selection is the focus of this study.It also focuses on calculating the contribution rates of multiple equipment systems with various types of capabilities.The contribution rate is measured by establishing a hierarchical multi-criteria value model from three dimensions.Based on the value model,the feasible portfolios are developed under certain cost constraints and the optimal weapons system portfolios are obtained by using the classification optimization selection strategy.Finally,an illustrative example is presented to verify the feasibility of the proposed model.

Service-oriented weapon systems of system portfolio selection method

Weapon system portfolio selection is an important combinatorial problem that arises in various applications,such as weapons development planning and equipment procurement,which are of concern to military decision makers.However,the existing weapon system-of-systems(SoS)is tightly coupled.Because of the diversity and connectivity of mission requirements,it is difficult to describe the direct mapping relationship from the mission to the weapon system.In the latest service-oriented research,the introduction of service modules to build a service-oriented,flexible,and combinable structure is an important trend.This paper proposes a service-oriented weapon system portfolio selection method,by introducing service to serve as an intermediary to connect missions and system selection,and transferring the weapon system selection into the service portfolio selection.Specifically,the relation between the service and the task is described through the service-task mapping matrix;and the relation between the service and the weapon system is constructed through the servicesystem mapping matrix.The service collaboration network to calculate the flexibility and connectivity of each service portfolio is then established.Through multi-objective programming,the optimal service portfolios are generated,which are further decoded into weapon system portfolios.

Research on strategic risk identification method of equipment system development based on system dynamics

Strategic management of equipment system develop-ment must attach importance to effective strategic risk manage-ment.Aiming at the identification of strategic risk of equipment system development,firstly,the source of strategic risk of equip-ment system development is analyzed and classified.Based on this,a causal loop diagram of strategic risk of equipment sys-tem development based on system dynamics is established.The system dynamics analysis software Vensim PLE is used to carry out the risk influencing factors analysis,risk consequences ana-lysis,risk feedback loop identification and corresponding pre-control measures,and achieves a good risk identification effect.

TOA positioning algorithm of LBL system for underwater target based on PSO

For the underwater long baseline(LBL)positioning systems,the traditional distance intersection algorithm simplifies the sound speed to a constant,and calculates the underwa-ter target position parameters with a nonlinear iteration.However,due to the complex underwater environment,the sound speed changes with time and space,and then the acoustic propagation path is actually a curve,which inevitably causes some errors to the traditional distance intersection positioning algorithm.To reduce the position error caused by the uncertain underwater sound speed,a new time of arrival(TOA)intersection underwater positioning algorithm of LBL system is proposed.Firstly,combined with the vertical layered model of the underwater sound speed,an implicit positioning model of TOA intersection is constructed through the constant gradient acoustic ray tracing.And then an optimization function based on the overall TOA residual square sum is advanced to solve the position parameters for the underwater target.Moreover,the particle swarm optimization(PSO)algorithm is replaced with the tra-ditional nonlinear least square method to optimize the implicit positioning model of TOA intersection.Compared with the traditional distance intersection positioning model,the TOA intersec-tion positioning model is more suitable for the engineering practice and the optimization algorithm is more effective.Simulation results show that the proposed methods in this paper can effectively improve the positioning accuracy for the underwater target.

Complex systems and network science:a survey

Complex systems widely exist in nature and human society.There are complex interactions between system elements in a complex system,and systems show complex features at the macro level,such as emergence,self-organization,uncertainty,and dynamics.These complex features make it difficult to understand the internal operation mechanism of complex systems.Networked modeling of complex systems is a favorable means of understanding complex systems.It not only represents complex interactions but also reflects essential attributes of complex systems.This paper summarizes the research progress of complex systems modeling and analysis from the perspective of network science,including networked modeling,vital node analysis,network invulnerability analysis,network disintegration analysis,resilience analysis,complex network link prediction,and the attacker-defender game in complex networks.In addition,this paper presents some points of view on the trend and focus of future research on network analysis of complex systems.

Network-based structure optimization method of the anti-aircraft system

The anti-aircraft system plays an irreplaceable role in modern combat. An anti-aircraft system consists of various types of functional entities interacting to destroy the hostile aircraft moving in high speed. The connecting structure of combat entities in it is of great importance for supporting the normal process of the system. In this paper, we explore the optimizing strategy of the structure of the anti-aircraft network by establishing extra communication channels between the combat entities.Firstly, the thought of combat network model(CNM) is borrowed to model the anti-aircraft system as a heterogeneous network. Secondly, the optimization objectives are determined as the survivability and the accuracy of the system. To specify these objectives, the information chain and accuracy chain are constructed based on CNM. The causal strength(CAST) logic and influence network(IN) are introduced to illustrate the establishment of the accuracy chain. Thirdly, the optimization constraints are discussed and set in three aspects: time, connection feasibility and budget. The time constraint network(TCN) is introduced to construct the timing chain and help to detect the timing consistency. Then, the process of the multi-objective optimization of the structure of the anti-aircraft system is designed.Finally, a simulation is conducted to prove the effectiveness and feasibility of the proposed method. Non-dominated sorting based genetic algorithm-Ⅱ(NSGA2) is used to solve the multiobjective optimization problem and two other algorithms including non-dominated sorting based genetic algorithm-Ⅲ(NSGA3)and strength Pareto evolutionary algorithm-Ⅱ(SPEA2) are employed as comparisons. The deciders and system builders can make the anti-aircraft system improved in the survivability and accuracy in the combat reality.

Complex task planning method of space-aeronautics cooperative observation based on multi-layer interaction

With the new development trend of multi-resource coordinated Earth observation and the new goal of Earth observation application of“short response time,high observation accuracy,and wide coverage”,space-aeronautics cooperative complex task planning problem has become an urgent problem to be solved.The focus of this problem is to use multiple resources to perform collaborative observations on complex tasks.By analyzing the process from task assignment to receiving task observation results,we propose a multi-layer interactive task planning framework which is composed of a preprocessing method for complex tasks,a task allocation layer,a task planning layer,and a task coordination layer.According to the characteristics of the framework,a hybrid genetic parallel tabu(HGPT)algorithm is proposed on this basis.The algorithm uses genetic annealing algorithm(GAA),parallel tabu(PT)algorithm,and heuristic rules to achieve task allocation,task planning,and task coordination.At the same time,coding improvements,operator design,annealing operations,and parallel calculations are added to the algorithm.In order to verify the effectiveness of the algorithm,simulation experiments under complex task scenarios of different scales are carried out.Experimental results show that this method can effectively solve the problems of observing complex tasks.Meanwhile,the optimization effect and convergence speed of the HGPT is better than that of the related algorithms.

Ensemble of Population-Based Metaheuristic Algorithms

No optimization algorithm can obtain satisfactory results in all optimization tasks.Thus,it is an effective way to deal with the problem by an ensemble ofmultiple algorithms.This paper proposes an ensemble of population-based metaheuristics(EPM)to solve single-objective optimization problems.The design of the EPM framework includes three stages:the initial stage,the update stage,and the final stage.The framework applies the transformation of the real and virtual population to balance the problem of exploration and exploitation at the population level and uses an elite strategy to communicate among virtual populations.The experiment tested two benchmark function sets with fivemetaheuristic algorithms and four ensemble algorithms.The ensemble algorithms are generally superior to the original algorithms by Friedman’s average ranking andWilcoxon signed ranking test results,demonstrating the ensemble framework’s effect.By solving the iterative curves of different test functions,we can see that the ensemble algorithms have faster iterative optimization speed and better optimization results.The ensemble algorithms cannot fall into local optimumby virtual populations distribution map of several stages.The ensemble framework performs well from the effects of solving two practical engineering problems.Some results of ensemble algorithms are superior to those of metaheuristic algorithms not included in the ensemble framework,further demonstrating the ensemble method’s potential and superiority.

Joint mission and route planning of unmanned air vehicles via a learning-based heuristic

Unmanned air vehicles(UAVs) have been regularly employed in modern wars to conduct different missions. Instead of addressing mission planning and route planning separately,this study investigates the issue of joint mission and route planning for a fleet of UAVs. The mission planning determines the configuration of weapons in UAVs and the weapons to attack targets, while the route planning determines the UAV’s visiting sequence for the targets. The problem is formulated as an integer linear programming model. Due to the inefficiency of CPLEX on large scale optimization problems, an effective learningbased heuristic, namely, population based adaptive large neighborhood search(P-ALNS), is proposed to solve the model. In P-ALNS, seven neighborhood structures are designed and adaptively utilized in terms of their historical performance. The effectiveness and superiority of the proposed model and algorithm are demonstrated on test instances of small, medium and large sizes. In particular, P-ALNS achieves comparable solutions or as good as those of CPLEX on small-size(20 targets)instances in much shorter time.

The Research on the Impact Factors of the Comprehensive Evaluation of Communication Unit Camps Based on Analytic Hierarchy Process

Currently, the comprehensive assessment of the communication troops’ camp planning project is primarily qualitative, with limited quantitative evaluation. Drawing upon the relevant spirit of the Military Commission’s documents and leveraging the author’s own work experience in branch offices, this article thoroughly explores the factors influencing the comprehensive assessment of the project and proposes quantitative representation methods for these factors. Utilizing the Analytic Hierarchy Process (AHP), a hierarchical structure model and judgment matrix for the evaluation factors of the communication troops’ camp construction planning project are constructed, enabling the determination of the weightage of each factor. This provides a certain level of support and reference for the project approval and management by branch offices, while also offering valuable insights for the approval and management of camp planning and construction projects in other types of troops and battlefield projects.

Requirements ranking based on crowd-sourcing high-end product USs

Based on the characteristics of high-end products,crowd-sourcing user stories can be seen as an effective means of gathering requirements,involving a large user base and generating a substantial amount of unstructured feedback.The key challenge lies in transforming abstract user needs into specific ones,requiring integration and analysis.Therefore,we propose a topic mining-based approach to categorize,summarize,and rank product requirements from user stories.Specifically,after determining the number of story categories based on py LDAvis,we initially classify“I want to”phrases within user stories.Subsequently,classic topic models are applied to each category to generate their names,defining each post-classification user story category as a requirement.Furthermore,a weighted ranking function is devised to calculate the importance of each requirement.Finally,we validate the effectiveness and feasibility of the proposed method using 2966 crowd-sourced user stories related to smart home systems.

Learning to Branch in Combinatorial Optimization With Graph Pointer Networks

Traditional expert-designed branching rules in branch-and-bound(B&B) are static, often failing to adapt to diverse and evolving problem instances. Crafting these rules is labor-intensive, and may not scale well with complex problems.Given the frequent need to solve varied combinatorial optimization problems, leveraging statistical learning to auto-tune B&B algorithms for specific problem classes becomes attractive. This paper proposes a graph pointer network model to learn the branch rules. Graph features, global features and historical features are designated to represent the solver state. The graph neural network processes graph features, while the pointer mechanism assimilates the global and historical features to finally determine the variable on which to branch. The model is trained to imitate the expert strong branching rule by a tailored top-k Kullback-Leibler divergence loss function. Experiments on a series of benchmark problems demonstrate that the proposed approach significantly outperforms the widely used expert-designed branching rules. It also outperforms state-of-the-art machine-learning-based branch-and-bound methods in terms of solving speed and search tree size on all the test instances. In addition, the model can generalize to unseen instances and scale to larger instances.

An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms.

Application of Simple Adaptive Control to Water Hydraulic Servo Cylinder System

Although conventional model reference adaptive control (MRAC) achieves good tracking performance for cylinder control, the controller structure is much more complicated and has less robustness to disturbance in real applications. This paper discusses the use of simple adaptive control (SAC) for positioning a water hydraulic servo cylinder system. Compared with MRAC, SAC has a simpler and lower order structure, i.e., higher feasibility. The control performance of SAC is examined and evaluated on a water hydraulic servo cylinder system. With the recent increased concerns over global environmental problems, the water hydraulic technique using pure tap water as a pressure medium has become a new drive source comparable to electric, oil hydraulic, and pneumatic drive systems. This technique is also preferred because of its high power density, high safety against fire hazards in production plants, and easy availability. However, the main problems for precise control in a water hydraulic system are steady state errors and overshoot due to its large friction torque and considerable leakage flow. MRAC has been already applied to compensate for these effects, and better control performances have been obtained. However, there have been no reports on the application of SAC for water hydraulics. To make clear the merits of SAC, the tracking control performance and robustness are discussed based on experimental results. SAC is confirmed to give better tracking performance compared with PI control, and a control precision comparable to MRAC (within 10 μm of the reference position) and higher robustness to parameter change, despite the simple controller. The research results ensure a wider application of simple adaptive control in real mechanical systems.

Resource allocation optimization of equipment development task based on MOPSO algorithm

Resource allocation for an equipment development task is a complex process owing to the inherent characteristics,such as large amounts of input resources,numerous sub-tasks,complex network structures,and high degrees of uncertainty.This paper presents an investigation into the influence of resource allocation on the duration and cost of sub-tasks.Mathematical models are constructed for the relationships of the resource allocation quantity with the duration and cost of the sub-tasks.By considering the uncertainties,such as fluctuations in the sub-task duration and cost,rework iterations,and random overlaps,the tasks are simulated for various resource allocation schemes.The shortest duration and the minimum cost of the development task are first formulated as the objective function.Based on a multi-objective particle swarm optimization(MOPSO)algorithm,a multi-objective evolutionary algorithm is constructed to optimize the resource allocation scheme for the development task.Finally,an uninhabited aerial vehicle(UAV)is considered as an example of a development task to test the algorithm,and the optimization results of this method are compared with those based on non-dominated sorting genetic algorithm-II(NSGA-II),non-dominated sorting differential evolution(NSDE)and strength pareto evolutionary algorithm-II(SPEA-II).The proposed method is verified for its scientific approach and effectiveness.The case study shows that the optimization of the resource allocation can greatly aid in shortening the duration of the development task and reducing its cost effectively.

Multi-objective optimization of operation loop recommendation for kill web

In order to improve our military ’s level of intelligent accusation decision-making in future intelligent joint warfare, this paper studies operation loop recommendation methods for kill web based on the fundamental combat form of the future, i.e.,“web-based kill,” and the operation loop theory. Firstly, we pioneer the operation loop recommendation problem with operation ring quality as the objective and closed-loop time as the constraint, and construct the corresponding planning model.Secondly, considering the case where there are multiple decision objectives for the combat ring recommendation problem,we propose for the first time a multi-objective optimization algorithm, the multi-objective ant colony evolutionary algorithm based on decomposition(MOACEA/D), which integrates the multi-objective evolutionary algorithm based on decomposition(MOEA/D) with the ant colony algorithm. The MOACEA/D can converge the optimal solutions of multiple single objectives nondominated solution set for the multi-objective problem. Finally,compared with other classical multi-objective optimization algorithms, the MOACEA/D is superior to other algorithms superior in terms of the hyper volume(HV), which verifies the effectiveness of the method and greatly improves the quality and efficiency of commanders’ decision-making.

Reliability Modeling of Phased Mission System with Phase Backup by Stochastic Petri Net

This paper presents a modeling method by stochastic Petri net for reliability analysis of phased mission system( PMS) with phase backup. The model consisting of petri nets,depicts the system behaviors of unit level,system logic level and phase level. Guard functions of petri nets are used to avoid modeling complexity and make the model flexible to different reliability logical structures. It was shown that the time redundancy within phase and from phase backup for PMS can both be described by use of the proposed model.

Reactive scheduling of multiple EOSs under cloud uncertainties:model and algorithms

Most earth observation satellites(EOSs)are low-orbit satellites equipped with optical sensors that cannot see through clouds.Hence,cloud coverage,high dynamics,and cloud uncertainties are important issues in the scheduling of EOSs.The proactive-reactive scheduling framework has been proven to be effective and efficient for the uncertain scheduling problem and has been extensively employed.Numerous studies have been conducted on methods for the proactive scheduling of EOSs,including expectation,chance-constrained,and robust optimization models and the relevant solution algorithms.This study focuses on the reactive scheduling of EOSs under cloud uncertainties.First,using an example,we describe the reactive scheduling problem in detail,clarifying its significance and key issues.Considering the two key objectives of observation profits and scheduling stability,we construct a multi-objective optimization mathematical model.Then,we obtain the possible disruptions of EOS scheduling during execution under cloud uncertainties,adopting an event-driven policy for the reactive scheduling.For the different disruptions,different reactive scheduling algorithms are designed.Finally,numerous simulation experiments are conducted to verify the feasibility and effectiveness of the proposed reactive scheduling algorithms.The experimental results show that the reactive scheduling algorithms can both improve observation profits and reduce system perturbations.