An Overtaking Trajectory Planning Framework Based on Spatio-temporal Topology and Reachable Set Analysis Ensuring Time Efficiency
Wule Mao, Zhouheng Li, Entao Sun, Lei Xie, Hongye Su

TL;DR
This paper introduces SROP, a novel overtaking trajectory planning framework that uses topological classes and reachable set analysis to improve efficiency, diversity, and feasibility in high-speed scenarios.
Contribution
It presents a hierarchical planning approach combining topological classification and reachable sets to enhance trajectory diversity and computational speed, addressing local optima issues.
Findings
Improves trajectory smoothness by 66.8%.
Reduces computation time by 62.9%.
Achieves high overtaking success rates in autonomous racing simulations.
Abstract
Generating overtaking trajectories in high-speed scenarios is typically addressed through hierarchical planning, which often suffers from local optima due to single initial solutions and low computational efficiency during numerical optimization. To overcome these limitations, this paper proposes a Spatio-temporal topology and Reachable set analysis enhanced Overtaking trajectory Planning framework (SROP). Specifically, by introducing topological classes to represent distinct overtaking behaviors, the upper-layer planner performs a spatio-temporal search to extract diverse initial paths, effectively preventing local optima. Subsequently, a lower-layer planner conducts parallel trajectory evaluation using reachable sets, which decouples vehicle kinematic constraints from the optimization process to ensure feasibility and significantly accelerate computation. Numerical experiments…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
