DocumentCode
2870780
Title
Notice of Retraction
Optimal route programming of submarine based on genetic algorithm
Author
Li Yuyang ; Da Lianglong ; Han Mei ; Jin Chaobo
Author_Institution
Navy Submarine Acad., Qingdao, China
Volume
9
fYear
2010
fDate
22-24 Oct. 2010
Abstract
Notice of Retraction
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The concealing and optimal route programming plays an important role for guaranteeing the fight navigation of submarine. The process of route programming can be transferred into multiple objects programming, which mainly based on the synthesis of ocean environment, tactical actions, enemy situation, detecting efficiency of warship´s sonar equipments, etc. An effective programming method based on the genetic arithmetic is researched and presented, which can provide optimal routes for the submarine. The simulation results indicates that the algorithm is obviously superior to dynamic programming and simulated annealing in the convergent capability.
After careful and considered review of the content of this paper by a duly constituted expert committee, this paper has been found to be in violation of IEEE´s Publication Principles.
We hereby retract the content of this paper. Reasonable effort should be made to remove all past references to this paper.
The presenting author of this paper has the option to appeal this decision by contacting TPII@ieee.org.
The concealing and optimal route programming plays an important role for guaranteeing the fight navigation of submarine. The process of route programming can be transferred into multiple objects programming, which mainly based on the synthesis of ocean environment, tactical actions, enemy situation, detecting efficiency of warship´s sonar equipments, etc. An effective programming method based on the genetic arithmetic is researched and presented, which can provide optimal routes for the submarine. The simulation results indicates that the algorithm is obviously superior to dynamic programming and simulated annealing in the convergent capability.
Keywords
genetic algorithms; military vehicles; simulated annealing; underwater vehicles; convergent capability; enemy situation; genetic algorithm; ocean environment; optimal route programming; simulated annealing; submarine fight navigation; tactical actions; warship detection efficiency; Computational modeling; Mathematical model; Oceans; Programming; Propagation losses; Sonar navigation; Underwater vehicles; genetic algorithm; route programming; submarine warfare; tactical aid decision;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Application and System Modeling (ICCASM), 2010 International Conference on
Conference_Location
Taiyuan
Print_ISBN
978-1-4244-7235-2
Type
conf
DOI
10.1109/ICCASM.2010.5623006
Filename
5623006
Link To Document