Skip to main content
Advertisement
Browse Subject Areas
?

Click through the PLOS taxonomy to find articles in your field.

For more information about PLOS Subject Areas, click here.

  • Loading metrics

Highly smooth and parameter independent obstacle avoidance method for autonomous vehicle with velocity-varying obstacle

Abstract

One of the primary challenges for autonomous vehicle (AV) is planning a collision-free path in dynamic environment. It is a tricky task for achieving high-performance obstacle avoidance with velocity-varying obstacle. To solve this problem, a highly smooth and parameter independent obstacle avoidance method for autonomous vehicle with velocity-varying obstacle (HSPI-OAM) is presented in this work. The proposed method uses the virtual collision point model to accurately design the desired acceleration, which makes the obtained path highly smooth. At the same time, the method gets rid of the dependence on parameter adjustment and has strong adaptability to different environments. The simulation is implemented on the Matlab-Carsim co-simulation platform, and the simulation results show that the path planned by HSPI-OAM has good performance for obstacle with acceleration.

Section 1: Introduction

Autonomous driving technology has been greatly developed due to its own merits [1, 2], and obstacle avoidance is one of the key components of autonomous driving [3]. According to different environments, obstacle avoidance can be divided into static obstacle avoidance and dynamic obstacle avoidance.

In a dynamic environment, obstacles need to be dealt with. This is critical for autonomous vehicles, especially those traveling at high speeds in dynamically changing environments. For this, an efficient computer vision algorithm is proposed and used for speed and depth determination of obstacles [4]. For the environment perception in navigation, an obstacle detection method based on visual optical flow is proposed. This method uses the optical flow field constructed by image sequence to provide depth clues for obstacle detection, and realizes the online and real-time processing of the algorithm [5]. Obstacle trajectories in dynamic collision avoidance methods are often considered linear or known, but this limitation is not accurate in many real-world situations. An obstacle motion prediction method is proposed, which can be obtained by training LSTM neural network online [6].

The first step is to implement obstacle avoidance in a static environment. A parallel genetic algorithm based on graphics processing is proposed and the quasi-optimal solution can be found in time for a fast path planning [7]. In [8], an improved bat algorithm based on Cauchy disturbance and a logarithmic decreasing strategy is designed for a mobile robot, and the proposed method can significantly reduce the length of planned path. Zhu, X. H. improves the traditional D* Lite algorithm for multi-goal path planning and collision avoidance in unknown environments, and the issue of limited steering maneuverability during autonomous navigation is addressed by designing a safe distance and expanding the search range [9]. For real-time path planning of mobile robot, a navigation control method using an artificial potential field (APF) algorithm and a grey wolves optimisation (GWO) method is proposed, and the navigation free from any dead-end situation [10]. The above methods have achieved good performance in static environment, however, the moving of obstacle is completely ignored.

In order to implement obstacle avoidance in a dynamic environment, a strategy of trajectory planning and tracking is presented based on an artificial fish swarm algorithm (AFSA) [11]. Du Toit [12]] presents a strategy for planning robot motions in uncertain environments using the reasoning about future evolution and uncertainties of the states of the moving obstacles. In [13], An Elman neural network is proposed to compensate the effect of uncertainties between the dynamic robot model and the obstacles. Kim, C. J. [14] proposes an obstacle avoidance method in the position stabilization of the wheeled mobile robots using interval type-2 fuzzy neural network, and it is robust against uncertainties. In [15], a general formulation of a predictive and multirate reactive planning method for AV in dynamic environments with uncertainty is introduced. Malone N. [16] uses a stochastic reachable set-based potential field to improve the success rate of path planning. In [1116], although dynamic obstacle avoidance is realized, the speed of obstacle is set to a specific value and ignores the acceleration of the obstacle. In fact, the speed of obstacle may change in real time, which poses a challenge to the performance of existing obstacle avoidance methods.

