Multi-vehicle cooperation-oriented driving priority planning method and reference vehicle speed planning method

By introducing slack variables and iterative solutions in multi-vehicle collaborative driving, the vehicle traffic priority planning is optimized, and the problems of waste of computing resources and poor results in the existing technology are solved, and efficient road network management is achieved in complex interactive scenarios .

CN118898902APending Publication Date: 2024-11-05TONGJI UNIV
View PDF 0 Cites 2 Cited by

Patent Information

Application Number
CN202410974916.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-07-19
Publication Date
2024-11-05

AI Technical Summary

Technical Problem

In the existing multi-vehicle collaborative driving, it is difficult to achieve comprehensive operating conditions coverage between vehicles, especially in complex interactive scenarios, which leads to waste of computing resources and the problem of farther results from the optimal solution.

Method used

Adopt a driving priority planning method for multi-vehicle collaboration, by obtaining vehicle driving parameter data, identifying potential conflict points, constructing slack nonlinear planning problems, introducing slack variables, iteratively solve to obtain the optimal vehicle traffic priority, and according to the best Priority planning of real-time reference speed of vehicles.

Benefits of technology

While maintaining the optimality of the results, it significantly reduces the amount of computing, optimizes the overall network efficiency, and can quickly solve complex interactive scenarios and avoid wasting computing resources.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118898902A_ABST
    Figure CN118898902A_ABST
Patent Text Reader

Abstract

The invention relates to a multi-vehicle cooperation-oriented driving priority planning method and a reference vehicle speed planning method, and the method comprises the steps: obtaining the driving parameter data of vehicles under multi-vehicle cooperation, recognizing potential conflict points between the vehicles, and calculating the time limit of the vehicles driving to the potential conflict points, wherein the time limit comprises a time minimum value and a time maximum value; based on the time limit of the vehicle driving to the potential conflict point, a relaxation nonlinear programming problem is constructed and solved, an initial solving result is obtained, in the process of constructing the relaxation nonlinear programming problem, the vehicle passing priority p related to the potential conflict point and the time t of the vehicle arriving at the potential conflict point serve as optimization variables, and the initial solving result is obtained; a slack variable is introduced for the passing priority p of the vehicle; and performing iterative solution based on the initial solution result to obtain the optimal vehicle passing priority. Compared with the prior art, the method has the advantages that the calculation amount is reduced while the result optimality is kept, and the like.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of vehicle planning, and in particular to a driving priority planning method and a reference vehicle speed planning method for multi-vehicle collaboration. Background Art

[0002] In multi-vehicle cooperative driving, facing the right-of-way conflicts between vehicles, different traffic orders will greatly affect the overall efficiency of traffic. For example, improper traffic order will cause slow traffic flow and even cause serious traffic jams. Therefore, optimizing the right of way between vehicles is very beneficial to improving the overall road network efficiency. With the development of intelligent networking and autonomous driving technology, automated right-of-way planning has become possible. However, the interaction between vehicles is complex and changeable, and the existing right-of-way planning methods are difficult to cover all working conditions, especially multi-vehicle right-of-way planning for global traffic efficiency.

[0003] Since the vehicle traffic priority planning problem belongs to a mixed integer optimization problem, the time and position constraints between each vehicle are coupled together, so it is difficult to directly solve the optimal solution of this problem and it will generate a large computational burden. For this problem, some methods use the first-come first serve (FCFS) scheduling algorithm or heuristic algorithm to seek feasible solutions and give up solving the optimal solution. This type of method has a small amount of calculation, but the final result is often far from the optimal solution (especially under complex multi-vehicle interaction conditions), and it also generates a waste of computing resources. Patent CN117690298B discloses a conflict road right allocation modeling method and system based on graph theory. The method establishes a conflict relationship diagram according to the conflict relationship, and determines the target speed of the priority vehicle according to the conflict relationship diagram. However, for complex interaction conditions, the corresponding conflict relationship diagram will also be more complicated, which is not suitable for comprehensive road conditions. Summary of the invention

[0004] The purpose of the present invention is to provide a driving priority planning method and a reference vehicle speed planning method for multi-vehicle collaboration that maintain optimal results while reducing the amount of calculation.

[0005] The purpose of the present invention can be achieved by the following technical solutions:

