EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Improved RRT* Algorithm for Disinfecting Robot Path Planning

Haotian Wang, Xiaolong Zhou iD, Jianyong Li, Zhilun Yang, Linlin Cao iD

Sensors · 26.02.2024 · 24 (5) · 1520

DOI: 10.3390/s24051520 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 26.02.2024. Verfasst von Haotian Wang und 4 weiteren Autor:innen. Beteiligte Einrichtung: Mechanical Engineering College, Beihua University, Jilin 132021, China. Die Arbeit wurde bisher 30-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Jilin Science and Technology Development Plan Project, Science and Technology Research Project of Jilin Provincial Department of Education, Graduate Innovation Project of Beihua University.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper, an improved APF-GFARRT* (artificial potential field-guided fuzzy adaptive rapidly exploring random trees) algorithm based on APF (artificial potential field) guided sampling and fuzzy adaptive expansion is proposed to solve the problems of weak orientation and low search success rate when randomly expanding nodes using the RRT (rapidly exploring random trees) algorithm for disinfecting robots in the dense environment of disinfection operation. Considering the inherent randomness of tree growth in the RRT* algorithm, a combination of APF with RRT* is introduced to enhance the purposefulness of the sampling process. In addition, in the context of RRT* facing dense and restricted environments such as narrow passages, adaptive step-size adjustment is implemented using fuzzy control. It accelerates the algorithm’s convergence and improves search efficiency in a specific area. The proposed algorithm is validated and analyzed in a specialized environment designed in MATLAB, and comparisons are made with existing path planning algorithms, including RRT, RRT*, and APF-RRT*. Experimental results show the excellent exploration speed of the improved algorithm, reducing the average initial path search time by about 46.52% compared to the other three algorithms. In addition, the improved algorithm exhibits faster convergence, significantly reducing the average iteration count and the average final path cost by about 10.01%. The algorithm’s enhanced adaptability in unique environments is particularly noteworthy, increasing the chances of successfully finding paths and generating more rational and smoother paths than other algorithms. Experimental results validate the proposed algorithm as a practical and feasible solution for similar problems.

Schlagwörter

Stichwörter der Autor:innen

artificial potential field (APF)disinfection robotfuzzy controlpath planningrapidly exploring random trees (RRT*)

Autor:innen und Institutionen

  • Mechanical Engineering College, Beihua University, Jilin 132021, China.

ORCID-Profile: Xiaolong Zhou, Linlin Cao

Förderung

  • Jilin Science and Technology Development Plan Project
  • Science and Technology Research Project of Jilin Provincial Department of Education
  • Graduate Innovation Project of Beihua University

Zitieren

APA

Wang, H., Zhou, X., Li, J., Yang, Z., & Cao, L. (2024). Improved RRT* Algorithm for Disinfecting Robot Path Planning. Sensors, 24(5), 1520. https://doi.org/10.3390/s24051520

Vancouver

Wang H, Zhou X, Li J, Yang Z, Cao L. Improved RRT* Algorithm for Disinfecting Robot Path Planning. Sensors. 2024;24(5):1520. doi:10.3390/s24051520

BibTeX
@article{Wang2024,
  author = {Wang, Haotian and Zhou, Xiaolong and Li, Jianyong and Yang, Zhilun and Cao, Linlin},
  title = {Improved RRT* Algorithm for Disinfecting Robot Path Planning},
  journal = {Sensors},
  year = {2024},
  volume = {24},
  number = {5},
  pages = {1520},
  doi = {10.3390/s24051520}
}
Kostenlos starten →