一种基于分段贝塞尔曲线的自动驾驶车辆轨迹优化方法

By constructing a piecewise spatiotemporal three-dimensional convex space using piecewise Bézier curves and transforming it into a quasi-quadratic programming problem, the safety and feasibility issues of existing trajectory planning algorithms under complex configuration spatiotemporal obstacles and dynamic constraints are solved, achieving more efficient trajectory optimization.

CN117093004BActive Publication Date: 2026-07-17NANJING UNIV OF AERONAUTICS & ASTRONAUTICS +1

Patent Information

Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
NANJING UNIV OF AERONAUTICS & ASTRONAUTICS
Filing Date
2023-09-18
Publication Date
2026-07-17

AI Technical Summary

Technical Problem

Existing polynomial trajectory planning algorithms cannot effectively guarantee safety and feasibility under complex configurations, spatiotemporal obstacles, and dynamic constraints, and have high computational complexity.

Method used

Piecewise Bézier curves are used for trajectory optimization. By leveraging the convex hull and convex graph properties of Bézier curves, a piecewise spatiotemporal three-dimensional convex space is constructed. The trajectory optimization problem is then transformed into a quasi-quadratic programming problem for solution. The convex graph properties of Bézier curves are used to constrain and control the trajectory with higher-order quantities.

Benefits of technology

It improves the robustness and security of trajectory optimization, reduces computational complexity, generates trajectories that better meet actual needs, and enhances the computational efficiency and real-time performance of the algorithm.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN117093004B_ABST
    Figure CN117093004B_ABST
Patent Text Reader

Abstract

本发明公开了一种基于分段贝塞尔曲线的自动驾驶车辆轨迹优化方法,包括:获取自车车辆位置及状态、决策粗轨迹、动静态障碍物信息、车道中心线信息;将自车车辆位置及状态、决策粗轨迹、动静态障碍物信息从笛卡尔坐标系转换到Frenet坐标系下,并填充到栅格地图中;以转换后的当前车辆位置为规划起点,基于填充了动静态障碍物信息和决策粗轨迹后的栅格地图进行分段时空三维凸空间的构建;采用分段贝塞尔曲线进行轨迹优化,将代价函数、约束条件转换成准二次规划问题数学表达式中各个矩阵的形式,进行最优轨迹求解。本发明借助于贝塞尔曲线的凸包特性和凸形图特性,对轨迹的高阶量进行约束并通过约束控制点在凸空间内来保证轨迹的安全性。
Need to check novelty before this filing date? Find Prior Art