In terms of the smoothness of the road, a smooth and ergonomic optimal lane-change trajectory is planned for an obstacle that moves at low speed [17]. A two-stage control method is proposed for path planning in highway cruise mode [18]. In order to solve the local path planning in the structured road, a Regional-Sampling RRT (RS-RRT) algorithm based path planning method is proposed for obstacle avoidance, and the search efficiency of sampling is improved by the local biasing and Gaussian distribution sampling [19]. For the situation that vehicle tire friction may approach the limit in an unsmooth path, resulting in increased difficulty in path tracking and even instability of the vehicle, Liang et al. propose a variable speed method to design feasible speed and acceleration during path tracking to ensure that the vehicle will not reach the limit of tire friction [20].

In addition, using an improved artificial potential field, Zhang, Z. W. proposes a structured road-oriented motion planning framework for collision avoidance of AV [21]]. The calculation time is shortened by reducing the number of design variables of the optimal path in [22]. For low-moving AV, a path planning system is proposed through a supervisory control method based on a barrier function [23]. A novel path planning system is presented for dynamic obstacle avoidance [24], and the velocity is considered as constraint to obtain the optimal velocity. A model predictive path-planning controller with potential functions and vehicle dynamics terms is introduced [25]. In [26], a 3-D virtual dangerous potential field is constructed as a superposition of trigonometric functions of the road and the exponential function of obstacles, which can generate a desired trajectory for collision avoidance. Liu, J. C. presents a nonlinear model predictive control formulation for large-size autonomous ground vehicle with high centre of gravity at high speed [27]. Good dynamic obstacle avoidance performance can be achieved in [2127], while they all depend on the parameters of the evaluation function, and the same parameters may not work well in different environments. Therefore, reducing the dependence on parameters is critical to the practicability of method.

Based on the analysis of the above research status, highly smooth and parameter independent obstacle avoidance method for autonomous vehicle with velocity-varying obstacle (HSPI-OAM) is proposed to adapt to the obstacle with complex motion, and the path planned by HSPI-OAM has high smoothness and low parameter dependence. The contributions of this work are summarized below:

  • For obstacle with arbitrary acceleration, the HSPI-OAM can achieve high-performance obstacle avoidance for AV, which allows it to adapt to most dynamic environments.
  • The proposed virtual collision point model accurately calculates the required acceleration, thus ensuring the high smoothness of the path, which is beneficial to the smooth running of the vehicle and the reduction of path tracking error.
  • The performance of obstacle avoidance does not depend on parameter adjustment due to collision time can be determined to the appropriate value according to demand. This enhances the adaptability of the method to different environments.

Compared with current obstacle avoidance methods, such as [1116], the proposed method implements obstacle avoidance for obstacles with more complex motions, at the same time, the planned path has high smoothness, and the planning process is less dependent on parameters. The remainder of this paper is organized as follows. In Section 2, the problem statement is described. Section 3 introduces the design of HSPI-OAM. The simulation and analysis are provided in Section 4. Finally, Section 5 gives the conclusion.

Section 2: Problem statement

It may be difficult to achieve high-performance obstacle avoidance by ignoring changes in obstacle velocity. In order to address this challenge, two problems should be considered: (1) The smoothness of the path; (2) The dependency issues for parameter.

The smoothness of path

The smoothness of path is critical to the smooth running of vehicle and the accuracy of path tracking. In general, the path planning problem is considered as [25, 28]: (1) where Ut+k,t denotes the cost of obstacle, is the cost for tracking the desired path, represents the cost of control inputs, is the cost of violation of control input and denotes the cost of slack variables. Q, R, S and P are the corresponding weight matrix. When the vehicle is far from the obstacle, the value of U is small, while the other penalty terms are relatively large, and the path does not change for obstacle avoidance. Only when the vehicle is close to the obstacle, the value of U will increase dramatically, and the path will change for obstacle avoidance. At this time, the time for obstacle avoidance is not much, and the change of path must be relatively drastic.

The dependency issues for parameter

