Next Article in Journal
A Hybrid Intention Recognition Framework with Semantic Inference for Financial Customer Service
Previous Article in Journal
Online Pulse Compensation for Energy Spectrum Determination: A Pole-Zero Cancellation and Unfolding Approach
Previous Article in Special Issue
Research on a Passenger Flow Prediction Model Based on BWO-TCLS-Self-Attention
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Research on Trajectory Planning Method Based on Bézier Curves for Dynamic Scenarios

1
School of Automobile and Transportation Engineering, Guangdong Polytechnic Normal University, Guangzhou 510665, China
2
School of Innovative Engineering, Macau University of Science and Technology, Macau 999078, China
*
Author to whom correspondence should be addressed.
Electronics 2025, 14(3), 494; https://doi.org/10.3390/electronics14030494
Submission received: 30 November 2024 / Revised: 14 January 2025 / Accepted: 23 January 2025 / Published: 25 January 2025

Abstract

:
With the increase in car ownership, traffic congestion, and frequent accidents, autonomous driving technology, especially for dynamic driving scenarios in the whole domain, has become a technological challenge for today’s researchers. Trajectory planning, as a crucial component of the autonomous driving technology framework, is gradually becoming a hot topic in intelligent research. In response to the challenges of planning lane-changing trajectories in complex dynamic driving scenarios under emergency evasive maneuvers, where it is difficult to consider surrounding vehicles and achieve dynamic adaptability, this paper proposes a dynamic adaptive trajectory planning method based on Bézier curves. Firstly, a mathematical model of Bézier curves is established and its curve characteristics are analyzed, which facilitates the correlation between the trajectory control points and the vehicle and the surrounding obstacles. Secondly, a mathematical function representing the Bézier curve is formulated, where the control points serve as the input and the lane-changing control curve as the output. Finally, the proposed method is validated through simulations on a jointly established simulation platform. The results indicate that the proposed method can plan lane-changing trajectories that are both safe and efficient under emergency evasive maneuvers, considering both static and complex dynamic conditions. This provides a novel solution for lane-changing trajectory planning in emergency evasive maneuvers for autonomous vehicles and holds significant theoretical research value.

1. Introduction

As the global new energy vehicle industry and internet technology continue to advance, autonomous driving technology has experienced rapid development. Trajectory planning, as an essential and challenging aspect of achieving autonomous driving, is both a research focus and a difficulty. The key issue lies in effectively planning a smooth trajectory that ensures the vehicle can safely and smoothly avoid obstacles in dynamically complex road conditions. This has become a hot topic in the field of autonomous driving research. The ability to accurately predict and plan vehicle paths is crucial for the success of autonomous systems, as it directly impacts safety, efficiency, and the overall user experience. Therefore, ongoing research is focused on developing advanced trajectory planning algorithms that can adapt to various scenarios and optimize vehicle performance [1].
A variety of trajectory planning methods exist for local paths, each characterized by its distinct features. Among the more prevalent trajectory planning techniques currently employed, those based on lateral acceleration stand out [2]: a trajectory planning methodology grounded in network search algorithms [3], a sampling-based planning methodology [4,5], and an artificial potential field method [6,7]. In this context, S. Deolasee et al. [8] proposed using trapezoidal-prism-shaped corridors for optimization, which significantly enlarges the solution space compared to the existing cuboidal-corridor-based method. However, this method does not take into account the bend section condition or the situation where there are surrounding obstacles. Wulfmeier M et al. [9] presented an approach for creating spatial traversability maps for driving in complex urban settings. This approach leverages a comprehensive dataset showcasing expert humans’ driving habits. By establishing a direct mapping from raw input data to cost, this method circumvents the need for manually designing certain components of the process. It effectively utilizes a vast amount of data samples. Additionally, this method can be used to enhance manually crafted cost maps, which are typically based on manually engineered features. However, this method has the problem of excessive computational complexity when planning trajectories for large areas. R. Cuesta and J. Alvarez. [10] proposed a method for designing closed curves using second-order Bézier curves for trajectory planning of mobile robots. However, second-order Bézier curves are not sufficiently applicable in complex scenarios. X Li et al. [11] presented a framework for local trajectory generation for autonomous vehicles navigating along a given reference path. This framework utilizes a two-phase motion planning approach. Initially, a Support Vector Machine technique is employed to enhance the reference path by maximizing the lateral clearance from the corridor boundaries while maintaining curvature continuity. Subsequently, a series of terminal states are sampled and correlated with the refined reference path. To adhere to system constraints, a model predictive path generation technique is then applied to create multiple viable paths, each linking the current vehicle state to the sampled terminal states. Nonetheless, the model predictive path generation method employed in the second step, while capable of considering system constraints and generating multiple path candidates, may be impacted in terms of performance and accuracy by factors such as model precision, computational resources, and time constraints. Guo Minghao et al. [12] proposed an enhanced artificial potential field method for autonomous driving trajectory planning. This improvement involves incorporating factors such as distance adjustment, dynamic road repulsion, velocity repulsion, and acceleration repulsion. To address the shortcomings of the traditional artificial potential field method, they introduce the invasive weed algorithm. Additionally, they develop a prediction model by linearizing and discretizing a vehicle dynamics model. This model includes predefined constraint variables and an optimized objective function, forming the foundation of an MPC model controller designed to achieve precise trajectory tracking. However, the method may easily encounter local optimal solutions during the solution process, leading to deadlocks.
Bézier curves are generated based on predefined control points, yielding continuous and smooth curves. They have been widely applied in various fields. Among them, H Li et al. [13] presented a path planning method based on a fifth-order Bézier curve for lane changing with a vehicle in front. However, the proposed method does not take into account the surrounding obstacle vehicles, Y Chen et al. [14] presented an accurate and efficient clothoid approximation approach using Bézier curves based on the minimization of curvature profile difference. Compared with existing methods, the proposed approach can guarantee higher-order geometric continuity with smaller approximation errors in terms of position, orientation, and curvature. Nevertheless, the proposed method lacks simulation validation to demonstrate practicality in reality. J Chen et al. [15] generated a path based on a piecewise quadratic Bezier curve, and the maximum curvature of the Bezier curve was calculated to verify whether an autonomous vehicle could follow the path. However, there is a shortage of consideration of speed variation scenarios for surrounding vehicles. J. Moreau et al. [16] proposed a Bézier curve optimization method to cope with these constraints, and the autonomous vehicles under study were considered equipped with all the necessary sensors for obstacle detection. In this way, the obstacle avoidance problem is transformed into an optimization problem under equality constraints. However, the computational efficiency of the method is inefficient, and its real-time applicability is limited in practice.
The studies described above indicate that by optimizing the positioning and quantity of control points, Bézier curves can flexibly adapt to various complex road conditions and driving requirements, thereby achieving the goal of ensuring smooth and safe vehicle trajectories during operation. Furthermore, Bézier curves possess superior mathematical properties, which enable highly precise calculations and optimizations in trajectory planning. Through the adjustment and optimization of curve parameters, the smoothness and precision of the trajectory can be further enhanced, thereby bolstering the performance and safety of autonomous vehicles.
This paper proposes a dynamic and adaptive trajectory planning method based on Bézier curves. Firstly, a mathematical model of Bézier curves is established, and the correlation characteristics between the curves and their control points are analyzed. Secondly, the trajectory control points are associated with the vehicle and surrounding obstacle vehicles, and a mathematical expression of the Bézier curve is established to output lane-changing trajectory curves as inputs from the control points. Finally, the proposed method is simulated and validated on a joint simulation platform. The results indicate that the proposed method can plan safe and comfortable lane-changing trajectories under both static and dynamic complex lane-changing conditions. This provides a new solution for autonomous driving trajectory planning.

