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 model...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.展开更多
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 targe...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.展开更多
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 o...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.展开更多
基金supported by the National Natural Science Foundation of China(61272011)
文摘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.
文摘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.
基金supported by the National Natural Science Foundation of China(71771216).
文摘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.
