An intelligent control method for traffic congestion, a terminal device, and a storage medium

Abstract

This application belongs to the field of vehicle networking, and particularly relates to an intelligent traffic congestion control method, a terminal device, and a storage medium. The method can avoid guiding a large number of vehicles to the same toll station to enter the highway, realizes the diversion of the traffic flow at the toll station, and can effectively relieve the congestion at the toll station. Moreover, when diverting the vehicles, time factors such as the time taken for the vehicle to travel to the toll station, the waiting time at the toll station, and the travel time to enter the highway through the toll station are comprehensively considered to determine the target toll station, so that the time taken for the target vehicle to enter the highway through the target toll station and travel to the destination is the shortest. That is, when the diversion of the toll station is realized, the driving efficiency of the target vehicle to reach the destination can be guaranteed as much as possible.

Description

Technical Field

[0001] The present application relates to the field of Internet of Vehicles, and in particular to an intelligent traffic congestion control method, terminal equipment and storage medium. Background Art

[0002] The length of expressways stretches for hundreds or even thousands of kilometers, and toll stations are distributed in all sections of the expressway, some in urban areas, and some in towns and suburbs;

[0003] Cars need to pass through highway toll stations to enter the highway. Car navigation often directly guides vehicles to the nearest toll station to enter the highway. However, since there are obviously more vehicles in the urban area, more vehicles will be guided to the toll stations in the urban area, which will cause congestion at the toll stations in the urban area, resulting in too long waiting time for vehicles at the corresponding toll stations to enter the highway. In this regard, the existing technology obtains the number of waiting vehicles at each toll station and then guides the car to the toll station with fewer waiting vehicles. However, this method only takes into account the congestion level of the toll station, but does not take into account the time required for the vehicle to reach the toll station from the current location, and the potential increase in driving time after entering the highway from the toll station, which may cause the vehicle to take longer to reach the destination from the current location, affecting the vehicle's travel efficiency. Summary of the invention

[0004] In view of this, an embodiment of the present application provides a traffic congestion intelligent control method, terminal device and storage medium, which can solve the above technical problems.

[0005] A first aspect of an embodiment of the present application provides a traffic congestion intelligent control method, the traffic congestion intelligent control method comprising:

[0006] S1: when a first signal of a vehicle is received, the vehicle corresponding to the first signal is taken as a target vehicle, and the nearest toll station of the target vehicle is determined, wherein the first signal is a signal indicating that the target vehicle is about to enter a highway, and the first signal includes a destination of the target vehicle;

[0007] S2: Determine the corresponding en route toll station for the target vehicle according to the current position and destination of the target vehicle, wherein the en route toll station is the highway toll station that the target vehicle will pass through when entering the highway from the nearest toll station and driving toward the destination, and furthermore, the distance between the en route toll station and the nearest toll station is within the set distance;

[0008] S3: taking the nearest toll station and all toll stations on the way as candidate toll stations, and determining the time taken for the target vehicle to reach each candidate toll station from the current position;

[0009] S4: Determine the queuing congestion levels of each alternative toll station, and then respectively determine the waiting time consumed by the target vehicle when arriving at each alternative toll station.

[0010] S5: Respectively determine the time consumed by the target vehicle from each other alternative toll station to the last alternative toll station.

[0011] S6: Select an alternative toll station, and determine the total time consumed for the vehicle to travel from the current location through this alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumption. Repeat this step to obtain the total time consumption corresponding to each alternative toll station, where the farthest alternative toll station is the toll station on the same route that is the farthest from the nearest toll station.

[0012] S7: Select the alternative toll station with the shortest corresponding total time consumption as the target toll station, and send the target toll station to the target vehicle to guide the target vehicle to enter the highway through the target toll station.

[0013] The second aspect of the embodiments of the present application provides a terminal device, including a memory and a processor. A computer program is stored in the memory. When the computer program is executed by the processor, the processor executes the steps of the intelligent traffic congestion control method.

[0014] The third aspect of the embodiments of the present application provides a terminal-readable storage medium. A computer program is stored on the terminal-readable storage medium. When the computer program is executed by the processor, the processor executes the steps of the intelligent traffic congestion control method.

[0015] The beneficial effects of the embodiments of the present application compared with the prior art are as follows: The method provided by the present invention includes: when receiving a first signal of a vehicle, regarding the vehicle corresponding to the first signal as a target vehicle, and determining the nearest toll station of the target vehicle; determining the convenient toll stations corresponding to the target vehicle according to the current position and the destination of the target vehicle; regarding the nearest toll station and each convenient toll station as alternative toll stations, and respectively determining the time consumption for the target vehicle to reach each alternative toll station from the current position; determining the queuing congestion degree of each alternative toll station, and further respectively determining the time consumption for waiting when the target vehicle arrives at each alternative toll station; respectively determining the time consumption for the target vehicle to travel from each other alternative toll station to the last alternative toll station; selecting an alternative toll station, and determining the total time consumption for the vehicle to travel from the current position through this alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumption, and repeating this step to obtain the total time consumption corresponding to each alternative toll station; selecting the alternative toll station with the shortest corresponding total time consumption as the target toll station, and sending the target toll station to the target vehicle to guide the target vehicle to enter the highway through the target toll station; in the present application, it is possible to avoid guiding a large number of vehicles to the same toll station to enter the highway, realizing the diversion of the traffic flow at the toll station, and effectively alleviating the congestion at the toll station; and when diverting the vehicles, time factors such as the time consumption of the vehicle when traveling to the toll station, the waiting time consumption at the toll station, and the traveling time consumption when entering the highway through the toll station are comprehensively considered to determine the target toll station, so that the time consumption for the target vehicle to enter the highway through the target toll station and travel to the destination is the shortest, that is, when realizing the diversion of the toll station, the driving efficiency of the target vehicle to reach the destination can be ensured as much as possible. BRIEF DESCRIPTION OF THE DRAWINGS

