Collaborative lane change control method for intercommunication interleaving area of express way based on bidirectional search

Through the two-way search method, the lane change control of the interchange area of ​​the expressway interchange area is optimized, which solves the problem of insufficient utilization of vehicle time and space resources, improves the traffic efficiency and safety of the interchange area, and improves the utilization rate of space and space resources.

CN118942253AActive Publication Date: 2024-11-12NANJING FORESTRY UNIV
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
CN202411233203.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2024-09-04
Publication Date
2024-11-12
Estimated Expiration
2044-09-04

AI Technical Summary

Technical Problem

The efficiency and safety of vehicle lane change in the interleaved area are limited by insufficient utilization of vehicle time and space resources, which leads to challenges in improving the overall safety and efficiency of the expressway network.

Method used

Using the coordinated lane change control method of fast-track interchange interchange zone based on two-way search, the cost model is selected and the cost function to minimize speed fluctuations is determined, and the lane change point with the safe lane change period and the most stable speed is generated, and the vehicle is generated. Track data to optimize the lane-change process.

Benefits of technology

It improves the traffic efficiency and safety of the interlaced areas, can better cope with the uncertain upstream lane change demand, and improves the utilization rate of space-time resources under high lane change ratio and high traffic load.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118942253A_ABST
    Figure CN118942253A_ABST
Patent Text Reader

Abstract

The invention belongs to the technical field of intelligent network connection vehicle cooperative control, and particularly relates to an expressway intercommunication interleaving area cooperative lane change control method based on bidirectional search, which comprises the following steps: constructing a lane change feasible time period selection cost model based on bidirectional search in combination with space-time conditions, and obtaining a lane change feasible time period when a target vehicle safely merges into a target lane; a cost function for minimizing speed fluctuation in the lane changing process is constructed, and a lane changing point position with the most stable speed is obtained; according to the method, the defects in the prior art are overcome, the lane changing points are concentrated in the middle and the downstream of the interleaving area, the passing efficiency of the interleaving area can be brought into play, the uncertain lane changing requirement of the upstream can be better met, and the traffic efficiency of the interleaving area is improved. Under the conditions of high lane change proportion and high traffic load, the utilization rate of space-time resources in the upstream area of the control area can be improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention belongs to the technical field of cooperative control of intelligent connected vehicles, and specifically relates to a cooperative lane changing control method in an expressway interchange area based on bidirectional search. Background Art

[0002] Weaving areas are a key component of urban expressway networks and play an important role in guiding and directing vehicles entering and leaving expressway ramps. However, the lack of coordinated lane changing behavior between vehicles has become a major bottleneck restricting the overall safety and efficiency improvement of the expressway network.

[0003] The efficiency and safety of vehicle lane changes in weaving areas fundamentally depend on how vehicles utilize the limited space-time resources in this area. Therefore, interchange weaving areas on expressways involving mixed incoming and outgoing traffic flows face greater challenges in traffic management and control.

[0004] In order to provide a better strategy for vehicle lane changing in the expressway interchange weaving area, a cooperative lane changing control method for intelligent connected vehicles in the expressway interchange weaving area based on two-way search was proposed, which provided a new control idea for improving the operating efficiency and safety of the weaving area. Summary of the invention

[0005] The purpose of the present invention is to provide a coordinated lane changing control method in an expressway interchange weaving area based on bidirectional search, which overcomes the shortcomings of the prior art, is beneficial to the traffic efficiency of the weaving area, and can better cope with the uncertain lane changing needs upstream.

[0006] To solve the above problems, the technical solutions adopted by the present invention are as follows:

[0007] The method for coordinated lane change control in an expressway interchange weaving area based on bidirectional search comprises the following steps:

[0008] Step 1: Based on the bidirectional search and the spatiotemporal conditions, a lane-changing feasible time period selection cost model is constructed to obtain the lane-changing feasible time period for the target vehicle to safely merge into the target lane;

[0009] Step 2: within the lane-changing feasible period obtained in step 1, construct a cost function that minimizes speed fluctuations during the lane-changing process to obtain the lane-changing point position with the most stable speed;

[0010] Step 3: Perform speed control according to the lane change point position obtained in step 2 to obtain complete vehicle trajectory data of the target vehicle at the corresponding position at each moment.

[0011] Furthermore, the construction of the lane-changing feasible time period selection cost model in step 1 specifically includes the following steps:

[0012] Step 11: Start point search