Generally speaking, the implementation of obstacle avoidance often depends on evaluation functions, and needs to evaluate a variety of objects, including obstacle avoidance, lane keeping, etc. These evaluation functions are usually scaled by weight coefficients. In dynamic environment, the same group of weight coefficients may not achieve good obstacle avoidance effect in the changing environment. In expressions (1), U is specifically expressed as: (2) where k1 and k2 denote the intensity and shape parameters, respectively. is the signed distance which is consider the velocity of vehicle and obstacle, and more information about it can be found in [25]. In expressions (1) and (2), the cost of obstacle and the cost of other items have their respective coefficients. For specific environment, good obstacle avoidance effect can be achieved through adjusting these coefficients. However, when the velocity of obstacle is changed, the same parameters may not work well, or even cause obstacle avoidance to fail. The obstacle avoidance with different parameters is shown in Fig 1.

In Fig 1, the method proposed by [25] is used to avoid moving obstacles. The only difference between path 1 and path 2 is that k1 = 0.1 in path 1 and k1 = 0.01 in path 2. Obviously path 1 completes obstacle avoidance, while path 2 collides with the obstacle. The performance of obstacle avoidance depends on appropriate parameters. Usually in a dynamic environment, the same parameter is difficult to adapt to environmental changes.

Section 3: The design of HSPI-OAM

The existing methods ignore the acceleration of obstacle, and the avoidance maneuver is not timely and depend heavily on parameters. It may fail to achieve high-performance obstacle avoidance, or even lead to collision. To solve this problem, a highly smooth and parameter independent obstacle avoidance method for autonomous vehicle with velocity-varying obstacle (HSPI-OAM) is presented in this work. The structural schematic of HSPI-OAM is shown in Fig 2.

In Fig 2, ξO = [aox aoy vox voy xo yo]T denotes the motion parameters of the obstacle, including its longitudinal acceleration, lateral acceleration, longitudinal velocity, lateral velocity, longitudinal position and lateral position. ξV = [avx avy vvx vvy xv yv]T is the motion parameters of the vehicle, including its longitudinal acceleration, lateral acceleration, longitudinal velocity, lateral velocity, longitudinal position and lateral position. Pr represents the predicted relative motion path. dp is the minimum predicted distance between the vehicle and the obstacle, and tp denotes the corresponding time. ax and ay are the average longitudinal and lateral accelerations required for obstacle avoidance, respectively. Ov represents the information of virtual obstacle. Cv denotes the information of virtual collision point. △tv is the advance time for virtual collision. △dv is the additional offset for avoiding collision. The relative motion model uses the motion parameters of vehicle and obstacle to obtain the predicted relative motion path. The minimum predicted distance between the vehicle and the obstacle and corresponding time can be predicted by combining the relative motion path and the information of virtual obstacle. In the virtual collision point model, the location of the virtual collision point is calculated using the time advance for virtual collision and the information of virtual obstacle. The virtual path is reconstructed by the input value to obtain the required average acceleration. The planned path and the motion parameters of vehicle at the next moment can be obtained from the vehicle motion model.

In order to visualize the problem, the moving obstacle is treated as stationary and the velocity of the moving obstacle is appended to the vehicle. For example, the velocity of the vehicle is vv, the velocity of the moving obstacle is vo, and after the obstacle is regarded as stationary and the velocity of the moving obstacle is attached to the vehicle, the velocity of the vehicle is vv-vo and the velocity of the obstacle is regarded as 0. Under such conditions, the relative motion parameters of the vehicle are expressed as: (3) where [arx ary vrx vry xr yr]T represent the motion parameters of the vehicle relative to the obstacle, including its longitudinal acceleration, lateral acceleration, longitudinal velocity, lateral velocity, longitudinal position and lateral position.

In order to improve the efficiency, the vehicle in this paper adopts the single point mass model considering acceleration [18]. And the relative motion model of the vehicle is expressed as: (4) (5) (6) (7) (8) (9) where t represents sampling time interval. The predicted relative motion path can be obtained by the relative motion model. And the slope of the predicted relative motion path can be expressed as: (10)

