.png){kind=icon}
.png){kind=icon}
Return
Multi-resolution field-based algorithm for autonomous robot exploration
.png){kind=icon}
OA
AI
DOI：10.1038/s41598-026-46119-3.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a robot autonomous exploration algorithm based on multi-resolution fields to solve the problems of low efficiency, high path repetition, and limited environmental adaptability in complex environments. First, OctoMap’s layered architecture is used to create a multi-resolution voxel map. A coarse-fine dual stage is then used to detect frontiers and balance point numbers. Second, polar coordinate sampling is utilized to avoid the sampling points being too concentrated in the center of the circle, and the scoring function is constructed by combining the distance decay function to prevent the robot from repeating the search. Finally, Monte Carlo integration’s gain calculation method is introduced to eliminate step errors caused by discretization and improve gain calculation accuracy. Simulation experiments are carried out in different environments, and the data prove that the method in this paper is better than the comparison algorithm in terms of moving distance, running time and exploration efficiency. The results show that the algorithm proposed in this paper effectively improves the robot’s autonomous exploration performance in unknown complex environments and provides a new solution for practical applications.
Keywords:
Engineering
Mathematics and computing
Multi-resolution field
Autonomous robot exploration
Frontier detection
Science
Humanities and Social Sciences
multidisciplinary
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.9
Papers:
27.1W
Citations:
83.5W