• Login
  • Register
  • Search

Three-dimensional TSP seabed search model based on genetic algorithm ——First aid for the lost submersible

Jiayi Sun

Abstract


The paper presents a three-dimensional TSP (Traveling Salesman Problem) search model based on genetic algorithms to efficiently
locate a lost submersible in the deep sea. The model takes into account the influence of underwater terrain and predicts the submersible’s
position using a genetic algorithm that optimizes the search path. The search probability as a function of time is also determined to prioritize
search points closest to the main ship. The model simplifies the search process by assuming constant speed travel and ignoring mutations for
operational efficiency. The conclusion highlights the model’s high efficiency and adaptability, while acknowledging the need for improved
accuracy in position prediction, especially under extreme conditions affecting the submersible’s trajectory.

Keywords


Submersible Search; Genetic Algorithm; Three-dimensional TSP Model; Search Probability

Full Text:

PDF

Included Database


References


[1]Jin Bowen. Solve TSP problem based on genetic algorithms [J]. China Storage and Transportation, 2023 (10): 141.DOI: 10.16301/

J.CNKI.CN12-1204/F.2023.10.096.

[2]Xiao Chunliang, Zhang Zhongmin. Ultra-broadband/inertia navigation system indoor fusion positioning technology based on the

improved volume Carman filter [J]. Application technology, 2023,50 (06): 69-75.

[3]Zhao Dagang, Zhang Shun, Gao Shi, etc. The impact of the influence of the motion and load of underwater aircraft [J/OL]. Chinese

ship research: 1-17 [2024-02-05].




DOI: http://dx.doi.org/10.18686/ag.v8i4.13860

Refbacks