Aiming at the problems of discontinuous curvature of the planned path, difficulty in finding the optimal reference path and high control accuracy requirements in tracking control for unmanned vehicles in the process of parallel parking, an optimal reference path planning method based on arc line and multi-objective optimization function and a path tracking control strategy based on nonlinear model predictive control are proposed. Firstly, the upper and lower boundaries of the exercisable area are obtained by the tangent of the arc and the straight line, and the multi-objective optimization function is designed to obtain the optimal arc-line combination, and the optimal reference path is obtained by polynomial curve fitting. Secondly, a path-following controller is designed using nonlinear model predictive control. Finally, a comparative analysis is carried out in MATLAB/Simulink and Carsim with the controller based on pure tracking design. The results show that the optimal reference path curvature obtained by the proposed method is continuous without sudden change, and the designed tracking controller has better tracking accuracy.
With the rapid development of unmanned vehicles, the Automated Parking System (APS), plays an important role in reducing the burden on drivers and improving vehicle safety.1 APS consists of three steps: environmental perception, path planning, and path tracking. Among them, the last two steps play a key role in the success of parking and determine the efficiency, accuracy, and safety of automatic parking.
For path planning problem, the existing parking path planning method can be roughly divided into two types.2 The first kind of planning method is based on an optimization algorithm. Li et al.3 established the parking path optimization problem by planning the optimal path time and using the interior point synchronous dynamic optimization method to solve the parking path. Chai et al.4 use particle swarm optimization algorithm and adaptive gradient method to solve the parking path by aiming at the shortest parking path and minimum pose deviation. Although the above path planning method based on the optimization algorithm has no constraint on the initial parking position and pose of vehicles and has a wide range of applications, it is difficult to be generalized and applied due to its large amount of calculation and low efficiency. Another kind of planning method is based on a geometry curve. Sungwoo et al.5 plan the shortest parking path by means of the tangent of two arcs, and there is the problem of spin turning because the curvatures at the tangent are not connected. Some scholars use the Bessel curve, cyclotron curve, B-spline curve, and so on to smooth the parking path so that the path curvature changes continuously.6–9 Although the above geometric curve planning method has higher computational efficiency and is convenient for engineering implementation relative to the optimization planning method, there are still some shortcomings, such as the acceleration is difficult to change continuously and smoothly, the whole reference path is long, and it is difficult to find the optimal reference path.
While the quintic polynomial can ensure the smoothing jerk and can specify the velocity and acceleration of the starting and ending path points, overcome the shortcomings of the geometric curve planning method.10
For the path tracking problem, the existing parking path tracking methods mainly include pure tracking control, synovial control, and fuzzy control methods. Li et al.11 use an improved pure tracking method to track polynomial curves. Jiang et al.12 use a non-time reference terminal for reaching law. The sliding mode path tracking control method is used to reduce the tracking error, improve the approach quality, and track the trajectory. Wen et al.13 make the tracking of parking path by establishing a simplified fuzzy rule library and using a learning algorithm to optimize the parameters of the fuzzy controller. Xiong et al.14 use the distance-angle deviation as a lateral preview model and used fuzzy control to design a fuzzy controller to track the parking path. Although the above methods have a good tracking effect on automatic parking, it is difficult to solve the problems of large changes in the curvature and heading angle of the reference path with low vehicle speed and the high requirements for tracking control accuracy in automatic parking. Nonlinear model predictive control (NMPC) can correct the control errors caused by model mismatch and external disturbances in time by through rolling optimization and feedback adjustment, it can better meet the requirements of automatic parking tracking control.
For the reasons mentioned above, this article proposes an optimal reference path planning method based on arc-line and multi-objective optimization functions, and a nonlinear model-based predictive path tracking control strategy. First, the upper and lower boundaries of the exercisable area are obtained by the tangent of the arc and the straight line, and the multi-objective optimization function is designed to obtain the optimal arc-line combination, and the optimal reference path is got by polynomial curve fitting. Then a path-following controller is designed using nonlinear model predictive control. Finally, the proposal is simulated in MATLAB/Simulink and Carsim compared with the pure tracking control.
Vehicle kinematics model
The unmanned vehicle is in a low-speed driving state during the parking process, and the influence of tire side slip can be ignored. The vehicle is simplified as a rigid body, and the path tracking controller is designed with the vehicle kinematic model instead of the dynamic model, and the center coordinate of the rear axle of the vehicle is used to design the path tracking controller. The motion state of the vehicle is represented by the center coordinates of the rear axle of the vehicle, and the kinematics model of the vehicle can be derived as follows:
where and are the velocity components of the vehicle at X and Y, respectively, is the rear axle speed, l is the wheel base, is the front wheel angle, is the heading angle, and is yaw velocity.
The established vehicle kinematics model is shown in Figure 1.
Vehicle kinematics model, where a, b, c, and d represent the four vertices of the vehicle contour, is the front suspension of vehicle, is the rear suspension of vehicle, and w is the width of the car.
When the vehicle runs with the minimum turning radius, the following relationship exists between the minimum turning radius of the vehicle, the maximum front wheel angle and the minimum turning radius of the rear axle center:
The coordinate relationship between the four vertices of the body and the center point of the rear axle is
Optimal reference path design
To realize the design of the optimal reference path, as shown in Figure 2. When the starting point and ending point coordinates of the parking are known, the arc radius of the first and second segments of the upper and lower boundaries of the exercisable area and the coordinates of the intersection between the arc and the straight line are solved by using the arc line tangent method, according to the starting point, ending point, collision avoidance constraints and vehicle parameter constraints. So as to determine the exercisable area of the parking trajectory. Three evaluation indexes of path curvature, control of the adjustable margin, and path length are designed to obtain the optimal arc-line combination in the exercisable area, and the optimal reference path is obtained by smoothing them with polynomial curves.
Optimal reference path analysis, where and are the starting point and ending point coordinates of the vehicle, , , , and are the coordinates of the upper and lower boundaries of the drivable region at the intersection points of straight lines, , , , and the radius of the upper and lower boundary of the driving area, , , , and are center coordinates of the upper and lower boundaries of the driving area.
Determination of the lower boundary of the drivable area
Under ideal conditions, the end of the parking should be located in the middle of the parking space as far as possible. Considering the parking safety, the end of the parking should be set as . As shown in Figure 3, safety distances and are reserved to ensure the safety of parking. By using reverse analysis (vehicle leaves from the parking space), according to the right front point b of the car body does not collide with the vertex of the parking space, the radius of the second section of the lower boundary of the drivable area can be obtained
Analysis of radius of the second section of the lower boundary of the drivable area. where A, B, C, and D represent the four vertices of parking space, L is the length and is the width of the parking space.
When b moves to point , the vehicle heading angle can be calculated
where is the vertical distance from to , and the coordinates of the center point of the rear axis are as follows:
When the center point of the rear axle passes through point , it drives along the line , so that the line equation of the lower boundary of the drivable area is , and the heading angle of the vehicle at is also , the line equation can be obtained as
Since the planned path arc is tangent to the straight line, the first arc of the lower boundary of the drivable area also passes through point .
From the formula of the distance from the center to the line , the first limit value of the first arc radius of the lower boundary of the drivable area can be obtained
The radius of the first section of the lower boundary of the drivable area calculated by the reverse analysis above cannot guarantee that the left front point a and right rear point c of the car body do not collide with the road boundary and parking space . Therefore, by making the left front point a of the vehicle body not collide with the road boundary and reserving a safe distance , the second limit value of the first arc radius of the lower boundary of the drivable area is obtained, as shown in Figure 4.
Analysis of radius of the first section of the lower boundary of the drivable area.
Since the right rear point c of the car body does not collide with the parking space , the third limit value q of the first arc radius of the lower boundary of the drivable area can be calculated, as shown in Figure 5.
Analysis of radius of the first section of the lower boundary of the drivable area.
When , .
When , , it is necessary to reversely deduce the radius of the second arc of the lower boundary of the new drivable area and the straight line equation of the lower boundary of the drivable area, as shown in Figure 6.
Analysis of radius of the second section of the lower boundary of the drivable area.
The distance from the center of the circle to the straight line is .
The distance from the center of the circle to the straight line is .
When the right front point b of the car body moves to intersect the upper-end line of the parking space, there is no collision occurs between the car body points and the parking space when the vehicle is traveling in a straight line. The heading angle of the new vehicle can be obtained by the same formula (8). In this case, the slope of the linear equation of the lower boundary of the drivable area is equal to the tangent value of .
To ensure that the right rear point c of the car body does not collide with the lower edge of the parking space, the first limit value of the second arc radius of the upper boundary of the drivable area is determined, as shown in Figure 7.
Analysis of radius of the second arc on the upper boundary of the drivable area.
Meanwhile, to meet the constraints of the vehicle steering mechanism, the radius of the second arc on the upper boundary of the drivable area should meet the following requirements
In the same way, the equation of the straight line and the radius of the first arc in the upper boundary of the drivable area are obtained from formulas (8) to (10).
Design of multi-objective optimization function
After the upper and lower boundary of the drivable area is calculated based on the arc straight line, theoretically, any group of arc-line combinations in the drivable area can meet the requirements of parking path planning. In this article, considering the influence of path curvature change, control adjustable margin, and path length on the reference path, a multi-objective optimization function is designed to find the optimal combination of circular arc lines in the drivable area.
Smooth curvature change
To avoid large turning angles in the parking process, the path curvature should be as small as possible. The two arcs in the driving area are discretized. The radius of the first arc is , the radius of the second arc is , and the curvature of the reference path is
where and are the abscissa of the intersection point of the first arc, the second arc, and the line, respectively. According to the values of and , the equation of the line is obtained from the distance formula of the coordinates and of the center of the two arcs to the line.
The coordinate of the intersection of the first arc and the line is obtained from the intersection of the arc and the line
Similarly, the coordinate of the intersection of the second arc and the line is obtained.
When the radius of the first arc and the radius of the second arc are maximized, the path curvature is minimized and when both radiuses of the arc are minimized, the path curvature is maximized.
The path curvature is constrained as
Maximum control adjustable margin
Control adjustable margin indicates the size of the correction controllable domain in vehicle control if the vehicle deviates from the expected trajectory. Since the variation range of the vehicle's steering angle is smaller than that of the vehicle's turning radius, the radius margin of the reference path is transformed into the front wheel angle margin
When the radius of the first arc and the radius of the second arc are maximized, the front wheel angle margin is minimized and when both radiuses of the arc are minimized, the front wheel angle margin is maximized.
The front wheel angle margin is constrained as
Shortest path length
When the parking speed is constant, the shorter the planned parking path length is, the shorter the parking time will be. The path length indicates the time required for the whole parking process, and the path length can reflect the economic performance of parking without considering other factors. The length of the parking path curve can be represented by the total arc length of the parking path curve
where is the rotation angle of the rear axle center moving from point to point , is the rotation angle of the rear axle center moving from point to point .
When the radius of the first arc and the radius of the second arc are maximized, the length of the path is maximized and when both radiuses of the arc are minimized, the length of the path is minimized.
The length of the path is constrained as
Multi-objective optimization function
According to the above analysis, when the path length is the shortest, the curvature of the path is not soft, and the adjustable margin at any time is not the maximum, which is contradictory to each other. Therefore, the following evaluation function is designed to calculate its substitute value.
where , , and are the weight coefficients, is the path curvature, is the front wheel angle margin, is the path length, , , and .
In summary, the radius of the first arc and the radius of the second arc are calculated from equation (30) when the evaluation function is minimized. According to equations (20) and (21), the linear equation and the coordinates and of the intersection point between the two arcs and the line can be obtained, so that the optimal combination of arc lines in the driving area can be obtained.
Optimal reference path smoothing
The parking reference path should meet the requirements of no collision with surrounding obstacles, continuous path curve, zero slope of the starting point and ending point, continuous curvature, and no more than the minimum turning radius of the vehicle.15 Curvature discontinuity exists in the reference path obtained by the tangent of the circular arc line. To tackle this issue, different types of curves are proposed. The advantages and disadvantages of common path curves are shown in Table 1. It can be seen that the quintic polynomial can meet the requirement of continuous curvature and is easy to solve. Therefore, this article chooses the quintic polynomial to fit the optimal circular arc line.
Comparison of advantages and disadvantages of different path curves.
Path curves type
Advantage
Disadvantages
B-spline curve Bezier curve
Continuous curvature. Easy to track
Much parameters. Higher calculation burden
Arctangent function Sigmoid function
Lower calculation burden. Continuous and smooth curvature
Not zero curvature at starting/ending points
Sinusoidal and polynomial superimposed curves
Continuous and smooth curvature.
Much parameters. Sometimes no solution
Quintic polynomial curve
Lower calculation burden. Continuous and smooth curvature
Larger parking space required
The planned parking path needs to pass through the starting coordinate and the ending coordinate of the parking, and the following constraint equation can be established
where are the coefficients of the quintic polynomial; and are the coordinates of .
To fit the arc line, the fifth-degree polynomial curve needs to pass through the coordinate of the intersection point between the first arc and the line and the coordinate of the intersection point between the second arc and the line. The following constraint equation can be established
To satisfy that the position and pose of the vehicle in the starting and ending parking states are parallel to the parking space, the derivative of the quintic polynomial curve at the starting coordinate and the ending coordinate is zero, and the following constraint equation can be established
The simultaneous equations (31) to (36) can be used to find the coefficients of the quintic polynomial, which can be used as the final optimal reference path for parking.
Design of path tracking controller
Compared with the linear model prediction method, the NMPC does not require a linearization process for nonlinear systems, which makes the simplified mathematical model closer to the real system state. Its core is to establish the prediction model and rolling optimization function, which minimizes the tracking error on the premise of minimum control quantity. According to the vehicle kinematics model in formula (1), the vehicle system can be regarded as a control system whose input is the control quantity and state quantity , and its general form is
where is the derivative of ; x and y are the center coordinates of the rear axle of the vehicle; is the heading angle of the vehicle; is the front wheel angle of the vehicle.
In order to make the kinematics model applied to the design of a nonlinear model predictive controller, the Euler method is adopted to discretize formula (37).
where t is the current sampling time; is the next sampling moment, and T is the sampling period and set to 0.05 s.
Assuming that the control time domain is and the prediction time domain is , the action sequence of the control quantity is
where is the control quantity at time .
In the prediction time domain, the pose state of the vehicle at each moment is
The deviation between vehicle pose and reference path in the time domain, namely, the predicted error is
where is the position and pose state information of the tracking target point on the reference path.
Based on the above model, the objective function of rolling optimization can be designed as
where the first item on the right of the equation is the tracking error penalty item, indicating the ability of the controlled system to follow the reference trajectory. The second term is the penalty of control input increment, reflecting the requirement of steady change of control quantity. The third term is the control quantity penalty to prevent the frequent changes in front wheel rotation caused by a small disturbance in the parking process. The last term prevents the occurrence of no feasible solution during operation. , , , and are the weight coefficient matrixes. is the relaxation factor.
Control quantity constraint and control quantity increment constraint of the system should be considered in rolling optimization
In parking path tracking control, the constraints of steering angle and steering angle increment are mainly considered.
According to formula (2) and vehicle parameters, the range of steering angle is .
The steering angle increment is calculated by the following formula
where is the steering angular velocity.
According to formula (44), the range of change in steering angle is .
In summary, the nonlinear model predictive control takes the front wheel angle as the control quantity, and the vehicle attitude as the state quantity. Under the control quantity and control increment constraints, the automatic parking path tracking control problem is transformed into a quadratic programming problem for solving
In each control cycle, the optimal sequence is obtained by solving formula (45), and the first element in the control sequence is applied to the controlled vehicle. The same process is repeated in the subsequent cycle such that the vehicle is controlled to track the best-planned trajectory.
To ensure the safety and comfort of vehicles in the parking process, parking speed is generally controlled below 5 km/h.16 Proportional–integral–derivative speed tracking controller is used to set the parking speed control, and the expected speed is set as 3.6 km/h.
Simulation and analysis
To verify the feasibility of parallel parking path planning and tracking control of driverless vehicles, MATLAB/Simulink and CarSim are used for joint simulation. Taking the actual parameters of a car as an example. According to the relevant construction standard requirements of the industry standard “Garage Building Design Code” of the People's Republic of China, the actual car and parking space parameters are set in Carsim.17 The vehicle parameters and environmental parameters are shown in Table 2.
Vehicle parameters and environmental parameters.
Parameter
Symbol
Unit
Numerical value
Vehicle width
1.774
The wheelbase
2.640
Front suspension
0.787
Rear suspension
1.158
Minimum turning radius
5.76
Parking space length
6.8
Parking space width
2.1
Road width
3.5
Maximum front wheel steering angular speed
0.5585
Path planning simulation
The starting coordinates of parking are set as (9.1580, 3.3870), and the safe distance is 0.1000 m.18 = 4.2000 m is calculated by formula (2). By setting the combination of weights and coefficients of different values, the multi-objective evaluation function is used to find the minimum objective function value under each combination of weights and coefficients. The corresponding weight coefficient combination of the minimum value of all the minimum objective function values is obtained. As shown in Figure 8, only part of the weight coefficient combination and the corresponding objective function value are shown. The minimum value of the objective function is 0.7707, and the corresponding weight coefficient combination is = 0.3, = 0.5, and = 0.2, which is set as the weight coefficient of this article. The optimal combination of arcs and lines in the driving area is calculated in MATLAB as shown in Figure 9. The radiuses of the first and second arcs of the upper boundary are 8.8918 m and 4.2000 m, respectively. The radiuses of the first and second arcs of the lower boundary are 8.1485 m and 4.7946 m, respectively. The radiuses of the first and second sections of the optimal arc-line combination are 8.4385 m and 4.3928 m, respectively, and the optimal arc-linear combination is located near the center of the drivable area. Figure 10 shows the simulation results of path curve fitting commonly used in Table 1. It can be seen from the figure that the path fitted by the arctangent function and sigmoid function is difficult to meet the requirement that the starting point of parking is parallel to the parking space, and the fitting effect is poor. The B-spline curve has the best path-fitting effect, but it is difficult to find control points and complicated to solve. The polynomial curve can satisfy the requirement that the parking starting point is parallel to the parking space, and the fitting effect is better than the arctangent function and sigmoid function. Figures 11 and 12 show the comparison before and after fitting the arc line combination by the quintic polynomial. It can be seen that the curvature of the arc-line combination has curvature mutation points in the whole parking process. After fitting the quintic polynomial, the shape of the arc-line combination can be maintained, and the curvature of the path is a smooth curve with no curvature mutation phenomenon, which meets the requirements of parking path planning. Figure 13 shows the trajectory of the center of the rear axle of the vehicle. It can be seen that the optimal arc-line combination can effectively avoid the restrictions of the road boundary and the parking space boundary in the parking environment, and form a collision-free reference path.
Value of weight coefficient.
The optimal combination of arcs and straight lines in the drivable area.
Different curve fitting comparison.
Path after polynomial fitting.
Path curvature after polynomial fitting.
Movement track of the center of the rear axle of the vehicle.
To verify the path planning performance of different parking starting points, the other two sets of starting point coordinates (9.3580, 3.4870) and (8.9580, 3.2870) are selected with the starting point (9.1580, 3.3870) in equal proportion, and the optimal reference path is obtained by quintic polynomial fitting. As shown in Figure 14, the heading angles of the vehicle at the starting point and the ending point are both 0, which meets the requirement that the initial state and the end state of the vehicle are parallel to the parking space. The three path curvatures are continuous without sudden change, the parking starting point curvature is 0, and the maximum curvature is 0.2124 m−1, as shown in Figure 15, which meets the requirement of the maximum vehicle curvature of 0.2380 m−1. The maximum front wheel rotation speed of the vehicle is 0.5325 rad/s, as shown in Figure 16, which meets the requirement of 0.5585 rad/s. Figure 17 shows the variation diagram of the front wheel angle of vehicles. It can be seen from the figure that the front wheel angle of vehicles continuously changes during the whole parking process. The maximum front wheel angle of vehicles in the three groups of paths is 0.5118 rad, which meets the requirement that the maximum front wheel angle of vehicles is less than 0.5585 rad. Taking the front wheel angle and path curvature as the evaluation index of ride comfort, the planned parking path meets the requirements of ride comfort.
Vehicle heading angle.
Path curvature.
Vehicle front wheel angle speed.
Front-wheel angle of vehicle.
Path tracking control simulation
To verify the performance of the designed path tracking controller, the expected vehicle speed is set to −3.6 km/h. The coordinates of the starting point of the tracking reference path are set to (9.1580, 3.3870), and compared with the pure tracking algorithm. , , and are empirical values determined by trial and error, It is found that when the ratio of heading error weight to transverse and longitudinal error weight in is greater than 10 or the ratio of to is less than 1, the tracking error of the controller is larger, but the front wheel steering angle changes continuously without abrupt change. When the ratio of course error weight to transverse and longitudinal error weight in is less than 10 or the ratio of to is more than 1, the tracking error of the controller is small, but the front wheel steering angle jumps. and are relaxation factors and corresponding weight coefficients to prevent no solution phenomenon in the process of solving, set as = 5, = 10. The controller parameters are shown in Table 3. It can be seen from Figures 18 and 19 that the vehicle can track the reference trajectory well under both NMPC and pure tracking control. However, it can be clearly seen from the local enlarged picture that the effect of NMPC tracking the reference trajectory is significantly higher than that of pure tracking control. The designed NMPC tracking controller can better meet the requirements of parking tracking control. It can be seen from Figure 20 that the tracking errors of the two tracking controllers are 0 at the starting point and the ending point, and the maximum error of pure tracking during the whole tracking process is 0.1365 m, accounting for 6.5% of the width of the parking space. The maximum ordinate tracking error of NMPC is 0.0428 m, accounting for 2.04% of the width of the parking space, whose tracking effect is significantly higher than pure tracking. Figure 21 shows that the maximum error of pure tracking heading angle reaches 0.0562 rad, while the maximum error of NMPC heading angle is 0.0165 rad, and the curve changes are more gentle than that of pure tracking control. Therefore, the tracking controller designed with NMPC has a better tracking effect than the controller with a pure tracking design.
Controller parameters.
The controller
Parameter selection
NMPC
PID
NMPC: nonlinear model predictive control; PID: proportional–integral–derivative.
Trajectory tracking effect.
Heading angle tracking effect.
Ordinate tracking error.
Heading angle tracking error.
Conclusion
This paper proposes an optimal reference path planning method based on arc-line and multi-objective evaluation, and a nonlinear model-based predictive path tracking control strategy. The upper and lower boundaries of the exercisable area are obtained by the tangent of the arc and the straight line. The optimal arc-line combination is obtained by designing a multi-objective optimization function, and the optimal reference path is obtained by fitting the polynomial curve. Then a path-following controller is designed using nonlinear model predictive control. The simulation results show that the proposed method can not only satisfy the collision avoidance and vehicle parameter constraints, but also that the path curvature is continuous without mutation, and the tracking controller designed has better tracking accuracy.
This article studies and analyzes the parallel parking of unmanned vehicles, and this method can be improved and verified in vertical and inclined parking scenarios in the future. Although the curvature of the planned path is continuous and has no sudden change, it has high requirements on the attitude of the parking starting point and requires a large parking space size. A multi-step parking method will be considered in future work to reduce the impact of the attitude of the parking starting point and the size of the parking space.
Footnotes
Declaration of conflicting interests
The author(s) declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.
Funding
The author(s) disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work is supported by the National Natural Science Foundation of China (no. 62071170) and the Natural Science Foundation of Henan Province (no. 212300410343).
ORCID iD
Yanfeng Wu
References
1.
MaCLiFLiaoC, et al.Path following based on model predictive control for automatic parking system. In: Intelligent and connected vehicles symposium, Shenzhen, China, 2017.
2.
ZhangJXWangCGuoC, et al.Parallel parking path planning based on adaptive neuro-fuzzy inference system. J Automot Eng2021; 43: 323–329.
3.
LiBWangKXShaoZQ. Time-optimal maneuver planning in automatic parallel parking using a simultaneous dynamic optimization approach. J IEEE Trans Intell Transp Syst2016; 17: 3263–3274.
4.
ChaiRTsourdosASavvarisA, et al.Multi-objective optimal parking maneuver planning of autonomous wheeled vehicles. J IEEE Trans Ind Electron2020; 67: 10809–10821.
5.
SungwooCBoussardCd'Andréa-NovelB. Easy path planning and robust control for automatic parallel parking. J IFAC Proc Vol2011; 44: 656–661.
6.
QinYLiuFWangP. A feasible parking algorithm in form of path planning and following. In: Proceedings of the 2019 International Conference on Robotics, Intelligent Control and Artificial Intelligence, XI'an, China, 2019, pp. 6–11.
7.
ZhangJXZhaoJShiZT, et al.Parallel parking path planning and tracking control based on clothoid curve. J Jilin Univ (Eng Ed)2020; 50: 2247–2257.
8.
VorobievaHGlaserSMinoiu-EnacheN, et al.Automatic parallel parking in tiny spots: path planning and control. J IEEE Trans Intell Transp Sys2015; 16: 396–410.
9.
LiHWjWLiKQ. Parallel parking path planning based on B-spline theory. J Chin J Highw2016; 29: 143–151.
10.
HuQMWangJGZhangXJ. Parallel parking path planning with quintic polynomial optimization. J Comput Eng Appl2022; 58: 291–298.
11.
LiHLuoJYanS, et al. Research on parking control of bus based on improved pure pursuit algorithms. In: 18th International symposium on distributed computing and applications for business engineering and science, Hubei, China, 2019, pp. 21–26.
12.
JiangLYangJ. Path tracking of automatic parking system based on sliding mode control. J Trans Chin Soc Agric Mach2019; 50: 356–364.
13.
WenZZGaoYPDuanJR, et al.Research on automatic parking based on fuzzy control. J Automot Technol2017; 498: 29–32.
14.
XiongZBYangWDingK, et al.Research on automatic parking algorithm based on preview fuzzy control. J Chongqing Univ Technol (Nat Sci Ed)2017; 31: 14–22.
15.
HuYZHePSLiuX. Parallel parking control method based on model predictive control. J Chongqing Univ Technol (Nat Sci)2020; 34: 1–8.
16.
WuFL. Research on path planning and tracking control algorithm of automatic parking system. Shandong: Qingdao University of Technology, 2021.
17.
JGJ 100-2015 Code for Design of Garage Buildings [S].
18.
QianYWangZQLiPX, et al.A control method for automatic parking based on linear quadratic programming. J Inf Control2021; 50: 660–666.