Since the obstacle is considered stationary, Oi can be considered as the initial position of the obstacle, and it can be denoted as , and the slope from Oi to Pr is: (11)

When the distance from Oi to Pr is the smallest, there is: (12)

When expression (12) is true, dp and tp can be obtained. Then the virtual collision point model can be constructed as shown in Fig 3.

In general, if dp is less than the collision radius R of the obstacle, the path needs to be offset outward by Rdp along dp in order to avoid collision. This will increase the lateral offset after obstacle avoidance because of the lateral acceleration. In order to reduce the lateral offset, Ov is simulated to collide with the vehicle in advance, and the advance collision time is △tv. In the virtual collision point model, dv is expected to be obtained. The coordinate of Ci is expressed as: (13) (14)

The coordinate of Cv is expressed as: (15) (16)

The coordinate of Ov is expressed as: (17) (18)

Then dv can be calculated as: (19)

In the virtual collision point model, additional offset △dv is needed to avoid collision. (20)

And the additional offset needs to be done in (tp − △tv) time. Therefore, the acceleration required is: (21)

The corresponding longitudinal and lateral acceleration components are: (22) (23) (24) where atan2 is an extension of the arctangent function, and it returns value in the range (−pi, pi]. The expression (15)—(22) is subject to t ∈ [0, tv − △tv]. When t ∈ (tv − △tv, tv), the expected accelerations are: (25) (26) where vrefx and vrefy denote the longitudinal and lateral reference velocity of vehicle.avx and avy are the accelerations required for relative motion, and the actual acceleration components required by the vehicle are: (27) (28)

Finally, the high-performance path for obstacle avoidance and the vehicle motion parameters at the next moment can be obtained using the vehicle motion model.

It should be pointed out that the proposed method is planned at the acceleration level and the acceleration is equalized in the virtual collision point model, so the smoothness of the planned path is greatly improved.

Section 4: Simulation and analysis

The performance of HSPI-OAM is tested by four comparative simulation tests, and improved artificial potential field method (IAPF) is used as the contrast method. The IAPF method uses the combination of artificial potential field and model prediction, both of which are classical path planning methods. Especially, the combination of the two methods makes the comparison method have strong dynamic planning ability by using prediction ability. Meanwhile, the comparison method can consider the actual physical constraints of vehicles in the model prediction, so that the path planned by the comparison method is smoother. Therefore, it is more comparable with the method proposed in this paper. In IAPF method, the velocity of obstacle is taken into account and the cost function is designed as expressions (1) and (2). More information about the IAPF method can be found in [28]. The result of test is summarized in Table 1. βmax is maximum side slip angle of vehicle. γmax denotes the maximum yaw rate of a vehicle. emax represents the maximum tracking error of vehicle. Generally speaking, after completing obstacle avoidance, the vehicle needs to return to the global path. At this time, the values of βmax, γmax and emax can be reduced through parameter settings. For example, more time and distance can be used to make the regression path smoother, so as to reduce the above variables. Therefore, the βmax, γmax and emax in Table 1 refer to the values before obstacle avoidance. The partial parameter of test is set in Table 2. ξO and ξV are the motion parameter of obstacle and vehicle as described in Fig 2. △tv is the advance time for virtual collision as described in Fig 2. Q and k1 are the relative weight coefficient as described in expressions (1) and (2). In the proposed method, only △tv needs to be determined. This parameter is first given an approximate value through experience, and then a better value is determined through multiple simulation tests.

Test 1

The results of Test 1 are shown in Figs 47. In Test 1, the obstacle has only longitudinal acceleration. As shown in Fig 4, The arrow indicates the direction of motion. The area surrounded by the star symbol represents the size of the obstacle. The area surrounded by the red star symbol is the initial position of the obstacle, and the areas surrounded by the star symbol in other colors are the positions of the obstacle when AV is closest to the obstacle in the corresponding method. It is not difficult to see that both methods HSPI-OAM and IAPF can achieve safe obstacle avoidance, while the path in method HSPI-OAM is smoother. In Fig 5, the maximum side slip angle of AV is 0.13 in HSPI-OAM, while IAPF does have 1.08. And the yaw rate has the same curve variation trend as shown in Fig 6, which means that the path obtained by HSPI-OAM is very smooth and conducive to vehicle stability, and the path tracking error of AV can also be minimized, as shown in Fig 7.

