TY - GEN
T1 - Time-Optimal Curvature Continuous Path to a Line for Robot Steering
AU - Zhang, Songyi
AU - Jian, Zhiqiang
AU - Zhan, Wei
AU - Zheng, Nanning
AU - Tomizuka, Masayoshi
N1 - Publisher Copyright:
© 2023 IEEE.
PY - 2023
Y1 - 2023
N2 - This paper proposes a novel method for solving the time-optimal path for a Curvature Continous (CC) robot toward a given line, which is called the Line-Targeted Curvature Continous (LTCC) path. Such an LTCC path can be directly used in lane changes and departure applications and can participate in the planning of complex scenarios as the steering function. Instead of solving by optimization method, this paper derives a closed-form representation of the path under any boundary constraints, which is an essential and computationally-friendly approach. A rigorous mathematical deduction is used to prove the correctness of the proposed method, meanwhile, numerous experiments are performed for verification. The experiment results reveal that the algorithm can generate the same path as the optimization-based method but much faster. On this basis, the proposed method is tested as the steering function with the RRT∗ method in complex scenarios, which reveals its advantage over the CC path, and the great potential for the applications in the real world.
AB - This paper proposes a novel method for solving the time-optimal path for a Curvature Continous (CC) robot toward a given line, which is called the Line-Targeted Curvature Continous (LTCC) path. Such an LTCC path can be directly used in lane changes and departure applications and can participate in the planning of complex scenarios as the steering function. Instead of solving by optimization method, this paper derives a closed-form representation of the path under any boundary constraints, which is an essential and computationally-friendly approach. A rigorous mathematical deduction is used to prove the correctness of the proposed method, meanwhile, numerous experiments are performed for verification. The experiment results reveal that the algorithm can generate the same path as the optimization-based method but much faster. On this basis, the proposed method is tested as the steering function with the RRT∗ method in complex scenarios, which reveals its advantage over the CC path, and the great potential for the applications in the real world.
UR - https://www.scopus.com/pages/publications/85186531119
U2 - 10.1109/ITSC57777.2023.10422319
DO - 10.1109/ITSC57777.2023.10422319
M3 - 会议稿件
AN - SCOPUS:85186531119
T3 - IEEE Conference on Intelligent Transportation Systems, Proceedings, ITSC
SP - 615
EP - 622
BT - 2023 IEEE 26th International Conference on Intelligent Transportation Systems, ITSC 2023
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 26th IEEE International Conference on Intelligent Transportation Systems, ITSC 2023
Y2 - 24 September 2023 through 28 September 2023
ER -