Traffic jam intelligent control method, terminal device and storage medium

Abstract

The invention belongs to the field of Internet of Vehicles, and particularly relates to a traffic jam intelligent control method, terminal equipment and a storage medium, and the method can prevent a large number of vehicles from being guided to the same toll station, achieves the shunting of the traffic flow of the toll station, and can effectively alleviate the jam condition of the toll station. Under the condition that the vehicles are shunted, the time factors such as the time consumed when the vehicles drive to the toll station, the time consumed when the vehicles wait at the toll station and the time consumed when the vehicles enter the expressway through the toll station are comprehensively considered to determine the target toll station; therefore, the time consumed by the target vehicle to enter the expressway through the target toll station to drive to the destination is shortest, that is, the driving efficiency of the target vehicle to the destination can be ensured as much as possible under the condition of realizing toll station diversion.

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; 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

[0003] 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.

[0004] A first aspect of an embodiment of the present application provides a traffic congestion intelligent control method, the traffic congestion intelligent control method comprising: 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; 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; 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; S4: determining the queue congestion degree of each candidate toll station, and then determining the waiting time of the target vehicle when arriving at each candidate toll station; S5: respectively determining the time taken for the target vehicle to travel from each of the other candidate toll stations to the last candidate toll station; S6: Select an alternative toll station, and determine the total time consumed for the vehicle to travel from the current position through the alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumed, and repeat this step to obtain the total time consumed corresponding to each alternative toll station, wherein the farthest alternative toll station is the toll station on the way that is farthest from the nearest toll station; S7: taking the candidate toll station with the shortest total time 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.

[0005] A second aspect of an embodiment of the present application provides a terminal device, including a memory and a processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of the intelligent traffic congestion control method.

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

[0007] Compared with the prior art, the embodiments of the present application have the following beneficial effects: the method provided by the present invention includes, when a first signal of a vehicle is received, taking the vehicle corresponding to the first signal as the target vehicle, and determining the nearest toll station of the target vehicle; determining the corresponding toll station along the way for the target vehicle according to the current position and destination of the target vehicle; taking the nearest toll station and each toll station along the way as alternative toll stations, and respectively determining the time consumed by the target vehicle from the current position to each alternative toll station; determining the queue congestion degree of each alternative toll station, and then respectively determining the time consumed by the target vehicle to wait when arriving at each alternative toll station; respectively determining the time consumed by the target vehicle from each other alternative toll station to the last alternative toll station; selecting an alternative toll station, and determining the position on the highway corresponding to the farthest alternative toll station for the vehicle to travel from the current position through the alternative toll station according to the determined time consumed. The total time consumed is determined, and this step is repeated to obtain the total time consumed for each alternative toll station; the alternative toll station with the shortest total time consumed is taken as the target toll station, and the target toll station is sent 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, thereby realizing the diversion of traffic at the toll station, and effectively alleviating the congestion at the toll station; and in the case of diverting vehicles, the target toll station is determined by comprehensively considering time factors such as the time consumed by the vehicle in driving to the toll station, the waiting time at the toll station, and the travel time through the toll station to enter the highway, so that the time consumed by the target vehicle to enter the highway through the target toll station to reach the destination is the shortest, that is, the driving efficiency of the target vehicle to reach the destination can be guaranteed as much as possible when the toll station is diverted. BRIEF DESCRIPTION OF THE DRAWINGS

[0008] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0009] Figure 1 It is a schematic diagram of the implementation process of the intelligent traffic congestion control method provided in the embodiment of the present application; Figure 2 Schematic diagram of the implementation environment of the intelligent traffic congestion control method provided in the embodiment of the present application; Figure 3 It is a schematic diagram of a toll station along the way in the intelligent control method for traffic congestion provided in an embodiment of the present application; Figure 4 It is a schematic diagram of a terminal device provided in an embodiment of the present application. DETAILED DESCRIPTION

[0010] In the following description, specific details such as specific system structures, technologies, etc. are provided for the purpose of illustration rather than limitation, so as to provide a thorough understanding of the embodiments of the present application. However, it should be clear to those skilled in the art that the present application may 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 prevent unnecessary details from obstructing the description of the present application.

[0011] In order to illustrate the technical solution described in this application, a specific embodiment is provided below for illustration.

