Robust Path Planning Of Obstacle Avoidance For Unmanned delivery robot

Mushu Wang, Xingxue Dong, Weigang Pan, Song Gao, Shuxin Wang

Abstract


Aiming at complex road conditions and difficult path planning of semi-structured roads in a park, a robust path planning method based on sequential quadratic programming (SQP) algorithm optimization is proposed. Firstly, an improved vector field histogram (VFH) algorithm is used to determine the optimal passable area, and then the determination method of the target state is given based on the optimal passable area; Secondly, according to a starting point and the target state, a description method of obstacle avoidance path is given based on a piecewise quadratic Bezier curve. Then, the problem of curve parameter optimization is established based on the vehicle running curvature constraint and the direction change margin constraint of the target point, and the SQP algorithm is used to optimize the curve parameters; Finally, the effectiveness and practicability of the proposed method are verified by simulation experiments and real vehicle experiments. Compared with other methods, this method has the shortest path and better robustness.

DOI: 10.61416/ceai.v25i2.8595


Keywords


Path planning, obstacle avoidance, navigation, unmanned driving, Bezier curve.

Full Text: PDF