A Universal Trajectory Planning Method for Automated Lane-Changing and Overtaking Maneuvers

Wang, Ying; Wei, Chong

doi:https://doi.org/10.1155/2020/1023975

Mathematical Problems in Engineering

On this page

Abstract Introduction Discussion Conclusion Data Availability Conflicts of Interest Acknowledgments References Copyright Related Articles

Research Article | Open Access

Volume 2020 | Article ID 1023975 | https://doi.org/10.1155/2020/1023975

A Universal Trajectory Planning Method for Automated Lane-Changing and Overtaking Maneuvers

Ying Wang¹and Chong Wei¹

Academic Editor: Mingshu Peng

Received26 Oct 2019

Accepted28 Feb 2020

Published25 Apr 2020

Abstract

Lane-changing and overtaking are conventional maneuvers on roads, and the reference trajectory is one of the prerequisites to execute these maneuvers. This study proposes a universal trajectory planning method for automated lane-changing and overtaking maneuvers, in which the trajectory is regarded as the combination of a path and its traffic state profiles. The two-dimensional path is represented by a suitable curve to connect the initial position with final position of the ego vehicle. Based on the planned path, its traffic state profiles are generated by solving a nonlinear mathematical optimization model. Moreover, the study discretizes the time horizon into several time intervals and determines the parameters to obtain the continuous and smooth profiles, which guarantees the safety and comfort of the ego vehicle. Finally, a series of simulation experiments are performed in the MATLAB platform and the results show the feasibility and effectiveness of the proposed universal trajectory planning method.

1. Introduction

Automated driving system can significantly alleviate traffic congestion, ensure traffic safety, and improve road capacity [1–4]. In order to realize the intelligent vehicle as soon as possible, some automated driving technologies are being tested on roads. Among the test items, the lane-changing and overtaking maneuvers are included [5–8]. To execute these maneuvers automatically, a feasible reference trajectory is needed. The ego vehicle will drive along the planned trajectory to finish the relevant maneuvers. This paper proposes a novel universal trajectory planning method for the automated lane-changing and overtaking maneuvers. With the development of advanced sensors and vehicle-to-vehicle (V2V) communications, real-time traffic information of vehicles, such as position, speed, and acceleration, can be obtained conveniently and accurately [9–12], and the trajectory is planned based on these traffic state information.

Different types of curves have different performance characteristics in terms of continuity and smoothness. Therefore, selecting a suitable curve function to represent the trajectory according to the traffic condition is important. In the relevant trajectory planning studies, the commonly used geometric curves include the spline curve [13–17], trapezoidal acceleration curve [18–22], Bezier curve [23–26], and polynomial curve [27–33].

Ziegler et al. [13] employed a quantic spline curve to generate the trajectory. They divided the space into multiple geometric graphs and adopted the shortest path algorithm to search for the feasible trajectory for each graph. Rousseau et al. [17] utilized the trajectory planning method based on the B-spline curve. The parameters of curve function were determined by minimizing the driving time. Yin et al. [18] described a trapezoidal acceleration motion planning model. The planned trajectory could avoid the potential collisions with obstacles by analyzing the variation law of the actuator. Chen et al. [22] presented a trajectory planning method using the 3D Bezier curve, which enhanced the flexibility of trajectory and guaranteed the conformity to the realistic driving maneuver.

Among the commonly used geometric curves, the polynomial curve is the most widely used in trajectory planning. This type of curve can plan the smooth trajectory with a low computational cost, and the order of polynomial can be tuned for obtaining the desired trajectory performance. Nelson et al. [27] were the first to propose the polynomial method. They used the polynomial curve to replace the arc curve for planning the continuous-curvature trajectory, which guaranteed the traceability of the trajectory. Nilsson et al. [29] presented a trajectory planning model using the discrete quadratic polynomial curve. They divided the planning area into three regions (i.e., preregion, periregion, and postregion) and solved the optimal positions of the ego vehicle in each region to determine the trajectory function. Zhang et al. [30] adopted two time-dependent cubic polynomial functions to describe the longitudinal and lateral motions, respectively. They concluded that the continuity of the polynomial curve could ensure the robustness of trajectory. Yang et al. [32] proposed a trajectory planning model based on the cubic polynomial curve. They focused on the trajectory replanning problem in dynamic driving environments. Wei et al. [33] increased the polynomial function to the fifth order and solved the optimal trajectory by treating the driving time and movement distance as free variables.