[0012] Figure 1 A traffic congestion intelligent control method provided in Embodiment 1 of the present application is shown, and the traffic congestion intelligent control method includes: 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; 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; 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; S4: determining the queue congestion degree of each candidate toll station, and then determining the waiting time of the target vehicle when arriving at each candidate toll station; S5: respectively determining the time taken for the target vehicle to travel from each of the other candidate toll stations to the last candidate toll station; S6: Select an alternative toll station, and determine the total time consumed for the vehicle to travel from the current position through the alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumed, and repeat this step to obtain the total time consumed corresponding to each alternative toll station, wherein the farthest alternative toll station is the toll station on the way that is farthest from the nearest toll station; S7: taking the candidate toll station with the shortest total time 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.

[0013] In this embodiment, if Figure 2As shown, the method is executed in a terminal device, which may be an independent physical server or terminal, or a server cluster composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud servers, cloud databases, cloud storage, and CDN; each vehicle is equipped with a vehicle terminal (such as a vehicle processor), and communicates with the terminal device through the vehicle terminal; each highway toll station is equipped with a camera, which communicates with the terminal device, and the image collected by the camera can be transmitted to the terminal device, so that the terminal device can determine the queue congestion degree of the highway toll station based on the image.

[0014] In this embodiment, this method can be executed for each vehicle that sends the first signal. Since the expressway often passes through multiple urban areas and suburbs between multiple urban areas, the queue congestion degree of each toll station will present a periodic distribution along the expressway (i.e., the urban area has high congestion, the suburbs have low congestion, and so on), 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 10km), the determined target toll station can be set in this cycle, so that the target vehicle does not need to go through too much pre-order driving before entering the target toll station; In this embodiment, if Figure 3 As shown in the figure, the toll station along the way is used as an alternative toll station, which avoids the selected target toll station being far away from its destination. When the target toll station is a toll station along the way, the target vehicle is actually approaching the destination in the process of going to the target toll station (the only difference is whether it is approaching on the highway or on the road under the highway), that is, it will not increase the driving distance on the highway, and can shorten the time to reach the destination; In this embodiment, no matter which alternative toll station is selected as the target toll station, it will eventually 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, which can be regarded as the corresponding time consumption is roughly the same. Therefore, the time it takes for the target vehicle to travel from the current position to the destination is mainly determined by the time it takes to travel from the current position to the last alternative toll station, that is, the total time consumption. Therefore, selecting the toll station with the shortest total time consumption as the target toll station can make the total time for the target vehicle to reach the destination the shortest. In the present application, it is possible to avoid directing a large number of vehicles to the same toll station to enter the highway, thereby realizing the diversion of traffic at the toll station, and effectively alleviating the congestion at the toll station; and in the case of diverting vehicles, the target toll station is determined by comprehensively considering time factors such as the time it takes for the vehicle to travel to the toll station, the waiting time at the toll station, and the travel time through the toll station to enter the highway, so that the time spent by the target vehicle to enter the highway through the target toll station to the destination is minimized, that is, while realizing the diversion of the toll station, the driving efficiency of the target vehicle to reach the destination can be guaranteed as much as possible.

[0015] As a preferred embodiment, respectively determining the time taken for the target vehicle to reach each candidate toll station from the current position includes: S31: for each candidate toll station, generate a plurality of navigation routes from the current position of the target vehicle to the candidate toll station based on the traffic congestion degree and the corresponding time consumption; S32: Selecting a corresponding navigation route with the shortest time consumption as a first navigation route, and determining the time consumption as the time consumption for the target vehicle to reach the candidate toll station from the current position.

[0016] The queue congestion is characterized by the number of waiting vehicles in the waiting area of ​​the toll station. The more waiting vehicles there are, the higher the queue congestion is. Determining the queue congestion of each candidate toll station and then determining the waiting time of the target vehicle when arriving at each candidate toll station includes: S41: For each candidate toll station, obtain an image of the waiting area of ​​the candidate toll station, and then determine the current number of waiting vehicles in the waiting area according to the image; S42: Determine the average number of vehicles passing through the candidate toll station per unit time according to historical data; S43: Retrieving the time taken by the target vehicle to reach the candidate toll station from the current position, and multiplying the time taken by the average number of vehicles passing through the station to obtain a first number; S44: Determine the remaining time taken for all other vehicles being guided to the alternative toll station to reach the alternative toll station; S45: Screen out the remaining time consumption of the vehicle whose remaining time consumption is shorter than the target vehicle, and count the number of other vehicles corresponding to the screened remaining time consumption to obtain a second number; S46: Calculate the number of waiting vehicles at the candidate toll station when the target vehicle arrives at the candidate toll station by the following formula: in, 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 booth, is the first quantity, is the second quantity; The obtained number of waiting vehicles is divided by the average number of passing vehicles to obtain the waiting time of the target vehicle when arriving at the alternative toll station.

