TY - GEN
T1 - Speed Planning for Autonomous Driving in Dynamic Urban Driving Scenarios
AU - Wang, Mingqiang
AU - Wang, Zhenpo
AU - Zhang, Lei
AU - Dorrell, D. G.
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/10/11
Y1 - 2020/10/11
N2 - Trajectory planning is essential for autonomous vehicles when operating in dynamic traffic environments. A layered approach usually separates out into path planning and speed planning. In the work reported in this paper, speed profile planning over a given path, which is defined by a trajectory planner, is proposed. The relevant information is provided by vehicle-to-vehicle (V2V) communication. First, a speed planning optimization algorithm which considers safety, time efficiency, smoothness and comfort constraints is presented. This strategy can provide a safe, comfortable and feasible speed profile for autonomous driving via a S-T graph under a complex traffic environment. Secondly, a conventional non-convex optimization problem is translated into a quadratic programming problem. This has the advantage of a low computation requirement because it uses a CFS (convex feasible set) algorithm. The effectiveness of the proposed scheme is verified through simulation studies in various urban driving scenarios. This holistic approach provides a more effective approach to speed and trajectory planning.
AB - Trajectory planning is essential for autonomous vehicles when operating in dynamic traffic environments. A layered approach usually separates out into path planning and speed planning. In the work reported in this paper, speed profile planning over a given path, which is defined by a trajectory planner, is proposed. The relevant information is provided by vehicle-to-vehicle (V2V) communication. First, a speed planning optimization algorithm which considers safety, time efficiency, smoothness and comfort constraints is presented. This strategy can provide a safe, comfortable and feasible speed profile for autonomous driving via a S-T graph under a complex traffic environment. Secondly, a conventional non-convex optimization problem is translated into a quadratic programming problem. This has the advantage of a low computation requirement because it uses a CFS (convex feasible set) algorithm. The effectiveness of the proposed scheme is verified through simulation studies in various urban driving scenarios. This holistic approach provides a more effective approach to speed and trajectory planning.
KW - CFS
KW - ST graph
KW - Speed Planning
KW - quadratic programming
UR - https://www.scopus.com/pages/publications/85097174720
U2 - 10.1109/ECCE44975.2020.9235659
DO - 10.1109/ECCE44975.2020.9235659
M3 - Conference contribution
AN - SCOPUS:85097174720
T3 - ECCE 2020 - IEEE Energy Conversion Congress and Exposition
SP - 1462
EP - 1468
BT - ECCE 2020 - IEEE Energy Conversion Congress and Exposition
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 12th Annual IEEE Energy Conversion Congress and Exposition, ECCE 2020
Y2 - 11 October 2020 through 15 October 2020
ER -