[0013] The time starts from when the target vehicle c triggers the control zone boundary t0, and the search time is recorded as t f , the distance searched within the search time is x f , whose expression is:

[0014] x f =min[ vref,c ·t f , x n -d safe , x bondary ]

[0015] Where: v ref,c is the expected speed of the target vehicle, x n is the position of the vehicle in front of the target vehicle, d safe is the safety distance, x bondary The boundary where the control zone ends;

[0016] Step 12: End point search

[0017] The vehicles p that will successively pass the end point of the target lane in the weaving area in the future are judged cyclically, and finally the vehicles p that can satisfy the target vehicle in time and space to change lanes in front of them at the right time and finally pass the end point of the target lane are selected;

[0018] Step 13: Time condition judgment

[0019] For the currently searched vehicle, determine whether there is a feasible time period for the target vehicle to safely change lanes to the front of the vehicle under the constraints of its own driving speed and the vehicle in front of the current lane. If yes, proceed to step 14, otherwise return to step 13;

[0020] Step 14: Determine spatial conditions

[0021] Determine whether the target lane has sufficient space to support the target vehicle to merge in the feasible time period, if yes, proceed to step 15, otherwise return to step 13;

[0022] Step 15: Lane change feasible period

[0023] The feasible period for lane change is the period that satisfies both time and space conditions. as ,

[0024] t as =t a ∩t s ;

[0025] Step 16: Construct a cost model for selecting a feasible lane-changing period

[0026] The function expression for constructing the lane-changing feasible period selection cost model is:

[0027]

[0028] Where: g(n) is the choice cost of the feasible time period for lane change, t a ,t s ,t as are respectively the feasible time period, the feasible space period, and the feasible lane-changing period, t f is the time of starting point search, x f is the distance from the starting point to search, x b is the distance to search for the end point, t p(m-1) For vehicle p m-1 The time to pass the end of the target lane, v c is the speed of the target vehicle c, v pm For vehicle p m speed.

[0029] Further, the endpoint search in step 12 includes the following steps:

[0030] Step 121: Starting from the target vehicle triggering control area, vehicles p that will successively pass through the end of the target lane in the weaving area in the future are marked as p1, p2, ..., p m-1 、p m 、p m+1 …p b , starting from t0, the time for each vehicle to pass the end of the target lane is recorded as t p1 ,t p2 …t p(m-1) ,t pm …t pb ;

[0031] Step 122: From vehicle p b Start searching and analyzing vehicle p b During the driving time before passing the end of the target lane, is it possible for the target vehicle to change lanes to the front and finally pass through the weaving area? b If it is feasible before, the feasible lane change period is formed by analysis; if the target vehicle changes lanes to vehicle p b If it is not feasible before, then continue to b-1 Perform judgment analysis until a feasible lane change period is found or all vehicles p are traversed;

[0032] Step 123: If the target vehicle passes the destination point m-1 If the car is swapped out before, the end point search can search for a distance of x b , whose expression is:

[0033] x b =min[v reyf,m-1 ·tp(m-1) , x m +d safe , x0]

[0034] Where: v ref,m-1 For vehicle p m-1 The expected speed, x m is the target lane vehicle p m The position of , x0 is the boundary where the control area starts;

[0035] If it is not feasible for the target vehicle to change lanes before all vehicles p, the target vehicle will follow p1 and pass the end of the target lane in the future.

[0036] Further, the time condition determination in step 13 includes the following steps:

[0037] Step 131: Determine the target vehicle position x c With vehicle p m-1 Position x p(m-1) The position relationship between [t0,t p(m-1) ] period, the target vehicle position is always smaller than the vehicle p m-1 position, then there is no solution for the lane change period, and the next car p m-2 Time condition judgment, if within this period, there is a moment when the target vehicle position is exactly equal to vehicle p m-1 position, then record this time as t cross , there is a feasible solution during the lane-changing period;

[0038] Step 132: Determine whether cross ,t p(m-1) ]The target vehicle position x during the period c With vehicle p m Position x pm If the target vehicle position is always smaller than the vehicle p during this period, m Position, then the feasible time period t a =[t cross ,t p(m-1) ]; if there is a moment in this period when the target vehicle position is exactly equal to the vehicle pm position, then this moment is recorded as t over , then the feasible time period t a =[t cross ,t over ].

[0039] Furthermore, the spatial condition determination in step 14 includes the following steps:

[0040] Step 141: Determine the speed of the target vehicle c and the target lane vehicle p. m The magnitude relationship of the speed;