However, there are still several common disadvantages existing in the previous studies. First, these trajectory planning models usually only focus on the automated lane-changing or overtaking maneuver, while neglecting the universality of the model for lane-changing and overtaking maneuvers. Second, the traffic states of the ego vehicle solved by the previous model usually were discretized, which might result in hard tracking or even crashes. Third, most of the studies designed the lane-changing or overtaking scenarios simply, in which they assumed that the surrounding environment was static, the speeds of other vehicles were constants, or only one or two vehicles were around the ego vehicle. These assumptions were inconsistent with the real-world traffic characteristics.

Aiming at these problems, a trajectory planning method based on the mathematical optimization framework is proposed in this paper. The contributions can be summarized as follows:(1)A universal framework of trajectory planning for the automated lane-changing and overtaking maneuvers is proposed. The study considers that the combination of a path and its traffic state profiles determines a complete spatiotemporal trajectory. The suitable curve is employed to represent the two-dimensional path. And then a nonlinear optimization model is established to generate the traffic state profiles, whose computational cost is low since the path has been planned.(2)The traffic state profiles are continuous and smooth. In previous studies, the traffic states of the ego vehicle solved by the nonlinear model usually were discretized. Our proposed model discretizes the time horizon into several time intervals and solves the unknown parameters of the function to generate the continuous and smooth traffic state profiles.

The rest of the paper is organized as follows. Section 2 introduces the framework of the universal trajectory planning method. Section 3 describes the technical details of the proposed method, including the generation process of the path and traffic state profiles. Section 4 presents the simulation results and several typical numerical examples. Section 5 concludes the study and discusses the future work.

2. Framework of the Universal Trajectory Planning Method

Figure 1 presents the framework of the proposed universal trajectory planning method, which plans the trajectory through four stages. In stage 1, the current traffic states of the vehicles are collected via GPS, digital maps, and sensors. In stage 2, based on the known boundary conditions, a suitable curve is employed to generate the two-dimensional path connecting the initial position and the final position. In stage 3, the objective function and relevant constraints are established to solve the traffic state profiles along the path, such as speed, acceleration, and jerk profiles. The combination of the path and its traffic state profiles determines a complete spatiotemporal trajectory. In stage 4, the generated trajectory parameters are used as inputs for the actuators to execute the desired control.

3. The Universal Trajectory Planning Method

Planning a reference trajectory before changing lane or overtaking is necessary and important. The quality of the trajectory has a direct impact on the performance of the automated driving behaviors. This study considers that the combination of a path and its traffic state profiles determines a complete spatiotemporal trajectory. Therefore, in the following sections, we will describe the universal generation method of path and traffic state profiles in detail.

3.1. Path Generation

A suitable curve should be selected to plan the lane-changing or overtaking path. Here, we choose the quintic polynomial, which has the advantages of a continuous third derivative and smooth curvature, as shown in the following equation:where and are the longitudinal and lateral positions of the ego vehicle, respectively. , , are unknown parameters that need to be calculated.

As for the lane-changing maneuver, the boundary traffic information can be collected with the help of sensors, GPS, and digital maps. Based on such information, the following equations can be obtained:where , , , and represent the longitudinal position, the lateral position, the derivative, and the curvature of the lane curve at current moment, respectively. , , , and represent the longitudinal position, the lateral position, the derivative, and the curvature of the lane curve at final moment, respectively. By solving equations (2)–(7), the values of , , are obtained, and then the lane-changing path can be generated.

As for overtaking maneuver, the same method as lane-changing is adopted to generate the path. A complete overtaking path is composed of two lane-changing paths, as shown in Figure 2. In the figure, vehicle 0 is the ego vehicle and vehicles 1, 2, and 3 are the surrounding vehicles.

After collecting the boundary traffic information of the ego vehicle in lane-changing or overtaking, the unknown parameters of the path function can be solved and then the suitable path is generated. The study chooses the polynomial curve to represent the path, which has the advantages of a continuous derivative and smooth curvature. Other types of curve can also be employed according to the traffic scenario, while the framework of the path generation is unchanged.

3.2. Traffic State Profile Generation