[0006] A driving priority planning method for multi-vehicle cooperation includes the following steps:

[0007] Acquire driving parameter data of vehicles in multi-vehicle coordination, identify potential conflict points between vehicles and calculate the time limit for vehicles to travel to the potential conflict points, wherein the time limit includes a minimum time value and a maximum time value;

[0008] Based on the time limit of the vehicle traveling to the potential conflict point, a relaxed nonlinear programming problem is constructed and solved to obtain an initial solution result, including the initial relaxed right of way q, the time t when the vehicle arrives at the potential conflict point, and the integer solution index I p 、Number of integer solutions p , decimal solution index I q 、Number of decimal solutions q , optimal right of way p * (I p )=q(I p ), wherein in the process of constructing the relaxed nonlinear programming problem, the vehicle priority p involved in the potential conflict point and the time t when the vehicle arrives at the potential conflict point are used as optimization variables, and a relaxation variable is introduced for the vehicle priority p;

[0009] Based on the initial solution result, an iterative solution is performed to obtain the optimal vehicle passage priority.

[0010] Furthermore, calculating the minimum time value includes two cases:

[0011] Case 1: The vehicle is in a uniform acceleration process before reaching the potential conflict point. The calculation expression of the minimum time is:

[0012]

[0013] Case 2: The vehicle is in a uniform acceleration process before reaching the potential conflict point. After accelerating to the maximum speed, it maintains the maximum speed and travels uniformly. The calculation expression of the minimum time is:

[0014]

[0015] In the formula, is the minimum time for vehicle i to reach the potential conflict point, v i,cur is the current speed of vehicle i, a i,max is the maximum acceleration of vehicle i, is the distance between vehicle i and the potential conflict point, v i,max is the maximum speed of vehicle i.

[0016] Furthermore, calculating the maximum time value includes two cases:

[0017] Case 1: The vehicle is in a uniform deceleration process before reaching the potential conflict point. The calculation expression of the maximum time is:

[0018]

[0019] Case 2: The vehicle is in a uniform deceleration process before reaching the potential conflict point. After decelerating to the minimum speed, it maintains the minimum speed and travels at a uniform speed. The calculation expression of the maximum time is:

[0020]

[0021] In the formula, is the maximum time it takes for vehicle i to reach the potential conflict point, v i,cur is the current speed of vehicle i, a i,min is the minimum acceleration of vehicle i, is the distance between vehicle i and the potential conflict point, v i,min is the minimum speed of vehicle i.

[0022] Furthermore, the expression of the relaxed nonlinear programming problem is:

[0023]

[0024] Where N c is the number of potential conflict points, t c is the arrival time of the farthest potential conflict point involved by the vehicle, is the time when the kth vehicle involved in the i-th potential conflict point arrives at the i-th potential conflict point, is the vehicle index of the kth vehicle involved in the ith potential conflict point, where k = 1, 2, q {i} is the i-th value of q, indicating the vehicle priority at the i-th potential conflict point. {i} =1 means vehicle Priority passage, q {i} =0 means vehicle Priority passage, T in N is the minimum time interval between vehicles passing the same potential conflict point. m is the number of vehicles involved in at least two potential conflict points, For vehicle n m Arrive at A potential conflict point. For vehicles involved m The index of the potential conflict point, C(n m ) is vehicle n m The number of potential conflict points involved, For vehicle n m The current speed of the vehicle, For vehicle n m Distance The distance between potential conflict points.

[0025] Furthermore, the step of obtaining the optimal vehicle passing priority includes:

[0026] 1) Define the initial value of the iteration index i=1;

[0027] 2) Determine whether the number of remaining decimal solutions is 0. If so, the iteration ends, t * =t, output p * and t * , if not, proceed to step 3);

[0028] 3) Construct the ith integer programming problem and solve it to obtain the ith q (i) integer variable p * (I q (i)), where the vehicle priority p is taken as an integer variable during the construction process;

[0029] 4) Construct and solve the i-th nonlinear programming problem to obtain the time t when the vehicle arrives at the potential conflict point and the remaining N q -i slack rights q(I q (i+1,i+2,…,N q ));

[0030] 5) Return to step 3) to perform iterative calculation to obtain the optimal vehicle traffic priority.