[0041] Step 142: When the speed of the target vehicle is less than the speed of the target lane vehicle p m The speed of the target vehicle c and the target lane vehicle p m The distance between them keeps increasing. If there is a moment when the target vehicle c exceeds the vehicle p, m When the distance between the two is a safe distance, record the time as t s1 , and there exists a moment when the target vehicle c and vehicle p m-1 When the distance between them is the safe distance, record the time as t s2 , then the feasible time period t that satisfies the spatial condition s =[t s1 ,t s2 ];

[0042] Step 143: When the speed of the target vehicle is greater than or equal to the target lane vehicle p m The speed of the target vehicle c and the target lane vehicle p m The distance between them is shrinking, and the feasible time period t that meets the spatial conditions s =[t s1 ,t p(m-1) ], the expression of the feasible period of spatial conditions is:

[0043]

[0044] Where: v c (t) is the speed of the target vehicle c changing with time, v pm (t) is vehicle p m The speed of change over time.

[0045] Further, the lane change point position with the most stable speed is obtained in step 2, and the specific method is as follows:

[0046] In the feasible period of lane change, a lane change point selection cost function is constructed to characterize the stability of the target vehicle's speed in the feasible period of lane change. Combined with the average speed of the target vehicle from the starting point to the lane change point and the average speed from the lane change point to the end point, the goal is to minimize the lane change point selection cost. The point with relatively stable speed before and after is selected as the lane change point of the target vehicle to reduce the volatility of the speed of the target vehicle during operation. The expression of the minimized lane change point function is:

[0047]

[0048] Where: p(n) represents the cost of selecting the lane change point, They respectively represent the average speed of the target vehicle from the starting point to the lane changing point and the average speed of the target vehicle from the lane changing point to the end point.

[0049] Further, the step 3 of obtaining the complete vehicle trajectory data of the target vehicle at the corresponding position at each moment includes the following steps:

[0050] Step 31: Plan a trajectory from the generated position to the lane-changing point for the target vehicle. The target vehicle obtains an initial velocity at the generated position, and the position and time at which the target vehicle reaches the lane-changing point are fixed. Then, the velocity (V g ) is the average speed of the target vehicle from the starting point to the lane change point and from the lane change point to the end point;

[0051] Under ideal conditions, the target vehicle changes speed from the initial velocity to V g If there is a vehicle in front of the target vehicle, the target vehicle cannot move at a uniform speed due to the restriction of the vehicle in front. The target vehicle maintains a safe distance from the vehicle in front and takes the minimum speed variance as the goal until the speed reaches V g , the speed variance formula is:

[0052]

[0053] Where: v ref,c is the expected speed of the target vehicle, v i is the speed of the target vehicle at time t;

[0054] Step 32: planning the trajectory of the target vehicle from the lane change point to the target lane end point. Since the lane change point and the end point of the target vehicle are fixed, the target vehicle is located in an ideal environment by V g After reaching the desired speed with uniform speed change, maintain the uniform speed; if there is a car in front of the target vehicle, the target vehicle is restricted by the front vehicle and the speed is V g Perform uniform speed change until the speed is consistent with that of the vehicle in front, and keep a certain safe distance from the vehicle in front and follow it to the end point.

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

[0056] The method for coordinated lane changing control in the interweaving area of ​​an expressway interchange based on bidirectional search described in the present invention plans the trajectory from the vehicle generation position to the terminal position by determining the feasible time period for lane changing and the position of the lane changing point with the most stable speed, and concentrates the lane changing points in the middle and downstream of the interweaving area, which is beneficial to the traffic efficiency of the interweaving area and can better cope with the uncertain lane changing demands upstream. Under the conditions of high lane changing ratio and high traffic load, the utilization rate of space-time resources in the upstream area of ​​the control area can be improved. BRIEF DESCRIPTION OF THE DRAWINGS

[0057] Figure 1 This is a framework diagram of the cooperative lane changing control in the weaving area of ​​the expressway interchange weaving area based on bidirectional search.

[0058] Figure 2 It is a flowchart of the two-way search in the control area of ​​the coordinated lane-changing control method in the expressway interchange area based on two-way search and a schematic diagram of the two-way search during the lane-changing period.

[0059] Figure 3 This is a bubble diagram showing the distribution of lane change points between two adjacent lanes on the main and auxiliary roads in the coordinated lane change control method in the expressway interchange area based on bidirectional search.

