TY - JOUR
T1 - Optimization-based maneuver planning for a tractor-trailer vehicle in a curvy tunnel
T2 - A weak reliance on sampling and search
AU - Li, Bai
AU - Li, Li
AU - Acarman, Tankut
AU - Shao, Zhijiang
AU - Yue, Ming
N1 - Publisher Copyright:
© 2022 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
PY - 2022/4/1
Y1 - 2022/4/1
N2 - This study is focused on the maneuver planning problem for a tractor-trailer vehicle in a curvy and tiny tunnel. Due to the curse of dimensionality, the prevalent sampling-and- search-based planners used to handle a rigid-body vehicle well become less efficient when the trailer number grows or when the tunnel narrows. This fact also has impacts on an optimization-based planner if it counts on a sampling-and-search-based initial guess to warm-start. We propose an optimization-based maneuver planner that weakly relies on the sampling and search, hoping to get rid of the curse of dimensionality and thus find optima rapidly. The proposed planner comprises three stages: stage 1 identifies the homotopy class via A∗ search in a 2D grid map; stage 2 recovers the kinematic feasibility with softened intermediate problems iteratively solved; stage 3 finds an optimum that strictly satisfies the nominal collision-avoidance constraints. Optimization-based planners are commonly known to run slowly, but this work shows that they have obvious advantages over the prevalent sampling-and-search-based planners when the solution space dimension is high and/or the constraints are harsh.
AB - This study is focused on the maneuver planning problem for a tractor-trailer vehicle in a curvy and tiny tunnel. Due to the curse of dimensionality, the prevalent sampling-and- search-based planners used to handle a rigid-body vehicle well become less efficient when the trailer number grows or when the tunnel narrows. This fact also has impacts on an optimization-based planner if it counts on a sampling-and-search-based initial guess to warm-start. We propose an optimization-based maneuver planner that weakly relies on the sampling and search, hoping to get rid of the curse of dimensionality and thus find optima rapidly. The proposed planner comprises three stages: stage 1 identifies the homotopy class via A∗ search in a 2D grid map; stage 2 recovers the kinematic feasibility with softened intermediate problems iteratively solved; stage 3 finds an optimum that strictly satisfies the nominal collision-avoidance constraints. Optimization-based planners are commonly known to run slowly, but this work shows that they have obvious advantages over the prevalent sampling-and-search-based planners when the solution space dimension is high and/or the constraints are harsh.
KW - Nonholonomic motion planning
KW - Optimization and optimal control
KW - Tractor-trailer vehicle
UR - https://www.scopus.com/pages/publications/85121921522
U2 - 10.1109/LRA.2021.3131693
DO - 10.1109/LRA.2021.3131693
M3 - 文章
AN - SCOPUS:85121921522
SN - 2377-3766
VL - 7
SP - 706
EP - 713
JO - IEEE Robotics and Automation Letters
JF - IEEE Robotics and Automation Letters
IS - 2
ER -