2. Bézier Curve Model and Its Characteristic Analysis

2.1. Bézier Curve Model

The Bézier curve was introduced in 1962, and its characteristic of defining its shape through control points endows it with a high degree of flexibility and controllability in describing complex smooth curves. Due to their smoothness and controllability, Bézier curves have been widely applied in trajectory curve planning within autonomous driving systems [17,18]. The n-degree Bézier curve defined by the given points p 0 , p 1 , …, p n can be expressed in the general form as shown in Equation (1) [19].
B t = i = 0 n n i p i 1 t n i t i = n 0 p 0 1 t n t 0 + n 1 p 1 1 t n 1 t 1 +     + n n 1 p n 1 1 t 1 t n 1 + n n p n 1 t 0 t n
The lateral displacement y and longitudinal displacement x are expressed as functions of the parameter t; hence, the cubic Bézier curve can be represented by Equation (2).
x = x 1 1 t 3 + 3 x 2 t 1 t 2 + 3 x 3 t 2 1 t + x 4 t 3 y = y 1 1 t 3 + 3 y 2 t 1 t 2 + 3 y 3 t 2 1 t + y 4 t 3                                                  
In the equation, ( x i , y i ), i = 1 , 2 , 3 , 4 , represents the coordinate information of the selected points, y i denotes the lateral displacement during the lane-changing process, and x i corresponds to the longitudinal displacement, and t is a curve parameter; t 0 , 1 .

2.2. Bézier Curve Characteristic Analysis

From the illustrative diagram of the Bézier curve (Figure 1), it can be observed that, based on the function expression of the Bézier curve, a smooth and feasible curve can be generated using the four control points P 0 , P 1 , P 2 , and P 3 . The planned curve precisely passes through the initial and final points P 0 and P 3 , while also avoiding the intermediate points P 1 and P 2 .
To further analyze the impact of control points on the Bézier curve, the control points are denoted as P 0 x 0 , y 0 , P 1 x 1 , y 1 , P 2 x 2 , y 2 , and P 3 x 3 , y 3 . Firstly, an analysis is conducted to investigate the influence of different horizontal coordinates x 1 of point P 1 on the Bézier curve. Values for x 1 are selected ranging from 2.8 to 2, with an interval of 0.2, while maintaining the original coordinates of P 0 0 , 0 , P 2 2 , 3.5 , and P 3 4 , 3.5 unchanged. Consequently, a cluster of curves is generated as depicted in Figure 2a. Similarly, an analysis is conducted to examine the influence of different x 2 values, which are the horizontal coordinates of point P 2 , on the curve. Values for x 2 are taken from 2 to 2.8, with an interval of 0.2, while keeping the original coordinates of P 0 0 , 0 , P 2 2 , 3.5 , and P 3 4 , 3.5 unchanged. This results in the generation of a cluster of curves, as illustrated in Figure 2b. Through analysis, it can be observed that as the value of x 1 gradually decreases, the generated Bézier curve shifts towards the negative half of the x-axis, meaning that the curve shifts in the same direction as the point P 1 shifts. Similarly, as the value of x 2 gradually increases, the generated Bézier curve shifts towards the positive half of the x-axis, indicating that the curve shifts in the same direction as the point P 2 shifts. Therefore, it can be concluded that the Bézier curve has the characteristic of changing with the position of its control points, providing theoretical support for the feasibility of trajectory planning in subsequent dynamic scenarios. Through analysis, it can be seen that as the value of x 1 gradually decreases, the generated Bézier curve gradually shifts towards the negative half of the x-axis, meaning that the curve shifts in the same direction as the point P 1 shifts. Similarly, as the value of x 2 gradually increases, the generated Bézier curve gradually shifts towards the positive half of the x-axis, indicating that the curve shifts in the same direction as the point P 2 shifts. Therefore, it can be concluded that the Bézier curve has the characteristic of changing with the position of its control points, providing theoretical support for the feasibility of trajectory planning in subsequent dynamic scenarios.