[0031] Furthermore, the expression of the i-th integer programming problem is:

[0032]

[0033] In the formula, q(I q (i)) is the relaxation of the right of way.

[0034] Furthermore, the expression of the i-th nonlinear programming problem is:

[0035]

[0036] in:

[0037]

[0038] I p ={i|(q(i)-0.5) 2 ≥(0.5-ε) 2},N p =len(I p )

[0039] I q ={i|(q(i)-0.5) 2 <(0.5-ε) 2},N q =len(Iq )

[0040] Where, t c is the arrival time of the farthest potential conflict point involved by the vehicle, u {i} To optimize the variables, is the time when the kth vehicle involved in the jth potential conflict point arrives at the ith potential conflict point, where k = 1, 2, q(j) is the jth value of q, indicating the vehicle priority at the jth potential conflict point, r(j) is the jth temporary priority used for iterative calculation of the ith nonlinear programming problem, T in is the minimum time interval between vehicles passing the same potential conflict point, p * (j) is p * The jth value of For vehicle n m Arrive at A potential conflict point. For vehicle n m The current speed of the vehicle, For vehicle n m Distance The distance between potential conflict points, C(n m ) is vehicle n m The number of potential conflict points involved, N m is the number of vehicles, ε is the judgment threshold, set to 0~0.1, N c is the number of potential conflict points.

[0041] The present invention also provides a reference vehicle speed planning method according to the above-mentioned driving priority planning method for multi-vehicle cooperation, comprising the following steps:

[0042] Based on the optimal vehicle traffic priority, the vehicle right of way ranking under multi-vehicle coordination is solved;

[0043] According to the vehicle right-of-way ranking, a vehicle position constraint is constructed, and the vehicle real-time reference speed is iteratively solved according to the vehicle position constraint.

[0044] Furthermore, the step of obtaining the vehicle right of way ranking under multi-vehicle coordination includes:

[0045] According to the optimal vehicle passage priority, a vehicle local priority pair is obtained;

[0046] Based on the local priority pairs of the vehicles, the vehicle right-of-way ranking under multi-vehicle coordination is obtained:

[0047]

[0048] In the formula, I h Sort the right of way for vehicles, For vehicles with right of way ranking in m, is a symbol indicating the size of the right of way. express Higher than

[0049] Furthermore, the step of obtaining the real-time reference speed of the vehicle includes:

[0050] According to the vehicle right of way ranking, the time when the vehicle arrives at the potential conflict point is obtained, and the vehicle position constraint is constructed. The vehicle position constraint is:

[0051]

[0052] If * (2n+l-2)∈[t cur +(k-1)Δt,t cur +kΔt]

[0053] Among them, the vehicle position and vehicle speed obey the vehicle second-order longitudinal dynamics model:

[0054]

[0055]

[0056] In the formula, For vehicles with right of way ranking in m, and For vehicle i m The current position and the position at k moments in the future, For vehicle i m The distance to the nth potential conflict point, t * (2n+l-2) is the time when the vehicle arrives at the potential conflict point, t cur is the current time, For vehicle i m The speed at k moments in the future, For vehicle i m The acceleration at time k in the future, Δt is the control time interval;

[0057] According to the vehicle position constraint, the vehicle speed planning problem is constructed and solved to obtain the optimal driving acceleration of the vehicle in the predicted time domain. The expression of the optimal driving acceleration is:

[0058]

[0059] If * (2n+l-2)∈[t cur +(k-1)Δt,t cur +kΔt]

[0060] in is the optimization objective function of the vehicle, expressed as:

[0061]

[0062]

[0063] In the formula, Predict the optimal driving acceleration for the vehicle in the time domain, For vehicle i m The optimization objective function, a min 、a max 、v min 、v max For vehicle i m The minimum acceleration, maximum acceleration, minimum speed and maximum speed of the vehicle, δ is the prediction time domain, For the kth moment in the future Vehicle m The overlap area with the vertical projection area of ​​vehicle n, To predict the time domain terminal vehicle i m location, For vehicle i m Distance to vehicle n, d min is the minimum distance set, ω f With ω p are the control weights of energy consumption and safety respectively, τ is the set vehicle distance keeping relaxation parameter, Vehicle energy consumption, M v and A f is the vehicle mass and the frontal area, ρ air is the air density, C d and C R are the air resistance coefficient and wheel friction coefficient, g is the acceleration of gravity, and θ is the road slope;

