共 34 条
Autonomous Driving on Curvy Roads Without Reliance on Frenet Frame: A Cartesian-Based Trajectory Planning Method
被引:75
|作者:
Li, Bai
[1
]
Ouyang, Yakun
[1
]
Li, Li
[2
]
Zhang, Youmin
[3
]
机构:
[1] Hunan Univ, Coll Mech & Vehicle Engn, Changsha 410082, Hunan, Peoples R China
[2] Tsinghua Univ, Dept Automat, BNRist, Beijing 100084, Peoples R China
[3] Concordia Univ, Dept Mech Ind & Aerosp Engn, Montreal, PQ H3G 1M8, Canada
基金:
加拿大自然科学与工程研究理事会;
中国国家自然科学基金;
关键词:
Trajectory;
Roads;
Kinematics;
Trajectory planning;
Planning;
Autonomous vehicles;
Task analysis;
computational optimal control;
nonlinear program;
Frenet frame;
autonomous vehicle;
OPTIMIZATION;
ALGORITHM;
D O I:
10.1109/TITS.2022.3145389
中图分类号:
TU [建筑科学];
学科分类号:
0813 ;
摘要:
Curvy roads are a particular type of urban road scenario, wherein the curvature of the road centerline changes drastically. This paper is focused on the trajectory planning task for autonomous driving on a curvy road. The prevalent on-road trajectory planners in the Frenet frame cannot impose accurate restrictions on the trajectory curvature, thus easily making the resultant trajectories beyond the ego vehicle's kinematic capability. Regarding planning in the Cartesian frame, selection-based methods suffer from the curse of dimensionality. By contrast, optimization-based methods in the Cartesian frame are more flexible to find optima in the continuous solution space, but the new challenges are how to tackle the intractable collision-avoidance constraints and nonconvex kinematic constraints. An iterative computation framework is proposed to accumulatively handle the complex constraints. Concretely, an intermediate problem is solved in each iteration, which contains linear and tractably scaled collision-avoidance constraints and softened kinematic constraints. Compared with the existing optimization-based planners, our proposal is less sensitive to the initial guess especially when it is not kinematically feasible. The efficiency of the proposed planner is validated by both simulations and real-world experiments. Source codes of this work are available at https://github.com/libai1943/CartesianPlanner.
引用
收藏
页码:15729 / 15741
页数:13
相关论文