3. Bézier Curve Trajectory Planning

3.1. Establishment of Control Points for Bézier Curve

In dynamic and complex lane-changing scenarios, the lane-changing trajectory often needs to consider not only the obstacle vehicle ahead but also the approaching vehicle from the side and rear, as shown in Figure 3. An ideal collision avoidance lane-changing trajectory should not only safely bypass the vehicle ahead that is about to collide but also ensure a safe distance from the vehicle behind during the lane-changing process.
Based on the analysis of the characteristics of Bézier curves, it is known that a cubic Bézier curve can not only avoid the control points other than the start and end points but also shift in the same direction as the offset of that control point. This characteristic precisely meets the theoretical requirements of lane-changing trajectory planning to avoid the vehicle ahead and the vehicle from the side and rear while maintaining a safe distance from them. To apply Bézier curves in lane-changing trajectory planning, the initial and final points P 0 and P 3 are set as the initial position of the ego vehicle and the target position after lane changing, respectively. The intermediate points P 1 and P 2 are set as the coordinates of the obstacle vehicle or coordinates related to the obstacle vehicle. In this study, the position coordinates of the ego vehicle P 0 x 0 , y 0 are taken as the starting point of the lane change, with x 0 = 0 , y 0 = 0 ; P 1 x 1 , y 1 is a control point related to the obstacle vehicle ahead. To increase the safety distance and reduce the risk of collision, the position of the obstacle vehicle ahead is not directly used as the coordinates of the control point P 1 . Instead, this study uses the midpoint coordinates between the ego vehicle and the obstacle vehicle ahead as the coordinates of point P 1 . This allows the lane-changing curve planned by the Bézier curve to have a larger distance redundancy from the obstacle vehicle while still avoiding the control point.
Given the coordinates of the obstacle vehicle ahead as d 1 , 0 , have x 1 = d 1 2 , and thus the coordinates of P 1 are d 1 2 , 0 . Similarly, using the midpoint coordinates between the obstacle vehicle ahead and the obstacle vehicle behind as P 2 x 2 , y 2 , with the lane width being y d and the coordinates of the obstacle vehicle behind being d 2 , y d , have x 2 = d 1 + d 2 2 . Therefore, the coordinates of P 2 are x 2 = d 1 + d 2 2 , y d . Taking the intersection of the horizontal coordinate of the obstacle vehicle ahead and the vertical coordinate of the obstacle vehicle behind as the final point P 3 x 3 , y 3 of the lane change, have x 3 = d 1 , y 3 = y d . Thus, the coordinates of the final point P 3 of the lane change are d 1 , y d . The corresponding table of control points and their coordinates is shown in Table 1

3.2. Bézier Curve Trajectory Planning Method in Static Scenarios

In the case where the road width y d is a constant, the variables that affect the coordinates of the control points of the Bézier curve are only d 1 and d 2 , meaning that the generated Bézier curve will change with the horizontal coordinates of the preceding and following vehicles. Firstly, analyze the impact of different d 1 and d 2 values on the resulting Bézier curve trajectories. Select a cluster of curves generated by different d 1 values (taking a lane-changing lateral displacement of 3.5 m, with d 2 fixed at −10 m, and d 1 ranging from 60 m to 45 m, with an interval of 5 m) and another cluster generated by different d 2 values (taking a lane-changing lateral displacement of 3.5 m, with d 1 fixed at 60 m, and d 2 ranging from −20 m to −2 m, with an interval of 6 m). The plots corresponding to these clusters are shown in Figure 4a and Figure 4b, respectively.
From Figure 4a, it can be observed that as d 1 gradually decreases, the planned Bézier trajectory curve exhibits a trend of shifting towards the negative half-axis of the x-axis. This means that when the distance between the ego vehicle and the obstacle vehicle ahead decreases, the planned Bézier lane-changing trajectory curve shifts away from the direction of the obstacle vehicle ahead. Consequently, the risk of collision with the preceding vehicle during the lane-changing process decreases.
From Figure 4b, it can be seen that as d 2 gradually decreases, the planned Bézier trajectory curve shows a trend of shifting towards the positive half-axis of the x-axis. This indicates that when the distance between the ego vehicle and the obstacle vehicle behind decreases, the planned Bézier lane-changing trajectory curve shifts away from the direction of the obstacle vehicle behind. Therefore, the risk of collision with the following vehicle during the lane-changing process decreases.
In addition to ensuring the safety of the lane-changing process, a high-quality lane-changing trajectory planning method should also strive to ensure the smoothness and comfort of the lane-changing trajectory in non-emergency collision avoidance scenarios. By comparing the Bézier lane-changing trajectory curves dynamically generated under the condition of gradually increasing d 1 (with a lateral displacement for lane changing set at 3.5 m, d 2 fixed at −10 m, and d 1 ranging from 60 m to 120 m with an interval of 20 m), which corresponds to a situation where the distance between the ego vehicle and the obstacle vehicle ahead is relatively large and lane changing is not for emergency collision avoidance, as shown in Figure 5, it can be observed that as d 1 increases, the lane-changing trajectory generated by the Bézier curve becomes smoother, and the longitudinal displacement required to complete the lane changing also increases. Therefore, under the same vehicle speed and lateral displacement, the lateral acceleration generated during the lane-changing maneuver will gradually decrease, making the lane-changing process more comfortable.