[0064] According to the optimal driving acceleration, the vehicle real-time reference speed is solved using the vehicle second-order longitudinal dynamics model.

[0065] Compared with the prior art, the present invention has the following beneficial effects:

[0066] (1) In the priority planning problem of the present invention, a slack variable is introduced for the vehicle passage priority, a relaxed nonlinear programming problem is constructed, and an iterative solution method is adopted to solve it. Compared with the existing vehicle passage priority planning problem, the present invention reduces the amount of calculation of the method while maintaining the optimality of the result.

[0067] (2) The present invention sorts the road rights according to the solved optimal driving priority to construct vehicle position constraints and solve the real-time reference speed of the vehicle, which helps to optimize the overall road network efficiency.

[0068] (3) The present invention reduces the amount of calculation and can quickly solve even complex interactive scenarios, thus avoiding the waste of computing resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0069] Figure 1 It is a schematic diagram of the method flow of the present invention;

[0070] Figure 2 A schematic diagram of identifying potential conflict points of the present invention;

[0071] Figure 3 It is a schematic diagram of the mixed integer solution method based on relaxation variables of the present invention;

[0072] Figure 4 A schematic diagram of a multi-vehicle cooperative driving trajectory of the present invention;

[0073] Figure 5 This is a schematic diagram of the speed of multiple vehicles traveling in coordination and the distance to the nearest potential conflict point according to the present invention. DETAILED DESCRIPTION

[0074] The present invention is described in detail below in conjunction with the accompanying drawings and specific embodiments. This embodiment is implemented based on the technical solution of the present invention, and provides a detailed implementation method and specific operation process, but the protection scope of the present invention is not limited to the following embodiments.

[0075] Example 1

[0076] This embodiment provides a driving priority planning method for multi-vehicle collaboration. Figure 1 As shown, the following steps are included:

[0077] S1. Calculate the time limit for the vehicle to travel to the potential conflict point, including the maximum and minimum values.

[0078] By predicting the future driving trajectories of vehicles, potential conflict points between vehicles are identified. Figure 2 As shown, each potential conflict point corresponds to two vehicles involved. Taking potential conflict point A and vehicle 1 as an example, according to: the distance between the vehicle and the potential conflict point The current speed of the vehicle v 1,cur 、Maximum vehicle speed v 1,max With minimum speed v 1,min 、Maximum vehicle acceleration a 1,max With the minimum acceleration a 1,min , calculate the time limit for vehicles to reach potential conflict points, including the maximum value With minimum The calculation process is as follows:

[0079] First, calculate the minimum time it takes for a vehicle to reach a potential conflict point Assume that the vehicle will accelerate to the maximum speed possible before reaching the potential conflict point. Assuming that the vehicle is in a uniform acceleration process before reaching the potential conflict point, then

[0080]

[0081] Otherwise, it is assumed that the vehicle first performs a uniform acceleration process before reaching the potential conflict point, accelerating to the maximum speed v 1,max After that, keep driving at a constant speed.

[0082]

[0083] Then, calculate the maximum time it takes for the vehicle to reach the potential conflict point Assume that the vehicle will decelerate to the minimum speed possible before reaching the potential conflict point. Assuming that the vehicle is in a uniform deceleration process before reaching the potential conflict point,

[0084]

[0085] Otherwise, it is assumed that the vehicle first decelerates uniformly before reaching the potential conflict point, decelerating to the minimum speed v 1,min After that, keep driving at a constant speed.

[0086]

[0087] S2. Define the slack variable as the control variable. According to the time limit of the vehicle to reach the potential conflict point, construct and solve the relaxed nonlinear programming problem to obtain the relaxed right of way q, the time t when the vehicle arrives at the potential conflict point, and the integer solution index I. p 、Number of integer solutions p , decimal solution index I q 、Number of decimal solutions q , optimal right of way p * (I p )=q(I p ).

