4.5 Article

Synchronous Maneuver Searching and Trajectory Planning for Autonomous Vehicles in Dynamic Traffic Environments

Journal

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/MITS.2019.2953551

Keywords

Trajectory; Trajectory planning; Autonomous vehicles; Heuristic algorithms; Cost function; Space vehicles; Real-time systems

Funding

  1. National Natural Science Foundation of China [61751311, 61825305, U1564214]

Ask authors/readers for more resources

This paper proposes a synchronous maneuver searching and trajectory planning (SMSTP) algorithm based on the topological concept of homotopy in order to optimize the real-time performance of autonomous vehicles in dynamic environments. By using trajectory profiles and corridor generation algorithm, the algorithm limits the spatial and temporal range of the decision-making and planning process, and the simulation and realistic driving-test experiments validate the effectiveness of the algorithm.
In the real-time decision-making and local planning process of autonomous vehicles in dynamic environments, the autonomous driving system may fail to find a reasonable policy or even gets trapped in some situation due to the complexity of global tasks and the incompatibility between upper level maneuver decisions with the lower level trajectory planning. To solve this problem, this paper presents a synchronous maneuver searching and trajectory planning (SMSTP) algorithm based on the topological concept of homotopy. Firstly, a set of alternative maneuvers with boundary limits are enumerated on a multi-lane road. Instead of sampling numerous paths in the whole spatio-temporal space, we, for the first time, propose using Trajectory Profiles (TPs) to quickly construct the topological maneuvers represented by different routes, and put forward a corridor generation algorithm based on graph-search. The bounded corridor further constrains the maneuver's space in the spatial space. A step-wise heuristic optimization algorithm is then proposed to synchronously generate a feasible trajectory for each maneuver. To achieve real-time performance, we initialize the states to be optimized with the boundary constraints of maneuvers, and we set some heuristic states as terminal targets in the quadratic cost function. The solution of a feasible trajectory is always guaranteed only if a specific maneuver is given. The simulation and realistic driving-test experiments verified that the proposed SMSTP algorithm has a short computation time which is less than 37 ms, and the experimental results showed the validity and effectiveness of the SMSTP algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available