3.3. Trajectory Planning Using Bézier Curves in Dynamic Scenarios

In the process of lane changing in dynamic scenarios, in addition to considering the positions of surrounding obstacle vehicles at the initial moment of lane changing to plan a lane-changing curve, it is also necessary to take into account the changes in the positions of surrounding vehicles during the ongoing lane-changing process, such as sudden acceleration or deceleration of the preceding or following vehicles. Therefore, during the lane-changing process, it is required to dynamically plan new lane-changing trajectories in real time based on the real-time positions of surrounding obstacle vehicles to ensure the safety of the lane-changing process.
With the initial position of the ego vehicle set as P 0 ( 0 , 0 ) , the initial longitudinal distance between the ego vehicle and the obstacle vehicle ahead is 20 m, and the initial longitudinal distance between the ego vehicle and the obstacle vehicle behind in the adjacent lane is 10 m. The lane width is 3.5 m. According to the coordinate correspondence table in Table 1, the control points can be obtained as P 1 ( 10 , 0 ) , P 2 ( 5 , 3.5 ) , and P 3 ( 30 , 3.5 ) , as shown in Figure 6.
Let the longitudinal relative distance between the ego vehicle and the preceding vehicle decrease at a speed of 0.5 m per unit of time and the longitudinal relative distance between the ego vehicle and the vehicle behind on the adjacent lane decrease at a speed of 0.6 m per unit of time (this simulates the scenario where the relative positions of surrounding vehicles change dynamically in real-time during the lane-changing process).
Firstly, a larger curve update cycle is selected to more clearly demonstrate the situation where the Bézier lane-changing trajectory curve is updated in real-time according to the dynamic changes of the control points during the lane-changing process, as shown in Figure 7a.
From Figure 7a, it can be seen that during the lane-changing process, a new trajectory curve is generated every cycle until the lane-changing action is completed. However, due to the large update cycle selected, the lane-changing trajectory is not smooth, which is not suitable for real vehicle operating conditions. In practical applications, the update cycle should be shortened to make the final trajectory curve smooth and ensure the comfort of lane changing, as shown in Figure 7b.
In summary, for static scenarios, the Bézier curve trajectory planning method can adjust the lane-changing trajectory curve according to the different coordinates of the vehicles ahead and behind at the beginning of lane changing. When the obstacle vehicles ahead or behind are close, the planned trajectory curve can deviate in the direction away from the obstacle vehicles, better controlling the longitudinal distance between the ego vehicle and the obstacle vehicles, significantly reducing the risk of collision with obstacle vehicles during the lane-changing process and ensuring the safety of lane changing. In non-emergency lane-changing and collision avoidance situations, the planned trajectory curve is smoother, ensuring the comfort of lane changing in non-emergency traffic environments.
For dynamic driving scenarios, the Bézier curve trajectory planning method can adaptively adjust the trajectory curve according to the real-time position changes of surrounding vehicles under dynamic and complex lane-changing conditions, improving the safety of lane changing and providing guidance and a basis for dynamic collision avoidance trajectory planning in complex traffic situations.

4. Simulation Analysis

4.1. Simulation Analysis of Bézier Curve Trajectory Planning Method in Static Scenarios