[0088] Assume that the number of potential conflict points identified in step S1 is N c , define the matrix Record the vehicle indexes involved in potential conflict points, such as and The value of is the vehicle index of the two vehicles involved in the first potential conflict point. If there are multiple potential conflict points involving the same two vehicles, the closest potential conflict point shall prevail. The priority of vehicles involved in potential conflict points is defined as For example, {1} =1 means vehicle At the first potential conflict point, the vehicle has the right of way. {1} =0 means vehicle It has the right of way at the first potential conflict point. The time when the vehicle reaches the potential conflict point is defined as

[0089]

[0090] The priority of the vehicles involved in the potential conflict point (integer variable) p and the time for the vehicles to arrive at the potential conflict point (continuous variable) t are used as optimization variables. The integer variables and continuous variables are coupled and constrained to each other. Directly solving the mixed integer optimization problem (integer variables and continuous variables coexist in the optimization variables) will produce a large computational burden. In order to reduce the amount of calculation, slack variables are introduced for integer variables. The arrival time of the farthest potential conflict point involved by the vehicle is taken as (N i The sum of the number of vehicles participating in the potential conflict point is taken as the optimization objective to be minimized, and the following nonlinear optimization problem is constructed to solve the relaxed right of way q and arrival time t.

[0091]

[0092] Where T in N is the minimum time interval between vehicles passing through the same potential conflict point. m is the number of vehicles involved in at least two potential conflict points, For vehicles involved m The index of potential conflict points (in Arranged in ascending order), C(n m ) is vehicle n m The number of potential conflict points involved.

[0093] Among the three constraints in the nonlinear optimization problem, the first constraint is the time limit for the vehicle to reach the potential conflict point, the second constraint is the coupling constraint of integer variables and continuous variables, and the third constraint is to ensure that the time for the same vehicle to reach different potential conflict points increases in the order of distance.

[0094] The following steps and steps S3-S5 are iterative solution steps, such as Figure 3 As described above, the iterative solution process is:

[0095] In the relaxed right of way q, some solutions may already be integer solutions, that is, they are distributed on the constraint boundary and are 0 or 1. Define the integer solution index as I p , the number of integer solutions is N p ,Right now

[0096] I p ={i|(q(i)-0.5) 2 ≥(0.5-ε) 2},N p =len(I p ) (7)

[0097] Where ε is the judgment threshold, which can be set to 0 to 0.1. The decimal solution index is I q , the number of decimal solutions is N q

[0098] I q ={i|(q(i)-0.5) 2 <(0.5-ε) 2},N q =len(I q ) (8)

[0099] The optimal right of way p * Middle I p The index part is p * (I p )=q(I p ).

[0100] Define the iteration index initial value i=1.

[0101] S3. Determine whether the number of remaining decimal solutions is 0. If so, the calculation ends. * =t, output p * and t * ; Otherwise, calculate S4 and S5 and return to S3.

[0102] S4. Solve the ith integer programming problem and obtain the ith q (i) integer variable p * (I q (i)).

[0103] Construct the following integer programming problem to solve the optimal right of way p * I q (i) value p * (I q (i)), that is

[0104]

[0105] Where q(I q(i)) is the relaxed right of way. If i = 1, then q(I q (i)) is obtained from the solution of the nonlinear optimization problem in step S2; if i>1, then q(I q (i)) is obtained from the solution of the i-1th nonlinear optimization problem in step S5 in the previous iteration (ie, i=i-1).

[0106] S5. Solve the i-th nonlinear programming problem to obtain the time t when the vehicle arrives at the potential conflict point and the remaining N q -i slack rights q(I q (i+1,i+2,…,N q )).

[0107] In the i-th iteration, the optimal right of passage p * The number of fixed integer results is N p +i, fixed integer result index is {I p ,I q (1,2,…,i)}, the number of integer variables to be solved is N q -i, the integer variable index to be solved is I q (i+1,i+2,…,N q ). Therefore, in the i-th nonlinear programming problem, define the optimization variable u {i} is the time t when the vehicle arrives at the potential conflict point and the remaining N q -i slack rights q(I q (i+1,i+2,…,N q )),Right now

[0108]

[0109] Construct the following i-th nonlinear programming problem and solve the time t when the vehicle arrives at the potential conflict point and the remaining N q -i slack rights q(I q (i+1,i+2,…,N q )).

[0110]

[0111] Example 2

[0112] This embodiment provides a reference vehicle speed planning method according to the driving priority planning method for multi-vehicle cooperation described in Embodiment 1, such as Figure 1 As shown, the following steps are included:

[0113] S6. According to the optimal right of way of the vehicles, the right of way ranking of the vehicles is obtained.

[0114] According to the optimal vehicle traffic priority, the local vehicle priority pair is obtained, that is, if for a potential conflict point involving vehicle m and vehicle n (m < n), if the priority p = 1, then If priority p = 0, then Since only the closest potential conflict point between two vehicles is considered, the local priority pair of vehicles can be uniquely determined. If there is no potential conflict point between vehicle m and vehicle n, then and According to the above definition, we can get the vehicle right of way ranking I in a network containing M vehicles. h ,Right now

[0115]

[0116] S7. Construct a vehicle position constraint based on the time reference constraint, and iteratively solve the vehicle real-time reference speed under the high road right vehicle safety constraint based on the vehicle position constraint.

[0117] If the vehicle Participated in the potential conflict point n, that is According to the time t when the vehicle arrives at the potential conflict point * (2n+l-2), construct the vehicle Vehicle position constraints:

[0118]

[0119] where t cur is the current time, and For vehicle i m The current position and the position at k moments in the future.

[0120] Vehicle location and vehicle speed Obey the vehicle second-order longitudinal dynamics model

[0121]

[0122] in is the vehicle acceleration, and Δt is the control time interval.

[0123] According to the vehicle position constraints, construct the The vehicle speed planning problem is as follows: Solve to obtain the optimal driving acceleration of the vehicle in the predicted time domain

[0124]

[0125] Where δ is the prediction time domain, For vehicle i mThe overlap area with the vertical projection area of ​​vehicle n can be calculated from the vehicle position, a min 、a max 、v min 、v max For vehicle i m The minimum acceleration, maximum acceleration, minimum vehicle speed and maximum vehicle speed. For vehicle i m The optimization objective function includes vehicle energy consumption, safety and fast driving terms, namely

[0126]

[0127] in For vehicle i m Distance to vehicle n, d min is the minimum distance set; ω f With ω p are the control weights of energy consumption and safety respectively, and τ is the set vehicle distance keeping relaxation parameter; Vehicle energy consumption, calculated as;

[0128]

[0129] Among them, M v and A f is the vehicle mass and the frontal area, ρ air is the air density, C d and C R is the air resistance coefficient and wheel friction coefficient, g is the acceleration of gravity, and θ is the road slope. Finally, according to the optimal driving acceleration The real-time reference speed of the vehicle is obtained by solving equation (14):

[0130] use Figure 4 Taking the vehicle interaction scenario shown in the figure as an example, the simulation is performed in MATLAB. The number of vehicles is 5, the speed limit is 1m / s~4m / s, and the vehicle acceleration limit is -1m / s2~1m / s2. The simulation results are shown in Figure 5 As shown, A, B, and C represent the time 0s, 6s, and 15s respectively. Figure 5 It can be seen that the vehicles can pass through the potential conflict point safely and orderly, and when necessary, the vehicles will slow down and give way for safety reasons (for example, within 0 to 6 seconds, there is a potential conflict point between vehicle 1 and vehicle 2, so vehicle 2 slows down and waits within 0 to 6 seconds, and starts to accelerate only after vehicle 1 passes the corresponding potential conflict point), which illustrates the effectiveness of the present invention in ensuring the safety of vehicle interaction.

[0131] Although the preferred embodiments of the present invention have been described, those skilled in the art may make other changes and modifications to these embodiments once they have learned the basic creative concept. Therefore, the appended claims are intended to be interpreted as including the preferred embodiments and all changes and modifications that fall within the scope of the present invention.

[0132] Obviously, those skilled in the art can make various changes and modifications to the present invention without departing from the spirit and scope of the present invention. Thus, if these modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include these modifications and variations.

Claims

1. A driving priority planning method for multi-vehicle cooperation, characterized in that: The following steps are involved: Acquire driving parameter data of vehicles in multi-vehicle coordination, identify potential conflict points between vehicles and calculate the time limit for vehicles to travel to the potential conflict points, wherein the time limit includes a minimum time value and a maximum time value; Based on the time limit of the vehicle traveling to the potential conflict point, a relaxed nonlinear programming problem is constructed and solved to obtain an initial solution result, including the initial relaxed right of way q, the time t when the vehicle arrives at the potential conflict point, and the integer solution index I p 、Number of integer solutions p , decimal solution index I q 、Number of decimal solutions q , optimal right of way p * (I p )=q(I p ), wherein in the process of constructing the relaxed nonlinear programming problem, the vehicle priority p involved in the potential conflict point and the time t when the vehicle arrives at the potential conflict point are used as optimization variables, and a relaxation variable is introduced for the vehicle priority p; Based on the initial solution result, an iterative solution is performed to obtain the optimal vehicle passage priority.

2. The driving priority planning method for multi-vehicle cooperation according to claim 1 is characterized in that: Calculating the minimum time includes two cases: Case 1: The vehicle is in a uniform acceleration process before reaching the potential conflict point. The calculation expression of the minimum time is: Case 2: The vehicle is in a uniform acceleration process before reaching the potential conflict point. After accelerating to the maximum speed, it maintains the maximum speed and travels uniformly. The calculation expression of the minimum time is: In the formula, is the minimum time for vehicle i to reach the potential conflict point, v i,cur is the current speed of vehicle i, a i,max is the maximum acceleration of vehicle i, is the distance between vehicle i and the potential conflict point, v i,max is the maximum speed of vehicle i.

3. The driving priority planning method for multi-vehicle cooperation according to claim 1 is characterized in that: Calculating the maximum time includes two cases: Case 1: The vehicle is in a uniform deceleration process before reaching the potential conflict point. The calculation expression of the maximum time is: Case 2: The vehicle is in a uniform deceleration process before reaching the potential conflict point. After decelerating to the minimum speed, it maintains the minimum speed and travels at a uniform speed. The calculation expression of the maximum time is: In the formula, is the maximum time it takes for vehicle i to reach the potential conflict point, v i,cur is the current speed of vehicle i, a i,min is the minimum acceleration of vehicle i, is the distance between vehicle i and the potential conflict point, v i,min is the minimum speed of vehicle i.

4. The driving priority planning method for multi-vehicle cooperation according to claim 1 is characterized in that: The expression of the relaxed nonlinear programming problem is: Where N c is the number of potential conflict points, t c is the arrival time of the farthest potential conflict point involved by the vehicle, is the time when the kth vehicle involved in the i-th potential conflict point arrives at the i-th potential conflict point, is the vehicle index of the kth vehicle involved in the ith potential conflict point, where k = 1, 2, q {i} is the i-th value of q, indicating the vehicle priority at the i-th potential conflict point. {i} =1 means vehicle Priority passage, q {i} =0 means vehicle Priority passage, T in N is the minimum time interval between vehicles passing the same potential conflict point. m is the number of vehicles involved in at least two potential conflict points, For vehicle n m Arrive at A potential conflict point. is the index of the potential conflict point involving vehicle nm, C(n m ) is vehicle n m The number of potential conflict points involved, For vehicle n m The current speed of the vehicle, For vehicle n m Distance The distance between potential conflict points.

5. The driving priority planning method for multi-vehicle cooperation according to claim 1 is characterized in that: The steps of obtaining the optimal vehicle passing priority include: 1) Define the initial value of the iteration index i=1; 2) Determine whether the number of remaining decimal solutions is 0. If so, the iteration ends, t * =t, output p * and t * , if not, proceed to step 3); 3) Construct the ith integer programming problem and solve it to obtain the ith q (i) integer variable p * (I q (i)), where the vehicle priority p is taken as an integer variable during the construction process; 4) Construct and solve the i-th nonlinear programming problem to obtain the time t when the vehicle arrives at the potential conflict point and the remaining N q -i slack rights q(I q (i+1,i+2,…,N q )); 5) Return to step 3) to perform iterative calculation to obtain the optimal vehicle traffic priority.