[0060] Figure 4 This is a heat map of the spatiotemporal utilization of two adjacent lanes on the main and auxiliary roads in the coordinated lane-changing control method in the expressway interchange area based on bidirectional search. DETAILED DESCRIPTION

[0061] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0062] In summary, the method for controlling coordinated lane change in an expressway interchange area based on bidirectional search according to the present invention comprises the following steps:

[0063] Step 1: In the context of intelligent networking and autonomous driving, the coordinated control framework of the weaving area is as follows: Figure 1 As shown, the upper part is the main road and the lower part is the auxiliary road, which are interconnected, and the length of the interconnected interweaving area is 120m.

[0064] The collaborative lane-changing control in the interchange area will use the roadside auxiliary computing unit as the control center, relying on intelligent roadside information collection equipment and on-board equipment to obtain accurate full-time and space traffic information in the collaborative control area. After processing and collaborative decision-making by the control center, a precise control plan for the intelligent connected vehicle is formed.

[0065] The second step is to construct the selection cost of the lane-changing feasible time period based on the two-way search combined with the time and space conditions to obtain the lane-changing feasible time period in which the target vehicle can safely merge into the target lane. Figure 2 Schematic diagram of bidirectional search during lane change period.

[0066] (1) Starting point search: The starting point search starts from the time when the target vehicle c triggers the control zone boundary t0, and the search time is recorded as t f , the distance searched within the search time is x f , whose expression is:

[0067] x f =min[v ref,c ·t f , xn -d safe , x bondary ]

[0068] Where: v ref,c is the expected speed of the target vehicle, x n is the position of the vehicle in front of the target vehicle, d safe is the safety distance, x bondary The boundary where the control zone ends.

[0069] (2) End point search: The vehicles that will successively pass the end point of the target lane in the weaving area are cyclically judged, and the vehicles p that can satisfy the time and space requirements of the target vehicle to change lanes in front of them and finally pass the end point of the target lane are finally selected.

[0070] The specific steps include:

[0071] Starting from the target vehicle triggering the control area, the vehicles p that will successively pass through the end of the target lane in the weaving area in the future are marked as p1, p2…p m-1 、p m 、p m+1 …p b , starting from t0, the time for each vehicle to pass the end of the target lane is recorded as t p1 ,t p2 …t p(m-1) ,t pm …t pb ;

[0072] The vehicle p that will pass through the end of the target lane in the weaving area in the future is judged cyclically. b Start searching and analyzing vehicle p b Whether the target vehicle is likely to change lanes to the front of it and eventually pass through the weaving area during the driving time before passing the end of the target lane;

[0073] If the target vehicle changes lanes to vehicle p b If it is feasible before, the feasible lane change period is formed by analysis; if the target vehicle changes lanes to vehicle p b If it is not feasible before, then continue to b-1 Perform judgment analysis until a feasible lane change period is found or all vehicles p are searched;

[0074] If the target vehicle passes the end point at p m-1 If the car is swapped out before, the distance that can be searched in reverse search is x b , whose expression is:

[0075] x b =min[v ref,m-1 ·t p(m-1) , xm +d safe , x0]

[0076] Where: v ref,m-1 For vehicle p m-1 The expected speed, x m is the target lane vehicle p m The position of , x0 is the boundary where the control area starts;

[0077] If it is not feasible for the target vehicle to change lanes before all vehicles p, the target vehicle will follow p1 and pass the end of the target lane in the future.

[0078] (3) Time condition judgment: for the currently searched vehicle, determine whether there is a feasible time period for the target vehicle to safely change lanes to the front of the vehicle under the constraints of its own driving speed and the vehicle in front of the current lane.

[0079] The specific steps include:

[0080] The bidirectional search method for time condition judgment is as follows Figure 2 As shown. First, determine the target vehicle position x c With vehicle p m-1 Position x p(m-1) The position relationship between [t0,t p(m-1) ] period, the target vehicle position is always smaller than the vehicle p m-1 position, then there is no solution for the lane change period, and the next car p m-2 If there is a time in this period when the target vehicle position is exactly equal to vehicle p m-1 position, then record this time as t cross , there is a feasible solution during the lane-changing period, and in [t cross ,t p(m-1) ] period to further judge the feasible solution.