[0016] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings required for use in the embodiments or the description of the prior art. Obviously, the drawings in the following description are only some embodiments of the present application. For those of ordinary skill in the art, without creative efforts, other drawings can be obtained according to these drawings.

[0017] Figure 1 It is a schematic flowchart of the implementation of the intelligent traffic congestion control method provided by the embodiments of the present application;

[0018] Figure 2 It is a schematic diagram of the implementation environment of the intelligent traffic congestion control method provided by the embodiments of the present application;

[0019] Figure 3 It is a schematic diagram of the convenient toll stations of the intelligent traffic congestion control method provided by the embodiments of the present application;

[0020] Figure 4 It is a schematic diagram of a terminal device provided by an embodiment of the present application. Detailed implementation manners

[0021] In the following description, for the purpose of illustration rather than limitation, specific details such as specific system architectures and technologies are presented to thoroughly understand the embodiments of the present application. However, those skilled in the art should understand that the present application can also be implemented in other embodiments without these specific details. In other cases, detailed descriptions of well-known systems, devices, circuits, and methods are omitted to avoid unnecessary details from interfering with the description of the present application.

[0022] To illustrate the technical solutions described in the present application, the following will be described through specific embodiments.

[0023] Figure 1 A traffic congestion intelligent control method provided by Embodiment 1 of the present application is shown. The traffic congestion intelligent control method includes:

[0024] S1: When a first signal of a vehicle is received, the vehicle corresponding to the first signal is used as a target vehicle, and the nearest toll station of the target vehicle is determined. Wherein, the first signal is a signal indicating that the target vehicle is about to enter the highway, and the first signal includes the destination of the target vehicle;

[0025] S2: Determine the convenient toll stations corresponding to the target vehicle according to the current position and destination of the target vehicle. Wherein, the convenient toll stations are the highway toll stations that the target vehicle will pass through during the process of entering the highway from the nearest toll station and driving towards the destination. Moreover, the distance between the convenient toll stations and the nearest toll station is within a set distance;

[0026] S3: Use the nearest toll station and each convenient toll station as alternative toll stations, and respectively determine the time consumption for the target vehicle to reach each alternative toll station from the current position;

[0027] S4: Determine the queuing congestion degree of each alternative toll station, and then respectively determine the time consumption for waiting when the target vehicle reaches each alternative toll station;

[0028] S5: Respectively determine the time consumption for the target vehicle to travel from each other alternative toll station to the last alternative toll station;

[0029] S6: Select an alternative toll station, and determine the total time consumption for the vehicle to travel from the current position through this alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumption. Repeat this step to obtain the total time consumption corresponding to each alternative toll station. Wherein, the farthest alternative toll station is the convenient toll station with the farthest distance from the nearest toll station;

[0030] S7: Select the alternative toll station with the shortest total elapsed time as the target toll station, and send the target toll station to the target vehicle to guide the target vehicle to enter the highway through the target toll station.

[0031] In this embodiment, as Figure 2 shown, this method is executed in the terminal device. The terminal device can be an independent physical server or terminal, or a server cluster composed of multiple physical servers. It can be a cloud server that provides basic cloud computing services such as cloud servers, cloud databases, cloud storage, and CDN. A vehicle terminal (such as a vehicle processor) is installed in each vehicle and communicates with the terminal device through the vehicle terminal. Cameras are installed in each highway toll station, and the cameras communicate with the terminal device. The images collected by the cameras can be transmitted to the terminal device, enabling the terminal device to determine the queuing congestion degree of the highway toll station based on the images.

[0032] In this embodiment, this method can be executed for each vehicle that emits the first signal. Since highways often pass through multiple urban areas and the suburbs between multiple urban areas, the queuing congestion levels of each toll station show a periodic distribution along the highway (that is, the congestion degree is high in urban areas and low in suburbs, repeating in this cycle), that is, the distribution of the congestion degree of the toll stations in each cycle is roughly the same. Therefore, by setting a set distance (such as 10 km), the determined target toll station in this cycle can be made such that the target vehicle does not need to travel too much in the previous sequence before entering the target toll station.

[0033] In this embodiment, as Figure 3 shown, using the convenient toll station as the alternative toll station avoids selecting a target toll station far from its destination. When the target toll station is a convenient toll station, during the process of the target vehicle traveling to the target toll station, it is actually approaching the destination (the difference is only whether it is approaching on the highway or on the road below the highway), that is, it will not additionally increase the driving distance on the highway and can shorten the time it takes to reach the destination.

[0034] In this embodiment, no matter which alternative toll station is selected as the target toll station, it will ultimately pass through the last alternative toll station. That is, no matter which alternative toll station the target vehicle enters the highway from, the distance from the last alternative toll station to the destination is the same for the target vehicle, and the corresponding elapsed time can be regarded as roughly the same. Therefore, the time it takes for the target vehicle to travel from the current position to the destination mainly depends on the time it takes to travel from the current position to the last alternative toll station, that is, the total elapsed time. Therefore, selecting the toll station with the shortest corresponding total elapsed time as the target toll station can minimize the total time it takes for the target vehicle to reach the destination.

[0035] In this application, it is possible to avoid guiding a large number of vehicles to the same toll station to enter the highway, achieving the diversion of the traffic flow at the toll station, and effectively alleviating the congestion at the toll station. Moreover, when diverting the vehicles, time factors such as the time taken for the vehicle to travel to the toll station, the waiting time at the toll station, and the traveling time to enter the highway through the toll station are comprehensively considered to determine the target toll station, so that the time taken for the target vehicle to enter the highway through the target toll station and travel to the destination is the shortest, that is, when the diversion of the toll station is achieved, the driving efficiency of the target vehicle to reach the destination can be guaranteed as much as possible.

