Enhanced Global Path Planning Efficiency by Bidirectional A*, Gradient Descent, and Orientation Interpolation Algorithms

Abstract

This paper presents an innovative approach to global path planning (GPP) that uniquely integrates an enhanced Bidirectional A* search algorithm, gradient descent smoothing, and orientation filter interpolation. These methods are applied within a quadratic approximation-based potential field and global cost map. The key idea is successfully integrating these powerful techniques, ensuring minimal impact on computational time while enhancing path size and smoothness. Rigorous testing in environments like the Amazon web services (AWS) RoboMaker Hospital Gazebo environment and the sections at the control and systems engineering building at Iraq's University of Technology (CSE-UOT) in Iraq shows significant improvement over existing planners like wavefront GPP and robot operating system (ROS) default GPP. The proposed algorithm reduced pathfinding time by approximately 60.3% and path size by 9.0%. These findings highlight the efficiency of the proposed global planner, suggesting it as a robust solution for autonomous robotic navigation in complex architectural scenarios.

Enhancement of a Path-Finding Algorithm for the Hovercraft System Based on Intelligent Hybrid Stochastic Methods

“…Specifically, when the vehicle has direct knowledge of all environmental data, including the trajectories of non-static objects and static obstacles, it falls under the first category. Conversely, if this data is unavailable or insufficient, the vehicle must assess the path throughout the navigation process, which is called online path finding [4,5]. In this context, numerous researchers employed path finding for a variety of purposes using different methods to solve this problem.…”

“…Figure 4. The flowchart of the SP-PSO algorithm Fig.5illustrates the concept of the hybrid methodology, which combines the ABC algorithm with the SP-PSO algorithm to accelerate convergence speed and balance between exploration and exploitation search to produce the shortest path while also preventing collisions.…”