To validate the proposed method, this study utilized a co-simulation platform built based on MATLAB (R2021B) and Carsim (2019.0) using Logitech G29. As shown in Figure 8, Carsim outputs the position coordinates of the ego vehicle and obstacle vehicles to the MATLAB algorithm. The algorithm then calculates the Bézier curve lane-changing trajectory and inputs it back into Carsim to control the ego vehicle to perform the lane-changing maneuver.
For the static lane-changing scenarios where obstacles are present both ahead and to the rear side, the following two conditions are simulated and analyzed separately.
Condition 1 is the ego vehicle is initially travelling straight at a constant speed of 60 km/h. A stationary vehicle appears 40 m ahead, necessitating a lane change to avoid it. Additionally, there is a stationary vehicle 15 m behind on the left lane. This simulation condition focuses on the Bézier curve lane-changing trajectory planning simulation analysis when there is a relatively distant stationary obstacle ahead and another obstacle behind on the side-rear, resulting in a relatively smooth lane-changing maneuver. Figure 9 depicts the initial state of Condition 1. The red and yellow line in Figure 9 indicates that the vehicle’s sensors have sensed the vehicle ahead and behind it, respectively.
From the simulation results in Figure 10a,b, it can be observed that the planned lane-changing trajectory is relatively smooth when the distance to the preceding vehicle is far. Additionally, the maximum lateral acceleration during the entire lane-changing process is less than 1.5 m/s2 [20], ensuring good lane-changing comfort. Figure 10c shows that the minimum distance between the ego vehicle and the preceding vehicle is 15 m, eliminating the risk of collision and thus ensuring good safety [21]. In summary, under the condition of a relatively far distance to the preceding vehicle and a relatively smooth lane-changing scenario, the Bézier curve trajectory planning method can plan a comfortable lane-changing trajectory while ensuring the safety of the lane-changing process.
Condition 2 describes a scenario where the ego vehicle is initially travelling straight at a constant speed of 60 km/h. A stationary vehicle suddenly appears 20 m ahead, necessitating an emergency lane change to avoid it. Additionally, there is another stationary vehicle 15 m behind in the left lane. This simulation focuses on the Bézier curve lane-changing trajectory planning analysis when the ego vehicle encounters a stationary obstacle close ahead under urgent lane-changing conditions and another obstacle is present behind in the adjacent lane. Figure 11a depicts a situation where the ego vehicle is travelling normally and has not yet detected the stationary vehicle ahead; Figure 11b shows the ego vehicle in the process of lane changing along the planned Bézier curve trajectory. The red and yellow line in Figure 11a indicates that the vehicle’s sensors have sensed the vehicle ahead and behind it, respectively. The red dotted line in Figure 11b shows the lane change trajectory.
Based on the simulation results, the vehicle successfully avoids the slower vehicle ahead and does not collide with the vehicle behind. From Figure 12a, it can be seen that under the more urgent lane-changing condition with a closer distance to the preceding vehicle, the planned lane-changing trajectory curve is more aggressive compared to Condition 1. Figure 12b, which compares the lateral acceleration generated during lane changing between Condition 1 and Condition 2, shows that under the more urgent lane-changing scenario of Condition 2, the maximum lateral acceleration along the generated trajectory is greater than that in the more relaxed Condition 1. However, the time required to complete the lane change in Condition 2 is only 3.2 s, significantly less than the 4.3 s required in Condition 1. Additionally, Figure 12c indicates that the minimum distance between the ego vehicle and the preceding vehicle is approximately 16 m, posing no risk of collision. Therefore, under urgent lane-changing conditions, the Bézier curve trajectory planning method can plan a safe and efficient lane-changing trajectory, ensuring the safety of the lane change.
In summary, the Bézier curve lane-changing trajectory planning method can adaptively plan appropriate lane-changing trajectories under both relaxed and urgent lane-changing conditions, effectively completing collision avoidance operations. While ensuring safety, it also maximizes the comfort or efficiency of the lane change as much as possible.

4.2. Simulation Analysis of Bézier Curve Trajectory Planning in Dynamic Scenarios

Based on Carsim/Simulink, a comprehensive simulation is conducted for dynamic lane-changing scenarios where there are moving and variable-speed obstacle vehicles both ahead and to the rear side. The simulation is divided into three conditions: Condition 1 is when the surrounding vehicles maintain a constant speed; Condition 2 is when a vehicle from the rear side accelerates and approaches as the ego vehicle begins to change lanes; and Condition 3 is when the preceding vehicle decelerates and approaches when the ego vehicle begins to change lanes.
This simulation compares scenarios where the vehicle behind on the side begins to accelerate and approach as the ego vehicle initiates a lane change. Figure 13a depicts the situation during the entire lane-changing operation when the vehicle ahead and the vehicle behind on the side are both travelling at a constant speed, with the ego vehicle travelling at 110 km/h and both the preceding vehicle and the vehicle behind on the side travelling at 100 km/h. Figure 13b shows a scenario where the vehicle behind accelerates and approaches midway through the lane-changing operation, with the ego vehicle maintaining a constant speed of 110 km/h, the preceding vehicle maintaining a constant speed of 100 km/h, and the vehicle behind on the side accelerating from 110 km/h to 120 km/h when the ego vehicle starts the lane change. Figure 13c illustrates a situation where the preceding vehicle decelerates and approaches during the lane-changing operation, with the ego vehicle maintaining a constant speed of 110 km/h, the vehicle behind maintaining a constant speed of 100 km/h, and the preceding vehicle decelerating from 110 km/h to 90 km/h when the ego vehicle starts the lane change. The red dotted line in Figure 13 indicates the schematic of the lane change trajectory in the simulation scenario of the corresponding subfigure.
From the comparison of lane-changing trajectories planned under the three different conditions shown in Figure 14, it can be observed that each condition results in a lane-changing trajectory curve with a different degree of inclination. In the simulation of Condition 2, where the vehicle behind accelerates, due to the approaching and accelerating vehicle from the rear side, if the ego vehicle were to change lanes with a large lateral speed at this time, it would be prone to a collision with the approaching vehicle. Therefore, the dynamic Bézier curve plans a trajectory that is more inclined to the right compared to other conditions, based on changes in the control points (with control point P2 gradually moving to the right). This, combined with the appropriate acceleration of the ego vehicle, ensures a safe distance from the approaching vehicle from behind. In the simulation of Condition 3, where the preceding vehicle decelerates, if the ego vehicle were to change lanes without a significant lateral speed at this time, it would be prone to a collision with the preceding vehicle. Hence, the dynamic Bézier curve plans a trajectory that is more inclined to the left compared to other conditions, based on changes in the control points (with control point P1 gradually moving to the left), allowing for a quicker lane change to the side and avoiding a collision with the preceding vehicle.
The conventional Bézier curve trajectory planning method merely generates a single path at the initiation of a lane change, without incorporating adaptive adjustments to the evolving relative positions between the ego vehicle and obstacle vehicles throughout the lane-changing process. To evaluate the proposed dynamic adaptive Bézier curve trajectory planning method, simulation experiments are conducted under Condition 2 and Condition 3, respectively, in comparison with the conventional Bézier curve trajectory planning method. The comparison focuses on the trend of longitudinal distance changes to the front and rear vehicle from the start of the lane change until the midpoint, i.e., when the lateral displacement of the ego vehicle reaches half of the lane width, in both conditions.
As shown in Figure 15, in the simulation of Condition 2, when the rear vehicle accelerates and approaches, the reduction in the distance between the ego vehicle and the rear vehicle using the adaptive control method proposed in this paper is obviously smaller than that using the traditional non-adaptive control method. Similarly, as shown in Figure 16, in the simulation of Condition 3, when the front vehicle is approaching with deceleration, the reduction in the distance between the ego vehicle and the front vehicle with the adaptive control method proposed in this paper is also notably smaller than that with the traditional non-adaptive control method. This indicates that the lane change trajectory planned by the method proposed in this paper has a better ability to maintain a safe distance compared with the traditional method, so it can increase the redundancy of the distance between the front and rear vehicles and significantly reduce the risk of collision with them.