[0036] As a preferred embodiment, determining the time taken for the target vehicle to reach each alternative toll station respectively includes:

[0037] S31: For each alternative toll station, generate several navigation routes based on the traffic congestion degree from the current position of the target vehicle to the alternative toll station and the corresponding time taken.

[0038] S32: Select the navigation route with the shortest corresponding time taken as the first navigation route, and determine the time taken for the target vehicle to reach the alternative toll station from the current position as the time taken.

[0039] The queuing congestion degree is characterized by the number of waiting vehicles in the waiting area of the toll station. The more the number of waiting vehicles, the higher the queuing congestion degree. Determining the queuing congestion degree of each alternative toll station, and then respectively determining the time taken for the target vehicle to wait when reaching each alternative toll station includes:

[0040] S41: For each alternative toll station, obtain the image of the waiting area of the alternative toll station, and then determine the current number of waiting vehicles in the waiting area based on the image.

[0041] S42: Determine the average number of vehicles passing through the alternative toll station per unit time according to historical data.

[0042] S43: Retrieve the time taken for the target vehicle to reach the alternative toll station from the current position, multiply the time taken by the average number of vehicles passing through the station to obtain the first quantity.

[0043] S44: Determine the remaining time for all other vehicles being guided to the alternative toll station to reach the alternative toll station.

[0044] S45: Screen out the remaining time less than the time taken for the target vehicle, and count the number of other vehicles corresponding to the screened remaining time to obtain the second quantity.

[0045] S46: Calculate the number of waiting vehicles at the alternative toll station when the target vehicle reaches the alternative toll station through the following formula:

[0046]

[0047] Among them, is the number of waiting vehicles at the alternative toll station when the target vehicle arrives at the alternative toll station, is the current number of waiting vehicles at the alternative toll station, is the first quantity, is the second quantity;

[0048] Divide the obtained number of waiting vehicles by the average number of vehicles passing through the station to obtain the waiting time consumed when the target vehicle arrives at the alternative toll station.

[0049] In this embodiment, the navigation route and the corresponding time consumption can be generated by existing navigation software. The navigation route generated by the existing navigation software takes into account the traffic congestion degree of each section of the route (for example, sections with high congestion degree will be displayed in red), and the generated time consumption also takes into account the time consumption in case of congestion;

[0050] In this embodiment, by performing image analysis on the images collected by the cameras at the toll station, the number of currently waiting vehicles in the images can be determined; since the terminal device guides other vehicles while guiding the target vehicle, to determine the number of waiting vehicles at a toll station when the target vehicle arrives at the toll station, that is, it is necessary to add the number of vehicles that arrived at the toll station before the target vehicle (that is, the vehicles with the corresponding remaining time less than the time consumption of the target vehicle from the current position to the alternative toll station) to the current number of waiting vehicles at the toll station, and then subtract the number of vehicles that entered the highway through the toll station during the time period from the current position of the target vehicle to the alternative toll station; among them, the remaining time can also be determined by generating the navigation route (selecting the navigation route with the shortest time consumption) for the vehicle to reach the toll station based on its real-time position;

[0051] In this embodiment, the historical data is the number of vehicles passing through the toll station in multiple historical time periods in the most recent period (such as the most recent month) (which can be determined by the historical images collected by the camera). For each historical time period, the total number of vehicles passing through the toll station in the historical time period can be divided by the duration of the historical time period to obtain the average number of vehicles passing through the station in the historical time period. By taking the average of the average number of vehicles passing through the station in each historical time period, the average number of vehicles passing through the alternative toll station per unit time can be obtained;

[0052] As a preferred embodiment, determining the time consumption of the target vehicle from each other alternative toll station to the last alternative toll station respectively includes:

[0053] For each of the other alternative toll stations, determine the time point when the target vehicle enters the highway through the alternative toll station;

[0054] Determine the vehicle density of the local section where the target vehicle is located when it enters the highway from the alternative toll station at this time point, and determine the initial moving speed of the target vehicle when it enters the highway based on this vehicle density;

[0055] Simulate the movement of the target vehicle at the initial moving speed, and during the simulation movement, update the vehicle density of the local section where the target vehicle is located, and adjust the moving speed of the target vehicle accordingly until the vehicle is simulated to move to the last alternative toll station;

[0056] Statistically calculate the simulation duration corresponding to the simulated movement of the target vehicle, that is, obtain the time consumption of the target vehicle from this alternative toll station to the last alternative toll station.

[0057] Determine the initial moving speed of the target vehicle when it enters the highway based on this vehicle density, that is, determine the initial moving speed of the target vehicle when it enters the highway based on the vehicle density of the local section where the target vehicle is located when it enters the highway and the vehicle density - vehicle speed comparison table. Among them, the vehicle density - vehicle speed comparison table includes each vehicle density from large to small and the vehicle speed at which the vehicle can safely travel at this vehicle density;

[0058] Updating the vehicle density of the local section where the target vehicle is located and adjusting the moving speed of the target vehicle accordingly includes:

[0059] During the process of any alternative toll station being passed by the local section where the target vehicle is located, use this alternative toll station as the current toll station;

[0060] Determine the time point when the local section where the target vehicle is located reaches the current toll station and the time point when the local section where the target vehicle is located leaves the current toll station, and then determine the time interval between the two time points;

[0061] Determine the vehicle density before the local section reaches the current toll station, and then obtain the number of vehicles in the local section before reaching the current toll station, that is, the third quantity;

[0062] Determine the number of vehicles leaving the highway and the number of vehicles entering the highway in the local section during this time interval, and subtract the number of vehicles leaving the highway from the number of vehicles entering the highway to obtain the net inflow quantity;