Test 2

The results of Test 2 are shown in Figs 811. Compared with Test 1, the motion parameter in Test 2 is changed. Corresponding to the change of motion parameter, the performance parameter involved in HSPI-OAM does not change as shown in Table 2, while the side slip angle, yaw rate and tracking error of AV remain in a very small range. In IAPF1, the same parameters as in Test 1 are used. Although obstacle avoidance is still completed, the path is indeed greatly changed. In IAPF1, the path implements sudden maneuver for obstacle avoidance, which is not in line with human obstacle-avoidance operation, but also greatly damages the smoothness of the path. In IAPF2, the weight of obstacle avoidance cost is reduced to k1 = 0.0015, and the path similar to IAPF in Test 1 is obtained. Therefore, the performance of obstacle avoidance in IAPF depends on the choice of parameters, while HSPI-OAM achieves good obstacle avoidance performance in Test 1 and Test 2 by using the same parameters.

Test 3

The results of Test 3 are shown in Figs 1215. Unlike Tests 1 and 2, both obstacle and vehicle in Test 3 have longitudinal and lateral acceleration, so their trajectories are curved. In HSPI-OAM, the performance parameter is still unchanged, and AV still achieves obstacle avoidance while the side slip angle, yaw rate and tracking error remain at fairly small values. k1 = 0.1 in IAPF1 is the same as that in Test 1. Different from Test 1 and Test 2, the vehicle collides with the obstacle because k1 = 0.1 value is too small in Test 3. In IAPF2, k1 is adjusted to k1 = 1.5 to complete obstacle avoidance again. Not only do IAPF1 and IAPF2 depend on the parameter, but the side slip angle, yaw rate and tracking error in IAPF1 and IAPF2 is greater than those in HSPI-OAM.

Test 4

The results of Test 4 are shown in Figs 1619. As in Test 3, both obstacle and vehicle in Test 4 have longitudinal and lateral acceleration. The difference is that AV and obstacle are moving in the same direction. In HSPI-OAM, the performance parameter is still unchanged, and AV still achieves obstacle avoidance while the side slip angle, yaw rate and tracking error remain at fairly small values. k1 = 1.5 in IAPF1 is the same as that in IAPF2 of Test 3. While the parameter that can realize obstacle avoidance in IAPF2 of Test 3 has a collision in this working condition. In IAPF2, k1 = 1.5 is adjusted to k1 = 50 to avoid collision.

In addition, the comparison method uses the combination of artificial potential field and model prediction method to plan the path. Adjusting the prediction time domain in the model prediction can improve the performance of the comparison method to a certain extent. For example, we use 5, 10 and 15 to as the prediction time. The longer the prediction time domain, the earlier the comparison algorithm can implement the path planning, thus smoothing the path to a certain extent. However, the required cost will also increase. More importantly, the smoothness of its path cannot be compared with that of the proposed method, and the improvement of yaw rate, side slip angle and tracking error of the vehicle controlled by the comparison method is also limited. And the proposed method is planned at the acceleration level and the acceleration is equalized in the virtual collision point model, so the smoothness of the planned path is greatly improved.

Section 5: Conclusions

The proposed HSPI-OAM can realize highly smooth and parameter independent obstacle avoidance in the complex obstacle avoidance situation where both the obstacle and the vehicle have acceleration. In four different working conditions, the comparison method needs to adjust parameters according to different working conditions to achieve obstacle avoidance, and the smoothness of the path is not as good as HSPI-OAM. HSPI-OAM can achieve obstacle avoidance and obtain a smooth path without adjusting parameter, which is conducive to the stability of the vehicle and the accuracy of path tracking. Since the proposed method accurately designs the required acceleration according to the motion information of the moving obstacle and vehicle, it may be necessary to add additional strategies for pre-processing each obstacle in the face of multiple obstacles, so as to improve the adaptability of the method to the multi-obstacle environment, which is also a direction for the subsequent efforts of the method.

