Have a personal or library account? Click to login
An Improved Hybrid Path Planning Algorithm in Indoor Environment Cover
By: Jiaxiang Fang and  Shuping Xu  
Open Access
|Jul 2024

Abstract

During the path planning of robots in the indoor unstructured complex environment, there are often problems such as unreachable target points, deflection in the planning process, and failure to avoid dynamic obstacles in time. To solve these problems, an improved hybrid indoor path planning algorithm was proposed, wherein the improved global path planning algorithm was effectually integrated with improved local path planning algorithm. Firstly, the heuristic factor of traditional A-Star algorithm was optimized, search range and nodes were reduced, and then the path generated by traditional A-Star algorithm for path planning was smoothed using the angle bisector tangent point method. Secondly, combining path and environment information, local path planning was undertaken by utilizing the improved artificial potential field algorithm, and the unreachable target points problem was addressed by adjusting the repulsive field parameters. Additionally, dynamic potential field function was constructed to make it have the ability to resolve dynamic obstacles. Finally, in the part of actual environment verification, a comparison was made in this paper to assess the performance of the traditional hybrid algorithm against the improved algorithm in terms of path planning. The consequences showed that, by the hybrid algorithm proposed in this paper, the path planning length was reduced by 10.3%, the running time was decreased by 12.5%, and 34 redundant nodes were eliminated. The consequences indicated that the hybrid algorithm can effectively address the indoor unstructured and complex path planning problems.

Language: English
Page range: 67 - 81
Published on: Jul 21, 2024
Published by: Xi’an Technological University
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2024 Jiaxiang Fang, Shuping Xu, published by Xi’an Technological University
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.