[0081] Combined with cross ,t p(m-1) ] period, determine the target vehicle position x within this period c With vehicle p m Position x pm 1. If during this period, the target vehicle position is always smaller than the vehicle p m Position, then the feasible time period t a =[t cross ,t p(m-1) ] 2. If within this period, there is a moment when the target vehicle position is exactly equal to vehicle p m position, then record this time as t over , then the feasible time period t a =[tcross ,t over ].

[0082] (4) Spatial condition judgment: determine whether the target lane has sufficient spatial conditions to support the target vehicle merging in within the feasible time period.

[0083] The spatial position of the vehicle mainly changes with time and is closely related to the speed of the vehicle. m The speed relationship of the target vehicle can be divided into two cases: Case 1: When the speed of the target vehicle is less than the speed of the target lane vehicle p m The speed of the target vehicle c and the target lane vehicle p m The distance between them keeps increasing. If there is a moment when the target vehicle c exceeds the vehicle p m When the distance between the two is a safe distance, record the time as t s1 , and there exists a moment when the target vehicle c and vehicle p m-1 When the distance between them is the safe distance, record the time as t s2 , then the feasible time period t that satisfies the spatial condition s =[t s1 ,t s2 ]. Case 2: When the speed of the target vehicle is greater than or equal to the target lane vehicle p m The speed of the target vehicle c and the target lane vehicle p m The distance between them is shrinking, and the feasible time period t that meets the spatial conditions s =[t s1 ,t p(m-1) ], the expression of the feasible period of spatial conditions is:

[0084]

[0085] Where: v c (t) is the speed of the target vehicle c changing with time, v pm (t) is vehicle p m The speed of change over time.

[0086] (5) The feasible lane-changing period is the period that satisfies both the time and space conditions. as ,

[0087] t as =t a ∩t s .

[0088] (6) Perform a cyclic judgment on all lane-changing vehicles, treat each lane-changing vehicle as a target vehicle, and repeat operations (1) to (5) to obtain a feasible lane-changing period in which each lane-changing vehicle can safely merge into the target lane.

[0089] Step 3: During the target vehicle’s lane-changing feasible period, a cost function is constructed to minimize the speed fluctuation during the lane-changing process and select the lane-changing point with the most stable speed.

[0090] In the lane-changing feasible period obtained in the second step, a lane-changing point selection cost function is constructed to characterize the speed stability of the target vehicle in the lane-changing feasible period. The average speed of the target vehicle from the starting point to the lane-changing point and the average speed from the lane-changing point to the end point are combined to minimize the lane-changing point selection cost. The point with relatively stable speed before and after is selected as the lane-changing point of the target vehicle to reduce the speed volatility of the target vehicle during operation. The lane-changing point selection function expression is:

[0091]

[0092] Where: p(n) represents the cost of selecting the lane change point, They respectively represent the average speed of the target vehicle from the starting point to the lane changing point and the average speed of the target vehicle from the lane changing point to the end point.

[0093] The fourth step is to control the speed according to the lane-changing point position of the target vehicle to obtain the complete vehicle trajectory data of the target vehicle at the corresponding position at each moment.

[0094] The specific steps include:

[0095] (1) Vehicle trajectory planning is to maximize the speed of each step under the condition of time discretization. The kinematic formula is introduced and the speed and acceleration of the target vehicle are restricted. The specific model is as follows:

[0096]

[0097] 0≤v c <v max

[0098] a min ≤a c <a max

[0099] x n -x c >d safe t=1,2…T-1

[0100] x m -x c >d safe t=1,2…T-1

[0101] x n -x c =v c Δt t=1,2…T-1

[0102] v n -v c =a c Δt t=1,2…T-1

[0103] In the formula, v n 、v c are the speeds of the vehicle in front of the target vehicle in the current lane and the target vehicle at time t; a c is the acceleration of the target vehicle; a min 、a max are the minimum acceleration and the maximum acceleration respectively; x n 、x m 、x c are the positions of the vehicle in front of the target vehicle in the current lane, the vehicle in front of the target lane, and the target vehicle at time t; d safe is the safety distance; Δt is the step length.

[0104] (2) Trajectory planning from the target vehicle generation position to the lane change point. The target vehicle obtains its initial velocity at the generation position, and the position and time at which the target vehicle reaches the lane change point are fixed. Then the velocity of the target vehicle at the lane change point (V g ) is the average speed of the target vehicle from the starting point to the lane changing point and from the lane changing point to the end point.