[0017] In this embodiment, the navigation route and the corresponding time consumption can be generated by the existing navigation software. The navigation route generated by the existing navigation software takes into account the traffic congestion of each section of the route (for example, a section with high congestion will be displayed in red), and the generated time consumption also takes into account the time consumption under congestion conditions; In this embodiment, by performing image analysis on the image captured by the camera of the toll station, the number of vehicles currently waiting in the image can be determined; since the terminal device is guiding other vehicles while guiding the target vehicle, the number of vehicles waiting at a toll station when the target vehicle arrives at the toll station is determined by adding the number of vehicles currently waiting at the toll station to the number of vehicles that arrive at the toll station before the target vehicle (i.e., the corresponding remaining time is less than the time taken for the target vehicle to reach the alternative toll station from the current position), and then subtracting the number of vehicles that enter the highway through the toll station during the time taken for the target vehicle to reach the alternative toll station from the current position; wherein the remaining time can also be determined by generating a navigation route for the vehicle to reach the toll station according to the real-time position of the vehicle (selecting the navigation route with the shortest time); In this embodiment, the historical data is the number of vehicles that have passed through the toll station from the queue in multiple historical time segments in a recent period (such as the latest month) (which can be determined by historical images collected by the camera). For each historical time segment, the total number of vehicles that have passed through the toll station in the historical time segment can be divided by the length of the historical time segment to obtain the average number of vehicles that have passed through the toll station in the historical time segment. The average of the average number of vehicles that have passed through the toll station in each historical time segment can be calculated to obtain the average number of vehicles that have passed through the toll station per unit time at the candidate toll station. As a preferred embodiment, respectively determining the time taken for the target vehicle to travel from each other candidate toll station to the last candidate toll station includes: For each other candidate toll station, determining the time point at which the target vehicle enters the highway through the candidate toll station; Determine the vehicle density of the local road section where the target vehicle is located when it enters the expressway from the candidate toll station at the time point, and determine the initial moving speed of the target vehicle when it enters the expressway based on the vehicle density; The target vehicle is simulated to move at the initial moving speed, and during the simulated movement, the vehicle density of the local road section where the target vehicle is located is updated, and the moving speed of the target vehicle is adjusted accordingly, until the vehicle is simulated to move to the last alternative toll station; The simulation time corresponding to the simulated movement of the target vehicle is counted, that is, the time consumed by the target vehicle from the alternative toll station to the last alternative toll station is obtained.

[0018] Determine the initial moving speed of the target vehicle when entering the expressway according to the vehicle density, that is, determine the initial moving speed of the target vehicle when entering the expressway according to the vehicle density of the local section where the target vehicle is located when entering the expressway and a vehicle density-vehicle speed comparison table, wherein the vehicle density-vehicle speed comparison table includes each vehicle density from large to small and the speed at which the vehicle can travel safely under the vehicle density; Updating the vehicle density of the local road section where the target vehicle is located and adjusting the moving speed of the target vehicle accordingly include: When the local road section where the target vehicle is located passes through any candidate toll station, the candidate toll station is used as the current toll station; Determine the time point at which the local road section where the target vehicle is located arrives at the current toll station and the time point at which the local road 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 of the local road section before it reaches the current toll station, and then obtain the number of vehicles in the local road section before it reaches the current toll station, that is, the third number; Determine the number of vehicles leaving the highway from the current toll station and the number of vehicles entering the highway in the local road section within the time interval, and subtract the number of vehicles leaving the highway from the number of vehicles entering the highway to obtain a net inflow number; The third quantity is added to the net inflow quantity to obtain the new number of vehicles in the local road section, and then the new vehicle density is obtained; The new moving speed is determined according to the new traffic density, and the target vehicle is simulated to move from the current toll station to the next alternative toll station at the new moving speed.

[0019] Determining the number of vehicles leaving the highway from the current toll station and the number of vehicles entering the highway in the local road section within the time interval includes: For each vehicle in the local road section, determine the highway toll station corresponding to the destination of the vehicle, and judge whether the 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. Count the number of vehicles leaving the highway from the current toll booth; Get the average number of vehicles passing through the current toll station per unit time, and multiply the average number of vehicles passing through the toll station by the duration corresponding to the time interval to get the number of vehicles entering the highway from the current toll station; The simulation duration corresponding to the simulated movement of the target vehicle includes: Determine the length and moving speed of each sub-section passed by the target vehicle in the simulated movement; For each sub-segment, the sub-duration is obtained by dividing the length of the sub-segment by the corresponding moving speed; The sub-durations are accumulated to obtain the simulation duration.