[0063] Add the third quantity to the net inflow quantity to obtain the new number of vehicles in the local section, and then obtain the new vehicle density;

[0064] Determine a new moving speed according to the new traffic flow density, and simulate the movement of the target vehicle from the current toll station to the next alternative toll station at the new moving speed.

[0065] Determining the number of vehicles leaving the highway from the current toll station and the number of vehicles entering the highway in this local section during this time interval includes:

[0066] For each vehicle in this local section, determine the highway toll station corresponding to the destination of the vehicle, and judge whether this highway toll station is the current toll station. If so, the vehicle is a vehicle leaving the highway from the current toll station; otherwise, the vehicle is not a vehicle leaving the highway from the current toll station;

[0067] Count the number of vehicles leaving the highway from the current toll station;

[0068] Obtain the average number of vehicles passing through the current toll station per unit time, and multiply the average number of vehicles passing through by the duration corresponding to the time interval to obtain the number of vehicles entering the highway from the current toll station;

[0069] Statistical simulation duration corresponding to the simulated movement of the target vehicle includes:

[0070] Determine the length and moving speed of the target vehicle passing through each sub-section during the simulated movement;

[0071] For each sub-section, divide the length of the sub-section by the corresponding moving speed to obtain the sub-duration;

[0072] Accumulate the sub-durations to obtain the simulation duration.

[0073] In this embodiment, adding the current time point to the consumption duration for the target vehicle to reach this alternative toll station and the consumption duration of waiting at this alternative toll station can obtain the time point when the target vehicle enters the highway through this alternative toll station;

[0074] In this embodiment, the local section is a section extending forward from the position where the target vehicle is located by a set length (such as 100 meters). The scope of the local section includes the entire highway pavement within this set length (only taking the highway pavement where the allowed driving direction is the same as the driving direction of the target vehicle); the vehicle density is the number of vehicles corresponding to the local section per unit length, which can be obtained by dividing the total number of vehicles in the local section by the set length;

[0075] In this embodiment, the terminal device can generate a map including highways, toll stations, and the areas surrounding the highways, and generate identification points representing the target vehicle on the map, so as to simulate the movement of the target vehicle by simulating the movement of the identification points; the vehicle density - vehicle speed comparison table is a preset comparison table, and the safe driving speed corresponding to the vehicle density of the local section where the target vehicle is located is found through this comparison table, and the determined vehicle speed is the movement speed of the simulation movement to be determined; during the simulation process, the local section moves with the movement of the target vehicle. During the process of the local section passing through a toll station (that is, from the front end of the local section starting to pass through the toll station to the process where the local section completely passes through the toll station at the rear end), some vehicles often leave the highway, and new vehicles enter the highway from the toll station and merge into the local section. Therefore, the vehicle density of the local section changes, resulting in a change in the movement speed. Therefore, it is necessary to update the vehicle density of the local section where the target vehicle is located and adjust the movement speed of the target vehicle accordingly (when the local section completely passes through the toll station, the movement simulation is carried out at the new movement speed) to ensure the accuracy of the simulation;

[0076] In this embodiment, the sub - section is the section between two adjacent alternative toll stations, and the length of the sub - section can be identified in the generated map. Since the movement speed of the target vehicle during the simulation movement in each sub - section is available, the time consumption of the target vehicle in each sub - section, that is, the sub - time, can be obtained; as can be seen from the foregoing, the time point when the target vehicle enters the highway can be obtained; therefore, the time point when the local section where the target vehicle is located leaves the current toll station can be obtained (by adding the time point when entering the highway and the sub - time corresponding to each sub - section in front of the current toll station). Further, subtracting the time duration for the local section to pass through the toll station (that is, the time duration obtained by dividing the set length by the corresponding movement speed) from the time point when the local section leaves the current toll station can obtain the time point when the local section arrives at the current toll station, and then the time interval can be obtained;

[0077] In this embodiment, for the initial vehicle density, i.e., the vehicle density of the local section where the target vehicle enters the highway at the time point, it can be obtained through prior simulation. That is, obtain the positions of all other vehicles on the highway before the selected alternative toll station, mark each other vehicle on the map, and then simultaneously perform simulated displacement on the marked position points (the way of simulated displacement is the same as that of the target vehicle). The simulation time period is from the current time point to the time point when the target vehicle enters the highway. Furthermore, for vehicles that have not entered the highway but will enter the highway within the simulation time period (as known from the above, the time consumption for each vehicle to be guided into the highway is known, and thus the time point when it enters the highway can be determined), determine the time points when these vehicles enter the highway and the toll stations, generate corresponding marked points at the positions of the highways corresponding to the toll stations at the corresponding time points, and perform simulated movement on these marked points in the same way. At the time point when the target vehicle enters the highway, identify the number of marked points in the local section where the target vehicle is located, and the vehicle density in the local section where the target vehicle is located at this time point can be obtained.

[0078] As a preferred embodiment, select an alternative toll station. The total time consumption for the vehicle to travel from the current position to the position on the highway corresponding to the farthest alternative toll station through this alternative toll station determined according to the determined time consumption includes:

[0079] Retrieve the time consumption for the target vehicle to reach this alternative toll station from the current position, the time consumption for the target vehicle to wait at this alternative toll station, and the time consumption for the target vehicle to travel from this alternative toll station to the last alternative toll station;

[0080] Accumulate the three retrieved time consumptions, and the total time consumption can be obtained;

[0081] In step S7, if the time difference between the two shortest total time consumptions is less than the set value, the target vehicle is also guided through the following steps:

[0082] Respectively determine the alternative toll stations corresponding to the two total time consumptions;

[0083] For each determined alternative toll station, identify the driving route of the target vehicle from passing through this alternative toll station to the position on the highway where the farthest alternative toll station is located;