In this section, a nonlinear programming model is constructed to generate the traffic state profiles (speed, acceleration, and jerk profiles) for the automated lane-changing or overtaking maneuver. Since the discrete traffic states of the ego vehicle may result in crashes, our model discretizes the time horizon and solves the unknown parameters of the function to generate the continuous and smooth traffic state profiles. The driving distance profile is shown in the following equation:

The corresponding speed, acceleration, and jerk profiles are shown in the following equations:

Six unknown parameters , , need to be determined. Based on the known initial traffic states of the ego vehicle, three equations are derived as follows:where , , and are the current driving distance, speed, and acceleration of the ego vehicle, respectively. The values of , , and can be obtained by solving equation (12). However, the unknown parameters , , and and total driving time are not easy to determine, and the arbitrary values may affect the solution efficiency of the model [29, 34]. Therefore, we treat , , , and as free variables and establish a nonlinear model to search for the optimal traffic state profiles.

The study divides into time intervals and uses to denote the end moment of each time interval. Let and set constraint . As shown in Figure 3, is the driving distance of the ego vehicle at . and are the longitudinal and lateral positions of the ego vehicle at , respectively. and is calculated as . Furthermore, for are treated as free variables. The unknown parameters , , and and driving time can be represented as functions of . Therefore, the planning traffic state profile problem can be converted into the optimization problem.

(a)

(b)

3.2.1. Optimal Traffic State Profile Planning

The objective function of the constrained nonlinear optimization model is shown in equation (13). and denote the acceleration and jerk of the ego vehicle at , respectively, and denotes the total driving time:

During the lane-changing or overtaking process, the passengers will feel comfortable when the accelerations and jerks of the ego vehicle are small, so and are used to reflect the comfort in equation (13). The total driving time can represent the efficiency. Short time indicates high efficiency.

3.2.2. Collision-Avoidance Constraint

To avoid the potential collisions, the ego vehicle should maintain sufficient distance from the surrounding vehicles during lane-changing or overtaking maneuver. For illustrative purposes, the study assumes that the vehicles drive along the straight roads. This limitation can be easily removed by introducing a curved road function. As shown in Figure 4, there are three vehicles around the ego vehicle (vehicle 0). The leading vehicle on the current lane is indexed as vehicle 1, the following vehicle on the target lane is indexed as vehicle 2, and the leading vehicle on the target lane is indexed as vehicle 3.

The safe distance between the ego vehicle and vehicle 1 is discussed first. As shown in Figure 5, the ego vehicle is simplified a geometry of several circles with diameter . Following Ziegler et al. [35], the Euclidean distance between the center of each circle of the ego vehicle and the center of the first circle of vehicle 1 should be greater than diameter of the circle. Therefore, the distance constraint between the ego vehicle (vehicle 0) and vehicle 1 can be shown in the following equation:where is used to denote the index of circles; and represent the positions of the ego vehicle of the -th circle at ; and and represent the positions of the first circle of vehicle 1 at , whose values can be solved from (). is calculated as , and is on the straight lane.

Then, the constraints of the collision avoidance between the ego vehicle and the other two vehicles are discussed. As shown in equations (15)-(16), the Euclidean distance between the ego vehicle and vehicles 2 and 3 should be greater than the diagonal length of the vehicle:where , , and are the longitudinal central positions of the ego vehicle, vehicle 2, and vehicle 3 at , respectively. , , and are the lateral central positions of the ego vehicle, vehicle 2, and vehicle 3 at , respectively.

and are the variables that need to be solved in the model. and can be calculated as and , respectively; and are the lane width . Here, the initial traffic states of relevant vehicles are directly derived from the sensors.

3.2.3. Acceleration Constraint Based on Car-following Maneuver

In real-world traffic environment, the ego vehicle usually shifts to a car-following maneuver at the end of the lane-changing or overtaking process. To guarantee a comfort driving behavior, the planned final acceleration of the ego vehicle should be smaller than the car-following acceleration, as shown in the following equation:where denotes the car-following acceleration of the ego vehicle at ; and denote the speeds of the ego vehicle and vehicle 3 at , respectively; and denotes the distance between the ego vehicle and vehicle 3 at .

Here, is solved by the proposed nonlinear model; and are calculated as follows, where is the length of the vehicle:

