DocumentCode :
3175721
Title :
Modified simulated annealing algorithm for laser antimissile problem
Author :
Zhang, Maorui ; Sun, Yong ; Liu, Weiwei ; Gao, Xiangyu
Author_Institution :
Center for Control Theor. & Guidance Technol., Harbin Inst. of Technol., Harbin, China
fYear :
2010
fDate :
29-30 Oct. 2010
Firstpage :
757
Lastpage :
760
Abstract :
The dynamic laser antimissile problem is solved by the simulated annealing (SA) algorithm. The attacking sequence optimization plays an important role in the real-time application. When faced with multiple attacking targets, it is clearly important for the laser antimissile system to determine the sequence of the attacking targets to be intercepted so that the maximum attacking targets are destroyed. This problem is much harder than a pure traveling salesman problem. It is a dynamical shortest path problem. But there are many barriers for finding the global optimal solution, especially when the number of the targets is greater than six. The modified simulated annealing (MSA) algorithm is proposed here which considers the heating strategy. Finally, taking ten targets as an example, the simulation results show that MSA has better solution than that of SA and this achievement can be used in the real application.
Keywords :
graph theory; missiles; simulated annealing; attacking sequence optimization; dynamic shortest path problem; laser antimissile problem; simulated annealing algorithm; traveling salesman problem; Annealing; Atmospheric modeling; Force; Heating; Simulated annealing; Heating; Laser Antimissile; Pursuit Navigation; Simulated Annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Artificial Intelligence and Education (ICAIE), 2010 International Conference on
Conference_Location :
Hangzhou
Print_ISBN :
978-1-4244-6935-2
Type :
conf
DOI :
10.1109/ICAIE.2010.5641476
Filename :
5641476
Link To Document :
بازگشت