[0084] Identify the power type of the target vehicle to determine the real-time price of the corresponding energy;

[0085] Determine the unit mileage energy consumption of the target vehicle to determine the total energy consumption for the target vehicle to complete this driving route, and then determine the energy consumption cost for the target vehicle to travel on this driving route based on the total energy consumption and the real-time price;

[0086] Identify the length of the highway section in the driving route, obtain the cost per unit length of the highway, and then multiply the length of the highway section by the cost per unit length to obtain the highway toll for this highway section;

[0087] Add the obtained energy consumption cost to the highway toll to get the total cost corresponding to this driving route;

[0088] Take the driving route passing through the alternative toll station with the shortest total elapsed time as the first driving route, take the driving route passing through the alternative toll station with the second shortest total elapsed time as the second driving route, and determine whether the total cost corresponding to the first driving route is lower than the total cost corresponding to the second driving route;

[0089] If so, take the alternative toll station with the shortest total elapsed time as the target toll station, and send the target toll station and the first driving route to the target vehicle to guide the target vehicle to travel along the first driving route;

[0090] If not, calculate the amount of money saved per unit time corresponding to the first driving route, and send the amount of money saved per unit time to the target vehicle for the driver of the target vehicle to select a driving route based on the amount of money saved per unit time;

[0091] When receiving the driving route selected by the driver transmitted back by the target vehicle, send the corresponding driving route to the target vehicle to guide the target vehicle to travel along this driving route.

[0092] Calculate the amount of money saved per unit time corresponding to the first driving route through the following formula:

[0093]

[0094] where M is the amount of money saved per unit time, is the total cost corresponding to the first driving route, is the total cost corresponding to the second driving route, is the time difference between the two shortest total elapsed times.

[0095] In this embodiment, the power type can be electric and motorized, and the corresponding energy sources are electric energy and gasoline respectively. The real-time prices of the energy sources can be obtained on the Internet. The vehicle terminal of the target vehicle will determine the energy consumption per unit mileage according to historical energy consumption records, and the terminal device can directly obtain the energy consumption per unit mileage from the vehicle terminal. The set value can be 2 minutes, 3 minutes or other values, which are not limited here. Since the distances of the routes to get on the highway at different toll stations are different, and the lengths of the highway sections passed are also different, the resulting energy costs and highway tolls are also different. In the case of similar total consumption durations, the driver will consider the cost performance more. In this embodiment, it is possible to respectively identify the driving routes of the two alternative toll stations with the shortest total consumption duration (that is, the route from the current position to the alternative toll station plus the route from this alternative toll station to the last alternative toll station), and calculate the total costs of the two driving routes respectively. When the total cost of the driving route with a slightly longer total consumption duration is lower than that of the other driving route, calculate the amount of savings per unit time (that is, representing the cost performance), and send this amount to the target vehicle, so that the driver can intuitively determine whether he is satisfied with this cost performance, and thus select one of the two driving routes to proceed.

[0096] An end device provided in the second embodiment of the present application includes a memory and a processor. A computer program is stored in the memory. When the computer program is executed by the processor, the processor executes the steps of the intelligent traffic congestion control method, which specifically includes:

[0097] S1: When receiving the first signal of the vehicle, use the vehicle corresponding to the first signal as the target vehicle, and determine the nearest toll station of the target vehicle. Among them, the first signal is a signal indicating that the target vehicle is about to enter the highway, and the first signal includes the destination of the target vehicle.

[0098] S2: Determine the convenient toll stations corresponding to the target vehicle according to the current position and destination of the target vehicle. Among them, the convenient toll stations are the highway toll stations that the target vehicle will pass through when getting on the highway from the nearest toll station and driving towards the destination. Moreover, the distance between the convenient toll stations and the nearest toll station is within the set distance.

[0099] S3: Use the nearest toll station and each convenient toll station as alternative toll stations, and respectively determine the consumption durations for the target vehicle to reach each alternative toll station from the current position.

[0100] S4: Determine the queue congestion degrees of each alternative toll station, and then respectively determine the consumption durations for waiting when the target vehicle arrives at each alternative toll station.

[0101] S5: Respectively determine the consumption durations for the target vehicle to travel from each other alternative toll station to the last alternative toll station.

[0102] S6: Select an alternative toll station, and determine the total elapsed time for the vehicle to travel from the current location to the location on the highway corresponding to the farthest alternative toll station via this alternative toll station according to the determined elapsed time. Repeat this step to obtain the total elapsed time corresponding to each alternative toll station, where the farthest alternative toll station is the toll station on the same route that is the farthest from the nearest toll station;

[0103] S7: Select the alternative toll station with the shortest corresponding total elapsed time as the target toll station, and send the target toll station to the target vehicle to guide the target vehicle to enter the highway through the target toll station.

[0104] A terminal-readable storage medium provided in the third embodiment of the present application, on which a computer program is stored. When the computer program is executed by a processor, the processor is caused to execute the steps of the intelligent traffic congestion control method, specifically including:

[0105] S1: When receiving the first signal of the vehicle, use the vehicle corresponding to the first signal as the target vehicle, and determine the nearest toll station of the target vehicle, where the first signal is a signal indicating that the target vehicle is about to enter the highway, and the first signal includes the destination of the target vehicle;

[0106] S2: Determine the toll stations on the same route corresponding to the target vehicle according to the current location and destination of the target vehicle, where the toll stations on the same route are the highway toll stations that the target vehicle will pass through when entering the highway from the nearest toll station and driving towards the destination. Moreover, the distance between the toll stations on the same route and the nearest toll station is within the set distance;

[0107] S3: Use the nearest toll station and each toll station on the same route as alternative toll stations, and respectively determine the elapsed time for the target vehicle to reach each alternative toll station from the current location;

