Obstacle avoidance algorithm in mobile robot motion

A method has been proposed, and a computer program has been developed for simulating obstacle avoidance by a robotic system. To expand the mobility capabilities of the robotic system, the algorithm combines the core elements of the vfh algorithm and our previously developed algorithm I [1], and is positioned in this work as algorithm II. An evaluation of the average obstacle avoidance time for various types of obstacles has been conducted, including five cubic obstacles, a long wall obstacle, and a complex obstacle. During the computational experiment using the Gazebo 11 simulation environment, the time parameters for robot movements around various types of obstacles were calculated, including five cubic obstacles, a wall obstacle, and a complex obstacle. In the computational experiment, statistical processing of the obtained results was carried out. It was shown that using the proposed algorithm, the assessment of the average time for the robotic system to avoid obstacles is reduced in some cases by up to 7.2 times compared to the use of algorithm I.

Authors

Institutions

Publication Details

Journal
«System analysis and applied information science»
Published
2024-12-30
DOI
https://doi.org/10.21122/2309-4923-2024-4-29-33
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Obstacle avoidance algorithm in mobile robot motion

N. A. Saladukha, А. В. Сидоренко
1 citations
«System analysis and applied information science»
Robotic Path Planning Algorithms
0.25
article

Obstacle avoidance algorithm in mobile robot motion

N. A. Saladukha, А. В. Сидоренко
article en
1 citations

Abstract

A method has been proposed, and a computer program has been developed for simulating obstacle avoidance by a robotic system. To expand the mobility capabilities of the robotic system, the algorithm combines the core elements of the vfh algorithm and our previously developed algorithm I [1], and is positioned in this work as algorithm II. An evaluation of the average obstacle avoidance time for various types of obstacles has been conducted, including five cubic obstacles, a long wall obstacle, and a complex obstacle. During the computational experiment using the Gazebo 11 simulation environment, the time parameters for robot movements around various types of obstacles were calculated, including five cubic obstacles, a wall obstacle, and a complex obstacle. In the computational experiment, statistical processing of the obtained results was carried out. It was shown that using the proposed algorithm, the assessment of the average time for the robotic system to avoid obstacles is reduced in some cases by up to 7.2 times compared to the use of algorithm I.

«System analysis and applied information science»(4)
Belarusian State University (BY)
Openalex Percentile: Top 43%
Robotic Path Planning Algorithms
0.25
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.