Autonomous umanned aerial vehicle(UAV) manipulation is necessary for the defense department to execute tactical missions given by commanders in the future unmanned battlefield. A large amount of research has been devo...Autonomous umanned aerial vehicle(UAV) manipulation is necessary for the defense department to execute tactical missions given by commanders in the future unmanned battlefield. A large amount of research has been devoted to improving the autonomous decision-making ability of UAV in an interactive environment, where finding the optimal maneuvering decisionmaking policy became one of the key issues for enabling the intelligence of UAV. In this paper, we propose a maneuvering decision-making algorithm for autonomous air-delivery based on deep reinforcement learning under the guidance of expert experience. Specifically, we refine the guidance towards area and guidance towards specific point tasks for the air-delivery process based on the traditional air-to-surface fire control methods.Moreover, we construct the UAV maneuvering decision-making model based on Markov decision processes(MDPs). Specifically, we present a reward shaping method for the guidance towards area and guidance towards specific point tasks using potential-based function and expert-guided advice. The proposed algorithm could accelerate the convergence of the maneuvering decision-making policy and increase the stability of the policy in terms of the output during the later stage of training process. The effectiveness of the proposed maneuvering decision-making policy is illustrated by the curves of training parameters and extensive experimental results for testing the trained policy.展开更多
A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple...A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers （DMs） can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.展开更多
In military service joint operations, when there are more operational forces, more multifarious materials are consumed, the support is more complex and fuzzy, the deployment of personnel is more rapid, and the support...In military service joint operations, when there are more operational forces, more multifarious materials are consumed, the support is more complex and fuzzy, the deployment of personnel is more rapid, and the support provided by wartime military material support powers can be more effective. When the principles,requirements, influencing factors and goals of military material support forces are deployed in wartime, an evaluation indicator system is established. Thus, a new combined empowerment method based on an analytic hierarchy process（AHP） is developed to calculate the subjective weights, and the rough entropy method is used to calculate the objective weights. Combination weights can be obtained by calculating the weight preference coefficient error, which is determined by combining the cooperative game method and the minimum deviation into objectives. This approach can determine the grey relation projection coefficient and synthesize the measure scheme superiority to finally optimize the deployment plan using the grey relation projection decision-making method. The results show that the method is feasible and effective;it can provide a more scientific and practical decision-making basis for the military material support power deployment in wartime.展开更多
In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and t...In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.展开更多
In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base...In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.展开更多
An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and sa...An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.展开更多
The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to...The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.展开更多
To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO al...To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and inte-grates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evo-lution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection opti-mization of paths, gradually reducing algorithmic space, accele-rating convergence, and enhances path cooperativity. Simula-tion experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demon-strate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. More-over it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collabora-tive path planning. The experiments are conducted in three col-laborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality.展开更多
Aiming at the intervention decision-making problem in manned/unmanned aerial vehicle（MAV/UAV） cooperative engagement, this paper carries out a research on allocation strategy of emergency discretion based on human f...Aiming at the intervention decision-making problem in manned/unmanned aerial vehicle（MAV/UAV） cooperative engagement, this paper carries out a research on allocation strategy of emergency discretion based on human factors engineering（HFE）.Firstly, based on the brief review of research status of HFE, it gives structural description to emergency in the process of cooperative engagement and analyzes intervention of commanders. After that,constraint conditions of intervention decision-making of commanders based on HFE（IDMCBHFE） are given, and the mathematical model, which takes the overall efficiency value of handling emergencies as the objective function, is established. Then, through combining K-best and variable neighborhood search（VNS） algorithm, a K-best optimization variable neighborhood search mixed algorithm（KBOVNSMA） is designed to solve the model. Finally,through three groups of simulation experiments, effectiveness and superiority of the proposed algorithm are verified.展开更多
To solve the uncertain multi-attribute group decision-making of unknown attribute weights,three optimal models are built to decide the corresponding ideal solution weights,standard deviation weights and mean deviation...To solve the uncertain multi-attribute group decision-making of unknown attribute weights,three optimal models are built to decide the corresponding ideal solution weights,standard deviation weights and mean deviation weights.The comprehensive attribute weights are gotten through the product of the above three kinds of weights.And each decision maker＇s weighted decision matrices are also received by using the integrated attribute weights.The closeness degrees are also gotten by use of technique for order preference by similarity to ideal solution（TOPSIS） through dealing with the weighted decision matrices.At the same time the group decision matrix and weighted group decision matrix are gotten by using each decision-maker＇s closeness degree to every project.Then the vertical TOPSIS method is used to calculate the closeness degree of each project.So these projects can be ranked according to their values of the closeness degree.The process of the method is also given step by step.Finally,a numerical example demonstrates the feasibility and effectiveness of the approach.展开更多
According to the aggregation method of experts＇ evaluation information in group decision-making,the existing methods of determining experts＇ weights based on cluster analysis take into account the expert＇s preferen...According to the aggregation method of experts＇ evaluation information in group decision-making,the existing methods of determining experts＇ weights based on cluster analysis take into account the expert＇s preferences and the consistency of expert＇s collating vectors,but they lack of the measure of information similarity.So it may occur that although the collating vector is similar to the group consensus,information uncertainty is great of a certain expert.However,it is clustered to a larger group and given a high weight.For this,a new aggregation method based on entropy and cluster analysis in group decision-making process is provided,in which the collating vectors are classified with information similarity coefficient,and the experts＇ weights are determined according to the result of classification,the entropy of collating vectors and the judgment matrix consistency.Finally,a numerical example shows that the method is feasible and effective.展开更多
Game theory can be applied to the air combat decision-making problem of multiple unmanned combat air vehicles(UCAVs).However,it is difficult to have satisfactory decision-making results completely relying on air comba...Game theory can be applied to the air combat decision-making problem of multiple unmanned combat air vehicles(UCAVs).However,it is difficult to have satisfactory decision-making results completely relying on air combat situation information,because there is a lot of time-sensitive information in a complex air combat environment.In this paper,a constraint strategy game approach is developed to generate intelligent decision-making for multiple UCAVs in complex air combat environment with air combat situation information and time-sensitive information.Initially,a constraint strategy game is employed to model attack-defense decision-making problem in complex air combat environment.Then,an algorithm is proposed for solving the constraint strategy game based on linear programming and linear inequality(CSG-LL).Finally,an example is given to illustrate the effectiveness of the proposed approach.展开更多
Pursuing the green manufacturing (GM) of products i s very beneficial in the alleviation of environment burdens. In order to reap such benefits, green manufacturing is involved in every aspect of manufacturing proc es...Pursuing the green manufacturing (GM) of products i s very beneficial in the alleviation of environment burdens. In order to reap such benefits, green manufacturing is involved in every aspect of manufacturing proc esses. During the machining process, cutting fluid is one of the main roots of e nvironmental pollution. And how to make an optimal selection for cutting fluid f or GM is an important path to reduce the environmental pollution. The objective factors of decision-making problems in the traditional selection of cutting flu id are usually two: quality and cost. But from the viewpoint of GM, environmenta l impact (E) should be considered together. In this paper, a multi-object d ecision-making model of cutting fluid selection for GM is put forward, in which the objects of Quality (Q), Cost(C) and Environmental impact (E) are considered together. In this model, E means to minimize the environmental impact, Q means to maximize the quality and C means to minimize the cost. Each objective is anal yzed in detail too. A case study on a decision-making problem of cutting fluid selection in a gear hobbing process is analyzed, and the result shows the model is practical.展开更多
The manner and conditions of running the decision-making system with self-defense electronic jamming are given. After proposing the scenario of applying discrete dynamic Bayesian network to the decision making with se...The manner and conditions of running the decision-making system with self-defense electronic jamming are given. After proposing the scenario of applying discrete dynamic Bayesian network to the decision making with self-defense electronic jamming, a decision-making model with self-defense electronic jamming based on the discrete dynamic Bayesian network is established. Then jamming decision inferences by the aid of the algorithm of discrete dynamic Bayesian network are carried on. The simulating result shows that this method is able to synthesize different targets which are not predominant. In this way, various features at the same time, as well as the same feature appearing at different time complement mutually; in addition, the accuracy and reliability of electronic jamming decision making are enhanced significantly.展开更多
It is not uncommon in multiple criteria decision-making that the numerical values of alternatives of some criteria are subject to imprecision, uncertainty and indetermination and the information on weights of criteria...It is not uncommon in multiple criteria decision-making that the numerical values of alternatives of some criteria are subject to imprecision, uncertainty and indetermination and the information on weights of criteria is incomplete certain. A new multiple criteria decision- making method with incomplete certain information based on ternary AHP is proposed. This improves on Takeda＇s method. In this method, the ternary comparison matrix of the alternatives under each pseudo-criteria is constructed, the eigenvector associated with the maximum eigenvalue of the ternary comparison matrix is attained as to normalize priority vector of the alternatives, then the order of alternatives is obtained by solving two kinds of linear programming problems. Finally, an example is given to show the feasibility and effectiveness of the method.展开更多
With the fast growth of Chinese economic, more and more capital will be invested in environmental projects. How to select the environmental investment projects （alternatives） for obtaining the best environmental qua...With the fast growth of Chinese economic, more and more capital will be invested in environmental projects. How to select the environmental investment projects （alternatives） for obtaining the best environmental quality and economic benefits is an important problem for the decision makers. The purpose of this paper is to develop a decision-making model to rank a finite number of alternatives with several and sometimes conflicting criteria. A model for ranking the projects of municipal sewage treatment plants is proposed by using exports＇ information and the data of the real projects. And, the ranking result is given based on the PROMETHEE method. Furthermore, by means of the concept of the weight stability intervals （WSI）, the sensitivity of the ranking results to the size of criteria values and the change of weights value of criteria are discussed. The result shows that some criteria, such as “proportion of benefit to project cost”, will influence the ranking result of alternatives very strong while others not. The influence are not only from the value of criterion but also from the changing the weight of criterion. So, some criteria such as “proportion of benefit to project cost” are key critera for ranking the projects. Decision makers must be cautious to them.展开更多
Multi-attribute group decision-making problems are considered where information on both attribute weights and value scores of consequences is incomplete.In group decision analysis,if preference information about alter...Multi-attribute group decision-making problems are considered where information on both attribute weights and value scores of consequences is incomplete.In group decision analysis,if preference information about alternatives is provided by participants,it should be verified whether there exist compromise weights that can support all the preference relations.The different compromise weight vectors may differ for the ranking of the alternatives.In the case that compromise weights exist,the method is proposed to find out all the compromise weight vectors in order to rank the alternatives.Based on the new feasible domain of attribute weights determined by all the compromise weight vectors and the incomplete information on value scores of consequences,dominance relations between alternatives are checked by a nonlinear goal programming model which can be transformed into a linear one by adopting a transformation.The checked dominance relations uniformly hold for all compromise weight vectors and the incomplete information on value scores of consequences.A final ranking of the alternatives can be obtained by aggregating these dominance relations.展开更多
The decision-making under complex urban environment become one of the key issues that restricts the rapid development of the autonomous vehicles. The difficulty in making timely and accurate decisions like human being...The decision-making under complex urban environment become one of the key issues that restricts the rapid development of the autonomous vehicles. The difficulty in making timely and accurate decisions like human beings under highly dynamic traffic environment is a major challenge for autonomous driving. Car-following has been regarded as the simplest but essential driving behavior among driving tasks and has received extensive attention from researchers around the world. This work addresses this problem and proposes a novel method RSAN(rough-set artificial neural network) to learn the decisions from excellent human drivers. A virtual urban traffic environment was built by Pre Scan and driving simulation was conducted to obtain a broad set of relevant data such as experienced drivers' behavior data and surrounding vehicles' motion data. Then, rough set was used to preprocess these data to extract the key influential factors on decision and reduce the impact of uncertain data and noise data. And the car-following decision was learned by neural network in which key factor was the input and acceleration was the output. The result shows the better convergence speed and the better decision accuracy of RSAN than ANN. Findings of this work contributes to the empirical understanding of driver's decision-making process and it provides a theoretical basis for the study of car-following decision-making under complex and dynamic environment.展开更多
基金supported by the Key Research and Development Program of Shaanxi (2022GXLH-02-09)the Aeronautical Science Foundation of China (20200051053001)the Natural Science Basic Research Program of Shaanxi (2020JM-147)。
文摘Autonomous umanned aerial vehicle(UAV) manipulation is necessary for the defense department to execute tactical missions given by commanders in the future unmanned battlefield. A large amount of research has been devoted to improving the autonomous decision-making ability of UAV in an interactive environment, where finding the optimal maneuvering decisionmaking policy became one of the key issues for enabling the intelligence of UAV. In this paper, we propose a maneuvering decision-making algorithm for autonomous air-delivery based on deep reinforcement learning under the guidance of expert experience. Specifically, we refine the guidance towards area and guidance towards specific point tasks for the air-delivery process based on the traditional air-to-surface fire control methods.Moreover, we construct the UAV maneuvering decision-making model based on Markov decision processes(MDPs). Specifically, we present a reward shaping method for the guidance towards area and guidance towards specific point tasks using potential-based function and expert-guided advice. The proposed algorithm could accelerate the convergence of the maneuvering decision-making policy and increase the stability of the policy in terms of the output during the later stage of training process. The effectiveness of the proposed maneuvering decision-making policy is illustrated by the curves of training parameters and extensive experimental results for testing the trained policy.
基金supported by the National Aerospace Science Foundation of China(20138053038)the Graduate Starting Seed Fund of Northwestern Polytechnical University(Z2015111)
文摘A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm （NGA） is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers （DMs） can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload.
基金supported by the Education Science Fund of the Military Science Institute of Beijing,China(2015JY320)
文摘In military service joint operations, when there are more operational forces, more multifarious materials are consumed, the support is more complex and fuzzy, the deployment of personnel is more rapid, and the support provided by wartime military material support powers can be more effective. When the principles,requirements, influencing factors and goals of military material support forces are deployed in wartime, an evaluation indicator system is established. Thus, a new combined empowerment method based on an analytic hierarchy process（AHP） is developed to calculate the subjective weights, and the rough entropy method is used to calculate the objective weights. Combination weights can be obtained by calculating the weight preference coefficient error, which is determined by combining the cooperative game method and the minimum deviation into objectives. This approach can determine the grey relation projection coefficient and synthesize the measure scheme superiority to finally optimize the deployment plan using the grey relation projection decision-making method. The results show that the method is feasible and effective;it can provide a more scientific and practical decision-making basis for the military material support power deployment in wartime.
基金Supported by the Natural Science Foundation of Chongqing(General Program,NO.CSTB2022NSCQ-MSX0884)Discipline Teaching Special Project of Yangtze Normal University(csxkjx14)。
文摘In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.
基金Shanxi Province Higher Education Science and Technology Innovation Fund Project(2022-676)Shanxi Soft Science Program Research Fund Project(2016041008-6)。
文摘In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
文摘In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.
基金supported by the National Key Research and Development Program(2021YFB3502500).
文摘An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.
基金supported by the National Social Science Fund of China(2022-SKJJ-B-084).
文摘The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.
基金supported by Hunan Provincial Natural Science Foundation(2024JJ5173,2023JJ50047)Hunan Provincial Department of Education Scientific Research Project(23A0494)Hunan Provincial Innovation Foundation for Postgraduate(CX20231221).
文摘To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and inte-grates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evo-lution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection opti-mization of paths, gradually reducing algorithmic space, accele-rating convergence, and enhances path cooperativity. Simula-tion experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demon-strate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. More-over it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collabora-tive path planning. The experiments are conducted in three col-laborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality.
基金supported by the National Natural Science Foundation of China(61573017)the Doctoral Foundation of Air Force Engineering University(KGD08101604)
文摘Aiming at the intervention decision-making problem in manned/unmanned aerial vehicle（MAV/UAV） cooperative engagement, this paper carries out a research on allocation strategy of emergency discretion based on human factors engineering（HFE）.Firstly, based on the brief review of research status of HFE, it gives structural description to emergency in the process of cooperative engagement and analyzes intervention of commanders. After that,constraint conditions of intervention decision-making of commanders based on HFE（IDMCBHFE） are given, and the mathematical model, which takes the overall efficiency value of handling emergencies as the objective function, is established. Then, through combining K-best and variable neighborhood search（VNS） algorithm, a K-best optimization variable neighborhood search mixed algorithm（KBOVNSMA） is designed to solve the model. Finally,through three groups of simulation experiments, effectiveness and superiority of the proposed algorithm are verified.
基金supported by the Research Innovation Project of Shanghai Education Committee (08YS19)the Excellent Young Teacher Project of Shanghai University
文摘To solve the uncertain multi-attribute group decision-making of unknown attribute weights,three optimal models are built to decide the corresponding ideal solution weights,standard deviation weights and mean deviation weights.The comprehensive attribute weights are gotten through the product of the above three kinds of weights.And each decision maker＇s weighted decision matrices are also received by using the integrated attribute weights.The closeness degrees are also gotten by use of technique for order preference by similarity to ideal solution（TOPSIS） through dealing with the weighted decision matrices.At the same time the group decision matrix and weighted group decision matrix are gotten by using each decision-maker＇s closeness degree to every project.Then the vertical TOPSIS method is used to calculate the closeness degree of each project.So these projects can be ranked according to their values of the closeness degree.The process of the method is also given step by step.Finally,a numerical example demonstrates the feasibility and effectiveness of the approach.
文摘According to the aggregation method of experts＇ evaluation information in group decision-making,the existing methods of determining experts＇ weights based on cluster analysis take into account the expert＇s preferences and the consistency of expert＇s collating vectors,but they lack of the measure of information similarity.So it may occur that although the collating vector is similar to the group consensus,information uncertainty is great of a certain expert.However,it is clustered to a larger group and given a high weight.For this,a new aggregation method based on entropy and cluster analysis in group decision-making process is provided,in which the collating vectors are classified with information similarity coefficient,and the experts＇ weights are determined according to the result of classification,the entropy of collating vectors and the judgment matrix consistency.Finally,a numerical example shows that the method is feasible and effective.
基金supported by Major Projects for Science and Technology Innovation 2030(Grant No.2018AA0100800)Equipment Pre-research Foundation of Laboratory(Grant No.61425040104)in part by Jiangsu Province“333”project under Grant BRA2019051.
文摘Game theory can be applied to the air combat decision-making problem of multiple unmanned combat air vehicles(UCAVs).However,it is difficult to have satisfactory decision-making results completely relying on air combat situation information,because there is a lot of time-sensitive information in a complex air combat environment.In this paper,a constraint strategy game approach is developed to generate intelligent decision-making for multiple UCAVs in complex air combat environment with air combat situation information and time-sensitive information.Initially,a constraint strategy game is employed to model attack-defense decision-making problem in complex air combat environment.Then,an algorithm is proposed for solving the constraint strategy game based on linear programming and linear inequality(CSG-LL).Finally,an example is given to illustrate the effectiveness of the proposed approach.
文摘Pursuing the green manufacturing (GM) of products i s very beneficial in the alleviation of environment burdens. In order to reap such benefits, green manufacturing is involved in every aspect of manufacturing proc esses. During the machining process, cutting fluid is one of the main roots of e nvironmental pollution. And how to make an optimal selection for cutting fluid f or GM is an important path to reduce the environmental pollution. The objective factors of decision-making problems in the traditional selection of cutting flu id are usually two: quality and cost. But from the viewpoint of GM, environmenta l impact (E) should be considered together. In this paper, a multi-object d ecision-making model of cutting fluid selection for GM is put forward, in which the objects of Quality (Q), Cost(C) and Environmental impact (E) are considered together. In this model, E means to minimize the environmental impact, Q means to maximize the quality and C means to minimize the cost. Each objective is anal yzed in detail too. A case study on a decision-making problem of cutting fluid selection in a gear hobbing process is analyzed, and the result shows the model is practical.
基金the National Natural Science Fundation of China (10377014).
文摘The manner and conditions of running the decision-making system with self-defense electronic jamming are given. After proposing the scenario of applying discrete dynamic Bayesian network to the decision making with self-defense electronic jamming, a decision-making model with self-defense electronic jamming based on the discrete dynamic Bayesian network is established. Then jamming decision inferences by the aid of the algorithm of discrete dynamic Bayesian network are carried on. The simulating result shows that this method is able to synthesize different targets which are not predominant. In this way, various features at the same time, as well as the same feature appearing at different time complement mutually; in addition, the accuracy and reliability of electronic jamming decision making are enhanced significantly.
文摘It is not uncommon in multiple criteria decision-making that the numerical values of alternatives of some criteria are subject to imprecision, uncertainty and indetermination and the information on weights of criteria is incomplete certain. A new multiple criteria decision- making method with incomplete certain information based on ternary AHP is proposed. This improves on Takeda＇s method. In this method, the ternary comparison matrix of the alternatives under each pseudo-criteria is constructed, the eigenvector associated with the maximum eigenvalue of the ternary comparison matrix is attained as to normalize priority vector of the alternatives, then the order of alternatives is obtained by solving two kinds of linear programming problems. Finally, an example is given to show the feasibility and effectiveness of the method.
基金Shanghai Leading Academic Discipline Project (T0502)Shanghai Municipal Educational Commission Project (05EZ32).
文摘With the fast growth of Chinese economic, more and more capital will be invested in environmental projects. How to select the environmental investment projects （alternatives） for obtaining the best environmental quality and economic benefits is an important problem for the decision makers. The purpose of this paper is to develop a decision-making model to rank a finite number of alternatives with several and sometimes conflicting criteria. A model for ranking the projects of municipal sewage treatment plants is proposed by using exports＇ information and the data of the real projects. And, the ranking result is given based on the PROMETHEE method. Furthermore, by means of the concept of the weight stability intervals （WSI）, the sensitivity of the ranking results to the size of criteria values and the change of weights value of criteria are discussed. The result shows that some criteria, such as “proportion of benefit to project cost”, will influence the ranking result of alternatives very strong while others not. The influence are not only from the value of criterion but also from the changing the weight of criterion. So, some criteria such as “proportion of benefit to project cost” are key critera for ranking the projects. Decision makers must be cautious to them.
基金supported by the Humanities and Social Sciences Foundation of Ministry of Education of China(09YJC630229)Scientific Research Foundation of Guangxi University for Nationalities for Talent Introduction(200702YZ01)Science and Technology Project of State Ethnic Affairs Commission(09GX03)
文摘Multi-attribute group decision-making problems are considered where information on both attribute weights and value scores of consequences is incomplete.In group decision analysis,if preference information about alternatives is provided by participants,it should be verified whether there exist compromise weights that can support all the preference relations.The different compromise weight vectors may differ for the ranking of the alternatives.In the case that compromise weights exist,the method is proposed to find out all the compromise weight vectors in order to rank the alternatives.Based on the new feasible domain of attribute weights determined by all the compromise weight vectors and the incomplete information on value scores of consequences,dominance relations between alternatives are checked by a nonlinear goal programming model which can be transformed into a linear one by adopting a transformation.The checked dominance relations uniformly hold for all compromise weight vectors and the incomplete information on value scores of consequences.A final ranking of the alternatives can be obtained by aggregating these dominance relations.
基金Project(9142020013)support by the National Natural Science Foundation of China
文摘The decision-making under complex urban environment become one of the key issues that restricts the rapid development of the autonomous vehicles. The difficulty in making timely and accurate decisions like human beings under highly dynamic traffic environment is a major challenge for autonomous driving. Car-following has been regarded as the simplest but essential driving behavior among driving tasks and has received extensive attention from researchers around the world. This work addresses this problem and proposes a novel method RSAN(rough-set artificial neural network) to learn the decisions from excellent human drivers. A virtual urban traffic environment was built by Pre Scan and driving simulation was conducted to obtain a broad set of relevant data such as experienced drivers' behavior data and surrounding vehicles' motion data. Then, rough set was used to preprocess these data to extract the key influential factors on decision and reduce the impact of uncertain data and noise data. And the car-following decision was learned by neural network in which key factor was the input and acceleration was the output. The result shows the better convergence speed and the better decision accuracy of RSAN than ANN. Findings of this work contributes to the empirical understanding of driver's decision-making process and it provides a theoretical basis for the study of car-following decision-making under complex and dynamic environment.