[0108] S4: Determine the queue congestion degree of each alternative toll station, and then respectively determine the elapsed time for the target vehicle to wait when reaching each alternative toll station;

[0109] S5: Respectively determine the elapsed time for the target vehicle to travel from each other alternative toll station to the last alternative toll station;

[0110] S6: Select an alternative toll station, and determine the total elapsed time for the vehicle to travel from the current location to the location on the highway corresponding to the farthest alternative toll station via this alternative toll station according to the determined elapsed time. Repeat this step to obtain the total elapsed time corresponding to each alternative toll station, where the farthest alternative toll station is the toll station on the same route that is the farthest from the nearest toll station;

[0111] S7: Select the alternative toll station with the shortest total elapsed time as the target toll station, and send the target toll station to the target vehicle to guide the target vehicle to enter the highway through the target toll station.

[0112] It should be understood that the magnitudes of the sequence numbers of the steps in the above embodiments do not imply the order of execution. The order of execution of each process should be determined according to its function and internal logic, and should not constitute any limitation to the implementation process of the embodiments of the present application.

[0113] It should be understood that when used in the specification of the present application, the term "comprising" indicates the presence of the described features, wholes, steps, operations, elements and / or components, but does not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components and / or their combinations.

[0114] It should also be understood that the term "and / or" used in the specification of the present application refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations.

[0115] As used in the specification of the present application, the term "if" can be interpreted as "when", "once", "in response to determining", or "in response to detecting" according to the context. Similarly, the phrase "if determined" or "if detecting [the described condition or event]" can be interpreted as meaning "once determined", "in response to determining", "once detecting [the described condition or event]", or "in response to detecting [the described condition or event]" according to the context.

[0116] In addition, in the description of the specification of the present application, the terms "first", "second", "third", etc. are only used for distinguishing descriptions and should not be construed as indicating or implying relative importance. It should also be understood that although the terms "first", "second", etc. are used in the text in some embodiments of the present application to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, the first table can be named the second table, and similarly, the second table can be named the first table, without departing from the scope of the various described embodiments. The first table and the second table are both tables, but they are not the same table.

[0117] Reference to "one embodiment" or "some embodiments" etc. described in the specification of this application means that a specific feature, structure or characteristic described in connection with the embodiment is included in one or more embodiments of this application. Thus, statements such as "in one embodiment", "in some embodiments", "in other some embodiments", "in still other embodiments" etc. that appear in different places in this specification do not necessarily all refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "comprising", "including", "having" and their variants all mean "including but not limited to", unless otherwise specifically emphasized in other ways.

[0118] The intelligent traffic congestion control method provided by the embodiments of this application can be applied to terminal devices such as mobile phones, tablet computers, wearable devices, in-vehicle devices, augmented reality (AR) / virtual reality (VR) devices, laptop computers, ultra-mobile personal computers (UMPCs), netbooks, personal digital assistants (PDAs), etc. The embodiments of this application do not impose any restrictions on the specific types of terminal devices.

[0119] For example, the terminal device can be a station (STAION, ST) in a WLAN, can be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA) device, a handheld device with wireless communication function, a computing device or other processing devices connected to a wireless modem, an in-vehicle device, a vehicle networking terminal, a computer, a laptop computer, a handheld communication device, a handheld computing device, a satellite wireless device, a wireless modem card, a television set top box (set top box, STB), a customer premise equipment (CPE), and / or other devices for communicating on a wireless system, and a next-generation communication system, for example, a mobile terminal in a 5G network or a mobile terminal in a future evolved Public Land Mobile Network (PLMN) network, etc.

[0120] By way of example and not limitation, when the terminal device is a wearable device, the wearable device can also be a general term for devices developed by applying wearable technology to the intelligent design of daily wear, such as glasses, gloves, watches, clothing, shoes, etc. A wearable device is a portable device that is either worn directly on the body or integrated into the user's clothing or accessories. A wearable device is not just a hardware device, but also realizes powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable intelligent devices include those with complete functions and large sizes that can realize complete or partial functions without relying on a smart phone, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to cooperate with other devices such as smart phones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0121] Figure 4 FIG. 4 is a schematic structural diagram of a terminal device provided by an embodiment of the present application. As Figure 4 shown, the terminal device of this embodiment includes: at least one processor ( Figure 4 only one is shown in FIG. 4), a memory, and a computer program that can run on the processor is stored in the memory. When the processor executes the computer program, the steps in the embodiments of the above various traffic congestion intelligent control methods are implemented, for example Figure 1 the steps S1 to S7 shown in FIG. 5.

[0122] The terminal device can be a computing device such as a desktop computer, a notebook, a palm computer, and a cloud server. The terminal device may include, but is not limited to, a processor and a memory. Those skilled in the art can understand that Figure 4 FIG. 4 is only an example of the terminal device and does not constitute a limitation on the terminal device. It may include more or fewer components than shown in the figure, or combine certain components, or different components. For example, the terminal device may further include an input and sending device, a network access device, a bus, etc.

[0123] The so-called processor may be a central processing unit (CPU), or may also be other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), off-the-shelf programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor, etc.

[0124] The memory may be an internal storage unit of the terminal device in some embodiments, such as the hard disk or memory of the terminal device. The memory may also be an external storage device of the terminal device, such as a plug-in hard disk equipped on the terminal device, a Smart Media Card (SMC), a Secure Digital (SD) card, a Flash Card, etc. Further, the memory may also include both the internal storage unit and the external storage device of the terminal device. The memory is used to store an operating system, application programs, a BootLoader, data, and other programs, such as the program code of the computer program, etc. The memory may also be used to temporarily store data that has been sent or will be sent.

