A Robust Reference Path Selection Method for Path Planning Algorithm
Ziang Zhang, Ruozhu Wu, Yu Pan, You Wang, Yixu Wang, Xiaoqing Guan, Jie Hao, Jin Zhang, Guang Li
Abstract
In this letter, a general robust reference path selection method (RPSM) that can be integrated into current existing motion planning algorithms is proposed to improve the mobile performance of autonomous patrol robots. The proposed RPSM maintains a dynamic array of path candidates that contains newly found paths, optimal historical paths, and hybrid paths that incorporate local trajectories. All these candidates will be evaluated in a unified criterion, and the best path with the minimal cost will be presented for trajectory tracking, ensuring the consistency and smoothness of the actual motion. Experiments with two different kinds of robots in various scenarios confirm that RPSM enriches the diversity and robustness of reference paths, and improves the execution efficiency by significantly reducing the average actual trajectory distance, orientation change, and total execution time, with an acceptable extra computational cost in comparison to the corresponding original hybrid A* algorithm.