When is smaller than the car-following acceleration, the ego vehicle will shift from a lane-changing or overtaking maneuver to a car-following maneuver comfortably, i.e., no accelerate or decrease immediately.

We choose a linear dynamic model [36] as the underlying car-following model. The car-following acceleration of the ego vehicle can be given as follows:where and denote the variation rate of the distance gap and the variation rate of the speed gap between the ego vehicle and vehicle 3, respectively; denotes the ideal distance gap between the ego vehicle and vehicle 3. The function of the three parameters is to help the ego vehicle reach the equilibrium condition as soon as possible by adjusting its acceleration. Following Pariota et al. [36], the parameters in the model are set as ,, and .

3.2.4. Traffic State Constraint

The speed , acceleration , and jerk of the ego vehicle at can be obtained according to equations (9)–(11). To ensure the driving safety and comfort, the total lane-changing or overtaking time and traffic states of the ego vehicle should be simultaneously constrained as follows:where , , , and denote the allowable maximum total time, speed, acceleration, and jerk, respectively. , , and denote the allowable minimum speed, acceleration, and jerk, respectively.

In the above constraints, the speed of the ego vehicle should always be positive and not exceed the maximum allowable speed, i.e., no stop or backward motion. Moreover, the smaller the jerk, the smaller the acceleration variation, and the higher the driving comfort degree [37].

3.3. Trajectory Planning Based on the Nonlinear Model

After receiving the lane-changing or overtaking decision, our proposed trajectory planning model will work. The steps are as follows:(1)Traffic information sensing Collecting the current traffic information of the relevant vehicles through the advanced sensors, GPS, and digital maps.(2)Path generation Based on the collected traffic information, using the quintic polynomial curve to represent the lane-changing or overtaking path, the unknown parameters of the path function can be solved according to the boundary conditions.(3)Traffic state profile generation Considering the safety and comfort constraints, establishing a nonlinear optimization model to solve the optimal traffic state profiles of the ego vehicle along the path.(4)Lane-changing or overtaking trajectory planning If a feasible solution is found for the proposed nonlinear optimization model, the lane-changing or overtaking trajectory of the ego vehicle can be planned. However, if there is no feasible solution, the current lane will continue to be used, and the planner will iterate the above three steps until a feasible trajectory is planned.

The sequence quadratic programming (SQP) algorithm is selected to solve the nonlinear optimization model. Previous studies [19, 33, 34] prove that this algorithm can find the feasible solution for the nonlinear problem well. Through multiple iterations, the optimal traffic state profiles of the ego vehicle are acquired based on the SQP algorithm. Therefore, the optimal lane-changing or overtaking trajectory can be planned.

4. Simulation and Discussion

In this section, the types of test scenarios are described first; then, the performance characteristics of the simulation results are shown; finally, three detailed trajectory planning cases are demonstrated.

4.1. Scenario Description and Simulation Result Analysis

Various test scenarios should be considered to evaluate the proposed model. Yang et al. [32] have proposed that lane-changing maneuver in real-world traffic can be roughly categorized into two types: the ego vehicle is located in front of vehicle 2 and the ego vehicle is located behind vehicle 2 at the initial moment. Similar to Yang et al. [32], we also consider that the overtaking maneuver includes two types according to the initial relative positions between the ego vehicle and vehicle 2 (see Figures 6(a) and 6(b)). In the figure, the solid vehicles indicate their current positions and the dashed vehicle indicates the final position of the ego vehicle.

(a)

(b)

As shown in Figure 6(a), under the first type of scenario, the ego vehicle is located in front of vehicle 2 at the initial moment. The ego vehicle can change lane to reach the target gap between vehicle 2 and vehicle 3 directly. Under the second type of scenario (see Figure 6(b)), the ego vehicle is located behind vehicle 2 at the initial moment. The ego vehicle needs to overtake vehicle 2 to reach the target gap between vehicle 2 and vehicle 3.

Furthermore, 100 random overtaking test cases for each type are generated to verify the feasibility and effectiveness of the proposed trajectory planning method. MATLAB is employed as the simulation platform. Table 1 presents the relevant parameters of the model, including the lower and upper boundaries of the traffic states, and the constant quantities. Inputting the current traffic information, the planner can automatically plan a comfort and safe trajectory for the ego vehicle.