[0020] In this embodiment, the time point at which the target vehicle enters the highway through the alternative toll station can be obtained by adding the time taken for the target vehicle to arrive at the alternative toll station and the time taken to wait at the alternative toll station to the current time point. In this embodiment, the local road section is a road section extending from the position of the target vehicle to the front of the target vehicle by a set length (for example, 100 meters), and the scope of the local road section includes the entire highway within the set length (only the highway with the same driving direction as the target vehicle is taken); the vehicle density is the number of vehicles corresponding to the local road section per unit length, which can be obtained by dividing the total number of vehicles in the local road section by the set length; In this embodiment, a map including the expressway, each toll station and the surrounding area of ​​the expressway can be generated in the terminal device, and an identification point representing the target vehicle can be generated on the map, so as to achieve simulated movement of the target vehicle by simulating movement of the identification point; 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 moving speed of the simulated movement to be determined; in the simulation process, the local section moves with the movement of the target vehicle, and in the process of the local section passing through a toll station (that is, the process from the front end of the local section passing through the toll station to the rear end of the local section completely passing through the toll station), some vehicles often leave the expressway, and new vehicles enter the expressway from the toll station and merge into the local section, so the vehicle density of the local section will change, thereby changing the moving speed, so the vehicle density of the local section where the target vehicle is located should be updated, and the moving speed of the target vehicle should be adjusted accordingly (when the local section completely passes through the toll station, the movement simulation is performed at the new moving speed) to ensure the accuracy of the simulation; In this embodiment, a sub-segment is a segment between two adjacent candidate toll stations. The length of the sub-segment can be identified in the generated map. Since the moving speed of the target vehicle in each sub-segment can be obtained, the time spent by the target vehicle in each sub-segment, i.e., the sub-time length, can be obtained. As can be seen from the foregoing, the time point at which the target vehicle enters the expressway can be obtained. Therefore, the time point at which the local segment where the target vehicle is located leaves the current toll station can be obtained (the time point at which the expressway is entered plus the sub-time length corresponding to each sub-segment before the current toll station). Furthermore, the time point at which the local segment leaves the current toll station minus the time length of the local segment passing through the toll station (i.e., the time length obtained by dividing the set length by the corresponding moving speed) can be used to obtain the time point at which the local segment arrives at the current toll station, and thus the time interval can be obtained. In this embodiment, the initial vehicle density, that is, the vehicle density of the local section where the target vehicle enters the highway, can be obtained through preliminary simulation, that is, the positions of all other vehicles on the highway before the selected candidate toll station are obtained, and each other vehicle is marked on the map, and then the position points of each mark are simulated for displacement (the method of simulating displacement is consistent with the method of simulating displacement of the target vehicle), and the simulation time period is from the current time point to the time point when the target vehicle enters the highway; further, for vehicles that have not yet entered the highway but will enter the highway within the simulation time period (as mentioned above, the time taken for each vehicle to be guided into the highway can be known, and then the time point when it enters the highway can be determined), the time point when these vehicles enter the highway and the toll station are determined, and corresponding identification points are generated at the positions of the highway corresponding to the corresponding toll stations at the corresponding time points, and these identification points are simulated for movement in the same way; at the time point when the target vehicle enters the highway, the number of identification points in the local section where the target vehicle is located is identified, and the vehicle density in the local section where the target vehicle is located at this time point can be obtained.

