TY - JOUR
T1 - Precise trajectory optimization for articulated wheeled vehicles in cluttered environments
AU - Li, Bai
AU - Shao, Zhijiang
N1 - Publisher Copyright:
© 2015 Elsevier Ltd. All rights reserved.
PY - 2016/2/1
Y1 - 2016/2/1
N2 - Trajectory planning refers to planning a time-dependent path connecting the initial and final configurations with some special constraints simultaneously considered. It is a critical aspect in autonomously driving an articulated vehicle. In this paper, trajectory planning is formulated as a dynamic optimization problem that contains kinematic differential equations, mechanical/environmental constraints, boundary conditions and an optimization objective. The prevailing numerical methods for solving the formulated dynamic optimization problem commonly disregard the constraint satisfactions between every two adjacent discretized mesh points, thus resulting in failure when the planned motions are actually implemented. As a remedy for this limitation, the concept of minute mesh grid is proposed, which improves the constraint satisfactions between adjacent rough mesh points. On the basis of accurate penalty functions, large-scale constraints are successfully incorporated into the optimization criterion, thus transforming the dynamic optimization problem into a static one with simple bounds on the decision variables. Simulation results verify that our proposed methodology can provide accurate results and can deal with various optimization objectives uniformly.
AB - Trajectory planning refers to planning a time-dependent path connecting the initial and final configurations with some special constraints simultaneously considered. It is a critical aspect in autonomously driving an articulated vehicle. In this paper, trajectory planning is formulated as a dynamic optimization problem that contains kinematic differential equations, mechanical/environmental constraints, boundary conditions and an optimization objective. The prevailing numerical methods for solving the formulated dynamic optimization problem commonly disregard the constraint satisfactions between every two adjacent discretized mesh points, thus resulting in failure when the planned motions are actually implemented. As a remedy for this limitation, the concept of minute mesh grid is proposed, which improves the constraint satisfactions between adjacent rough mesh points. On the basis of accurate penalty functions, large-scale constraints are successfully incorporated into the optimization criterion, thus transforming the dynamic optimization problem into a static one with simple bounds on the decision variables. Simulation results verify that our proposed methodology can provide accurate results and can deal with various optimization objectives uniformly.
KW - Articulated vehicle
KW - Collision avoidance
KW - Computational guidance and control
KW - Large-scale optimization
KW - Mesh generation
KW - Trajectory planning
UR - https://www.scopus.com/pages/publications/84947906353
U2 - 10.1016/j.advengsoft.2015.10.008
DO - 10.1016/j.advengsoft.2015.10.008
M3 - 文章
AN - SCOPUS:84947906353
SN - 0965-9978
VL - 92
SP - 40
EP - 47
JO - Advances in Engineering Software
JF - Advances in Engineering Software
ER -