Through our proposed model, 82 of the 100 test cases can find the feasible overtaking trajectory under the first type of scenario; 76 of the 100 test cases can find the feasible overtaking trajectory under the second type of scenario, which proves that this method is applied to most traffic conditions. The distribution of the overtaking time is shown in Figure 7. From the figure, it can be indicated that the driving time of most cases is between 6 and 7 s for the first type of overtaking scenario. The shortest time is 4.72 s, the longest time is 10.24 s, and the average time is approximately 6.36 s. For the second type of overtaking scenario, most driving time is between 7 and 8 s, the shortest time is 4.68 s, the longest time is 11.56 s, and the average time is approximately 7.71 s.

A comprehensive presentation of the simulation results is presented in Table 2. Using the current traffic states of vehicles as the input variables, the overtaking time can be determined automatically by the proposed model. Since the ego vehicle needs to overtake vehicle 2 first to reach the target gap under the second type of scenario, the mean value of (7.71 s) is larger than the mean value of (6.36 s) under the first type of scenario. Moreover, the variations in the trajectory performance parameters (speed, acceleration, and jerk) in Table 2 are small, which guarantees the ride comfort.

4.2. Numerical Examples

In this section, two special cases are demonstrated in detail. Table 3 shows the initial traffic states of vehicles under two detailed scenarios. In scenario 1, the ego vehicle (111.59 m) is located in front of vehicle 2 (100.00 m), which belongs to the first type of scenario. In scenario 2, the ego vehicle (89.17 m) is located behind vehicle 2 (100.00 m), which belongs to the second type of scenario. The speed gap (4.87 m/s) between the ego vehicle and vehicle 2 under scenario 1 is larger than that (0.95 m/s) under scenario 2.

Figures 8 and 9 present the overtaking trajectories and the variations in the speeds of vehicles under scenario 1, respectively. From Figure 8, it is shown that the overtaking longitudinal distance is 115 m and the total driving time is 7.14 s. Figure 9 indicates that the ego vehicle first trends to decelerate slightly to avoid the collisions with surrounding vehicles and then to accelerate to a maximum value and finally to decrease the speed slowly to a stable state. It can be concluded that the ego vehicle can dynamically adjust its speed for adapting the speed change in surrounding vehicles.

(a)

(b)

Figures 10 and 11 display the overtaking trajectories and the variations in speeds of vehicles under scenario 2, respectively. The overtaking longitudinal distance is 147 m, and the total driving time is 9.02 s. From Figure 11, it can be seen that the ego vehicle trends to decrease the speed from 0 s to 1.69 s and then to change its speed lightly from 1.69 s to 7.35 s. After 7.35 s, the ego vehicle accelerates to a value that is larger than the final speed of vehicle 1.

(a)

(b)

Figure 12 shows the speed comparison of the ego vehicle under scenarios 1 and 2. Under scenario 1, the ego vehicle decreases its speed lightly at beginning because the ego vehicle has enough initial speed gap (4.87 m/s) to adjust its position. However, since the initial speed gap (0.95 m/s) between the ego vehicle and vehicle 2 is small under scenario 2, the ego vehicle needs to decelerate quickly at the beginning for avoiding a collision with vehicle 2.

Figures 13 and 14 show the planned accelerations and jerks of the ego vehicle under two scenarios, respectively. From the figures, it can be indicated that different initial traffic states of vehicles will have a significant impact on acceleration and jerk profiles. These trajectory performance variables of the ego vehicle under scenarios 1 and 2 are all small, which ensures the comfort of passengers during the overtaking process.

4.3. Trajectory Correction Scenario

If the traffic states of surrounding vehicles change suddenly, the planned trajectory of the ego vehicle needs to be corrected to prevent the potential collision. The corrected trajectory can still be generated using our proposed model. Next, we will describe a trajectory correction scenario in detail. Table 4 shows the initial traffic states of the vehicles.

In this scenario, the ego vehicle originally intends to change lanes. However, vehicle 3 suddenly decelerates at 2.62 s. The ego vehicle perceives that the distance between itself and vehicle 3 will become very short, and there may be a collision. Therefore, the lane-changing trajectory is corrected, and the ego vehicle returns to the original lane. Figure 15 presents the trajectories of the relevant vehicles in this scenario. The simulation result indicates that the total longitudinal distance of the ego vehicle is 91.73 m, and the driving time is 6.64 s. During the trajectory correction process, we assume that vehicle 2 follows the leading vehicle politely, so the motion of vehicle 2 after 2.62 s is not discussed.