[0021] As a preferred embodiment, selecting an alternative toll station, and determining the total time consumed for the vehicle to travel from the current position through the alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumed includes: Retrieve the time it takes for the target vehicle to reach the alternative toll station from the current position, the time it takes for the target vehicle to wait at the alternative toll station, and the time it takes for the target vehicle to reach the last alternative toll station from the alternative toll station; Add up the three consumed time to get the total consumed time. In step S7, if the difference between the two shortest total time durations is less than the set value, the target vehicle is guided by the following steps: Determine the alternative toll stations corresponding to the two total time consumptions respectively; For each determined candidate toll station, identifying a driving route of the target vehicle through the candidate toll station to a location on the highway where the farthest candidate toll station is located; Identify the power type of the target vehicle to determine the real-time price of the corresponding energy; Determine the energy consumption per unit mileage of the target vehicle to determine the total energy consumption of the target vehicle for completing the driving route, and then determine the energy consumption cost of the target vehicle for driving the driving route based on the total energy consumption and the real-time price; Identify the length of the expressway section in the driving route, obtain the unit length fee of the expressway, and then multiply the unit length fee by the length of the expressway section to obtain the expressway fee of the expressway section; Add the obtained energy consumption cost to the highway fee to get the total cost corresponding to the driving route; The driving route passing through the alternative toll station with the shortest total time is taken as the first driving route, and the driving route passing through the alternative toll station with the longest and second shortest total time is taken as the second driving route, and it is determined whether the total cost corresponding to the first driving route is lower than the total cost corresponding to the second driving route; If yes, the corresponding candidate toll station with the shortest total time consumption is used as the target toll station, and the target toll station and the first driving route are sent to the target vehicle to guide the target vehicle to travel along the first driving route; If not, the unit time saving amount corresponding to the first driving route is calculated, and the unit time saving amount is sent to the target vehicle, so that the driver of the target vehicle can select a driving route according to the unit time saving amount; When the driving route selected by the driver transmitted back by the target vehicle is received, the corresponding driving route is sent to the target vehicle to guide the target vehicle to travel along the driving route.

[0022] The amount of time saved per unit of driving route is calculated using the following formula: Among them, M is the amount saved per unit time, is the total cost corresponding to the first driving route, is the total cost corresponding to the second driving route, The difference between the two shortest total durations.

[0023] In this embodiment, the power type can be electric and motorized, and the corresponding energy sources are electricity and gasoline. The real-time price of energy can be obtained on the Internet; the vehicle end of the target car will determine the unit mileage energy consumption based on the historical energy consumption records, and the terminal device can directly obtain the unit mileage energy consumption from the vehicle end; the set value can be 2 minutes, 3 minutes or other values, which are not limited here; because the distance of the highway route selected at different toll stations is different, the length of the highway section passed is also different, and the energy cost and highway fee generated are also different. When the total time consumed is similar, the driver will be more Considering the cost-effectiveness, in this embodiment, the driving routes of the two alternative toll stations with the shortest total driving time (i.e., the route from the current position to the alternative toll station plus the route from the alternative toll station to the last alternative toll station) can be identified respectively, and the total costs of the two driving routes can be calculated respectively; when the total cost of the driving route with a slightly longer total driving time is lower than the total cost of the other driving route, the amount saved per unit time (i.e., representing the cost-effectiveness) is calculated, and this amount is sent to the target vehicle, so that the driver can intuitively determine whether he is satisfied with the cost-effectiveness, and thus choose one of the two driving routes.

[0024] A terminal device provided in a second embodiment of the present application includes a memory and a processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes the steps of the intelligent traffic congestion control method, specifically including: 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; 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; 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; S4: determining the queue congestion degree of each candidate toll station, and then determining the waiting time of the target vehicle when arriving at each candidate toll station; S5: respectively determining the time taken for the target vehicle to travel from each of the other candidate toll stations to the last candidate toll station; S6: Select an alternative toll station, and determine the total time consumed for the vehicle to travel from the current position through the alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumed, and repeat this step to obtain the total time consumed corresponding to each alternative toll station, wherein the farthest alternative toll station is the toll station on the way that is farthest from the nearest toll station; S7: taking the candidate toll station with the shortest total time 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.

[0025] A terminal-readable storage medium is provided in Embodiment 3 of the present application. A computer program is stored on the terminal-readable storage medium. When the computer program is executed by a processor, the processor executes the steps of the intelligent traffic congestion control method, specifically including: 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; 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; 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; S4: determining the queue congestion degree of each candidate toll station, and then determining the waiting time of the target vehicle when arriving at each candidate toll station; S5: respectively determining the time taken for the target vehicle to travel from each of the other candidate toll stations to the last candidate toll station; S6: Select an alternative toll station, and determine the total time consumed for the vehicle to travel from the current position through the alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumed, and repeat this step to obtain the total time consumed corresponding to each alternative toll station, wherein the farthest alternative toll station is the toll station on the way that is farthest from the nearest toll station; S7: taking the candidate toll station with the shortest total time 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.

[0026] It should be understood that the size of the serial numbers of the steps in the above embodiments does not mean the order of execution. The execution order of each process should be determined by its function and internal logic, and should not constitute any limitation on the implementation process of the embodiments of the present application.

[0027] It should be understood that when used in the present application specification, the term "comprising" indicates the presence of 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 combinations thereof.

[0028] 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.