[0105] Under ideal conditions, the target vehicle changes speed from the initial velocity to V g If there is a car in front of the target vehicle, the target vehicle cannot move at a constant speed due to the restriction of the front vehicle. The target vehicle maintains a safe distance from the front vehicle and takes the minimum speed variance as the goal until the speed reaches V g The speed variance formula is:

[0106]

[0107] Where: v ref,c is the expected speed of the target vehicle, v i is the speed of the target vehicle at time t.

[0108] (3) The trajectory planning of the target vehicle from the lane change point to the target lane end point. Since the lane change point and the end point of the target vehicle are fixed, the target vehicle is located in an ideal environment by V g After reaching the desired speed with uniform speed change, maintain the uniform speed. If there is a car in front of the target vehicle, the target vehicle is restricted by the front vehicle and the speed is V g Perform uniform speed change until the speed is consistent with that of the vehicle in front, and keep a certain safe distance from the vehicle in front and follow it to the end point.

[0109] The fifth step is to construct a cellular automation simulation model to explore the impact of different lane change ratios under differentiated traffic loads on the two adjacent lanes of the main and auxiliary roads in the interchange area of ​​the urban expressway.

[0110] (1) Construct a cellular automaton simulation model, including simulation environment configuration;

[0111] The specific steps include:

[0112] Based on the actual road conditions, a 150m main and auxiliary adjacent one-way two-lane road is created, of which 30m to 150m is the intercommunication and weaving area, which is also the control range of the coordinated control area. Each vehicle occupies a space of 2.5×6㎡, and the initial speed of the vehicle is controlled at [20, 60] (km·h -1 ), the time step is set to 0.1s, and vehicles are generated according to the Poisson distribution.

[0113] The average value of the vehicle operation meets the expected speed of the type, and the maximum speed and maximum acceleration are added as the speed limit of the vehicle simulation operation. The maximum acceleration of the vehicle is set to 5m·s -2 In order to be close to the actual traffic flow composition, the speed type of the vehicle is divided into aggressive, neutral and conservative according to the driver's driving style. The different speed types of the intelligent connected vehicle correspond to the vertical coordinate axis selected by the driver when driving in the weaving area, and the distribution bubble diagram of the lane change points of the adjacent two lanes of the main and auxiliary roads is drawn as shown in the figure. Figure 3 As shown in the figure, the size of the bubble reflects the concentration of lane-changing points in the weaving area. From the figure, we can find that: ① For the longitudinal section with the same lane-changing ratio, as the traffic load increases, the distribution of lane-changing points of the two adjacent lanes of the main and auxiliary roads gradually shifts from the downstream of the control area to the upstream; ② For the cross-section with the same traffic load, as the lane-changing ratio increases, the distribution of lane-changing points of the two adjacent lanes of the main and auxiliary roads also gradually shifts to the upstream of the control area.

[0114] The time-space utilization rate is defined as the ratio of the time a vehicle runs on the road to the total length of the statistical period. This indicator can reflect the occupancy of road space. The calculation formula is as follows:

[0115]

[0116] Where: j represents the lane; α j represents the time-space occupancy of the vehicle to the corresponding position; n represents the number of vehicles passing through position j; x j (i) represents the time that the i-th vehicle occupies the position, and y represents the total length of the statistical period.

[0117] According to the distribution of lane change points between two adjacent lanes of the main and auxiliary roads, draw Figure 4The heat map of time-space utilization of two adjacent lanes of the main and auxiliary roads is shown (a is the main road, b is the auxiliary road). The horizontal axis represents the position of the vehicle in the weaving area, and the vertical axis represents the increasing lane change ratio from bottom to top. The color of the color block in the heat map represents the time-space utilization of the area. Figure 4 It can be seen that the distribution law of time and space utilization of the two lanes of the main and auxiliary roads in each section of the coordinated control area of ​​the weaving area is basically the same. With the increase of the lane change ratio, the time and space utilization of the upstream section in the control area gradually increases.

[0118] It will be apparent to those skilled in the art that the invention is not limited to the details of the exemplary embodiments described above and that the invention can be implemented in other specific forms without departing from the spirit or essential features of the invention. Therefore, the embodiments should be considered exemplary and non-limiting in all respects, and the scope of the invention is defined by the appended claims rather than the foregoing description, and it is intended that all variations falling within the meaning and scope of the equivalent elements of the claims be included in the invention. Any reference numeral in a claim should not be considered as limiting the claim to which it relates.

Claims