5. Conclusions

This study proposes an adaptive trajectory planning method based on Bézier curves for lane-changing scenarios with obstacle vehicles in the vicinity. Firstly, the characteristics of Bézier curves and the impact of changes in control points on the curves are analyzed. Then, using a cubic Bézier curve as the basis for trajectory planning, control points related to the ego vehicle and obstacle vehicles are established for lane-changing scenarios. Subsequently, functions are developed to output static single and dynamic real-time updated and iterated Bézier curves, with static and dynamic control points as inputs, respectively. Finally, the proposed method is verified through simulation, and the results indicate that the static Bézier curve trajectory planning method can adaptively generate a smooth and safe lane-changing trajectory based on the position of obstacle vehicles, ensuring a safe distance from static obstacle vehicles.
Through the research in this paper, it is found that the dynamic Bézier curve trajectory planning method can dynamically adjust and generate lane-changing trajectory curves based on the coordinates of vehicles in front and behind. When obstacle vehicles in front or behind gradually approach, the dynamically planned trajectory curves can make real-time adjustments compared to static trajectory planning, significantly reducing the risk of collisions with obstacle vehicles during the lane-changing process and ensuring safety in complex traffic environments. The proposed method can use fewer control points to achieve adaptive control of lane-changing trajectories under both static and complex dynamic lane-changing conditions, which effectively improves the computational efficiency and provides a new solution for dynamic lane-changing trajectory planning of driverless cars under emergency collision avoidance conditions. The method will be optimized for more complex and changing driving scenarios in further research.

Author Contributions