[0029] As used in the present specification, the term "if" can be interpreted as "when" or "uponce" or "in response to determining" or "in response to detecting" depending on the context. Similarly, the phrase "if it is determined" or "if [the described condition or event] is detected" can be interpreted as meaning "uponce it is determined" or "in response to determining" or "uponce [the described condition or event] is detected" or "in response to detecting [the described condition or event]" depending on the context.

[0030] In addition, in the description of the present specification, the terms "first", "second", "third", etc. are only used to distinguish descriptions, and cannot be understood as indicating or implying relative importance. It should also be understood that although the terms "first", "second", etc. are used to describe various elements in some embodiments of the present application in the text, these elements should not be limited by these terms. These terms are only used to distinguish one element from another element. For example, the first table can be named as the second table, and similarly, the second table can be named as 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.

[0031] References to "one embodiment" or "some embodiments" etc. described in the specification of this application mean that one or more embodiments of the present application include specific features, structures or characteristics described in conjunction with the embodiment. Therefore, the statements "in one embodiment", "in some embodiments", "in some other embodiments", "in some other embodiments", etc. that appear in different places in this specification do not necessarily refer to the same embodiment, but mean "one or more but not all embodiments", unless otherwise specifically emphasized in other ways. The terms "including", "comprising", "having" and their variations all mean "including but not limited to", unless otherwise specifically emphasized in other ways.

[0032] The intelligent traffic congestion control method provided in the embodiment of the present application can be applied to terminal devices such as mobile phones, tablet computers, wearable devices, vehicle-mounted devices, augmented reality (AR) / virtual reality (VR) devices, laptop computers, ultra-mobile personal computers (UMPC), netbooks, personal digital assistants (PDA), etc. The embodiment of the present application does not impose any restrictions on the specific type of the terminal device.

[0033] For example, the terminal device can be a station (STAION, ST) in a WLAN, 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 device connected to a wireless modem, a vehicle-mounted 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 TV set top box (STB), a customer premises equipment (CPE) and / or other devices for communicating on a wireless system and a next-generation communication system, such as a mobile terminal in a 5G network or a mobile terminal in a future evolved Public Land Mobile Network (PLMN) network, etc.

[0034] As an example but not limitation, when the terminal device is a wearable device, the wearable device can also be a general term for wearable devices that are intelligently designed and developed using wearable technology for daily wear, such as glasses, gloves, watches, clothing and shoes. A wearable device is a portable device that is worn directly on the body or integrated into the user's clothes or accessories. Wearable devices are not just hardware devices, but also achieve powerful functions through software support, data interaction, and cloud interaction. Broadly speaking, wearable smart devices include those that are fully functional, large in size, and can achieve complete or partial functions without relying on smartphones, such as smart watches or smart glasses, as well as those that only focus on a certain type of application function and need to be used in conjunction with other devices such as smartphones, such as various smart bracelets and smart jewelry for vital sign monitoring.

[0035] Figure 4Schematic diagram of the structure of a terminal device provided by an embodiment of the present application. Figure 4 As shown, the terminal device of this embodiment includes: at least one processor ( Figure 4 Only one is shown in the figure), a memory, wherein the memory stores a computer program that can be run on the processor. When the processor executes the computer program, the steps in the above-mentioned embodiments of the intelligent control method for traffic congestion are implemented, such as Figure 1 Steps S1 to S7 are shown.

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

[0037] The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor may be a microprocessor or any conventional processor, etc.

[0038] In some embodiments, the memory may be an internal storage unit of the terminal device, such as a 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, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. equipped on the terminal device. Furthermore, the memory may include both an internal storage unit and an external storage device of the terminal device. The memory is used to store an operating system, an application program, a boot loader (BootLoader), data, and other programs, such as the program code of the computer program. The memory may also be used to temporarily store data that has been sent or is to be sent.

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

[0040] An embodiment of the present application provides a computer program product. When the computer program product is run on a mobile terminal device, the mobile terminal device can implement the steps in the above-mentioned method embodiments when executing the computer program product.

[0041] If the 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 this understanding, the present application implements all or part of the processes in the above-mentioned embodiment method, and can also be completed by instructing the relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium, and the computer program can implement the steps of the above-mentioned various method embodiments when executed by the processor. Among them, the computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device that can carry the computer program code, recording medium, U disk, mobile hard disk, disk, optical disk, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signal, telecommunication signal and software distribution medium, etc.

[0042] In the above embodiments, the description of each embodiment has its own emphasis. For parts that are not described or recorded in detail in a certain embodiment, reference can be made to the relevant descriptions of other embodiments.

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