1. A coordinated lane-changing control method for expressway interchange areas based on bidirectional search, Features: The following steps are involved: Step 1: Based on the bidirectional search and the spatiotemporal conditions, a lane-changing feasible time period selection cost model is constructed to obtain the lane-changing feasible time period for the target vehicle to safely merge into the target lane; Step 2: within the lane-changing feasible period obtained in step 1, construct a cost function that minimizes speed fluctuations during the lane-changing process to obtain the lane-changing point position with the most stable speed; Step 3: Perform speed control according to the lane change point position obtained in step 2 to obtain complete vehicle trajectory data of the target vehicle at the corresponding position at each moment.

2. The coordinated lane-changing control method for expressway interchange area based on bidirectional search according to claim 1, Features: The construction of the lane-changing feasible time period selection cost model described in step 1 specifically includes the following steps: Step 11: Start point search Triggering the control zone boundary t from the target vehicle c 0 Start timing and record the search time as t f , the distance searched within the search time is x f , whose expression is: x f =min[v ref,c ·t f ,x n -d safe ,x bondary ] Where: v ref,c is the expected speed of the target vehicle, x n is the position of the vehicle in front of the target vehicle, d safe is the safety distance, x bondary The boundary where the control zone ends; Step 12: End point search The vehicles p that will successively pass the end point of the target lane in the weaving area in the future are judged cyclically, and finally the vehicles p that can satisfy the target vehicle in time and space to change lanes in front of them at the right time and finally pass the end point of the target lane are selected; Step 13: Time condition judgment For the currently searched vehicle, determine whether there is a feasible time period for the target vehicle to safely change lanes to the front of the vehicle under the constraints of its own driving speed and the vehicle in front of the current lane. If yes, proceed to step 14, otherwise return to step 13; Step 14: Determine spatial conditions Determine whether the target lane has sufficient space to support the target vehicle to merge in the feasible time period, if yes, proceed to step 15, otherwise return to step 13; Step 15: Lane change feasible period The feasible period for lane change is the period that satisfies both time and space conditions. as , t as =t a ∩t s ; Step 16: Construct a cost model for selecting a feasible lane-changing period The function expression for constructing the lane-changing feasible period selection cost model is: Where: g(n) is the choice cost of the feasible time period for lane change, t a ,t s ,t as are respectively the feasible time period, the feasible space period, and the feasible lane-changing period, t f is the time of starting point search, x f is the distance from the starting point to search, x b is the distance to search for the end point, t p(m-1) For vehicle p m-1 The time to pass the end of the target lane, v c is the speed of the target vehicle c, v pm For vehicle p m speed.

3. The method for controlling the coordinated lane change in the expressway interchange area based on bidirectional search according to claim 2, Features: The end point search in step 12 includes the following steps: Step 121: Starting from the target vehicle triggering the control area, vehicles p that will successively pass through the end of the target lane in the weaving area in the future are marked as p 1 、p 2 …p m-1 、p m 、p m+1 …p b , from t 0 Start timing, and the time for each vehicle to pass the end of the target lane is recorded as t p1 ,t p2 …t p(m-1) ,t pm …t pb ; Step 122: From vehicle p b Start searching and analyzing vehicle p b During the driving time before passing the end of the target lane, is it possible for the target vehicle to change lanes to the front and finally pass through the weaving area? b If it is feasible before, the feasible lane change period is formed by analysis; if the target vehicle changes lanes to vehicle p b If it is not feasible before, then continue to b-1 Perform judgment analysis until a feasible lane change period is found or all vehicles p are traversed; Step 123: If the target vehicle passes the destination point m-1 If the car is swapped out before, the end point search can search for a distance of x b , whose expression is: x b =min[v ref,m-1 ·t p(m-1) ,x m +d safe ,x 0 ] Where: v ref,m-1 For vehicle p m-1 The expected speed, x m is the target lane vehicle p m The position of x 0 is the boundary where the control zone begins; If it is not feasible for the target vehicle to change lanes before all vehicles p, then the target vehicle will follow p in the future. 1 Then pass the end of the target lane.