[0125] In addition, in each embodiment of the present application, each functional unit may be integrated in a processing unit, may exist separately physically for each unit, or two or more units may be integrated in one unit. The above-mentioned integrated units may be implemented in the form of hardware or in the form of software functional units.

[0126] The embodiments of the present application provide a computer program product. When the computer program product runs on a mobile terminal device, the mobile terminal device can be enabled to execute and implement the steps in the above-mentioned various method embodiments.

[0127] If the above-mentioned integrated module / unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on such an understanding, to implement all or part of the processes in the above-mentioned embodiment methods of the present application, it can also be completed by instructing relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. When the computer program is executed by a processor, the steps in the above-mentioned various method embodiments can be implemented. Among them, the computer program includes computer program code, and the computer program code can be in the form of source code, object code, an executable file, or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, a recording medium, a USB flash drive, a mobile hard disk, a magnetic disk, an optical disc, a computer memory, a Read-Only Memory (ROM), a Random Access Memory (RAM), an electrical carrier signal, a telecommunication signal, and a software distribution medium, etc.

[0128] In the above embodiments, the descriptions of the various embodiments have their own emphases. For parts not detailed or recorded in a certain embodiment, reference may be made to the relevant descriptions of other embodiments.

[0129] Those of ordinary skill in the art will appreciate that the units and algorithm steps of the examples described in connection with the embodiments disclosed herein can be implemented in electronic hardware, or in a combination of computer software and electronic hardware. Whether these functions are executed in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods for each specific application to implement the described functions, but such implementation should not be considered to exceed the scope of this application.

[0130] The units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or may be distributed over multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0131] The above-described embodiments are only used to illustrate the technical solutions of this application, and are not intended to limit them; although this application has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions recorded in the foregoing embodiments, or perform equivalent replacements for some of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the spirit and scope of the technical solutions of the embodiments of this application, and should all be included in the protection scope of this application.

Claims

1. An intelligent control method for traffic congestion, characterized in that, The intelligent traffic congestion control method includes: S1: When receiving the first signal of a vehicle, taking the vehicle corresponding to the first signal as the target vehicle and determining the nearest toll station of the target vehicle. Herein, the first signal is a signal indicating that the target vehicle is about to enter the highway, and the destination of the target vehicle is included in the first signal. S2: Determining the toll stations on the way of the target vehicle according to the current position and destination of the target vehicle. The toll stations on the way are the highway toll stations that the target vehicle will pass through when getting on the highway from the nearest toll station and driving towards the destination. Moreover, the distance between the toll stations on the way and the nearest toll station is within the set distance. S3: Taking the nearest toll station and each toll station on the way as alternative toll stations and respectively determining the time consumption for the target vehicle to reach each alternative toll station from the current position. S4: Determining the queuing congestion degree of each alternative toll station, and then respectively determining the time consumption for the target vehicle to wait when reaching each alternative toll station. S5: Respectively determining the time consumption for the target vehicle to travel from each other alternative toll station to the last alternative toll station. S6: Selecting an alternative toll station and determining the total time consumption for the vehicle to travel from the current position through this alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumption. Repeating this step to obtain the total time consumption corresponding to each alternative toll station. Herein, the farthest alternative toll station is the toll station on the way that is the farthest from the nearest toll station. S7: Taking the alternative toll station with the shortest corresponding total time consumption as the target toll station and sending the target toll station to the target vehicle to guide the target vehicle to get on the highway through the target toll station.

2. The method according to claim 1, wherein Respectively determining the time consumption for the target vehicle to reach each alternative toll station from the current position includes: S31: For each alternative toll station, generating several navigation routes based on the traffic congestion degree from the current position of the target vehicle to this alternative toll station and the corresponding time consumption. S32: Selecting the navigation route with the shortest corresponding time consumption as the first navigation route and determining this time consumption as the time consumption for the target vehicle to reach the alternative toll station from the current position.

3. The method according to claim 2, wherein The queuing congestion degree is characterized by the number of waiting vehicles in the waiting area of the toll station. The more the number of waiting vehicles, the higher the queuing congestion degree. Determining the queuing congestion degree of each alternative toll station, and then respectively determining the time consumption for the target vehicle to wait when reaching each alternative toll station includes: S41: For each alternative toll station, obtaining the image of the waiting area of this alternative toll station and then determining the current number of waiting vehicles in the waiting area according to this image. S42: Determining the average number of vehicles passing through this alternative toll station per unit time according to the historical data. S43: Retrieving the time consumption for the target vehicle to reach this alternative toll station from the current position, multiplying this time consumption by the average number of vehicles passing through, and obtaining the first number. S44: Determining the remaining time for all other vehicles being guided to this alternative toll station to reach this alternative toll station. S45: Screen out the remaining time less than the time it takes for the target vehicle to reach the alternative toll station from the current position, and count the number of other vehicles corresponding to the screened remaining time to obtain the second quantity; S46: Calculate the number of waiting vehicles at the alternative toll station when the target vehicle reaches the alternative toll station through the following formula: Among them, is the number of waiting vehicles at the alternative toll station when the target vehicle arrives at the alternative toll station, is the current number of waiting vehicles at the alternative toll station, is the first quantity, is the second quantity; Divide the obtained number of waiting vehicles by the average number of vehicles passing through the station to obtain the time consumed for waiting in the case where the target vehicle reaches the alternative toll station.

4. The method according to claim 3, characterized in that Determine respectively the time it takes for the target vehicle to reach the last alternative toll station from each other alternative toll station, including: For each other alternative toll station, determine the time point when the target vehicle enters the expressway through the alternative toll station; Determine the vehicle density of the local section where the target vehicle is located when entering the expressway at this time point, and determine the initial moving speed of the target vehicle entering the expressway based on the vehicle density; Simulate the movement of the target vehicle at the initial moving speed, and during the simulation movement, update the vehicle density of the local section where the target vehicle is located and adjust the moving speed of the target vehicle accordingly until the vehicle is simulated to move to the last alternative toll station; Count the simulation duration corresponding to the simulated movement of the target vehicle, that is, obtain the time it takes for the target vehicle to reach the last alternative toll station from the alternative toll station.