Conceptualization, H.L.; Methodology, H.L. and H.P.; Simulation, Y.H.; Validation, H.X.; Formal analysis, H.P. and H.X.; Writing—original draft, H.L. and H.P.; Writing—review & editing, X.Z.; Project administration, Y.H.; Funding acquisition, X.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by Guangzhou Science and Technology Planning Project [2023A04J0366].

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Liu, Y.; Liu, L.; Yu, X.; Wang, C. Optimal Path Planning Algorithm of AUV State Space Sampling Based on Improved Cost Function. In Proceedings of the 2020 39th Chinese Control Conference (CCC), Shenyang, China, 27–29 July 2020; pp. 3747–3752. [Google Scholar] [CrossRef]
  2. Fan, Y.; Li, L.; Zhang, F. Intelligent Vehicle Lane-Change Trajectory Planning on Slippery Road Surface Using Nonlinear Programming. In Proceedings of the 2022 41st Chinese Control Conference (CCC), Hefei, China, 25–27 July 2022; pp. 5365–5370. [Google Scholar] [CrossRef]
  3. Pandey, K.K.; Parhi, D.R. Trajectory Planning and the Target Search by the Mobile Robot in an Environment Using a Behavior-Based Neural Network Approach. Robotica 2020, 38, 1627–1641. [Google Scholar] [CrossRef]
  4. Zhu, D.D.; Sun, J.Q. A New Algorithm Based on Dijkstra for Vehicle Path Planning Considering Intersection. IEEE Access 2021, 9, 19761–19775. [Google Scholar] [CrossRef]
  5. Zhang, T.; Wang, J.; Meng, Q. Generative Adversarial Network Based Heuristics for Sampling-Based Path Planning. IEEE/CAA J. Autom. Sin. 2022, 9, 64–74. [Google Scholar] [CrossRef]
  6. Hu, J.; Cheng, C.; Wang, C.; Zhao, C.; Pan, Q.; Liu, Z. An Improved Artificial Potential Field Method Based on DWA and Path Optimization. In Proceedings of the 2019 IEEE International Conference on Unmanned Systems (ICUS), Beijing, China, 17–19 October 2019; pp. 809–814. [Google Scholar] [CrossRef]
  7. Huang, Y.; Ding, H.; Zhang, Y.; Wang, H.; Gao, D.; Xu, N. A Motion Planning and Tracking Framework for Autonomous Vehicles Based on Artificial Potential Field Elaborated Resistance Network Approach. IEEE Trans. Ind. Electron. 2020, 67, 1376–1386. [Google Scholar] [CrossRef]
  8. Deolasee, S.; Lin, Q.; Li, J.; Dolan, J.M. Spatio-temporal Motion Planning for Autonomous Vehicles with Trapezoidal Prism Corridors and Bézier Curves. In Proceedings of the 2023 American Control Conference (ACC), San Diego, CA, USA, 31 May–2 June 2023; pp. 3207–3214. [Google Scholar] [CrossRef]
  9. Wulfmeier, M.; Rao, D.; Wang, D.Z.; Ondruska, P.; Posner, I. Large-scale cost function learning for path planning using deep inverse reinforcement learning. Int. J. Robot. Res. 2017, 36, 1073–1087. [Google Scholar] [CrossRef]
  10. Cuesta, R.; Alvarez, J. Limit Cycle Construction Using Bézier Curves: Application in a Mobile Robot. In Proceedings of the 2023 XXV Robotics Mexican Congress (COMRob), Xalapa/Veracruz, Mexico, 15–17 November 2023; pp. 68–73. [Google Scholar] [CrossRef]
  11. Li, X.; Sun, Z.; Kurt, A.; Zhu, Q. A sampling-based local trajectory planner for autonomous driving along a reference path. In Proceedings of the 2014 IEEE Intelligent Vehicles Symposium Proceedings, Dearborn, MI, USA, 8–11 June 2014; pp. 376–381. [Google Scholar] [CrossRef]
  12. Guo, M.; Peng, J.; Huang, H. Unmanned Vehicle Path Planning and Tracking Control Based on Improved Artificial Potential Field Method. J. Syst. Simul. 2023, 36, 1–10. [Google Scholar] [CrossRef]
  13. Li, H.; Luo, Y.; Wu, J. Collision-Free Path Planning for Intelligent Vehicles Based on Bézier Curve. IEEE Access 2019, 7, 123334–123340. [Google Scholar] [CrossRef]
  14. Chen, Y.; Cai, Y.; Zheng, J.; Thalmann, D. Accurate and Efficient Approximation of Clothoids Using Bézier Curves for Path Planning. IEEE Trans. Robot. 2017, 33, 1242–1247. [Google Scholar] [CrossRef]
  15. Chen, J.; Zhao, P.; Mei, T.; Liang, H. Lane change path planning based on piecewise Bezier curve for autonomous vehicle. In Proceedings of the 2013 IEEE International Conference on Vehicular Electronics and Safety, Dongguan, China, 28–30 July 2013; pp. 17–22. [Google Scholar] [CrossRef]
  16. Moreau, J.; Melchior, P.; Victor, S.; Moze, M.; Aioun, F.; Guillemard, F. Reactive Path Planning for Autonomous Vehicle Using Bézier Curve Optimization. In Proceedings of the 2019 IEEE Intelligent Vehicles Symposium (IV), Paris, France, 9–12 June 2019; pp. 1048–1053. [Google Scholar] [CrossRef]
  17. Bae, I.; Moon, J.; Park, H.; Kim, J.H.; Kim, S. Path Generation and Tracking Based on a Bézier Curve for a Steering Rate Controller of Autonomous Vehicles. In Proceedings of the 16th International IEEE Conference on Intelligent Transportation Systems (ITSC 2013), The Hague, The Netherlands, 6–9 October 2013; pp. 436–441. [Google Scholar]
  18. Wagner, M.A.F.; Wilson, J.R. Recent Developments in Input Modeling with Bézier Distributions. In Proceedings of the 1996 Winter Simulation Conference, Coronado, CA, USA, 8–11 December 1996; pp. 1448–1456. [Google Scholar]
  19. Przemysław, K. Podstawy Modelowania Krzywych I Powierzchni; WNT: Warszawa, Poland, 2005. [Google Scholar]
  20. Durukal, B.; Eren, M.; Çetin, Ö.; Karabıyık, E.; Zengin, N.; Yetkin, S.K. How Can Machine Learning Models Be Used for Subjective Assessment of Safety and Comfort: Application on Free Lane Change Maneuver. In Proceedings of the 2022 Joint 12th International Conference on Soft Computing and Intelligent Systems and 23rd International Symposium on Advanced Intelligent Systems (SCIS&ISIS), Ise, Japan, 29 November–2 December 2022; pp. 1–6. [Google Scholar] [CrossRef]
  21. Chen, X.; Liu, X.; Zhang, M. Autonomous Vehicle Lane-Change Control Based on Model Predictive Control with Control Barrier Function. In Proceedings of the 2024 IEEE 13th Data Driven Control and Learning Systems Conference (DDCLS), Kaifeng, China, 17–19 May 2024; pp. 1267–1272. [Google Scholar] [CrossRef]