[0044] 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 distributed on multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

[0045] The embodiments described above are only used to illustrate the technical solutions of the present application, rather than to limit them. Although the present application has been described in detail with reference to the aforementioned embodiments, a person skilled in the art should understand that the technical solutions described in the aforementioned embodiments may still be modified, or some of the technical features may be replaced by equivalents. Such modifications or replacements do not deviate the essence of the corresponding technical solutions from the spirit and scope of the technical solutions of the embodiments of the present application, and should all be included in the protection scope of the present application.

Claims

1. A traffic congestion intelligent control method, characterized in that: The intelligent traffic congestion control method comprises: 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; 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; 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; S4: determining the queue congestion degree of each candidate toll station, and then determining the waiting time of the target vehicle when arriving at each candidate toll station; S5: respectively determining the time taken for the target vehicle to travel from each of the other candidate toll stations to the last candidate toll station; S6: Select an alternative toll station, and determine the total time consumed for the vehicle to travel from the current position through the alternative toll station to the position on the highway corresponding to the farthest alternative toll station according to the determined time consumed, and repeat this step to obtain the total time consumed corresponding to each alternative toll station, wherein the farthest alternative toll station is the toll station on the way that is farthest from the nearest toll station; S7: taking the candidate toll station with the shortest total time 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.

2. The method according to claim 1, characterized in that Determining the time it takes for the target vehicle to reach each candidate toll station from the current location includes: S31: for each candidate toll station, generate a plurality of navigation routes from the current position of the target vehicle to the candidate toll station based on the traffic congestion degree and the corresponding time consumption; S32: Selecting a corresponding navigation route with the shortest time consumption as a first navigation route, and determining the time consumption as the time consumption for the target vehicle to reach the candidate toll station from the current position.

3. The method according to claim 2, characterized in that The queue congestion is characterized by the number of waiting vehicles in the waiting area of ​​the toll station. The more waiting vehicles there are, the higher the queue congestion is. Determine the queue congestion degree of each alternative toll station, and then determine the waiting time of the target vehicle when arriving at each alternative toll station, including: S41: For each candidate toll station, obtain an image of the waiting area of ​​the candidate toll station, and then determine the current number of waiting vehicles in the waiting area according to the image; S42: Determine the average number of vehicles passing through the candidate toll station per unit time according to historical data; S43: Retrieving the time taken by the target vehicle to reach the candidate toll station from the current position, and multiplying the time taken by the average number of vehicles passing through the station to obtain a first number; S44: Determine the remaining time taken for all other vehicles being guided to the alternative toll station to reach the alternative toll station; S45: Screen out the remaining time that is less than the time it takes for the target vehicle to reach the candidate toll station from the current position, and count the number of other vehicles corresponding to the screened remaining time to obtain a second number; S46: Calculate the number of waiting vehicles at the alternative toll station when the target vehicle arrives at the alternative toll station by the following formula: in, 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 booth, is the first quantity, is the second quantity; The obtained number of waiting vehicles is divided by the average number of passing vehicles to obtain the waiting time of the target vehicle when arriving at the alternative toll station.

4. The method according to claim 3, characterized in that Determining the time taken for the target vehicle to travel from each of the other candidate toll stations to the last candidate toll station includes: For each other candidate toll station, determining the time point at which the target vehicle enters the highway through the candidate toll station; Determine the vehicle density of the local road section where the target vehicle is located when it enters the expressway from the candidate toll station at the time point, and determine the initial moving speed of the target vehicle when it enters the expressway based on the vehicle density; The target vehicle is simulated to move at the initial moving speed, and during the simulated movement, the vehicle density of the local road section where the target vehicle is located is updated, and the moving speed of the target vehicle is adjusted accordingly, until the vehicle is simulated to move to the last alternative toll station; The simulation time corresponding to the simulated movement of the target vehicle is counted, that is, the time consumed by the target vehicle from the alternative toll station to the last alternative toll station is obtained.

