Inicio  /  Algorithms  /  Vol: 15 Par: 6 (2022)  /  Artículo
ARTÍCULO
TITULO

Improved JPS Path Optimization for Mobile Robots Based on Angle-Propagation Theta* Algorithm

Yuan Luo    
Jiakai Lu    
Qiong Qin and Yanyu Liu    

Resumen

The Jump Point Search (JPS) algorithm ignores the possibility of any-angle walking, so the paths found by the JPS algorithm under the discrete grid map still have a gap with the real paths. To address the above problems, this paper improves the path optimization strategy of the JPS algorithm by combining the viewable angle of the Angle-Propagation Theta* (AP Theta*) algorithm, and it proposes the AP-JPS algorithm based on an any-angle pathfinding strategy. First, based on the JPS algorithm, this paper proposes a vision triangle judgment method to optimize the generated path by selecting the successor search point. Secondly, the idea of the node viewable angle in the AP Theta* algorithm is introduced to modify the line of sight (LOS) reachability detection between two nodes. Finally, the paths are optimized using a seventh-order polynomial based on minimum snap, so that the AP-JPS algorithm generates paths that better match the actual robot motion. The feasibility and effectiveness of this method are proved by simulation experiments and comparison with other algorithms. The results show that the path planning algorithm in this paper obtains paths with good smoothness in environments with different obstacle densities and different map sizes. In the algorithm comparison experiments, it can be seen that the AP-JPS algorithm reduces the path by 1.61?4.68% and the total turning angle of the path by 58.71?84.67% compared with the JPS algorithm. The AP-JPS algorithm reduces the computing time by 98.59?99.22% compared with the AP-Theta* algorithm.

 Artículos similares

       
 
Sang-Woong Yun, Dong-Ham Kim, Se-Won Kim, Dong-Jin Kim and Hye-Jin Kim    
This study introduces global path planning for autonomous ships in port environments, with a focus on the Port of Ulsan, where various environmental factors are modeled for analysis. Global path planning is considered to take place from departure to bert... ver más

 
Shuai Zheng, Yumin Su, Jiayuan Zhuang, Yueqi Tang and Guangjie Yi    
The development of dynamic positioning (DP) algorithms for an unmanned surface vehicle (USV) is attracting great interest, especially in support of complex missions such as sea rescue. In order to improve the simplicity of the algorithm, a DP algorithm b... ver más

 
Shitu Chen, Ling Feng, Xuteng Bao, Zhe Jiang, Bowen Xing and Jingxiang Xu    
Path planning is crucial for unmanned surface vehicles (USVs) to navigate and avoid obstacles efficiently. This study evaluates and contrasts various USV path-planning algorithms, focusing on their effectiveness in dynamic obstacle avoidance, resistance ... ver más

 
Bowen Xing, Xiao Wang and Zhenchong Liu    
The path planning strategy of deep-sea mining vehicles is an important factor affecting the efficiency of deep-sea mining missions. However, the current traditional path planning algorithms suffer from hose entanglement problems and small coverage in the... ver más

 
Yi Zhang, Hengchao Zhao, Zheng Zhang and Hongbo Wang    
Addressing the automatic berthing task for vessels, this study introduces the Flow Matching Double Section Bezier Berth Method (FM-DSB) for handling downstream and upstream berthing instructions. By considering the orientation relationship between the di... ver más