(a)

(b)

In Figure 15, the ego vehicle successfully returns to the original lane tracking the corrected trajectory and does not collide with the surrounding vehicles. It can be concluded that the proposed model is effective for emergent traffic condition.

Furthermore, the real-time distance of the ego vehicle and surrounding vehicles is shown in Figure 16. Here, the distance denotes the driving distance from the origin point of the lane to the current position of vehicle. In Figure 16, vehicle 3 decelerates at 2.62 s, and then its speed decreases rapidly. If the ego vehicle does not correct the trajectory, it is likely to collide with vehicle 3.

5. Conclusion

This paper proposes a universal trajectory planning method that is suitable for the automated lane-changing and overtaking maneuvers. The proposed method first generates a two-dimensional path in the Cartesian coordinate system to connect the initial position with the final position, and then a nonlinear mathematical optimization model is established to obtain the traffic state profiles along the path. The combination of a path and its traffic state profiles determines a spatiotemporal trajectory. Moreover, considering the safety and comfort of the ego vehicle during the driving process, the study discretizes the total time horizon into several time intervals and solves the unknown parameters of the function to generate the continuous and smooth traffic state profiles. Furthermore, a series of numerical examples are conducted under the typical scenarios. The simulation results demonstrate that the intelligent vehicle can avoid the potential collisions effectively when tracking the planned trajectory. Future works will concentrate on the trajectory replanning and tracking issues for proposing a more realistic lane-changing and overtaking model.

Data Availability

The data used to support the findings of this study are included within the article. In this paper, the scenarios traffic data are simulated by MATLAB platform, and this study focuses on the establishment of the universal model.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was supported by the National Key R&D Program of China (Grant no. 2019YFF0301403) and National Natural Science Foundation of China (Grant nos. 71971017, 91746201, and 71621001).

References

