Research on Optimal Rescue Path Planning of Submersible Based on Submarine Terrain Modeling

Authors

  • Chengjun Wen Satbayev University, Kazakhstan
  • Shijiao Li Southeast University, China

DOI:

https://doi.org/10.51301/ce.2023.i4.06

Keywords:

Markov chain Monte Carlo, genetic algorithm (GA), traveling salesman problem (TSP), shortest path planning

Abstract

In the process of deep-sea tourism exploration, due to the complex and ever-changing underwater environment, submarines may be affected by natural disasters, seawater pressure, and seabed topography, resulting in communication interruptions and mechanical failures during travel, causing harm to personnel in the submersible and causing huge losses to the tourism company. In order to address safety issues during deep-sea tourism exploration of submarines. This study takes the Inoian Sea as an example. Assuming that people encounter malfunctions during deep-sea tourism exploration while riding a submersible, immediate rescue is required. Firstly, we obtained high-resolution underwater terrain data from GEOCO 2023 and established a detailed three-dimensional underwater terrain model using Matalab software. During the search and rescue process, the sonar of the rescue vessel was used to search for the submersible, and the Markov Chain Monte Carlo (MCMC) method was used to predict the most likely position and probability distribution of the submersible. By combining the traveling salesman problem with genetic algorithm to process location and probability distribution data, the shortest path can be found. At the same time, we also established a dynamic model of the rescue process, allowing the rescue vessel to maximize the efficiency of maritime search and operation paths (such as spiral paths), and reflect the dynamic relationship between the rescue submersible and the damaged submersible.

Downloads

Published

2023-12-31

How to Cite

Wen, C. ., & Li, S. . (2023). Research on Optimal Rescue Path Planning of Submersible Based on Submarine Terrain Modeling. Computing &Amp; Engineering, 1(4), 32–37. https://doi.org/10.51301/ce.2023.i4.06

Issue

Section

Innovative Computing Systems and Engineering Solutions