5. The method according to claim 4, wherein Determine the initial moving speed of the target vehicle entering the expressway based on the vehicle density, that is, determine the initial moving speed of the target vehicle entering the expressway based on the vehicle density of the local section where the target vehicle is located when entering the expressway and the vehicle density - vehicle speed comparison table. The vehicle density - vehicle speed comparison table includes each vehicle density from large to small and the vehicle speed at which the vehicle can safely travel at this vehicle density; Update the vehicle density of the local section where the target vehicle is located and adjust the moving speed of the target vehicle accordingly, including: During the process of any alternative toll station being passed through in the local section where the target vehicle is located, regard the alternative toll station as the current toll station; Determine the time point when the local section where the target vehicle is located reaches the current toll station and the time point when the local section where the target vehicle is located leaves the current toll station, and then determine the time interval between the two time points; Determine the vehicle density before the local section reaches the current toll station, and then obtain the number of vehicles in the local section before reaching the current toll station, that is, the third quantity; Determine the number of vehicles leaving the expressway and the number of vehicles entering the expressway in the local section during this time interval, and subtract the number of vehicles leaving the expressway from the number of vehicles entering the expressway to obtain the net inflow quantity; Add the third quantity to the net inflow quantity to obtain the new number of vehicles in the local section, and then obtain the new vehicle density; Determine the new moving speed based on the new traffic flow density, and simulate the movement of the target vehicle from the current toll station to the next alternative toll station at the new moving speed.

6. The method according to claim 5, wherein Determine the number of vehicles leaving the expressway and the number of vehicles entering the expressway in the local section during this time interval, including: For each vehicle in this local road section, determine the highway toll station corresponding to the destination of the vehicle, and determine whether this highway toll station is the current toll station. If it is, then the vehicle is a vehicle leaving the highway from the current toll station; otherwise, the vehicle is not a vehicle leaving the highway from the current toll station; Count the number of vehicles leaving the highway from the current toll station; Obtain the average number of vehicles passing through the current toll station per unit time, and multiply the average number of vehicles passing through by the duration corresponding to the time interval to obtain the number of vehicles entering the highway from the current toll station; The statistical simulation duration corresponding to the target vehicle's simulated movement includes: Determine the length and moving speed of the target vehicle passing through each sub-road section during the simulated movement; For each sub-road section, divide the length of the sub-road section by the corresponding moving speed to obtain the sub-duration; Accumulate the sub-durations to obtain the simulated duration.

7. The method according to claim 6, wherein Select an alternative toll station. The total consumption duration for the vehicle to travel from the current position through this alternative toll station to the position on the highway corresponding to the farthest alternative toll station determined according to the determined consumption duration includes: Retrieve the consumption duration for the target vehicle to reach this alternative toll station from the current position, the consumption duration for the target vehicle to wait at this alternative toll station, and the consumption duration for the target vehicle to travel from this alternative toll station to the last alternative toll station; Accumulate the three retrieved consumption durations to obtain the total consumption duration; In step S7, if the duration difference between the two shortest total consumption durations is less than the set value, the target vehicle is further guided through the following steps: Respectively determine the alternative toll stations corresponding to the two total consumption durations; For each determined alternative toll station, identify the driving route for the target vehicle to travel from this alternative toll station to the position on the highway where the farthest alternative toll station is located; Identify the power type of the target vehicle to determine the real-time price of the corresponding energy source; Determine the energy consumption per unit mileage of the target vehicle to determine the total energy consumption for the target vehicle to complete this driving route, and then determine the energy consumption cost for the target vehicle to travel on this driving route based on the total energy consumption and the real-time price; Identify the length of the highway section in this driving route, obtain the cost per unit length of the highway, and then multiply the length of the highway section by the cost per unit length to obtain the highway toll for this highway section; Add the obtained energy consumption cost and the highway toll to obtain the total cost corresponding to this driving route; Take the driving route passing through the alternative toll station with the shortest corresponding total consumption duration as the first driving route, and take the driving route passing through the alternative toll station with the second shortest corresponding total consumption duration as the second driving route, and determine whether the total cost corresponding to the first driving route is lower than the total cost corresponding to the second driving route; If so, take the alternative toll station with the shortest corresponding total consumption duration as the target toll station, and send the target toll station and the first driving route to the target vehicle to guide the target vehicle to travel along the first driving route; If not, calculate the amount of money saved per unit time corresponding to the first driving route and send the amount of money saved per unit time to the target vehicle for the driver of the target vehicle to select a driving route based on the amount of money saved per unit time; When receiving the driving route selected by the driver and transmitted back by the target vehicle, send the corresponding driving route to the target vehicle to guide the target vehicle to travel along this driving route.

8. The method according to claim 7, wherein Calculate the amount of money saved per unit time corresponding to the first driving route through the following formula: Among them, M is the amount of money saved per unit time, is the total cost corresponding to the first driving route, is the total cost corresponding to the second driving route, is the time difference between the two shortest total elapsed times.

9. A terminal device, characterized in that, It includes a memory and a processor. A computer program is stored in the memory. When the computer program is executed by the processor, the processor is caused to execute the steps of the intelligent traffic congestion control method according to any one of claims 1 to 8.

10. A terminal-readable storage medium, characterized in that, A computer program is stored on the terminal-readable storage medium. When the computer program is executed by the processor, the processor is caused to execute the steps of the intelligent traffic congestion control method according to any one of claims 1 to 8.

Images