Figure 1. Illustration of a Bézier curve.
Figure 1. Illustration of a Bézier curve.
Electronics 14 00494 g001
Figure 2. Comparison chart of different changes in x 1 and x 2 : (a) comparison chart of different changes in x 1 ; (b) comparison chart of different changes in x 2 .
Figure 2. Comparison chart of different changes in x 1 and x 2 : (a) comparison chart of different changes in x 1 ; (b) comparison chart of different changes in x 2 .
Electronics 14 00494 g002
Figure 3. Schematic diagram of dynamic and complex lane-changing conditions.
Figure 3. Schematic diagram of dynamic and complex lane-changing conditions.
Electronics 14 00494 g003
Figure 4. Cluster of Bézier curves under different d 1 and d 2 values: (a) cluster of Bézier curves under different d 1 values; (b) cluster of Bézier curves under different d 2 values.
Figure 4. Cluster of Bézier curves under different d 1 and d 2 values: (a) cluster of Bézier curves under different d 1 values; (b) cluster of Bézier curves under different d 2 values.
Electronics 14 00494 g004aElectronics 14 00494 g004b
Figure 5. Comparison of trajectory curves.
Figure 5. Comparison of trajectory curves.
Electronics 14 00494 g005
Figure 6. Schematic diagram of initial positional relationship.
Figure 6. Schematic diagram of initial positional relationship.
Electronics 14 00494 g006
Figure 7. Schematic diagram of dynamic Bézier curve update: (a) the real-time iteration process of trajectories at longer step sizes; (b) the schematic diagram of updating trajectories at shorter step sizes, with smoother trajectories.
Figure 7. Schematic diagram of dynamic Bézier curve update: (a) the real-time iteration process of trajectories at longer step sizes; (b) the schematic diagram of updating trajectories at shorter step sizes, with smoother trajectories.
Electronics 14 00494 g007
Figure 8. Co-simulation platform.
Figure 8. Co-simulation platform.
Electronics 14 00494 g008
Figure 9. Initial situation of Condition 1.
Figure 9. Initial situation of Condition 1.
Electronics 14 00494 g009
Figure 10. Lane-changing situation of Condition 1: (a) the planned Bézier curve trajectory; (b) lateral acceleration; (c) change in distance between the ego vehicle and the vehicles ahead and behind.
Figure 10. Lane-changing situation of Condition 1: (a) the planned Bézier curve trajectory; (b) lateral acceleration; (c) change in distance between the ego vehicle and the vehicles ahead and behind.
Electronics 14 00494 g010
Figure 11. Schematic diagram of the simulation process for Condition 2: (a) initial state of Condition 2; (b) intermediate state of Condition 2.
Figure 11. Schematic diagram of the simulation process for Condition 2: (a) initial state of Condition 2; (b) intermediate state of Condition 2.
Electronics 14 00494 g011
Figure 12. Lane-changing situation of Condition 2: (a) Bézier curve generated for Condition 2; (b) comparison of lateral acceleration between Condition 1 and Condition 2; (c) change in distance between the ego vehicle and the vehicles ahead and behind in Condition 2.
Figure 12. Lane-changing situation of Condition 2: (a) Bézier curve generated for Condition 2; (b) comparison of lateral acceleration between Condition 1 and Condition 2; (c) change in distance between the ego vehicle and the vehicles ahead and behind in Condition 2.
Electronics 14 00494 g012
Figure 13. Schematic diagram of midway lane-changing scenarios under three different conditions: (a) midway lane-changing scenario for Condition 1; (b) midway lane-changing scenario for Condition 2; (c) midway lane-changing scenario for Condition 3.
Figure 13. Schematic diagram of midway lane-changing scenarios under three different conditions: (a) midway lane-changing scenario for Condition 1; (b) midway lane-changing scenario for Condition 2; (c) midway lane-changing scenario for Condition 3.
Electronics 14 00494 g013
Figure 14. Comparison of lane-changing trajectory curves under three different conditions.
Figure 14. Comparison of lane-changing trajectory curves under three different conditions.
Electronics 14 00494 g014
Figure 15. Distance to rear vehicle in Condition 2.
Figure 15. Distance to rear vehicle in Condition 2.
Electronics 14 00494 g015
Figure 16. Distance to front vehicle in Condition 3.
Figure 16. Distance to front vehicle in Condition 3.
Electronics 14 00494 g016
Table 1. Control points and coordinate correspondence.
Table 1. Control points and coordinate correspondence.
P 0 P 1 P 2 P 3
0 , 0 d 1 2 , 0 x 2 = d 1 + d 2 2 , y d d 1 , y d
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Li, H.; Pang, H.; Xia, H.; Huang, Y.; Zeng, X. Research on Trajectory Planning Method Based on Bézier Curves for Dynamic Scenarios. Electronics 2025, 14, 494. https://doi.org/10.3390/electronics14030494

AMA Style

Li H, Pang H, Xia H, Huang Y, Zeng X. Research on Trajectory Planning Method Based on Bézier Curves for Dynamic Scenarios. Electronics. 2025; 14(3):494. https://doi.org/10.3390/electronics14030494

Chicago/Turabian Style

Li, Hongluo, Hai Pang, Hongyang Xia, Yongxian Huang, and Xiangkun Zeng. 2025. "Research on Trajectory Planning Method Based on Bézier Curves for Dynamic Scenarios" Electronics 14, no. 3: 494. https://doi.org/10.3390/electronics14030494

APA Style

Li, H., Pang, H., Xia, H., Huang, Y., & Zeng, X. (2025). Research on Trajectory Planning Method Based on Bézier Curves for Dynamic Scenarios. Electronics, 14(3), 494. https://doi.org/10.3390/electronics14030494

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop