Studies On Path Planning Of Warship Navigation Based On Genetic Algorithm

The optimal navigation plan design is one of the essential technologies about Integrated Bridge System, its concrete function includes the self-shipping and optimizing of the path plan. The pilot needs to input the outset port, goal port and the safe value of water depth only, the algorithm will work according to the detailed information in the electronical chart, and finally find the safest short-path. It belongs to category of the route layout. In the paper, the research work launches based on the genetic algorithm, it gives a deep research to the GA's base theory, improved method and the non-linear optimization application domain, and realized programming the optimal plan using the simulated Annealing Genetic Algorithm.First, the paper gives a deep research to the elementary theory and the movement mechanism of the genetic algorithm. After analyzing the advantages and disadvantages between the binary code and the floating code, it designs a floating coding mode whose length is variational, and the coding mode suits this article very well. According to the idiographic conditions of the ship navigation, the paper gives six kinds of genetic operating operators, includes the selection, crossover, mutation, insertion, deletion and reversal.Next, the genetic algorithm is explained in detail, the flaws in the application of the genetic algorithm are pointed out, which are easy to falling into a partially convergence and a slow convergent rate. In view of the above two questions several improvement genetic algorithm are studied, and according to the actual condition the optimal navigation plan design with the simulated Annealing Genetic Algorithm is completed.Finally, under the VC++ environment, five kinds of different complex test examples run using the paper's algorithm, at the same time, the simulation chart and the data form are given, according to which algorithm...