Optimal Trajectory Planning with Collision Avoidance for Autonomous Vehicle Maneuvering
Jason Zalev

TL;DR
This paper introduces a novel sequential convex optimization method for optimal trajectory planning in autonomous vehicles, enabling collision avoidance and efficient maneuvering such as parking.
Contribution
It presents a new approach using sequential convex optimization with a discretized Dubins model for collision-free, optimal trajectory generation in autonomous driving.
Findings
Efficient collision-free trajectories generated in parking scenarios
Method achieves shortest paths and minimal maneuver segments
Trajectories adhere to vehicle kinematic constraints
Abstract
To perform autonomous driving maneuvers, such as parallel or perpendicular parking, a vehicle requires continual speed and steering adjustments to follow a generated path. In consequence, the path's quality is a limiting factor of the vehicle maneuver's performance. While most path planning approaches include finding a collision-free route, optimal trajectory planning involves solving the best transition from initial to final states, minimizing the action over all paths permitted by a kinematic model. Here we propose a novel method based on sequential convex optimization, which permits flexible and efficient optimal trajectory generation. The objective is to achieve the fastest time, shortest distance, and fewest number of path segments to satisfy motion requirements, while avoiding sensor blind-spots. In our approach, vehicle kinematics are represented by a discretized Dubins model. To…
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.
Taxonomy
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
