Ant colony optimization(ACO)is a random search algorithm based on probability calculation.However,the uninformed search strategy has a slow convergence speed.The Bayesian algorithm uses the historical information of t...Ant colony optimization(ACO)is a random search algorithm based on probability calculation.However,the uninformed search strategy has a slow convergence speed.The Bayesian algorithm uses the historical information of the searched point to determine the next search point during the search process,reducing the uncertainty in the random search process.Due to the ability of the Bayesian algorithm to reduce uncertainty,a Bayesian ACO algorithm is proposed in this paper to increase the convergence speed of the conventional ACO algorithm for image edge detection.In addition,this paper has the following two innovations on the basis of the classical algorithm,one of which is to add random perturbations after completing the pheromone update.The second is the use of adaptive pheromone heuristics.Experimental results illustrate that the proposed Bayesian ACO algorithm has faster convergence and higher precision and recall than the traditional ant colony algorithm,due to the improvement of the pheromone utilization rate.Moreover,Bayesian ACO algorithm outperforms the other comparative methods in edge detection task.展开更多
Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can ...Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can estimate the joint probability distribution of the variables with Bayesian network, and the new candidate solutions also can be generated by the joint distribution. The simulation example verified that the method could be used to solve the complex question, the operation was quickly and the solution was best.展开更多
The coordinated Bayesian optimization algorithm（CBOA） is proposed according to the characteristics of the function independence,conformity and supplementary between the electronic countermeasure（ECM） and the firep...The coordinated Bayesian optimization algorithm（CBOA） is proposed according to the characteristics of the function independence,conformity and supplementary between the electronic countermeasure（ECM） and the firepower attack systems.The selection criteria are combinations of probabilities of individual fitness and coordinated degree and can select choiceness individual to construct Bayesian network that manifest population evolution by producing the new chromosome.Thus the CBOA cannot only guarantee the effective pattern coordinated decision-making mechanism between the populations,but also maintain the population multiplicity,and enhance the algorithm performance.The simulation result confirms the algorithm validity.展开更多
To aim at the multimode character of the data from the airplane detecting system, the paper combines Dempster- Shafer evidence theory and subjective Bayesian algorithm and makes to propose a mixed structure multimode ...To aim at the multimode character of the data from the airplane detecting system, the paper combines Dempster- Shafer evidence theory and subjective Bayesian algorithm and makes to propose a mixed structure multimode data fusion algorithm. The algorithm adopts a prorated algorithm relate to the incertitude evaluation to convert the probability evaluation into the precognition probability in an identity frame, and ensures the adaptability of different data from different source to the mixed system. To guarantee real time fusion, a combination of time domain fusion and space domain fusion is established, this not only assure the fusion of data chain in different time of the same sensor, but also the data fusion from different sensors distributed in different platforms and the data fusion among different modes. The feasibility and practicability are approved through computer simulation.展开更多
基金supported by the National Natural Science Foundation of China(62276055).
文摘Ant colony optimization(ACO)is a random search algorithm based on probability calculation.However,the uninformed search strategy has a slow convergence speed.The Bayesian algorithm uses the historical information of the searched point to determine the next search point during the search process,reducing the uncertainty in the random search process.Due to the ability of the Bayesian algorithm to reduce uncertainty,a Bayesian ACO algorithm is proposed in this paper to increase the convergence speed of the conventional ACO algorithm for image edge detection.In addition,this paper has the following two innovations on the basis of the classical algorithm,one of which is to add random perturbations after completing the pheromone update.The second is the use of adaptive pheromone heuristics.Experimental results illustrate that the proposed Bayesian ACO algorithm has faster convergence and higher precision and recall than the traditional ant colony algorithm,due to the improvement of the pheromone utilization rate.Moreover,Bayesian ACO algorithm outperforms the other comparative methods in edge detection task.
基金This project was supported by the Fund of College Doctor Degree (20020699009)
文摘Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can estimate the joint probability distribution of the variables with Bayesian network, and the new candidate solutions also can be generated by the joint distribution. The simulation example verified that the method could be used to solve the complex question, the operation was quickly and the solution was best.
基金supported by the National Natural Science Foundation of China (10377014)the Innovation Foundation of Northwestern Polytechnical university (2007KJ01027)
文摘The coordinated Bayesian optimization algorithm（CBOA） is proposed according to the characteristics of the function independence,conformity and supplementary between the electronic countermeasure（ECM） and the firepower attack systems.The selection criteria are combinations of probabilities of individual fitness and coordinated degree and can select choiceness individual to construct Bayesian network that manifest population evolution by producing the new chromosome.Thus the CBOA cannot only guarantee the effective pattern coordinated decision-making mechanism between the populations,but also maintain the population multiplicity,and enhance the algorithm performance.The simulation result confirms the algorithm validity.
文摘To aim at the multimode character of the data from the airplane detecting system, the paper combines Dempster- Shafer evidence theory and subjective Bayesian algorithm and makes to propose a mixed structure multimode data fusion algorithm. The algorithm adopts a prorated algorithm relate to the incertitude evaluation to convert the probability evaluation into the precognition probability in an identity frame, and ensures the adaptability of different data from different source to the mixed system. To guarantee real time fusion, a combination of time domain fusion and space domain fusion is established, this not only assure the fusion of data chain in different time of the same sensor, but also the data fusion from different sensors distributed in different platforms and the data fusion among different modes. The feasibility and practicability are approved through computer simulation.
