Research on Path Planning Based on Improved JPS Algorithm

Abstract

In order to address issues in the JPS pathfinding algorithm such as the search for unnecessary jump points, frequent jump point selections, and the lack of environmental information regarding the target location, this paper proposes a selectively bidirectional JPS pathfinding algorithm based on a conditionally depth-first search and a biased selection towards the target point. The bidirectional search strategy of this algorithm prioritizes unidirectional searches approaching the target point, conducting in-depth searches towards the target until a change in the direction towards the target point occurs. The results indicate that the improved JPS algorithm, compared to the traditional JPS algorithm and bidirectional JPS algorithm, exhibits fewer selected jump points, shorter pathfinding times, and significantly enhances the efficiency of global path planning.