Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for t...Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for timing and deployment.To improve the response speed and jamming effect,a cluster of OADs based on an unmanned surface vehicle(USV)is proposed.The formation of the cluster determines the effectiveness of jamming.First,based on the mechanism of OAD jamming,critical conditions are identified,and a method for assessing the jamming effect is proposed.Then,for the optimization of the cluster formation,a mathematical model is built,and a multi-tribe adaptive particle swarm optimization algorithm based on mutation strategy and Metropolis criterion(3M-APSO)is designed.Finally,the formation optimization problem is solved and analyzed using the 3M-APSO algorithm under specific scenarios.The results show that the improved algorithm has a faster convergence rate and superior performance as compared to the standard Adaptive-PSO algorithm.Compared with a single OAD,the optimal formation of USV-OAD cluster effectively fills the blind area and maximizes the use of jamming resources.展开更多
In order to solve the non-linear and high-dimensional optimization problems more effectively, an improved self-adaptive membrane computing(ISMC) optimization algorithm was proposed. The proposed ISMC algorithm applied...In order to solve the non-linear and high-dimensional optimization problems more effectively, an improved self-adaptive membrane computing(ISMC) optimization algorithm was proposed. The proposed ISMC algorithm applied improved self-adaptive crossover and mutation formulae that can provide appropriate crossover operator and mutation operator based on different functions of the objects and the number of iterations. The performance of ISMC was tested by the benchmark functions. The simulation results for residue hydrogenating kinetics model parameter estimation show that the proposed method is superior to the traditional intelligent algorithms in terms of convergence accuracy and stability in solving the complex parameter optimization problems.展开更多
To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damagin...To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.展开更多
A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK ...A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.展开更多
This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satell...This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.展开更多
To meet the requirements of modern air combat,an integrated fire/flight control(IFFC)system is designed to achieve automatic precision tracking and aiming for armed helicopters and release the pilot from heavy target ...To meet the requirements of modern air combat,an integrated fire/flight control(IFFC)system is designed to achieve automatic precision tracking and aiming for armed helicopters and release the pilot from heavy target burden.Considering the complex dynamic characteristics and the couplings of armed helicopters,an improved automatic attack system is con-structed to integrate the fire control system with the flight con-trol system into a unit.To obtain the optimal command signals,the algorithm is investigated to solve nonconvex optimization problems by the contracting Broyden Fletcher Goldfarb Shanno(C-BFGS)algorithm combined with the trust region method.To address the uncertainties in the automatic attack system,the memory nominal distribution and Wasserstein distance are introduced to accurately characterize the uncertainties,and the dual solvable problem is analyzed by using the duality the-ory,conjugate function,and dual norm.Simulation results verify the practicality and validity of the proposed method in solving the IFFC problem on the premise of satisfactory aiming accu-racy.展开更多
针对动态不确定战场环境下多无人机对多区域、多目标的协同察打任务规划过程中存在的信息不确定、任务多约束及航迹强耦合的多目标优化与决策问题,结合Dubins航迹规划算法,提出了一种融合多种改进策略的灰狼优化算法(grey wolf optimiza...针对动态不确定战场环境下多无人机对多区域、多目标的协同察打任务规划过程中存在的信息不确定、任务多约束及航迹强耦合的多目标优化与决策问题,结合Dubins航迹规划算法,提出了一种融合多种改进策略的灰狼优化算法(grey wolf optimization algorithm incorporating multiple improvement strategies,IMISGWO).首先,针对动态环境带来的无人机巡航速度及察打任务消失时间的不确定性,基于可信性理论建立了以最大化任务收益为指标的任务规划数学模型;其次,为实现该问题的快速求解,设计了初始解均匀分布、个体通信机制调整、动态权重更新和跳出局部最优等策略,提升算法解搜索能力;最后,构建了多无人机察打一体典型任务仿真场景,通过数字仿真以及虚实结合半实物仿真试验验证了算法的可行性和有效性.仿真结果表明:算法在求解不确定环境下耦合航迹的多无人机察打一体任务规划问题时,能够生成多机高效的任务执行序列和满足无人机飞行性能约束的飞行轨迹,且能够适用于无人机数量增加导致问题复杂度增加情形下此类问题的求解.展开更多
基金the National Natural Science Foundation of China(Grant No.62101579).
文摘Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for timing and deployment.To improve the response speed and jamming effect,a cluster of OADs based on an unmanned surface vehicle(USV)is proposed.The formation of the cluster determines the effectiveness of jamming.First,based on the mechanism of OAD jamming,critical conditions are identified,and a method for assessing the jamming effect is proposed.Then,for the optimization of the cluster formation,a mathematical model is built,and a multi-tribe adaptive particle swarm optimization algorithm based on mutation strategy and Metropolis criterion(3M-APSO)is designed.Finally,the formation optimization problem is solved and analyzed using the 3M-APSO algorithm under specific scenarios.The results show that the improved algorithm has a faster convergence rate and superior performance as compared to the standard Adaptive-PSO algorithm.Compared with a single OAD,the optimal formation of USV-OAD cluster effectively fills the blind area and maximizes the use of jamming resources.
基金Projects(61203020,61403190)supported by the National Natural Science Foundation of ChinaProject(BK20141461)supported by the Jiangsu Province Natural Science Foundation,China
文摘In order to solve the non-linear and high-dimensional optimization problems more effectively, an improved self-adaptive membrane computing(ISMC) optimization algorithm was proposed. The proposed ISMC algorithm applied improved self-adaptive crossover and mutation formulae that can provide appropriate crossover operator and mutation operator based on different functions of the objects and the number of iterations. The performance of ISMC was tested by the benchmark functions. The simulation results for residue hydrogenating kinetics model parameter estimation show that the proposed method is superior to the traditional intelligent algorithms in terms of convergence accuracy and stability in solving the complex parameter optimization problems.
基金Sponsored by Beijing Priority Laboratory Fund of China(SYS10070522)
文摘To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.
文摘A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.
基金supported by the National Natural Science Foundation of China(7127106671171065+1 种基金71202168)the Natural Science Foundation of Heilongjiang Province(GC13D506)
文摘This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.
基金supported by the National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22).
文摘To meet the requirements of modern air combat,an integrated fire/flight control(IFFC)system is designed to achieve automatic precision tracking and aiming for armed helicopters and release the pilot from heavy target burden.Considering the complex dynamic characteristics and the couplings of armed helicopters,an improved automatic attack system is con-structed to integrate the fire control system with the flight con-trol system into a unit.To obtain the optimal command signals,the algorithm is investigated to solve nonconvex optimization problems by the contracting Broyden Fletcher Goldfarb Shanno(C-BFGS)algorithm combined with the trust region method.To address the uncertainties in the automatic attack system,the memory nominal distribution and Wasserstein distance are introduced to accurately characterize the uncertainties,and the dual solvable problem is analyzed by using the duality the-ory,conjugate function,and dual norm.Simulation results verify the practicality and validity of the proposed method in solving the IFFC problem on the premise of satisfactory aiming accu-racy.