References

  1. 1. Li X. et al, “Progression cognition reinforcement learning with prioritized experience for multi-vehicle pursui,” IEEE Transactions on Intelligent Transportation Systems, 2024.
  2. 2. Wang X., Li J., Fan L., Wang Y. and Li Y., “Advancing vehicular healthcare: The DAO-based parallel maintenance for intelligent vehicles”, IEEE Transactions on Intelligent Vehicles, vol. 8, no. 12, pp. 4671–4673, 2023.
  3. 3. Lazarowska. Agnieszka, “Review of collision avoidance and path planning methods for ships utilizing radar remote sensing,” Remote Sensing, vol. 13, no. 16, pp. 3265, 2021.
  4. 4. McGuire K., de Croon G., De Wagter C., Tuyls K. and Kappen H., “Efficient optical flow and stereo vision for velocity estimation and obstacle avoidance on an autonomous pocket drone,” IEEE Robotics and Automation Letters, vol. 2, no. 2, pp.1070–1076, 2017.
  5. 5. Lin H. -Y. and Peng X. -Z., “Autonomous quadrotor navigation with vision based obstacle avoidance and path planning,” IEEE Access, vol. 9, pp. 102450–102459, 2021.
  6. 6. V. Kurtz and H. Lin, “Toward verifiable real-time obstacle motion prediction for dynamic collision avoidance,” 2019 American Control Conference (ACC), Philadelphia, PA, USA 2019, pp. 2633–2638.
  7. 7. Roberge V., Tarbouchi M. and Labonté G., “Fast genetic algorithm path planner for fixed-wing military UAV using GPU,” IEEE Transactions on Aerospace and Electronic Systems, Vol. 54, no. 5, pp. 2105–2117, 2018
  8. 8. Yuan. X, Yuan. X. W, Wang. X.H, “Path planning for mobile robot based on improved bat algorithm,” Sensors, vol. 21, no. 13, pp. 4389, 2021. pmid:34206921
  9. 9. Zhu. X. H, Yan. B, Yue. Y, “Path planning and collision avoidance in unknown environments for USVs based on an improved D* Lite,” Applied Sciences-Basel, vol. 11, no. 17, pp. 7863, 2021.
  10. 10. Zafar. M. N, Mohanta. J. C, Keshari. A, “GWO-potential field method for mobile robot path planning and navigation control,” Arabian Journal for Science and Engineering, vol. 46, no. 8, pp. 8087–8104, 2021.
  11. 11. Zhou. X. B, Yu. X, Zhang. Y. M, Luo. Y. Y, Peng. X. Y, “Trajectory planning and tracking strategy applied to an unmanned ground vehicle in the presence of obstacles,” IEEE Transactions on Automation Science and Engineering, vol. 18, no. 4, pp. 1575–1589, 2021.
  12. 12. Du. Toit. Noel. E, Burdick. Joel. W, “Robot motion planning in dynamic, uncertain environments,” IEEE Transactions on Robotics, vol. 28, no. 1, pp. 101–115, 2012.
  13. 13. Wen. Shuhuan, Zheng. Wei, Zhu. Jinghai, “Elman fuzzy adaptive control for obstacle avoidance of mobile robots using hybrid force/position incorporation,” IEEE Transactions on Systems Man and Cybernetics Part C-Applications and Reviews, vol. 42, no. 4, pp. 603–608, 2012.
  14. 14. Kim. Cheol. Joong, Chwa. Dongkyoung, “Obstacle avoidance method for wheeled mobile robots using interval type-2 fuzzy neural network,” IEEE Transactions on Fuzzy Systems, vol. 23, no. 3, pp. 677–687, 2015.
  15. 15. Malone. N, “Hybrid dynamic moving obstacle avoidance using a stochastic reachable set-based potential field,” IEEE Transactions on Robotics, vol. 33, no. 5, pp. 1124–1138, 2017.
  16. 16. Mora. M. C, “Predictive and multirate sensor-based planning under uncertainty,” IEEE Transactions on Intelligent Transportation Systems, vol. 16, no. 3, pp. 1493–504, 2015.
  17. 17. Shamir. T, “How should an autonomous vehicle overtake a slower moving vehicle: Design and analysis of an optimal trajectory,” IEEE Transactions on Automatic Control, vol. 49, no. 4, pp. 607–610, 2004.
  18. 18. Rosolia. Ugo, De. Bruyne. Stijn, Alleyne. Andrew G, “Autonomous vehicle control: A nonconvex approach for obstacle avoidance,” IEEE Transactions on Control Systems Technology, vol. 25, no. 2, pp. 469–484, 2017.
  19. 19. Zong. C. F, Han. X. J, Zhang. D, Liu. Y, Zhao. W. Q, Sun. M, “Research on local path planning based on improved RRT algorithm,” Proceedings of the Institution of Mechanical Engineers Part D-Journal of Automobile Engineering, vol. 235, no. 8, pp. 2086–2100, 2021.
  20. 20. Liang Z., Zhao J., Liu B., Wang Y. and Ding Z., “Velocity-based path following control for autonomous vehicles to avoid exceeding road friction limits using sliding mode method,” IEEE Transactions on Intelligent Transportation Systems, vol. 23, no. 3, pp. 1947–1958, 2022.
  21. 21. Cho. Jang-Ho, Pae. Dong-Sung, Lim. Myo.Taeg, “A real-time obstacle avoidance method for autonomous vehicles using an obstacle-dependent gaussian potential field,” Journal of Advanced Transportation Journal, vol. 2018, 2018.
  22. 22. Dang R., Wang J., Li S., Eben , and Li K., “Path generation algorithm based on crash point prediction for lane changing of autonomous vehicles,” International Journal of Automotive Technology, vol. 20, no. 3, pp. 507–519, 2019.
  23. 23. Chen. Yuxiao, Peng. Huei, Grizzle. Jessy, “Obstacle avoidance for low-speed autonomous vehicles with barrier function,” IEEE Transactions on Control Systems Technology, vol. 26, no. 1, pp. 194–206, 2018.
  24. 24. X. Sun, S. Deng and B. Tong, “Trajectory planning approach of mobile robot dynamic obstacle avoidance with multiple constraints,” 2021 6th IEEE International Conference on Advanced Robotics and Mechatronics (ICARM), pp. 829–834, 2021.
  25. 25. Rasekhipour. Y, Khajepour. A, Chen. S. K and Litkouhi. B, “A potential field-based model predictive path-planning controller for autonomous road vehicles,” IEEE Transactions on Intelligent Transportation Systems, vol. 18, no. 5, pp. 1255–1267, 2017.
  26. 26. Ji. J, Khajepour. A, Melek. W. W and Huang. Y. J, “Path planning and tracking for vehicle collision avoidance based on model predictive control with multiconstraints,” IEEE Transactions on Vehicular Technology, vol. 66, no. 2, pp. 952–964, 2017.
  27. 27. Liu. J. C, Jayakumar. P, Stein. J. L and Ersal. T, “A nonlinear model predictive control formulation for obstacle avoidance in high-speed autonomous ground vehicles in unstructured environments,” Vehicle System Dynamics, vol. 56, no. 6, pp. 853–882, 2018.
  28. 28. Wang. H, Huang. Y. J, Khajepour. A, Rasekhipour. Y, Zhang. Y. B and Cao. D. P, “Crash mitigation in motion planning for autonomous vehicles,” IEEE Transactions on Intelligent Transportation Systems, vol. 20, no. 9, pp. 3313–3323, 2019.