5. The method according to claim 4, characterized in that Determine the initial moving speed of the target vehicle when entering the expressway according to the vehicle density, that is, determine the initial moving speed of the target vehicle when entering the expressway according to the vehicle density of the local section where the target vehicle is located when entering the expressway and a vehicle density-vehicle speed comparison table, wherein the vehicle density-vehicle speed comparison table includes each vehicle density from large to small and the speed at which the vehicle can travel safely under the vehicle density; Updating the vehicle density of the local road section where the target vehicle is located and adjusting the moving speed of the target vehicle accordingly include: When the local road section where the target vehicle is located passes through any candidate toll station, the candidate toll station is used as the current toll station; Determine the time point at which the local road section where the target vehicle is located arrives at the current toll station and the time point at which the local road 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 of the local road section before it reaches the current toll station, and then obtain the number of vehicles in the local road section before it reaches the current toll station, that is, the third number; Determine the number of vehicles leaving the highway from the current toll station and the number of vehicles entering the highway in the local road section within the time interval, and subtract the number of vehicles leaving the highway from the number of vehicles entering the highway to obtain a net inflow number; The third quantity is added to the net inflow quantity to obtain the new number of vehicles in the local road section, and then the new vehicle density is obtained; The new moving speed is determined according to the new traffic density, and the target vehicle is simulated to move from the current toll station to the next alternative toll station at the new moving speed.

6. The method according to claim 5, characterized in that Determining the number of vehicles leaving the highway from the current toll station and the number of vehicles entering the highway in the local road section within the time interval includes: For each vehicle in the local road section, determine the highway toll station corresponding to the destination of the vehicle, and judge whether the 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. Count the number of vehicles leaving the highway from the current toll booth; Get the average number of vehicles passing through the current toll station per unit time, and multiply the average number of vehicles passing through the toll station by the duration corresponding to the time interval to get the number of vehicles entering the highway from the current toll station; The simulation duration corresponding to the simulated movement of the target vehicle includes: Determine the length and moving speed of each sub-section passed by the target vehicle in the simulated movement; For each sub-segment, the sub-duration is obtained by dividing the length of the sub-segment by the corresponding moving speed; The sub-durations are accumulated to obtain the simulation duration.

7. The method according to claim 6, characterized in that Selecting an alternative toll station, and determining the total time it takes for the vehicle to travel from the current position through the alternative toll station to the position on the highway corresponding to the farthest alternative toll station based on the determined time consumption includes: Retrieve the time it takes for the target vehicle to reach the alternative toll station from the current position, the time it takes for the target vehicle to wait at the alternative toll station, and the time it takes for the target vehicle to reach the last alternative toll station from the alternative toll station; Add up the three consumed time to get the total consumed time. In step S7, if the difference between the two shortest total time durations is less than the set value, the target vehicle is guided by the following steps: Determine the alternative toll stations corresponding to the two total time consumptions respectively; For each determined candidate toll station, identifying a driving route of the target vehicle through the candidate toll station to a location on the highway where the farthest candidate toll station is located; Identify the power type of the target vehicle to determine the real-time price of the corresponding energy; Determine the energy consumption per unit mileage of the target vehicle to determine the total energy consumption of the target vehicle for completing the driving route, and then determine the energy consumption cost of the target vehicle for driving the driving route based on the total energy consumption and the real-time price; Identify the length of the expressway section in the driving route, obtain the unit length fee of the expressway, and then multiply the unit length fee by the length of the expressway section to obtain the expressway fee of the expressway section; Add the obtained energy consumption cost to the highway fee to get the total cost corresponding to the driving route; The driving route passing through the alternative toll station with the shortest total time is taken as the first driving route, and the driving route passing through the alternative toll station with the longest and second shortest total time is taken as the second driving route, and it is determined whether the total cost corresponding to the first driving route is lower than the total cost corresponding to the second driving route; If yes, the corresponding candidate toll station with the shortest total time consumption is used as the target toll station, and the target toll station and the first driving route are sent to the target vehicle to guide the target vehicle to travel along the first driving route; If not, the unit time saving amount corresponding to the first driving route is calculated, and the unit time saving amount is sent to the target vehicle, so that the driver of the target vehicle can select a driving route according to the unit time saving amount; When the driving route selected by the driver transmitted back by the target vehicle is received, the corresponding driving route is sent to the target vehicle to guide the target vehicle to travel along the driving route.

8. The method according to claim 7, characterized in that The amount of time saved per unit of driving route is calculated using the following formula: Among them, M is the amount saved per unit time, is the total cost corresponding to the first driving route, is the total cost corresponding to the second driving route, The difference between the two shortest total durations.

9. A terminal device, characterized in that: The method comprises a memory and a processor, wherein a computer program is stored in the memory, and when the computer program is executed by the processor, the processor executes 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: The terminal-readable storage medium stores a computer program, and when the computer program is executed by a processor, the processor executes the steps of the intelligent traffic congestion control method according to any one of claims 1 to 8.

Images