Abstract

Abstract. This paper developed a two-stage solution for underwater gravity matching navigation based on the particle swarm optimization algorithm and affine transformation. The first stage established a starting point, and the second stage treated the matching track gained through affine transformation as a particle at the same starting point, followed by the application of the particle swarm optimization algorithm to obtain the optimal solution. To avoid falling into a local optimal solution, a convergence factor was incorporated into the optimization process in addition to the linear decreasing weight. This was followed by the addition of a constraint on the velocity and position of the particles, which was then updated in an iterating process. Two simulated navigation tracks were employed for experiments. The results revealed that the algorithm was capable of matching actual tracks in real time. Additionally, the results were found to be consistent with those obtained from the real-world tracks, with all the locations and gravity anomaly deviations falling within a tolerable range. However, when there were too many matching track points, the algorithm efficiency declined in terms of calculation time. This entails improving the algorithm through the segmentation technique.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call