Improved RRT* Algorithm for Disinfecting Robot Path Planning

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.