Algorithm for Controlling an Autonomous Underwater Vehicle when Avoiding a Complex Obstacle

The problem of avoiding obstacles by an autonomous underwater vehicle is considered. In contrast to the traditional approach to choosing a route around an obstacle, based on its current observation, the work proposes to additionally use an electronic bathymetric map and a physical map of the world, as well as the results of aerial photography - to obtain complete information about the position, shape and size of the obstacle. This approach allows you to reasonably select the shortest route around a detected obstacle. Due to the fact that the depth values are indicated in grid nodes with an unacceptably large step, to increase the detail of the bottom topography, the Kriging algorithm was used in the work, which makes it possible to refine the depth grid. The operation of the Kriging algorithm is clearly demonstrated, and an algorithm for determining the spatial shortest route is developed. Using a specially developed mathematical model, numerical experiments were carried out aimed at testing the proposed solution to bypass the obstacle and assess the gains from the use of additional information in the form of digital electronic maps. the results of a numerical experiment showed that the use of additional materials led to a reduction in the bypass path by 10-17%, which leads, accordingly, to a reduction in the time to bypass an obstacle and save energy resources.

Authors

Institutions

Publication Details

Published
2024-09-08
DOI
https://doi.org/10.1109/rusautocon61949.2024.10694466
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Algorithm for Controlling an Autonomous Underwater Vehicle when Avoiding a Complex Obstacle

A. S. Pavlov, Liubov Martynova
Robotic Path Planning Algorithms
article

Algorithm for Controlling an Autonomous Underwater Vehicle when Avoiding a Complex Obstacle

A. S. Pavlov, Liubov Martynova
article en

Abstract

The problem of avoiding obstacles by an autonomous underwater vehicle is considered. In contrast to the traditional approach to choosing a route around an obstacle, based on its current observation, the work proposes to additionally use an electronic bathymetric map and a physical map of the world, as well as the results of aerial photography - to obtain complete information about the position, shape and size of the obstacle. This approach allows you to reasonably select the shortest route around a detected obstacle. Due to the fact that the depth values are indicated in grid nodes with an unacceptably large step, to increase the detail of the bottom topography, the Kriging algorithm was used in the work, which makes it possible to refine the depth grid. The operation of the Kriging algorithm is clearly demonstrated, and an algorithm for determining the spatial shortest route is developed. Using a specially developed mathematical model, numerical experiments were carried out aimed at testing the proposed solution to bypass the obstacle and assess the gains from the use of additional information in the form of digital electronic maps. the results of a numerical experiment showed that the use of additional materials led to a reduction in the bypass path by 10-17%, which leads, accordingly, to a reduction in the time to bypass an obstacle and save energy resources.

Oceanpribor (Russia) (RU), State Research Center of the Russian Federation (RU)
Russian Science Foundation
Life below water
Openalex Percentile: Top 83%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.