Author:
Liu Ronghua,Wang Xin,Wu Di,Xie Chunyuan
Abstract
AbstractThis paper proposed to improve the bidirectional dynamic JPS algorithm in order to address the issues with the jump point search algorithm in the process of pathfinding, such as numerous path inflection points, numerous intermediate search hop points, numerous extended nodes, and lengthy pathfinding time in the process of finding jump points. The algorithm was based on the two-way dynamic hopping point search algorithm, defined the target points in the forward and reverse expansion directions dynamically, defined the heuristic function dynamically. In the process of searching each other from the starting point and the target point, the dynamic constraint ellipse was constructed to limit the expansion area of the jump point. The simulation results show that the optimized bidirectional dynamic JPS algorithm has a certain performance in general maps, especially in indoor environment maps with fewer obstacles and the target point is close to the starting point.
Publisher
Springer Nature Singapore
Reference17 articles.
1. Song XR, Ren YU, Gao S, et al (2019) Survey on technology of mobile robot path planning. Comput Meas Control 27(4):1–5, 17
2. Yun Y, Wang CY, Wu KX et al (2022) Overview of global path planning algorithms for mobile robots. Inf Rec Mater 23(3):29–32
3. Davoodi M, Panahi M, Mohades A et al (2013) Multi-objective path planning in discrete space. Appl Soft Comput J 13(1):709–720
4. Vista FP, Singh AM, Lee DJ et al (2014) Design convergent dynamic window approach for quadrotor navigation. Int J Precis Eng Manuf 15(10):2177–2184
5. Bing H, Lu L (2022) Improvement and application of Dijkstra algorithms. Acad J Comput & Inf Sci 5