6. The driving priority planning method for multi-vehicle cooperation according to claim 5 is characterized in that: The expression of the i-th integer programming problem is: In the formula, q(I q (i)) is the relaxation of the right of way.

7. The driving priority planning method for multi-vehicle cooperation according to claim 5 is characterized in that: The expression of the i-th nonlinear programming problem is: in: I p ={i|(q(i)-0.5) 2 ≥(0.5-ε) 2 },N p =len(I p ) I q ={i|(q(i)-0.5) 2 <(0.5-ε) 2 },N q =len(I q ) Where, t c is the arrival time of the farthest potential conflict point involved by the vehicle, u {i} To optimize the variables, is the time when the kth vehicle involved in the jth potential conflict point arrives at the ith potential conflict point, where k = 1, 2, q(j) is the jth value of q, indicating the vehicle priority at the jth potential conflict point, r(j) is the jth temporary priority used for iterative calculation of the ith nonlinear programming problem, T in is the minimum time interval between vehicles passing the same potential conflict point, p * (j) is p * The jth value of For vehicle n m Arrive at A potential conflict point. For vehicle n m The current speed of the vehicle, For vehicle n m Distance The distance between potential conflict points, C(n m ) is vehicle n m The number of potential conflict points involved, N m is the number of vehicles, ε is the judgment threshold, set to 0~0.1, N c is the number of potential conflict points.

