Vehicle ramp coordinated merging method, device and storage medium
By acquiring and updating the planned vehicle queue, the staggered passage time of vehicles on the main road and ramps is determined, which solves the spatiotemporal conflict problem when vehicles merge on ramps, improves traffic efficiency and reduces the risk of collisions.
Patent Information
- Application Number
- CN202411027296.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-30
- Publication Date
- 2024-11-08
- Estimated Expiration
- 2044-07-30
AI Technical Summary
Existing technologies cannot effectively solve the problems of temporal and spatial conflicts and traffic disturbances when vehicles merge on ramps, resulting in low overall traffic efficiency.
By acquiring the planned vehicle queue, the staggered passage time of vehicles on the main road and ramps is determined, and the planned vehicle queue is updated in response to the location information of newly added vehicles. The vehicle passage order is adjusted, and a cooperative inbound method is executed using electronic devices and computer-readable storage media.
It improves vehicle merging efficiency, reduces the risk of vehicle collisions, and enables dynamic adjustments to adapt to rapidly changing traffic demands.
Smart Images

Figure CN118553115B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of traffic planning, and in particular to a vehicle ramp coordinated merging method, device and storage medium. Background Art
[0002] The congestion problem faced by road traffic is becoming increasingly serious, especially at the entrance of ramps and surrounding areas, which often become bottleneck sections of the road due to merging behavior. Considering only macro-control or single-vehicle intelligence cannot fundamentally solve the problem of right-of-way conflicts during merging.
[0003] At present, measures such as diversion induction and traffic light control in merging and diverging areas can be adopted to carry out coordinated dispatch. However, these measures cannot meet the ever-changing traffic operation needs, nor can they fundamentally solve the time and space conflicts and traffic disturbances when vehicles merge into the ramps. There is also the problem of being unable to make dynamic adjustments, which affects the overall traffic efficiency.
[0004] In view of this, the present invention is proposed. Summary of the invention
[0005] In order to solve the above technical problems, the present invention provides a vehicle ramp coordinated merging method, device and storage medium, which achieves the effect of improving vehicle merging efficiency and reducing vehicle collision risk.
[0006] An embodiment of the present invention provides a vehicle ramp coordinated merging method, the method comprising:
[0007] Get the planned vehicle queue;
[0008] Determining, according to the planned vehicle queue, a staggered travel time of each first vehicle in a main road within a planning area and a staggered travel time of each second vehicle in a ramp within the planning area;
[0009] In response to a new vehicle entering the planned area, the planned vehicle queue is updated according to the position information and minimum travel time of the new vehicle, the staggered travel time of each first vehicle in the planned vehicle queue, and the staggered travel time of each second vehicle in the planned vehicle queue.
[0010] An embodiment of the present invention provides an electronic device, the electronic device comprising:
[0011] Processor and memory;
[0012] The processor is used to execute the steps of the vehicle ramp coordinated merging method described in any embodiment by calling the program or instruction stored in the memory.
[0013] An embodiment of the present invention provides a computer-readable storage medium, wherein the computer-readable storage medium stores a program or instruction, wherein the program or instruction enables a computer to execute the steps of the vehicle ramp coordinated merging method described in any embodiment.
[0014] The embodiments of the present invention have the following technical effects: by acquiring a planned vehicle queue, the staggered passage time of each first vehicle in the main road within the planning area and the staggered passage time of each second vehicle in the ramp within the planning area are determined according to the planned vehicle queue; further, in response to the presence of a new vehicle entering the planning area, the planned vehicle queue is updated according to the position information and minimum passage time of the new vehicle, the staggered passage time of each first vehicle in the planned vehicle queue, and the staggered passage time of each second vehicle, so as to timely adjust the planned vehicle queue according to the new vehicle, thereby achieving the effect of improving vehicle merging efficiency and reducing vehicle collision risk. BRIEF DESCRIPTION OF THE DRAWINGS
[0015] Figure 1 is a flow chart of a vehicle ramp coordinated merging method provided by an embodiment of the present invention;
[0016] Figure 2 is a schematic diagram of a planning area, a control area, and a confluence point provided by an embodiment of the present invention;
[0017] Figure 3 is a flow chart of another vehicle ramp coordinated merging method provided by an embodiment of the present invention;
[0018] Figure 4 is a schematic diagram of tracking control provided by an embodiment of the present invention;
[0019] Figure 5 It is a structural schematic diagram of an electronic device provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0020] The vehicle ramp coordinated merging method provided by the embodiment of the present invention is mainly applicable to the situation of reasonable planning when vehicles merge on the main road and the ramp. The vehicle ramp coordinated merging method provided by the embodiment of the present invention can be executed by an electronic device.
[0021] Figure 1 is a flow chart of a vehicle ramp coordinated merging method provided by an embodiment of the present invention. Figure 1 The vehicle ramp coordinated merging method specifically includes:
[0022] S110: Obtain a planned vehicle queue.
[0023] The planned vehicle queue is the vehicle queue obtained after the vehicles on the main road and ramp in the planning area are planned for staggered traffic. The planning area is a pre-set area for planning and dispatching vehicles. There is also a control area between the planning area and the confluence point. The schematic diagram of the planning area, control area and confluence point is shown in the figure. Figure 2 shown.
[0024] Specifically, the planned vehicle queue obtained when a vehicle entered the planning area at the last moment or the last time can be obtained. The planned vehicle queue includes the arrangement order of vehicles on the main road and the ramp traveling to the merging point.
[0025] It can be understood that the vehicle ramp coordinated merging method can obtain a new planned vehicle queue for executing the vehicle ramp coordinated merging method next time.
[0026] S120. Determine, according to the planned vehicle queue, the staggered travel time of each first vehicle in the main road within the planning area and the staggered travel time of each second vehicle in the ramp within the planning area.
[0027] The first vehicles are the vehicles on the main road in the planning area, and the second vehicles are the vehicles on the ramps in the planning area. The staggered travel time is the travel time for the vehicle to travel from the current location to the merging point.
[0028] Specifically, since the order of the planned vehicle queue is arranged according to the staggered travel time of each vehicle, the staggered travel time of each first vehicle and the staggered travel time of each second vehicle can be known. Of course, it can also be calculated according to the position and travel speed of each vehicle in the planned vehicle queue.
[0029] For example, the staggered travel time of the first vehicle in the planned vehicle queue can be obtained by the distance and driving speed between the first vehicle and the merging point; the first vehicle is taken as the current vehicle, and it is determined whether the next vehicle of the current vehicle in the planned vehicle queue is located on the same road (main road or ramp) as the current vehicle; if so, the sum of the staggered travel time of the current vehicle and the preset minimum safety time headway is calculated, and the maximum value of the sum and the minimum travel time of the next vehicle of the current vehicle is used as the staggered travel time of the next vehicle of the current vehicle; if not, the sum of the staggered travel time of the current vehicle and the preset comfortable and safe time headway is calculated, and the maximum value of the sum and the minimum travel time of the next vehicle of the current vehicle is used as the staggered travel time of the next vehicle of the current vehicle; the next vehicle of the current vehicle is taken as the new current vehicle, and the step of determining whether the next vehicle of the current vehicle in the planned vehicle queue is located on the same road (main road or ramp) as the current vehicle is returned, until there is no next vehicle of the current vehicle. Among them, the preset minimum safety time headway is the time interval set to ensure the safety of driving between two adjacent vehicles on the same road. The preset comfortable safety time interval is the time interval set to ensure the comfort of two adjacent vehicles entering the merging point on different roads. The minimum travel time is the minimum time for a vehicle to travel from the current position to the merging point, which can be the sum of the acceleration time and the cruise control time. The acceleration time is the time to accelerate from the current position to the merging point, and the cruise control time is the time to travel at the maximum speed from the current position to the merging point. The minimum travel time can be determined by the following formula:
[0030]
[0031]
[0032]
[0033] in, is the minimum travel time, To speed up the travel time, is the cruise time. is the current speed, is the maximum acceleration, is the speed when driving to the merging point at the maximum acceleration. is the maximum speed, is the distance between the current position and the entry point.
[0034] S130. In response to a new vehicle entering the planned area, the planned vehicle queue is updated according to the location information and minimum travel time of the new vehicle, the staggered travel time of each first vehicle in the planned vehicle queue, and the staggered travel time of each second vehicle in the planned vehicle queue.
[0035] The newly added vehicle is a vehicle that enters the planning area, which can be a vehicle that enters the planning area from the main road or a vehicle that enters the planning area from the ramp. The location information is information about whether there are vehicles on different roads between the newly added vehicle and the last vehicle on the same road as the newly added vehicle, that is, whether the last vehicle in the planned vehicle queue is on the same road as the newly added vehicle, and the number of vehicles on different roads between the newly added vehicle and the last vehicle on the same road as the newly added vehicle.
[0036] Specifically, when a new vehicle is detected entering the planning area, the vehicle is treated as a newly added vehicle, and the road where the newly added vehicle is located is determined, that is, whether it is located on the main road or the ramp, and it is determined whether there are vehicles on different roads between the newly added vehicle and the last vehicle on the same road. If so, the number of vehicles existing is determined, and this information is used as the location information of the newly added vehicle. Further, combined with the location information of the newly added vehicle, the minimum travel time of the newly added vehicle, the staggered travel time of each first vehicle in the planned vehicle queue, and the staggered travel time of each second vehicle, the positions of the newly added vehicle, the last vehicle on the same road with the newly added vehicle, and the vehicles on different roads between the newly added vehicle and the last vehicle on the same road with the newly added vehicle in the planned vehicle queue, as well as the new staggered travel time are planned to update the planned vehicle queue and plan the newly added vehicle into the updated planned vehicle queue.
[0037] Based on the above example, if the newly added vehicle is located on the main road, according to the location information of the newly added vehicle, that is, whether there is a target second vehicle between the newly added vehicle and the target first vehicle and the number of target second vehicles, it can be divided into the following three situations, which can be:
[0038] Case 1: In response to a newly added vehicle being located on the main road and the position information of the newly added vehicle indicating that there is a target second vehicle between the newly added vehicle and the target first vehicle, it is determined whether to update the staggered passage time of the target second vehicle according to the staggered passage time of the target first vehicle, the preset minimum safety time headway, the minimum passage time of the newly added vehicle, and the staggered passage time of the target second vehicle;
[0039] If so, the staggered passage time of the newly added vehicle is determined according to the staggered passage time of the target first vehicle, the preset minimum safe time distance and the minimum passage time of the newly added vehicle, and the staggered passage time of the target second vehicle is updated according to the staggered passage time of the newly added vehicle and the preset comfortable and safe time distance; the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle and the staggered passage time of the target second vehicle; if not, the staggered passage time of the newly added vehicle is determined according to the driving speed of the newly added vehicle and the distance between the newly added vehicle and the merging point, and the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle.
[0040] The target first vehicle is the first vehicle in the planned vehicle queue that is farthest from the merging point. The target second vehicle is the second vehicle that is between the newly added vehicle and the target first vehicle in the distance from the merging point.
[0041] Specifically, if the newly added vehicle is located on the main road, and the location information of the newly added vehicle shows that there is a target second vehicle between the newly added vehicle and the target first vehicle, the newly added vehicle and the target first vehicle can be taken as a whole and replanned with the target second vehicle in terms of staggered travel time. The sum of the staggered travel time of the target first vehicle and the preset minimum safety time distance can be calculated, and then the maximum value of the sum and the minimum travel time of the newly added vehicle is calculated. The maximum value is the overall staggered travel time. If the overall staggered travel time is less than the staggered travel time of the target second vehicle, the staggered travel time of the newly added vehicle needs to be less than the staggered travel time of the target second vehicle. Therefore, the staggered travel time of the target second vehicle needs to be updated. Otherwise, the newly added vehicle can be planned after the target second vehicle, that is, it is determined whether to update the staggered travel time of the target second vehicle. If yes, then find the sum of the staggered passage time of the target first vehicle and the preset minimum safe time headway, and then find the maximum value of the sum and the minimum passage time of the newly added vehicle, and use the maximum value as the staggered passage time of the newly added vehicle, and update the sum of the staggered passage time of the newly added vehicle and the preset comfortable and safe time headway as the staggered passage time of the target second vehicle. Then, update the staggered passage time of the newly added vehicle and the updated staggered passage time of the target second vehicle to the planned vehicle queue, that is, change the staggered passage time of the target second vehicle, and add the staggered passage time of the newly added vehicle to the planned vehicle queue, that is, plan the newly added vehicle after the target first vehicle, and plan the target second vehicle after the newly added vehicle. If no, it means that there is no need to plan the newly added vehicle before the target second vehicle, so the quotient of the distance between the newly added vehicle and the merging point and the driving speed of the newly added vehicle is used as the staggered passage time of the newly added vehicle, and the staggered passage time of the newly added vehicle is updated to the planned vehicle queue, that is, as the last vehicle in the planned vehicle queue.
[0042] Exemplarily, the following formula is used to determine whether to update the staggered passage time of the target second vehicle according to the staggered passage time of the target first vehicle, the preset minimum safety time interval, the minimum passage time of the newly added vehicle, and the staggered passage time of the target second vehicle. If satisfied, the staggered passage time of the target second vehicle is updated; if not satisfied, the staggered passage time of the target second vehicle is not updated:
[0043]
[0044] It is understandable that if the conditions are met, the order of passage is adjusted in the following way: becomes , and determine the staggered travel time of the newly added vehicle according to the staggered travel time of the first target vehicle, the preset minimum safe time headway, and the minimum travel time of the newly added vehicle through the following formula, and update the staggered travel time of the second target vehicle according to the staggered travel time of the newly added vehicle and the preset comfortable and safe time headway:
[0045]
[0046]
[0047] in, The first vehicle is the target. To add new vehicles, The second vehicle is the target. is the staggered travel time of the first target vehicle, To preset the minimum safe time interval, is the minimum travel time for the newly added vehicles, is the staggered travel time of the second target vehicle, To add staggered travel times for new vehicles, is the updated target staggered travel time of the second vehicle, To preset a comfortable and safe time distance.
[0048] Case 2: In response to a newly added vehicle being located on the main road and the position information of the newly added vehicle indicating that there are at least two target second vehicles between the newly added vehicle and the target first vehicle, it is determined whether to update the staggered passage time of the target second vehicle according to the staggered passage time of the target first vehicle, the preset minimum safety time headway, the minimum passage time of the newly added vehicle, and the staggered passage time of the benchmark second vehicle among the target second vehicles;
[0049] If so, the staggered passage time of the newly added vehicle is determined according to the staggered passage time of the target first vehicle, the preset minimum safe time distance and the minimum passage time of the newly added vehicle, and the staggered passage time of the benchmark second vehicle is updated according to the staggered passage time of the newly added vehicle, the preset comfortable and safe time distance and the minimum passage time of the benchmark second vehicle; the staggered passage time of each target second vehicle is updated according to the staggered passage time of the benchmark second vehicle; the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle and the staggered passage time of each target second vehicle; if not, the staggered passage time of the newly added vehicle is determined according to the driving speed of the newly added vehicle and the distance between the newly added vehicle and the merging point, and the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle.
[0050] The benchmark second vehicle is the one of the target second vehicles that is closest to the merging point, that is, the one of the target second vehicles that has the shortest crossing time.
[0051] Specifically, if the newly added vehicle is located on the main road and the location information of the newly added vehicle indicates that there are at least two target second vehicles between the newly added vehicle and the target first vehicle, the newly added vehicle and the target first vehicle can be taken as a whole, and the interleaving time of each target second vehicle can be replanned. The sum of the interleaving time of the target first vehicle and the preset minimum safety time distance can be calculated, and then the maximum value of the sum and the minimum time of the newly added vehicle can be calculated. The maximum value can be considered as the overall interleaving time. If the overall interleaving time is less than the interleaving time of the benchmark second vehicle, the interleaving time of the newly added vehicle needs to be less than the interleaving time of the benchmark second vehicle. Therefore, the interleaving time of all target second vehicles needs to be updated. Otherwise, the newly added vehicle can be planned after the last one of the target second vehicles, that is, it is determined whether to update the interleaving time of the target second vehicle. If so, then find the sum of the target first vehicle's staggered passage time and the preset minimum safe time headway, then find the maximum of the sum and the minimum passage time of the newly added vehicle, and use the maximum as the staggered passage time of the newly added vehicle, find the sum of the staggered passage time of the newly added vehicle and the preset comfortable and safe time headway, and use the maximum of the sum and the minimum passage time of the benchmark second vehicle as the updated staggered passage time of the benchmark second vehicle, and further, redistribute the staggered passage time of each target second vehicle after the benchmark second vehicle according to the staggered passage time of the benchmark second vehicle. Then, update the staggered passage time of the newly added vehicle and the updated staggered passage time of each target second vehicle to the planned vehicle queue, that is, change the staggered passage time of each target second vehicle, and add the staggered passage time of the newly added vehicle to the planned vehicle queue, that is, plan the newly added vehicle after the target first vehicle, and plan each target second vehicle after the newly added vehicle. If not, it means that there is no need to plan the new vehicle before the benchmark second vehicle, nor to disrupt the order of the target second vehicles. Therefore, the quotient of the distance between the new vehicle and the merging point and the driving speed of the new vehicle is used as the staggered passage time of the new vehicle, and the staggered passage time of the new vehicle is updated to the planned vehicle queue, that is, as the last vehicle in the planned vehicle queue.
[0052] For example, adding a new vehicle With the target first vehicle There are k target second vehicles , where k ≥ 2, The following formula is used to determine whether to update the staggered travel time of the target second vehicle according to the staggered travel time of the target first vehicle, the preset minimum safe time headway, the minimum travel time of the newly added vehicle, and the staggered travel time of the benchmark second vehicle among the target second vehicles. If the staggered travel time is satisfied, the staggered travel time of the target second vehicle is updated; if not, the staggered travel time of the target second vehicle is not updated:
[0053]
[0054] It is understandable that if the conditions are met, the order of passage is adjusted in the following way: becomes , and determine the staggered travel time of the newly added vehicle according to the staggered travel time of the target first vehicle, the preset minimum safe time headway, and the minimum travel time of the newly added vehicle through the following formula, and update the staggered travel time of the benchmark second vehicle according to the staggered travel time of the newly added vehicle, the preset comfortable and safe time headway, and the minimum travel time of the benchmark second vehicle:
[0055]
[0056]
[0057] The parameters that are the same as those in case 1 are not described here. As the second vehicle, is the staggered travel time of the second vehicle, is the updated benchmark second vehicle's staggered travel time.
[0058] Furthermore, the remaining k-1 target second vehicles that need to be adjusted in the ramp recalculate the staggered travel time according to the staggered travel time allocated to the previous target second vehicle and their own minimum travel time, similar to the method of calculating the staggered travel time of the newly added vehicles, which will not be elaborated here.
[0059] Case three: in response to a newly added vehicle being located on the main road and the position information of the newly added vehicle being that there is no target second vehicle between the newly added vehicle and the target first vehicle, the staggered passage time of the newly added vehicle is determined according to the driving speed of the newly added vehicle and the distance between the newly added vehicle and the merging point, and the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle.
[0060] Specifically, if the newly added vehicle is located on the main road and the position information of the newly added vehicle shows that there is no target second vehicle between the newly added vehicle and the target first vehicle, it means that there is no need to re-plan in combination with the second vehicles on the ramp. Therefore, the quotient of the distance between the newly added vehicle and the merging point and the driving speed of the newly added vehicle is used as the staggered passage time of the newly added vehicle, and the staggered passage time of the newly added vehicle is updated to the planned vehicle queue, that is, as the last vehicle in the planned vehicle queue.
[0061] Based on the above example, if the newly added vehicle is located on the ramp, then according to the location information of the newly added vehicle, that is, whether there is a target fourth vehicle between the newly added vehicle and the target third vehicle and the number of target fourth vehicles, the following three situations can be classified for updating the planned vehicle queue, which can be:
[0062] Case 1: In response to a newly added vehicle being located at a ramp and the position information of the newly added vehicle indicating that there is a target fourth vehicle between the newly added vehicle and the target third vehicle, it is determined whether to update the staggered passage time of the target fourth vehicle according to the staggered passage time of the target third vehicle, the preset minimum safety time headway, the minimum passage time of the newly added vehicle, and the staggered passage time of the target fourth vehicle;
[0063] If so, the staggered passage time of the new vehicle is determined according to the staggered passage time of the target third vehicle, the preset minimum safe time distance and the minimum passage time of the new vehicle, and the staggered passage time of the target fourth vehicle is updated according to the staggered passage time of the new vehicle and the preset comfortable and safe time distance; the planned vehicle queue is updated according to the staggered passage time of the new vehicle and the staggered passage time of the target fourth vehicle; if not, the staggered passage time of the new vehicle is determined according to the driving speed of the new vehicle and the distance between the new vehicle and the merging point, and the planned vehicle queue is updated according to the staggered passage time of the new vehicle.
[0064] Case 2: In response to a newly added vehicle being located at a ramp and the position information of the newly added vehicle indicating that there are at least two target fourth vehicles between the newly added vehicle and the target third vehicle, it is determined whether to update the staggered passage time of the target third vehicle according to the staggered passage time of the target third vehicle, the preset minimum safety time headway, the minimum passage time of the newly added vehicle, and the staggered passage time of the benchmark fourth vehicle among the target fourth vehicles;
[0065] If so, the staggered passage time of the newly added vehicle is determined according to the staggered passage time of the target third vehicle, the preset minimum safe time distance and the minimum passage time of the newly added vehicle, and the staggered passage time of the benchmark fourth vehicle is updated according to the staggered passage time of the newly added vehicle, the preset comfortable and safe time distance and the minimum passage time of the benchmark fourth vehicle; the staggered passage time of each target fourth vehicle is updated according to the staggered passage time of the benchmark fourth vehicle; the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle and the staggered passage time of each target fourth vehicle; if not, the staggered passage time of the newly added vehicle is determined according to the driving speed of the newly added vehicle and the distance between the newly added vehicle and the merging point, and the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle.
[0066] Case three: in response to a newly added vehicle being located on the ramp and the position information of the newly added vehicle being that there is no target fourth vehicle between the newly added vehicle and the target third vehicle, the staggered passage time of the newly added vehicle is determined according to the driving speed of the newly added vehicle and the distance between the newly added vehicle and the merging point, and the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle.
[0067] The target third vehicle is the second vehicle in the planned vehicle queue that is farthest from the merging point. The target fourth vehicle is the first vehicle that is between the newly added vehicle and the target third vehicle in the merging point. The benchmark fourth vehicle is the vehicle that is closest to the merging point among all target fourth vehicles.
[0068] It should be noted that the three situations where the newly added vehicles are located on the ramp are similar to the three situations where the newly added vehicles are located on the main road, and will not be described in detail here.
[0069] Based on the above example, after updating the planned vehicle queue, it is possible to further verify whether the updated planned vehicle queue meets the requirements, which can be:
[0070] According to the updated planned vehicle queue, a traffic sequence matrix is established;
[0071] According to the passage sequence matrix and the staggered passage time of each vehicle in the updated planned vehicle queue, under the preset constraints, the solution result is determined, and it is judged whether the solution result meets the preset requirements;
[0072] If satisfied, control is performed according to the updated planned vehicle queue;
[0073] If not, a planning failure message is generated.
[0074] Among them, the size of the traffic order matrix is the number of first vehicles in the main road in the planning area multiplied by the number of second vehicles in the ramp in the planning area. The traffic order matrix is used to describe the traffic order between vehicles on different roads. The preset constraints are the pre-set conditions that the planned vehicle queue should meet. The solution result is the numerical result of the solution that meets the preset constraints. The preset requirements are requirements used to determine whether the solution results can be achieved, such as positive numbers. Planning failure information is information used to remind the planning control center of planning failure.
[0075] Specifically, according to the updated planned vehicle queue, a traffic order matrix is established, each row of the matrix represents each first vehicle in the main road, each column represents each second vehicle in the ramp, and each element represents whether the first vehicle corresponding to the element arrives at the merging point before the second vehicle corresponding to the element. Furthermore, the traffic order matrix and the staggered travel time of each vehicle in the updated planned vehicle queue are used as known conditions, and the solution is performed under each preset constraint condition to meet each preset constraint condition and obtain the solution result. It is judged whether the solution result meets the preset requirements. If it does, it is controlled according to the updated planned vehicle queue. If it does not, a planning failure message is generated to remind the planning control center to re-plan.
[0076] For example, a 0-1 variable matrix is introduced as a pass order matrix , where m is the number of first vehicles on the main road in the planning area, and n is the number of second vehicles on the ramp in the planning area. Indicates whether the second vehicle j in the ramp passes before the first vehicle i in the main road. When it is equal to 1, vehicle i will pass the merging point before vehicle j. If the solution result is a positive number C, so that all the preset constraints are met, then the control can be carried out according to the planned vehicle queue, that is, the vehicle can enter the control area according to the planned passage order in the planned vehicle queue.
[0077] Based on the above example, the solution result can be determined according to the travel order matrix and the staggered travel time of each vehicle in the updated planned vehicle queue under the preset constraints in the following manner: The solution result is determined according to the following preset constraints:
[0078]
[0079]
[0080]
[0081]
[0082]
[0083]
[0084]
[0085] in, is the speed of the kth vehicle in the planned vehicle queue, is the preset minimum speed, is the preset maximum speed, is the acceleration of the kth vehicle in the planned vehicle queue, is the preset minimum acceleration, is the preset maximum acceleration, 1≤k≤m+n, m is the number of first vehicles on the main road in the planning area, n is the number of second vehicles on the ramp in the planning area, is the updated staggered travel time of the r1th vehicle on the main road or ramp, is the updated staggered travel time of the r2nd vehicle on the main road or ramp, is the updated staggered travel time of the jth vehicle on the main road, is the updated staggered travel time of the jth vehicle in the ramp, is the preset minimum safe time interval, It is a preset comfortable and safe time distance. is the element in the i-th row and j-th column of the pass order matrix, if , it means that the i-th vehicle in the main road reaches the merging point before the j-th vehicle in the ramp. If , it means that the i-th vehicle in the main road reaches the merging point after the j-th vehicle in the ramp. is the solution result.
[0086] Based on the above example, after the planned vehicle queue is updated, each planned vehicle in the planned vehicle queue may also be controlled, specifically:
[0087] For each planned vehicle in the planned vehicle queue, when entering the control area, a target trajectory of the planned vehicle is determined based on the vehicle kinematic model, the planned vehicle queue, and the staggered travel time of the planned vehicles;
[0088] A linear time-varying model is established based on the target trajectory and the sampling moments between the current moment and the travel time of the planned vehicle;
[0089] Based on the model predictive control algorithm, the predicted control amount and preview trajectory at the current moment are obtained according to the linear time-varying model and the target trajectory;
[0090] According to the predicted control quantity at the current moment, the control plans the vehicle to move based on the preview trajectory.
[0091] Among them, the planned vehicles are the vehicles in the planned vehicle queue, including vehicles on the main road and vehicles on the ramp. The target trajectory is the trajectory generated after trajectory planning for the planned vehicle. The travel time is the estimated time to arrive at the merging point. The sampling time is the time obtained by sampling at the preset sampling interval between the current time and the travel time. The preset sampling interval can be set according to the needs and is not specifically limited here. The linear time-varying model is a discretized trajectory tracking model established according to the target trajectory, which is used to describe the relationship between the vehicle state variables and the control variables corresponding to each control time. The vehicle state variables include heading angle, speed, horizontal axis component speed and vertical axis component speed. The model predictive control algorithm (MPC) is a special type of control. Its current control action is obtained by solving a finite time domain open-loop optimal control problem at each sampling moment. The current state of the process is used as the initial state of the optimal control problem. The optimal control sequence obtained only implements the first control action. Therefore, the predicted control quantity at the current moment is solved. The predicted control quantity is the solution result of the model predictive control algorithm, which is used to control the planned vehicle at the current moment. The preview trajectory is based on the trajectory obtained by MPC solution.
[0092] Specifically, when entering the control area, for each planned vehicle in the planned vehicle queue, according to the staggered passage time of the planned vehicles, combined with the restrictions of each vehicle in the planned vehicle queue, trajectory planning is performed based on the vehicle kinematic model to obtain the target trajectory of the planned vehicle, which includes the state of each vehicle that changes with time. Then, according to the planned vehicle at each sampling time between the current moment and the passage time, the discretized trajectory tracking is performed within the target trajectory to establish a linear time-varying model. The linear time-varying model and the target trajectory are substituted into the model predictive control algorithm to solve the predicted control amount and the preview trajectory at the current moment. Then, according to the predicted control amount at the current moment, a control instruction is issued to control the planned vehicle to move according to the preview trajectory at the current moment, that is, to achieve the control of the current control cycle.
[0093] It can be understood that after controlling the planned vehicle movement according to the predicted control amount at the current moment, the predicted control amount at the next moment can be determined, and the planned vehicle can be controlled at the moment corresponding to each control cycle.
[0094] Based on the above example, the following method can be used to control the planned vehicle motion according to the predicted control amount at the current moment:
[0095] Obtain the actual trajectory and determine the first lateral and longitudinal deviation values between the actual trajectory at the current moment and the preview trajectory;
[0096] According to the pre-established proportional-integral-differential controller, based on the first lateral and longitudinal deviation values, a correction control amount at the current moment is obtained, and a first weight corresponding to the correction control amount is determined according to the first lateral and longitudinal deviation values;
[0097] Determine a second lateral and longitudinal deviation value according to the preview trajectory and the target trajectory at the next moment of the current moment, and determine a second weight corresponding to the predicted control amount according to the second lateral and longitudinal deviation value;
[0098] Determine the target control amount at the current moment based on the predicted control amount at the current moment, the second weight, the corrected control amount, and the first weight;
[0099] According to the target control amount at the current moment, control and plan the vehicle movement.
[0100] Among them, the actual trajectory is the trajectory generated during the vehicle's driving process. The first lateral and longitudinal deviation value is the deviation value between the trajectory point of the actual trajectory at the current moment and the trajectory point of the preview trajectory in the lateral and longitudinal directions. The second lateral and longitudinal deviation value is the deviation value between the trajectory point of the preview trajectory at the next moment and the trajectory point of the target trajectory in the lateral and longitudinal directions. The first weight is used to weight the correction control amount, and the second weight is used to weight the predicted control amount. The pre-established proportional-integral-derivative controller is a PID (Proportional-Integral-Derivative) controller, which is used for feedback regulation and compensation of the control amount. The corrected control amount is the output result of the pre-established proportional-integral-derivative controller, which is used to compensate the predicted control amount. The target control amount is the weighted sum of the predicted control amount and the corrected control amount according to the second weight and the first weight respectively, and is a control amount that is adaptively adjusted based on the error size.
[0101] Specifically, the actual trajectory of the vehicle, that is, the actual trajectory, is collected and acquired. The deviation value between the trajectory point in the actual trajectory at the current moment and the trajectory point in the preview trajectory is used as the first lateral and longitudinal deviation value. The first lateral and longitudinal deviation value is processed by a pre-established proportional integral differential controller to obtain a correction control amount that is expected to adjust the first lateral and longitudinal deviation value to 0 at the current moment. Furthermore, the first weight corresponding to the correction control amount can be determined according to the correspondence between the first lateral and longitudinal deviation value and the pre-set first lateral and longitudinal deviation value and the first weight. The deviation value between the trajectory point in the preview trajectory and the trajectory point in the target trajectory at the next moment of the current moment is used as the second lateral and longitudinal deviation value, and the second weight corresponding to the predicted control amount is determined according to the correspondence between the second lateral and longitudinal deviation value and the pre-set second lateral and longitudinal deviation value and the second weight. The predicted control amount and the corrected control amount at the current moment are weighted based on the second weight and the first weight respectively as the target control amount at the current moment, and a control instruction is issued according to the target control amount at the current moment to control the planned vehicle to move at the current moment, that is, the target control amount of the feedforward MPC control and the feedback PID control is combined to control the current control cycle of the planned vehicle.
[0102] Figure 3 FIG. 1 is a flow chart of another vehicle ramp coordinated merging method provided by an embodiment of the present invention. Figure 3 As shown, the vehicle ramp coordinated merging method specifically includes:
[0103] Step 1: Collect the movement information of each first vehicle on the main road in the planning area, the movement information of each second vehicle on the ramp, and the distance information between all vehicles and the merging point, and calculate the staggered travel time and theoretical minimum travel time for each vehicle to reach the merging point under the current circumstances.
[0104] The road before the merging point is divided into a planning area and a control area, and the first vehicles on the main road in the planning area are obtained: P1, P2, ..., P m , calculate the distance from the first vehicle on the main road to the merging point , , …, ; Get the second vehicles in the planned area ramp: Q1, Q2, ..., Qn, and calculate the distance from each second vehicle on the ramp to the merging point , , …, m is the number of first vehicles in the main road within the planning area, and n is the number of second vehicles in the ramp within the planning area.
[0105] Step 2: construct a queue for the newly added vehicles entering the planning area, adjust the traffic order of the main road and ramp vehicles (update the planned vehicle queue), and allocate staggered traffic time after the traffic order is adjusted.
[0106] Specifically, in the planning area, according to the movement information of each first vehicle in the main road and the movement information of each second vehicle in the ramp, a queue is constructed for the newly added vehicles entering the planning area. In case of conflict or large vehicle distance that reduces traffic efficiency, the traffic order of vehicles in the main road and the ramp is adjusted, and the vehicles are allocated travel time after the adjusted traffic order.
[0107] For each new vehicle entering the planning area, a vehicle queue is constructed to adjust the traffic order and eliminate the right-of-way conflict at the merging point. This can be done by: and ( is a sufficiently small number), i is the sequence number of the first vehicle, j is the sequence number of the second vehicle, then there is a time-space conflict between the first vehicle in the main road and the second vehicle in the ramp, the first vehicle in the main road can be merged into a vehicle queue, the travel time can be uniformly arranged, and then the travel time of the second vehicle in the ramp can be calculated; conversely, when the distance from the first vehicle in the main road to the merging point is between the two ramp vehicles, the ramp vehicles can be merged into a vehicle queue and the travel time can be uniformly arranged, and then the travel time of the main road vehicle can be calculated. When constructing a queue, the minimum safe time headway and the comfortable safe time headway are recorded as , , the minimum safe distance is .
[0108] Based on the relationship between the newly added vehicles entering the planning area and the current vehicles in the planning area, a fleet is constructed and the vehicle right of way is adjusted. The following four situations are discussed.
[0109] (1) The distance from the confluence point satisfies , that is, the newly detected additional vehicles is a vehicle on the main road, and at this time there is only one second vehicle (target second vehicle) in the ramp between the newly added vehicle and the previous vehicle on the main road (target first vehicle). If:
[0110]
[0111] That is, new vehicles entering the planning area With the target first vehicle The staggered travel time of the convoy is less than the staggered travel time of the second target vehicle. At this time, the travel order is adjusted in the following way: .at this time, and The staggered travel time is updated to:
[0112]
[0113]
[0114] in, The first vehicle is the target. To add new vehicles, The second vehicle is the target. is the staggered travel time of the first target vehicle, To preset the minimum safe time interval, is the minimum travel time for the newly added vehicles, is the staggered travel time of the second target vehicle, To add staggered travel times for new vehicles, is the updated target staggered travel time of the second vehicle, To preset a comfortable and safe time distance.
[0115] (2) The distance from the confluence point satisfies , that is, the number of new vehicles entering the planning area The main road vehicle, and at this time there are A second vehicle (at least two target second vehicles) is located between the newly added vehicle and the previous vehicle (target first vehicle) on the main road. If:
[0116]
[0117] That is, the newly added vehicles entering the planning area and the first target vehicle The staggered travel time of the convoy is less than the second vehicle of the benchmark At this time, the order of passage is adjusted in the following ways: .at this time, and The staggered travel time is updated to:
[0118]
[0119]
[0120] Other ramps that need adjustment -1 target second vehicle recalculates the staggered travel time according to the allocated staggered travel time of its preceding vehicle and its own minimum travel time.
[0121] The contents that are the same as (1) are not repeated here. As the second vehicle, is the staggered travel time of the second vehicle, is the updated benchmark staggered travel time of the second vehicle.
[0122] (3) The distance from the confluence point satisfies , that is, the number of new vehicles entering the planning area is a ramp vehicle, and at this time there is only one first vehicle (the fourth target vehicle) in the main road between the newly added vehicle and the previous vehicle in the ramp (the third target vehicle). If:
[0123]
[0124] That is, new vehicles entering the planning area With the third vehicle of the target The staggered travel time of the convoy is less than the staggered travel time of the fourth target vehicle. At this time, the travel order is adjusted in the following way: .at this time, and The staggered travel time is updated to:
[0125]
[0126]
[0127] in, The fourth vehicle is the target. To add new vehicles, The third vehicle is the target. is the staggered travel time of the fourth target vehicle, To preset the minimum safe time interval, is the minimum travel time for the newly added vehicles, is the staggered travel time of the third target vehicle, To add staggered travel times for new vehicles, is the updated target staggered travel time of the fourth vehicle, To preset a comfortable and safe time distance.
[0128] (4) The distance from the confluence point satisfies , that is, the number of new vehicles entering the planning area is a ramp vehicle, and there is The first vehicle (the fourth target vehicle) is located between the newly added vehicle and the previous vehicle on the ramp (the third target vehicle). If:
[0129]
[0130] That is, the newly added vehicles entering the planning area and the target third vehicle The staggered travel time of the convoy is less than the fourth vehicle of the benchmark At this time, the order of passage is adjusted in the following ways: .at this time, and The staggered travel time is updated to:
[0131]
[0132]
[0133] Others in the main road that need to be adjusted -1 target fourth vehicle recalculates the staggered travel time according to the allocated staggered travel time of its preceding vehicle and its own minimum travel time.
[0134] The contents that are the same as (3) are not repeated here. As the fourth vehicle, The staggered travel time of the fourth vehicle is the benchmark. It is the updated benchmark staggered travel time of the fourth vehicle.
[0135] Step 3: Establish a pass sequence matrix to verify the security of the pass sequence.
[0136] Specifically, a traffic sequence matrix is established, and the collaborative dispatch center verifies the safety of the traffic sequence and calculates whether the headway time interval between every two vehicles meets the preset minimum safety time interval and the preset comfortable safety time interval to ensure maximum traffic volume and safety.
[0137] For the adjusted planned vehicle queue, a traffic order matrix is established to facilitate the calculation of whether the headway time interval between each two vehicles meets the preset minimum safety time interval and the preset comfortable safety time interval. Therefore, a 0-1 variable matrix (traffic order matrix) is introduced. , where each element indicates whether the second vehicle passes before the first vehicle, , are the number of first vehicles in the main road and the number of second vehicles in the ramp, respectively. When is equal to 1, the i-th vehicle in the main road reaches the merging point before the j-th vehicle in the ramp. If there is a positive number C at the same time, so that the following preset constraints are met, the vehicles enter the control area according to the planned passage order in the planned vehicle queue.
[0138]
[0139]
[0140]
[0141]
[0142]
[0143]
[0144]
[0145] in, is the speed of the kth vehicle in the planned vehicle queue, is the preset minimum speed, is the preset maximum speed, is the acceleration of the kth vehicle in the planned vehicle queue, is the preset minimum acceleration, is the preset maximum acceleration, 1≤k≤m+n, m is the number of first vehicles on the main road in the planning area, n is the number of second vehicles on the ramp in the planning area, is the updated staggered travel time of the r1th vehicle on the main road or ramp, is the updated staggered travel time of the r2nd vehicle on the main road or ramp, is the updated staggered travel time of the jth vehicle on the main road, is the updated staggered travel time of the jth vehicle in the ramp, is the preset minimum safe time interval, It is a preset comfortable and safe time distance. is the element in the i-th row and j-th column of the pass order matrix, if , it means that the i-th vehicle in the main road reaches the merging point before the j-th vehicle in the ramp. If , it means that the i-th vehicle in the main road reaches the merging point after the j-th vehicle in the ramp. is the solution result.
[0146] Step 4: Calculate the vehicle motion trajectory sequence (target trajectory) for each vehicle according to the traffic order matrix and send it to each vehicle on the main road and the ramp.
[0147] For each vehicle (planning vehicle), a lateral and longitudinal kinematic model is established as follows:
[0148]
[0149]
[0150]
[0151]
[0152] in, is the heading angle of the vehicle; is the vehicle wheelbase, is the vehicle turning angle, is the vehicle speed; is the component speed of the vehicle in the horizontal direction of the coordinate axis; is the component speed of the vehicle in the longitudinal direction of the coordinate axis; is the vehicle’s acceleration, denoted by .
[0153] Combined with the above kinematic model, the optimal trajectory planning of the vehicle is controlled and optimized:
[0154]
[0155]
[0156]
[0157]
[0158]
[0159] in, For the current moment, is the arrival time, t is the sampling time, a is the acceleration, is the initial distance, is the initial velocity, and are the maximum speed and the minimum speed respectively, and are the maximum and minimum acceleration values, respectively. is the distance between the i-th vehicle and the current position, is the distance between the i-1th vehicle and the current position, and the minimum safe distance is It is understandable that the closer to the entry point, the smaller the sequence number.
[0160] Solving the above optimization problem, we can obtain the target trajectory that changes over time: ( ), t is the sampling time.
[0161] Step 5: Establish a vehicle lateral and longitudinal control kinematic model based on the target trajectory, discretize the kinematic model, and obtain a control linear time-varying model.
[0162] According to the vehicle lateral and longitudinal kinematic model established according to the target trajectory, A linear time-varying control model (control linear time-varying model) is established in the time domain and discretized with Δt as the preset time interval.
[0163] Select is the state vector, is the control variable, which can be expressed as: .
[0164] For the rth reference point corresponding to ( , ) and ignoring the higher-order terms, we obtain:
[0165] (1)
[0166] (2)
[0167] in, , , the subscript r represents the parameters corresponding to the rth reference point.
[0168] in, , , , .
[0169] (2)-(1) and discretize to obtain:
[0170] in, , .
[0171] Step 6: Establish the MPC and PID vehicle fuzzy compensation composite control model, solve the control output (acceleration and angle), and track the trajectory.
[0172] The MPC controller is used for predictive control, and the PID controller is used for feedback control according to the deviation between the target trajectory and the actual trajectory at the previous moment. The fuzzy compensation composite control method is used to obtain the control output (target control quantity), including vehicle acceleration and turning angle, to reduce the single control method from being able to adapt to the lateral and longitudinal control requirements at the same time, and to track the target trajectory. The vehicle drives to the confluence point according to the planned trajectory within the control area, such as Figure 4 The tracking control schematic diagram is shown in the figure.
[0173] In order to realize the output of preview trajectory points, the preview trajectory that changes with time is Discretize the preset time interval to obtain the time series trajectory points (the trajectory points of the preview trajectory) The vehicle trajectory tracking strategy is to continuously track the preview trajectory point at the next moment, and use The vehicle state is sampled at time intervals to obtain the actual trajectory points .
[0174] The vehicle fuzzy compensation composite control model includes feedforward control MPC (MPC feedforward algorithm), feedback control PID (PID feedback algorithm) and fuzzy compensation composite method. The control quantity (acceleration and angle) is predicted through MPC feedforward output. The control quantity of the MPC control output is compensated by the historical deviation (the first lateral and longitudinal deviation value) between the preview trajectory and the actual trajectory through PID feedback control: , and solve for the first weight and the second weight , the final target control quantity is obtained by fuzzy composite method: .
[0175] Feedforward control MPC includes: establishing the objective function, obtaining the state variables in the controller output expected preview trajectory , get the predicted control quantity (Optimal acceleration and front wheel turning angle):
[0176]
[0177] in, , , , is the error weight matrix, and is the control weight matrix, which can be calculated using the gradient descent method. is the state variable in the target trajectory. The matrix is used to change the tracking effect of the controller on the target trajectory. Each coefficient on the diagonal corresponds to the state variable In order to improve the tracking accuracy under different working conditions, it is necessary to dynamically adjust the weight of the lateral displacement deviation. The function of the matrix is to adjust the size of the system control quantity. Each coefficient of its diagonal corresponds to the control quantity Each item. The function of the matrix is to limit the rapid change of the control quantity. Each coefficient of its diagonal corresponds to each item of the change of the control quantity μ. The subscript a represents the parameter related to acceleration, and the subscript Indicates the parameters related to the turning angle, the subscript ref indicates the target trajectory, the subscript scan indicates the preview trajectory, the subscript t indicates the time t, and the subscript t+1 indicates the time t+1. Combining the above, the problem can be transformed into a quadratic programming problem and solved using the interior point method.
[0178]
[0179]
[0180] in, and are the minimum and maximum values of the preset predicted control quantity change values, and They are respectively the minimum and maximum values of the preset predictive control quantity.
[0181] PID compensation control is, the input error is The deviation between the preview trajectory of MPC at time t and the actual trajectory at time t (the first horizontal and vertical deviation value), that is, , calculate the corrected control amount (compensated acceleration and compensated rotation angle). The output of the PID controller used to compensate for the actual output error of MPC is:
[0182] ,
[0183] in, , , is the preset control matrix, ], ], ], the coefficients in the matrix are adjusted through debugging, the subscript a represents the parameters related to acceleration, and the subscript Represents parameters related to the rotation angle.
[0184] The influence coefficient (second weight) of the control quantity output by MPC in the vehicle fuzzy compensation composite control is determined by the lateral and longitudinal deviations (second lateral and longitudinal deviations) between the reference trajectory at the current moment and the preview trajectory, and the influence coefficient (first weight) of the control quantity output by PID is determined by the lateral and longitudinal deviations (first lateral and longitudinal deviations) between the actual trajectory at the previous moment and the preview trajectory. Set the lateral deviation between the target trajectory and the preview trajectory {NM1, NS1, Z1, PS1, PM1}, longitudinal deviation {NM1, NS1, Z1, PS1, PM1}, where the value range of NM1, NS1, Z1, PS1 and PM1 is [-0.5, 1], setting the lateral deviation between the preview trajectory and the actual trajectory {NM2, NS2, Z2, PS2, PM2}, longitudinal deviation {NM2, NS2, Z2, PS2, PM2}, where the value ranges of NM2, NS2, Z2, PS2 and PM2 are all [-0.5, 0.5]. {NM3, NS3, Z3, PS3, PM3}, first weight {NM4, NS4, Z4, PS4, PM4}, where the value ranges of NM3, NS3, Z3, PS3, PM3, NM4, NS4, Z4, PS4 and PM4 are all [0.5, 1.5], as shown in Tables 1 and 2. NM, NS, Z, PS and PM corresponding to the same subscript are used to describe different magnitudes, where NM means Negative Middle, NS means Negative Small, Z means deviation close to 0 (Zero), PS means Positive Small, and PM means Positive Middle. It can be understood that the specific values of NM, NS, Z, PS and PM are set according to requirements within the value range.
[0185] Table 1 Relationship between the second horizontal and vertical deviations and the second weight (fuzzy rule 2)
[0186]
[0187] Table 2 Relationship between the first horizontal and vertical deviations and the first weight (fuzzy rule 1)
[0188]
[0189] The above method constructs a vehicle queue, adjusts the passage order of new vehicles entering the planning area, and timely adjusts the movement status of each vehicle to avoid conflicts between ramp vehicles and main road vehicles at the merging point. At the same time, the vehicle trajectory is accurately controlled by adding timestamps to ensure the safe merging of vehicles.
[0190] The present invention has the following technical effects: by acquiring a planned vehicle queue, the staggered passage time of each first vehicle in the main road within the planning area and the staggered passage time of each second vehicle in the ramp within the planning area are determined according to the planned vehicle queue; then, in response to the presence of a new vehicle entering the planning area, the planned vehicle queue is updated according to the position information and minimum passage time of the new vehicle, the staggered passage time of each first vehicle in the planned vehicle queue, and the staggered passage time of each second vehicle, so as to timely adjust the planned vehicle queue according to the new vehicle, thereby achieving the effect of improving vehicle merging efficiency and reducing vehicle collision risk.
[0191] Figure 5 Schematic diagram of the structure of an electronic device provided by an embodiment of the present invention. Figure 5 As shown, the electronic device 500 includes one or more processors 501 and a memory 502 .
[0192] The processor 501 may be a central processing unit (CPU) or other forms of processing units having data processing capabilities and / or instruction execution capabilities, and may control other components in the electronic device 500 to perform desired functions.
[0193] The memory 502 may include one or more computer program products, which may include various forms of computer-readable storage media, such as volatile memory and / or non-volatile memory. The volatile memory may include, for example, random access memory (RAM) and / or cache memory (cache), etc. The non-volatile memory may include, for example, read-only memory (ROM), hard disk, flash memory, etc. One or more computer program instructions may be stored on the computer-readable storage medium, and the processor 501 may run the program instructions to implement the vehicle ramp coordinated merging method of any embodiment of the present invention described above and / or other desired functions. Various contents such as initial external parameters, thresholds, etc. may also be stored in the computer-readable storage medium.
[0194] The electronic device 500 may further include: an input device 503 and an output device 504, which are interconnected via a bus system and / or other forms of connection mechanisms (not shown). The input device 503 may include, for example, a keyboard, a mouse, etc. The output device 504 may output various information to the outside, including early warning information, braking force, etc. The output device 504 may include a display, a speaker, a printer, a communication network and a remote output device connected thereto, etc.
[0195] certainly, Figure 5 Only some of the components related to the present invention in the electronic device 500 are shown, and components such as a bus, an input / output interface, etc. are omitted. In addition, according to specific application conditions, the electronic device 500 may also include any other appropriate components.
[0196] The embodiments of the present invention may also be a computer program product, which includes computer program instructions. When the computer program instructions are executed by a processor, the processor executes the steps of the vehicle ramp coordinated merging method provided by any embodiment of the present invention.
[0197] The computer program product may be written in any combination of one or more programming languages to write program code for performing the operations of the embodiments of the present invention, including object-oriented programming languages such as Java, C++, etc., and conventional procedural programming languages such as "C" or similar programming languages. The program code may be executed entirely on the user computing device, partially on the user device, as a separate software package, partially on the user computing device and partially on a remote computing device, or entirely on a remote computing device or server.
[0198] In addition, an embodiment of the present invention may also be a computer-readable storage medium having computer program instructions stored thereon. When the computer program instructions are executed by a processor, the processor executes the steps of the vehicle ramp coordinated merging method provided by any embodiment of the present invention.
[0199] Computer readable storage media can adopt any combination of one or more readable media. The readable medium can be a readable signal medium or a readable storage medium. The readable storage medium can include, for example, but is not limited to, a system, device or device of electricity, magnetism, light, electromagnetic, infrared, or semiconductor, or any combination of the above. More specific examples (non-exhaustive list) of readable storage media include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.
Claims
1. A vehicle ramp coordinated merging method, It is characterized in that include: Get the planned vehicle queue; Determining, according to the planned vehicle queue, a staggered travel time of each first vehicle in a main road within a planning area and a staggered travel time of each second vehicle in a ramp within the planning area; In response to a newly added vehicle entering the planned area, the planned vehicle queue is updated according to the position information and minimum travel time of the newly added vehicle, the staggered travel time of each first vehicle in the planned vehicle queue, and the staggered travel time of each second vehicle; According to the updated planned vehicle queue, a traffic order matrix is established; wherein the size of the traffic order matrix is the number of first vehicles in the main road in the planning area multiplied by the number of second vehicles in the ramp in the planning area; According to the passage sequence matrix and the updated staggered passage time of each vehicle in the planned vehicle queue, under preset constraints, a solution result is determined, and it is judged whether the solution result meets the preset requirements; If satisfied, control is performed according to the updated planned vehicle queue; If not, planning failure information is generated; The method of determining a solution result according to the passage sequence matrix and the updated staggered passage time of each vehicle in the planned vehicle queue under preset constraints includes: The solution result is determined by the following preset constraints: in, is the speed of the kth vehicle in the planned vehicle queue, is the preset minimum speed, is the preset maximum speed, is the acceleration of the kth vehicle in the planned vehicle queue, is the preset minimum acceleration, is the preset maximum acceleration, 1≤k≤m+n, m is the number of first vehicles on the main road in the planning area, n is the number of second vehicles on the ramp in the planning area, Is the rth 1 The updated staggered travel time of the vehicle, Is the rth 2 The updated staggered travel time of the vehicle, is the updated staggered travel time of the jth vehicle on the main road, is the updated staggered travel time of the jth vehicle in the ramp, is the preset minimum safe time interval, It is a preset comfortable and safe time distance. is the element in the i-th row and j-th column of the pass order matrix, if , it means that the i-th vehicle in the main road reaches the merging point before the j-th vehicle in the ramp. If , it means that the i-th vehicle in the main road reaches the merging point after the j-th vehicle in the ramp. is the solution result.
2. The method according to claim 1, It is characterized in that The updating of the planned vehicle queue according to the position information and the minimum passing time of the newly added vehicle, the staggered passing time of each first vehicle in the planned vehicle queue, and the staggered passing time of each second vehicle includes: In response to the newly added vehicle being located on the main road and the position information of the newly added vehicle indicating that there is a target second vehicle between the newly added vehicle and the target first vehicle, it is determined whether to update the staggered passage time of the target second vehicle according to the staggered passage time of the target first vehicle, the preset minimum safety time headway, the minimum passage time of the newly added vehicle and the staggered passage time of the target second vehicle; wherein the target first vehicle is the first vehicle in the planned vehicle queue that is farthest from the merging point; the target second vehicle is the second vehicle that is between the newly added vehicle and the target first vehicle in the distance from the merging point; If so, the staggered passage time of the newly added vehicle is determined according to the staggered passage time of the first target vehicle, the preset minimum safe time headway and the minimum passage time of the newly added vehicle, and the staggered passage time of the second target vehicle is updated according to the staggered passage time of the newly added vehicle and the preset comfortable and safe time headway; the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle and the staggered passage time of the second target vehicle; If not, the staggered travel time of the newly added vehicle is determined according to the travel speed of the newly added vehicle and the distance between the newly added vehicle and the merging point, and the planned vehicle queue is updated according to the staggered travel time of the newly added vehicle.
3. The method according to claim 1, It is characterized in that The updating of the planned vehicle queue according to the position information and the minimum passing time of the newly added vehicle, the staggered passing time of each first vehicle in the planned vehicle queue, and the staggered passing time of each second vehicle includes: In response to the newly added vehicle being located on the main road and the position information of the newly added vehicle indicating that there are at least two target second vehicles between the newly added vehicle and the target first vehicle, it is determined whether to update the staggered passage time of the target second vehicle according to the staggered passage time of the target first vehicle, the preset minimum safety time headway, the minimum passage time of the newly added vehicle, and the staggered passage time of a reference second vehicle among the target second vehicles; wherein the target first vehicle is the first vehicle in the planned vehicle queue that is farthest from the merging point; the target second vehicle is the second vehicle that is between the newly added vehicle and the target first vehicle in distance from the merging point; and the reference second vehicle is the vehicle among the target second vehicles that is closest to the merging point; If so, the staggered passage time of the newly added vehicle is determined according to the staggered passage time of the target first vehicle, the preset minimum safe time headway and the minimum passage time of the newly added vehicle, and the staggered passage time of the reference second vehicle is updated according to the staggered passage time of the newly added vehicle, the preset comfortable and safe time headway and the minimum passage time of the reference second vehicle; the staggered passage time of each target second vehicle is updated according to the staggered passage time of the reference second vehicle; the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle and the staggered passage time of each target second vehicle; If not, the staggered travel time of the newly added vehicle is determined according to the travel speed of the newly added vehicle and the distance between the newly added vehicle and the merging point, and the planned vehicle queue is updated according to the staggered travel time of the newly added vehicle.
4. The method according to claim 1, It is characterized in that The updating of the planned vehicle queue according to the position information and the minimum passing time of the newly added vehicle, the staggered passing time of each first vehicle in the planned vehicle queue, and the staggered passing time of each second vehicle includes: In response to the fact that the newly added vehicle is located on the main road and the position information of the newly added vehicle shows that there is no target second vehicle between the newly added vehicle and the target first vehicle, the staggered passage time of the newly added vehicle is determined according to the driving speed of the newly added vehicle and the distance between the newly added vehicle and the merging point, and the planned vehicle queue is updated according to the staggered passage time of the newly added vehicle; wherein the target first vehicle is the first vehicle in the planned vehicle queue that is farthest from the merging point; and the target second vehicle is the second vehicle whose distance from the merging point is between the newly added vehicle and the target first vehicle.
5. The method according to claim 1, It is characterized in that After the updating of the planned vehicle queue, the method further includes: For each planned vehicle in the planned vehicle queue, when entering a control area, determining a target trajectory of the planned vehicle based on a vehicle kinematic model, the planned vehicle queue, and a staggered travel time of the planned vehicles; Establishing a linear time-varying model according to the target trajectory and each sampling time of the planned vehicle between the current time and the travel time; Based on the model predictive control algorithm, according to the linear time-varying model and the target trajectory, the predicted control amount at the current moment and the preview trajectory at the next moment are obtained; According to the predicted control amount at the current moment, the planned vehicle is controlled to move based on the preview trajectory.
6. The method according to claim 5, It is characterized in that Controlling the planned vehicle motion according to the predicted control amount at the current moment includes: Acquire the actual trajectory, and determine the first lateral and longitudinal deviation values between the actual trajectory at the current moment and the preview trajectory; According to a pre-established proportional-integral-differential controller, based on the first lateral and longitudinal deviation values, a correction control amount at the current moment is obtained, and according to the first lateral and longitudinal deviation values, a first weight corresponding to the correction control amount is determined; Determine a second lateral and longitudinal deviation value according to the preview trajectory and the target trajectory at the next moment of the current moment, and determine a second weight corresponding to the predicted control amount according to the second lateral and longitudinal deviation value; determining the target control amount at the current moment based on the predicted control amount, the second weight, the corrected control amount, and the first weight; The planned vehicle motion is controlled according to the target control amount at the current moment.
7. An electronic device, It is characterized in that The electronic device comprises: Processor and memory; The processor is used to execute the steps of the vehicle ramp coordinated merging method as described in any one of claims 1 to 6 by calling the program or instructions stored in the memory.
8. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores a program or instruction, and the program or instruction enables a computer to execute the steps of the vehicle ramp coordinated merging method as described in any one of claims 1 to 6.