S. Childress, B. Nichols, B. Charlton, and S. Coe, “Using an activity-based model to explore the potential impacts of automated vehicles,” Transportation Research Record: Journal of the Transportation Research Board, vol. 2493, no. 1, pp. 99–106, 2015.
View at: Publisher Site | Google Scholar
B. S. Kerner, “Failure of classical traffic flow theories: stochastic highway capacity and automatic driving,” Physica A: Statistical Mechanics and Its Applications, vol. 450, pp. 700–747, 2016.
View at: Publisher Site | Google Scholar
D. Milakis, B. van Arem, and B. van Wee, “Policy and society related implications of automated driving: a review of literature and directions for future research,” Journal of Intelligent Transportation Systems, vol. 21, no. 4, pp. 324–348, 2017.
View at: Publisher Site | Google Scholar
J. Nie, J. Zhang, W. Ding, X. Wan, X. Chen, and B. Ran, “Decentralized cooperative lane-changing decision-making for connected autonomous vehicles,” IEEE Access, vol. 4, pp. 9413–9420, 2016.
View at: Publisher Site | Google Scholar
A. Talebpour, H. S. Mahmassani, and S. H. Hamdar, “Modeling lane-changing behavior in a connected environment: a game theory approach,” Transportation Research Procedia, vol. 7, pp. 420–440, 2015.
View at: Publisher Site | Google Scholar
T. Pan, W. H. Lam, A. Sumalee, and R. Zhong, “Modeling the impacts of mandatory and discretionary lane-changing maneuvers,” Transportation Research Part C: Emerging Technologies, vol. 68, pp. 403–424, 2016.
View at: Google Scholar
J. Karlsson, N. Murgovski, and J. Sj¨oberg, “Temporal vs. spatial formulation of autonomous overtaking algorithms,” in Proceedings of the IEEE 19th International Conference on Intelligent Transportation Systems, pp. 1029–1034, IEEE, Rio de Janeiro, Brazil, November 2016.
View at: Google Scholar
G. Abe, K. Sato, and M. Itoh, “Driver trust in automated driving systems: the case of overtaking and passing,” IEEE Transactions on Human-Machine Systems, vol. 48, no. 1, pp. 85–94, 2017.
View at: Publisher Site | Google Scholar
T. Abbas, K. Sjöberg, J. Karedal, and F. Tufvesson, “A measurement based shadow fading model for vehicle-to-vehicle network simulations,” International Journal of Antennas and Propagation, vol. 2015, Article ID 190607, pp. 1–12, 2015.
View at: Publisher Site | Google Scholar
H. R. Noh, “Method for transmitting traffic information using vehicle to vehicle communication,” 2015, US Patent No. 9,159,231.
View at: Google Scholar
M. I. Ashraf, M. Bennis, C. Perfecto, and W. Saad, “Dynamic proximity-aware resource allocation in vehicle-to-vehicle (V2V) communications,” in Proceedings of the 2016 IEEE Globecom Workshops, pp. 1–6, IEEE, Washington, DC, USA, December 2016.
View at: Google Scholar
K. C. Dey, A. Rayamajhi, M. Chowdhury, P. Bhavsar, and J. Martin, “Vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication in a heterogeneous wireless network-performance evaluation,” Transportation Research Part C: Emerging Technologies, vol. 68, pp. 168–184, 2016.
View at: Publisher Site | Google Scholar
J. Ziegler and C. Stiller, “Spatiotemporal state lattices for fast trajectory planning in dynamic on-road driving scenarios,” in Proceedings of the 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, IEEE, St. Louis, MO, USA, October 2009.
View at: Google Scholar
H. Liu, X. Lai, and W. Wu, “Time-optimal and jerk-continuous trajectory planning for robot manipulators with kinematic constraints,” Robotics and Computer-Integrated Manufacturing, vol. 29, no. 2, pp. 309–317, 2013.
View at: Publisher Site | Google Scholar
L. Rodriguez, F. Balampanis, J. A. Cobano, I. Maza, and A. Ollero, “Energy-efficient trajectory generation with spline curves considering environmental and dynamic constraints for small UAS,” in Proceedings of the 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 1739–1745, IEEE, Vancouver, Canada, September 2017.
View at: Google Scholar
J. Huang, P. Hu, K. Wu, and M. Zeng, “Optimal time-jerk trajectory planning for industrial robots,” Mechanism and Machine Theory, vol. 121, pp. 530–544, 2018.
View at: Publisher Site | Google Scholar
G. Rousseau, C. Stoica Maniu, S. Tebbani, M. Babel, and N. Martin, “Minimum-time B-spline trajectories with corridor constraints. Application to cinematographic quadrotor flight plans,” Control Engineering Practice, vol. 89, pp. 190–203, 2019.
View at: Publisher Site | Google Scholar
W. Yin, L. Sun, M. Wang, S. Dong, and J. Liu, “Residual vibration suppression for series elastic actuator based on phase plane analysis and trajectory tracking,” in Proceedings of the 35th Chinese Control Conference, pp. 4453–4458, IEEE, Chengdu, China, July 2016.
View at: Google Scholar
X. Zheng, Z. Zhou, Z. Cheng, and H. Liang, “A method for industrial robot manipulators trajectory planning based on piecewise continuous function,” in Proceedings of the International Conference on Artificial Intelligence and Robotics, pp. 1–5, IEEE, Kitakyushu, Japan, July 2016.
View at: Google Scholar
J. Yang, Q. Hu, and H. Ding, “A two-stage CNC interpolation algorithm for corner smoothing trajectories with geometric error and dynamics constraints,” Procedia CIRP, vol. 56, pp. 306–310, 2016.
View at: Publisher Site | Google Scholar
C. Liu, B. Sun, and F. Li, “Acceleration planning based anti-swing and position control for double-pendulum cranes,” in Proceedings of the 2017 29th Chinese Control and Decision Conference, pp. 5671–5675, IEEE, Chongqing, China, May 2017.
View at: Google Scholar
W.-C. Chen, C.-S. Chen, F.-C. Lee, and L.-Y. Chen, “High speed blending motion trajectory planning using a predefined absolute accuracy,” The International Journal of Advanced Manufacturing Technology, vol. 104, no. 5-8, pp. 2179–2193, 2019.
View at: Publisher Site | Google Scholar
L. Yang, D. Song, J. Xiao, J. Han, L. Yang, and Y. Cao, “Generation of dynamically feasible and collision free trajectory by applying six-order Bezier curve and local optimal reshaping,” in Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 643–648, IEEE, Hamburg, Germany, September 2015.
View at: Google Scholar
K. R. Simba, N. Uchiyama, and S. Sano, “Real-time smooth trajectory generation for nonholonomic mobile robots using Bezier curves,” Robotics and Computer-Integrated Manufacturing, vol. 41, pp. 31–42, 2016.
View at: Google Scholar
R. Choe, J. Puig-Navarro, V. Cichella, E. Xargay, and N. Hovakimyan, “Cooperative trajectory generation using pythagorean hodograph bézier curves,” Journal of Guidance, Control, and Dynamics, vol. 39, no. 8, pp. 1744–1763, 2016.
View at: Publisher Site | Google Scholar
X. Zong, Q. Sun, D. Yao, W. Du, and Y. Tang, “Trajectory planning in 3D dynamic environment with non-cooperative agents via fast marching and Bézier curve,” Cyber-Physical Systems, vol. 5, no. 2, pp. 119–143, 2019.
View at: Publisher Site | Google Scholar
W. Nelson, “Continuous-curvature paths for autonomous vehicles,” in Proceedings of the 1989 International Conference on Robotics and Automation, pp. 1260–1264, IEEE, Scottsdale, AZ, USA, May 1989.
View at: Google Scholar
H. Bai, J. Shen, L. Wei, and Z. Feng, “Accelerated lane-changing trajectory planning of automated vehicles with vehicle-to-vehicle collaboration,” Journal of Advanced Transportation, vol. 2017, Article ID 8132769, 11 pages, 2017.
View at: Publisher Site | Google Scholar
J. Nilsson, M. Brannstrom, E. Coelingh, and J. Fredriksson, “Lane change maneuvers for automated vehicles,” IEEE Transactions on Intelligent Transportation Systems, vol. 18, no. 5, pp. 1087–1096, 2017.
View at: Publisher Site | Google Scholar
S. Zhang, W. Deng, Q. Zhao, H. Sun, and B. Litkouhi, “Dynamic trajectory planning for vehicle autonomous driving,” in Proceedings of the 2013 IEEE International Conference on Systems, pp. 4161–4166, IEEE, Manchester, UK, October 2013.
View at: Google Scholar
T. Su, L. Cheng, Y. Wang, X. Liang, J. Zheng, and H. Zhang, “Time-optimal trajectory planning for delta robot based on quintic pythagorean-hodograph curves,” IEEE Access, vol. 6, pp. 28530–28539, 2018.
View at: Publisher Site | Google Scholar
D. Yang, S. Zheng, C. Wen, P. J. Jin, and B. Ran, “A dynamic lane-changing trajectory planning model for automated vehicles,” Transportation Research Part C: Emerging Technologies, vol. 95, pp. 228–247, 2018.
View at: Publisher Site | Google Scholar
C. Wei, Y. Wang, Y. Asakura, and L. Ma, “A nonlinear programing model for collision-free lane-change trajectory planning based on vehicle-to-vehicle communication,” Journal of Transportation Safety & Security, vol. 11, pp. 1–21, 2019.
View at: Publisher Site | Google Scholar
S. Ammoun, F. Nashashibi, and C. Laurgeau, “An analysis of the lane changing maneuvers on roads: the contribution of inter-vehicle cooperation via communication,” in Proceedings of the 2007 IEEE Intelligent Vehicles Symposium, pp. 1095–1100, IEEE, Istanbul, Turkey, June 2007.
View at: Google Scholar
J. Ziegler, P. Bender, T. Dang, and C. Stiller, “Trajectory planning for bertha—a local, continuous method,” in Proceedings of the 2014 IEEE Intelligent Vehicles Symposium, pp. 450–457, IEEE, Dearborn, MI, USA, June 2014.
View at: Google Scholar
L. Pariota, G. N. Bifulco, and M. Brackstone, “A linear dynamic model for driving behavior in car following,” Transport. Science, vol. 50, no. 3, pp. 1032–1042, 2015.
View at: Google Scholar
R. Hult and R. S. Tabar, Path Planning for Highly Automated Vehicles, Master Thesis, Chalmers University of Technology, Göteborg, Sweden, 2013.

Copyright

Copyright © 2020 Ying Wang and Chong Wei. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

PDF Download Citation

Download other formats

Order printed copies