4. The method for controlling the coordinated lane change in the expressway interchange area based on bidirectional search according to claim 2, Features: The time condition determination in step 13 includes the following steps: Step 131: Determine the target vehicle position x c With vehicle p m-1 Position x p(m-1) The position relationship, if [t 0 ,t p(m-1) ] period, the target vehicle position is always smaller than the vehicle p m-1 position, then there is no solution for the lane change period, and the next car p m-2 Time condition judgment, if within this period, there is a moment when the target vehicle position is exactly equal to vehicle p m-1 position, then record this time as t cross , there is a feasible solution during the lane-changing period; Step 132: Determine whether cross ,t p(m-1) ]The target vehicle position x during the period c With vehicle p m Position x pm If the target vehicle position is always smaller than the vehicle p during this period, m Position, then the feasible time period is t a =[t cross ,t p(m-1) ]; if within this period, there is a moment when the target vehicle position is exactly equal to vehicle p m position, then record this time as t over , then the feasible time period t a =[t cross ,t over ].

5. The method for controlling the coordinated lane change in the expressway interchange area based on bidirectional search according to claim 2, Features: The spatial condition determination in step 14 includes the following steps: Step 141: Determine the speed of the target vehicle c and the target lane vehicle p. m The magnitude relationship of the speed; Step 142: When the speed of the target vehicle is less than the speed of the target lane vehicle p m The speed of the target vehicle c and the target lane vehicle p m The distance between them keeps increasing. If there is a moment when the target vehicle c exceeds the vehicle p, m When the distance between the two is a safe distance, record the time as t s1 , and there exists a moment when the target vehicle c and vehicle p m-1 When the distance between them is the safe distance, record the time as t s2 , then the feasible time period t that satisfies the spatial condition s =[t s1 ,t s2 ]; Step 143: When the speed of the target vehicle is greater than or equal to the target lane vehicle p m The speed of the target vehicle c and the target lane vehicle p m The distance between them is shrinking, and the feasible time period t that meets the spatial conditions s =[t s1 ,t p(m-1) ], the expression of the feasible period of spatial conditions is: Where: v c (t) is the speed of the target vehicle c changing with time, v pm (t) is vehicle p m The speed of change over time.

6. The method for controlling the coordinated lane change in the expressway interchange area based on bidirectional search according to claim 1, Features: The specific method for obtaining the lane change point position with the most stable speed in step 2 is as follows: In the feasible period of lane change, a lane change point selection cost function is constructed to characterize the stability of the target vehicle's speed in the feasible period of lane change. Combined with the average speed of the target vehicle from the starting point to the lane change point and the average speed from the lane change point to the end point, the goal is to minimize the lane change point selection cost. The point with relatively stable speed before and after is selected as the lane change point of the target vehicle to reduce the volatility of the speed of the target vehicle during operation. The expression of the minimized lane change point function is: Where: p(n) represents the cost of selecting the lane change point, They respectively represent the average speed of the target vehicle from the starting point to the lane changing point and the average speed of the target vehicle from the lane changing point to the end point.

7. The method for controlling the coordinated lane change in the expressway interchange area based on bidirectional search according to claim 1, Features: The step 3 described in which the complete vehicle trajectory data of the target vehicle at the corresponding position at each moment is obtained includes the following steps: Step 31: Plan a trajectory from the generated position to the lane-changing point for the target vehicle. The target vehicle obtains an initial velocity at the generated position, and the position and time at which the target vehicle reaches the lane-changing point are fixed. Then, the velocity (V g ) is the average speed of the target vehicle from the starting point to the lane change point and from the lane change point to the end point; Under ideal conditions, the target vehicle reaches V at a uniform speed from its initial speed. g If there is a vehicle in front of the target vehicle, the target vehicle cannot move at a uniform speed due to the restriction of the vehicle in front. The target vehicle maintains a safe distance from the vehicle in front and takes the minimum speed variance as the goal until the speed reaches V g , the speed variance formula is: Where: v ref,c is the expected speed of the target vehicle, v i is the speed of the target vehicle at time t; Step 32: planning the trajectory of the target vehicle from the lane change point to the target lane end point. Since the lane change point and the end point of the target vehicle are fixed, the target vehicle is located by V g After reaching the desired speed with uniform speed change, maintain the uniform speed; if there is a car in front of the target vehicle, the target vehicle is restricted by the front vehicle and the speed is V g Perform uniform speed change until the speed is consistent with that of the vehicle in front, and keep a certain safe distance from the vehicle in front and follow it to the end.

Citation Information

Patent Citations

  • Intelligent connected vehicle cooperative lane changing and queue entering control method

    CN108447266A

  • Multi-vehicle interaction lane changing risk real-time identification method and early warning system based on Internet of Vehicles

    CN117400939A

  • Collaborative lane changing method and system for tunnel accident road section in network connection mixed driving environment

    CN117496761A

  • Automated lane change system and methods

    US20200180634A1