8. A reference vehicle speed planning method for a multi-vehicle coordinated driving priority planning method according to any one of claims 1 to 7, characterized in that: The following steps are involved: Based on the optimal vehicle traffic priority, the vehicle right of way ranking under multi-vehicle coordination is solved; According to the vehicle right-of-way ranking, a vehicle position constraint is constructed, and the vehicle real-time reference speed is iteratively solved according to the vehicle position constraint.

9. The reference vehicle speed planning method according to claim 8, characterized in that: The step of obtaining the vehicle right of way ranking under multi-vehicle coordination includes: According to the optimal vehicle passage priority, a vehicle local priority pair is obtained; Based on the local priority pairs of the vehicles, the vehicle right-of-way ranking under multi-vehicle coordination is obtained: In the formula, I h Sort the right of way for vehicles, For vehicles with right of way ranking in m, is a symbol indicating the size of the right of way. express Higher than 10. The reference vehicle speed planning method according to claim 8, characterized in that: The step of obtaining the real-time reference speed of the vehicle comprises: According to the vehicle right of way ranking, the time when the vehicle arrives at the potential conflict point is obtained, and the vehicle position constraint is constructed. The vehicle position constraint is: If * (2n+l-2)∈[t cur +(k-1)Δt,t cur +kΔt] Among them, the vehicle position and vehicle speed obey the vehicle second-order longitudinal dynamics model: In the formula, For vehicles with right of way ranking in m, and For vehicle i m The current position and the position at k moments in the future, For vehicle i m The distance to the nth potential conflict point, t * (2n+l-2) is the time when the vehicle arrives at the potential conflict point, t cur is the current time, For vehicle i m The speed at k moments in the future, For vehicle i m The acceleration at time k in the future, Δt is the control time interval; According to the vehicle position constraint, the vehicle speed planning problem is constructed and solved to obtain the optimal driving acceleration of the vehicle in the predicted time domain. The expression of the optimal driving acceleration is: If * (2n+l-2)∈[t cur +(k-1)Δt,t cur +kΔt] in is the optimization objective function of the vehicle, and its expression is: In the formula, Predict the optimal driving acceleration for the vehicle in the time domain, For vehicle i m The optimization objective function, a min 、a max 、v min 、v max For vehicle i m The minimum acceleration, maximum acceleration, minimum speed and maximum speed of the vehicle, δ is the prediction time domain, For the kth moment in the future Vehicle m The overlap area with the vertical projection area of ​​vehicle n, To predict the time domain terminal vehicle i m location, For vehicle i m Distance to vehicle n, d min is the minimum distance set, ω f With ω p are the control weights of energy consumption and safety respectively, τ is the set vehicle distance keeping relaxation parameter, Vehicle energy consumption, M v and A f is the vehicle mass and the frontal area, ρ air is the air density, C d and C R are the air resistance coefficient and wheel friction coefficient, g is the acceleration of gravity, and θ is the road slope; According to the optimal driving acceleration, the vehicle real-time reference speed is solved using the vehicle second-order longitudinal dynamics model.

Citation Information

Cited By

  • Multi-vehicle unmanned transportation collaborative planning method and system in closed scene

    CN120669695A

  • Method for planning game strategy for vehicles interacting at intersection, and related apparatus

    WO2026194237A1