CN115830851B - Traffic flow regulating method, device, equipment and medium - Google Patents

Traffic flow regulating method, device, equipment and medium Download PDF

Info

Publication number
CN115830851B
CN115830851B CN202211370300.XA CN202211370300A CN115830851B CN 115830851 B CN115830851 B CN 115830851B CN 202211370300 A CN202211370300 A CN 202211370300A CN 115830851 B CN115830851 B CN 115830851B
Authority
CN
China
Prior art keywords
route
traffic
inducible
channels
channel
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202211370300.XA
Other languages
Chinese (zh)
Other versions
CN115830851A (en
Inventor
冯国臣
丁晔昕
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Apollo Zhilian Beijing Technology Co Ltd
Original Assignee
Apollo Zhilian Beijing Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Apollo Zhilian Beijing Technology Co Ltd filed Critical Apollo Zhilian Beijing Technology Co Ltd
Priority to CN202211370300.XA priority Critical patent/CN115830851B/en
Publication of CN115830851A publication Critical patent/CN115830851A/en
Application granted granted Critical
Publication of CN115830851B publication Critical patent/CN115830851B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Traffic Control Systems (AREA)

Abstract

The disclosure provides a traffic flow adjusting method, a traffic flow adjusting device, traffic flow adjusting equipment and a traffic flow adjusting medium, relates to the field of artificial intelligence, and particularly relates to the technical field of intelligent traffic and navigation. The implementation scheme is as follows: for each of a plurality of channels, determining an actual traffic saturation for the channel during a current time period; determining a saturated channel and an evacuated channel in the plurality of channels based on the actual traffic saturation of each of the plurality of channels and the corresponding target saturation; and determining a vehicle guidance direction in a plurality of routes respectively passing through the plurality of channels based on the saturated channel and the evacuation channel in the plurality of channels, so as to perform traffic flow adjustment of the corresponding channel in the plurality of routes based on the vehicle guidance direction.

Description

Traffic flow regulating method, device, equipment and medium
Technical Field
The present disclosure relates to the field of artificial intelligence, and in particular, to the field of intelligent traffic and navigation technologies, and in particular, to a traffic flow adjustment method, apparatus, electronic device, computer readable storage medium, and computer program product.
Background
The connecting channels among different areas in the city often take on the role of an aortic artery for traffic exchange in the city, and a large amount of traffic pressure runs on the main channel. In actual traveling, travelers often pass through a fixed line every day with an inertial thinking, but the fixed line is not optimal for some travelers, which results in different channel congestion conditions among areas, too congested connecting channels, low congestion degree of the connecting channels, structural unbalance, and insufficient space utilization of the channels among areas.
The approaches described in this section are not necessarily approaches that have been previously conceived or pursued. Unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section. Similarly, the problems mentioned in this section should not be considered as having been recognized in any prior art unless otherwise indicated.
Disclosure of Invention
The present disclosure provides a traffic flow adjustment method, apparatus, electronic device, computer readable storage medium, and computer program product.
According to an aspect of the present disclosure, there is provided a traffic flow adjusting method including: determining, for each of a plurality of channels, an actual traffic saturation of the channel over a current period, wherein each of the plurality of channels is a backbone channel from a first region to a second region; determining a saturated channel and an evacuated channel in the plurality of channels based on the actual traffic saturation of each of the plurality of channels and the corresponding target saturation; and determining a vehicle guidance direction among a plurality of routes respectively passing through the plurality of channels based on the saturated channel and the evacuation channel among the plurality of channels, so as to perform traffic flow adjustment of the corresponding channel among the plurality of routes based on the vehicle guidance direction, wherein the plurality of routes include the same starting point and the end point, and the vehicle guidance direction is used for guiding the vehicle from the route passing through the saturated channel among the plurality of routes to the route passing through the evacuation channel among the plurality of routes.
According to another aspect of the present disclosure, there is provided a traffic flow adjusting apparatus including: a first determining unit configured to determine, for each of a plurality of channels, an actual traffic saturation of the channel in a current period, wherein each of the plurality of channels is a backbone channel leading from a first region to a second region; a second determining unit configured to determine a saturated channel and an evacuated channel of the plurality of channels based on an actual traffic saturation of each of the plurality of channels and a corresponding target saturation; and a third determination unit configured to determine a vehicle guidance direction among a plurality of routes respectively passing through the plurality of channels based on the saturated channel and the evacuation channel among the plurality of channels, to perform traffic flow adjustment of the corresponding channel among the plurality of routes based on the vehicle guidance direction, wherein the plurality of routes include the same starting point and ending point, and the vehicle guidance direction is used to guide the vehicle from the route passing through the saturated channel among the plurality of routes to the route passing through the evacuation channel among the plurality of routes.
According to another aspect of the present disclosure, there is provided an electronic device including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the traffic flow regulation method described above.
According to another aspect of the present disclosure, there is provided a non-transitory computer-readable storage medium storing computer instructions for causing a computer to execute the above-described traffic flow adjustment method.
According to another aspect of the present disclosure, there is provided a computer program product comprising a computer program, wherein the computer program, when executed by a processor, implements the above-described traffic flow regulation method.
According to one or more embodiments of the present disclosure, guidance information of a vehicle traveling direction can be provided to a user under the condition that a driving start point and a driving end point of the user are unchanged, so that a vehicle flow is guided from a saturated channel to an evacuation channel, and thus adjustment and balance of traffic flow between multiple channels between two areas are achieved.
It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the disclosure, nor is it intended to be used to limit the scope of the disclosure. Other features of the present disclosure will become apparent from the following specification.
Drawings
The accompanying drawings illustrate exemplary embodiments and, together with the description, serve to explain exemplary implementations of the embodiments. The illustrated embodiments are for exemplary purposes only and do not limit the scope of the claims. Throughout the drawings, identical reference numerals designate similar, but not necessarily identical, elements.
FIG. 1 illustrates a schematic diagram of an exemplary system in which various methods described herein may be implemented, in accordance with an embodiment of the present disclosure;
FIG. 2 illustrates a flow chart of a traffic flow regulation method according to an embodiment of the present disclosure;
FIG. 3 illustrates a schematic view of a traffic channel between two areas according to an exemplary embodiment of the present disclosure;
FIG. 4 illustrates a flow chart of the acquisition of the start and end points of a plurality of routes according to an embodiment of the present disclosure;
FIG. 5 illustrates a flow chart of a traffic flow regulation method according to an embodiment of the present disclosure;
FIG. 6 illustrates a flow chart of a traffic flow regulation method according to an embodiment of the present disclosure;
fig. 7 shows a block diagram of a traffic flow regulating device according to an embodiment of the present disclosure;
Fig. 8 illustrates a block diagram of an exemplary electronic device that can be used to implement embodiments of the present disclosure.
Detailed Description
Exemplary embodiments of the present disclosure are described below in conjunction with the accompanying drawings, which include various details of the embodiments of the present disclosure to facilitate understanding, and should be considered as merely exemplary. Accordingly, one of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope of the present disclosure. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
In the present disclosure, the use of the terms "first," "second," and the like to describe various elements is not intended to limit the positional relationship, timing relationship, or importance relationship of the elements, unless otherwise indicated, and such terms are merely used to distinguish one element from another element. In some examples, a first element and a second element may refer to the same instance of the element, and in some cases, they may also refer to different instances based on the description of the context.
The terminology used in the description of the various illustrated examples in this disclosure is for the purpose of describing particular examples only and is not intended to be limiting. Unless the context clearly indicates otherwise, the elements may be one or more if the number of the elements is not specifically limited. Furthermore, the term "and/or" as used in this disclosure encompasses any and all possible combinations of the listed items.
Embodiments of the present disclosure will be described in detail below with reference to the accompanying drawings.
Fig. 1 illustrates a schematic diagram of an exemplary system 100 in which various methods and apparatus described herein may be implemented, in accordance with an embodiment of the present disclosure. Referring to fig. 1, the system 100 includes one or more client devices 101, 102, 103, 104, 105, and 106, a server 120, and one or more communication networks 110 coupling the one or more client devices to the server 120. Client devices 101, 102, 103, 104, 105, and 106 may be configured to execute one or more applications.
In an embodiment of the present disclosure, the server 120 may run one or more services or software applications that enable execution of the traffic flow regulation methods of the present disclosure.
In some embodiments, server 120 may also provide other services or software applications, which may include non-virtual environments and virtual environments. In some embodiments, these services may be provided as web-based services or cloud services, for example, provided to users of client devices 101, 102, 103, 104, 105, and/or 106 under a software as a service (SaaS) model.
In the configuration shown in fig. 1, server 120 may include one or more components that implement the functions performed by server 120. These components may include software components, hardware components, or a combination thereof that are executable by one or more processors. A user operating client devices 101, 102, 103, 104, 105, and/or 106 may in turn utilize one or more client applications to interact with server 120 to utilize the services provided by these components. It should be appreciated that a variety of different system configurations are possible, which may differ from system 100. Accordingly, FIG. 1 is one example of a system for implementing the various methods described herein and is not intended to be limiting.
The user may use client devices 101, 102, 103, 104, 105, and/or 106 to navigate the route and obtain corresponding vehicle-induced direction information. The client device may provide an interface that enables a user of the client device to interact with the client device. The client device may also output information to the user via the interface. Although fig. 1 depicts only six client devices, those skilled in the art will appreciate that the present disclosure may support any number of client devices.
Client devices 101, 102, 103, 104, 105, and/or 106 may include various types of computer devices, such as portable handheld devices, general purpose computers (such as personal computers and laptop computers), workstation computers, wearable devices, smart screen devices, self-service terminal devices, service robots, gaming systems, thin clients, various messaging devices, sensors or other sensing devices, and the like. These computer devices may run various types and versions of software applications and operating systems, such as MICROSOFT Windows, APPLE iOS, UNIX-like operating systems, linux, or Linux-like operating systems (e.g., GOOGLE Chrome OS); or include various mobile operating systems such as MICROSOFT Windows Mobile OS, iOS, windows Phone, android. Portable handheld devices may include cellular telephones, smart phones, tablet computers, personal Digital Assistants (PDAs), and the like. Wearable devices may include head mounted displays (such as smart glasses) and other devices. The gaming system may include various handheld gaming devices, internet-enabled gaming devices, and the like. The client device is capable of executing a variety of different applications, such as various Internet-related applications, communication applications (e.g., email applications), short Message Service (SMS) applications, and may use a variety of communication protocols.
Network 110 may be any type of network known to those skilled in the art that may support data communications using any of a number of available protocols, including but not limited to TCP/IP, SNA, IPX, etc. For example only, the one or more networks 110 may be a Local Area Network (LAN), an ethernet-based network, a token ring, a Wide Area Network (WAN), the internet, a virtual network, a Virtual Private Network (VPN), an intranet, an extranet, a blockchain network, a Public Switched Telephone Network (PSTN), an infrared network, a wireless network (e.g., bluetooth, WIFI), and/or any combination of these and/or other networks.
The server 120 may include one or more general purpose computers, special purpose server computers (e.g., PC (personal computer) servers, UNIX servers, mid-end servers), blade servers, mainframe computers, server clusters, or any other suitable arrangement and/or combination. The server 120 may include one or more virtual machines running a virtual operating system, or other computing architecture that involves virtualization (e.g., one or more flexible pools of logical storage devices that may be virtualized to maintain virtual storage devices of the server). In various embodiments, server 120 may run one or more services or software applications that provide the functionality described below.
The computing units in server 120 may run one or more operating systems including any of the operating systems described above as well as any commercially available server operating systems. Server 120 may also run any of a variety of additional server applications and/or middle tier applications, including HTTP servers, FTP servers, CGI servers, JAVA servers, database servers, etc.
In some implementations, server 120 may include one or more applications to analyze and consolidate data feeds and/or event updates received from users of client devices 101, 102, 103, 104, 105, and/or 106. Server 120 may also include one or more applications to display data feeds and/or real-time events via one or more display devices of client devices 101, 102, 103, 104, 105, and/or 106.
In some implementations, the server 120 may be a server of a distributed system or a server that incorporates a blockchain. The server 120 may also be a cloud server, or an intelligent cloud computing server or intelligent cloud host with artificial intelligence technology. The cloud server is a host product in a cloud computing service system, so as to solve the defects of large management difficulty and weak service expansibility in the traditional physical host and Virtual special server (VPS PRIVATE SERVER) service.
The system 100 may also include one or more databases 130. In some embodiments, these databases may be used to store data and other information. For example, one or more of databases 130 may be used to store information such as audio files and video files. Database 130 may reside in various locations. For example, the database used by the server 120 may be local to the server 120, or may be remote from the server 120 and may communicate with the server 120 via a network-based or dedicated connection. Database 130 may be of different types. In some embodiments, the database used by server 120 may be, for example, a relational database. One or more of these databases may store, update, and retrieve the databases and data from the databases in response to the commands.
In some embodiments, one or more of databases 130 may also be used by applications to store application data. The databases used by the application may be different types of databases, such as key value stores, object stores, or conventional stores supported by the file system.
The system 100 of fig. 1 may be configured and operated in various ways to enable application of the various methods and apparatus described in accordance with the present disclosure.
According to some embodiments, as shown in fig. 2, there is provided a traffic flow adjusting method, including: step S201, determining the actual traffic saturation of each channel in the current period of time according to each channel in a plurality of channels, wherein each channel in the plurality of channels is a main channel from a first area to a second area; step S202, determining saturated channels and evacuation channels in a plurality of channels based on the actual traffic saturation of each channel in the plurality of channels and the corresponding target saturation; and step S203, determining a vehicle guidance direction in a plurality of routes respectively passing through the plurality of channels based on the saturated channels and the evacuation channels in the plurality of channels, so as to perform traffic flow adjustment of the corresponding channels in the plurality of routes based on the vehicle guidance direction, wherein the plurality of routes comprise the same starting point and the same end point, and the vehicle guidance direction is used for guiding the vehicle from the route passing through the saturated channels in the plurality of routes to the route passing through the evacuation channels in the plurality of routes.
Therefore, under the condition that the running start point and the running end point of a user are unchanged, guidance information of the running direction of the vehicle is provided for the user, so that the traffic flow is guided into the evacuation channel from the saturated channel, and the adjustment and balance of traffic flow among a plurality of channels between two areas are realized.
Wherein the first region and the second region may not be limited to administrative regions. In some embodiments, the first area and the second area may be, for example, a business area and a residential area. It will be appreciated that the first and second regions may be self-determined based on actual traffic flow regulation needs, and are not limited herein.
In some embodiments, the multiple channels between the first area and the second area may select, according to the analysis requirement, multiple trunk channels with average traffic flow connected between the two areas greater than a preset flow threshold. It will be appreciated that the plurality of channels between the first region and the second region may also be self-determined based on actual traffic flow regulation needs, and is not limited herein.
Fig. 3 shows a schematic view of a traffic channel between two areas according to an exemplary embodiment of the present disclosure.
As shown in fig. 3, first, the first region 310 and the second region 320 may be determined first, and in the above manner, the channel 301 (T 1), the channel 302 (T 2), the channel 303 (T 3), and the channel 304 (T 4) between the first region 310 and the second region 320 are acquired.
In some embodiments, the traffic flow may be adjusted by the method described above for each of the two directions of travel of the determined plurality of channels (from the first region to the second region, from the second region to the first region) for the selected two regions.
In some embodiments, taking one of the directions as an example, the actual traffic saturation of each of the plurality of channels in that direction may be obtained first.
In some embodiments, the determination of actual traffic saturation may include: firstly, determining the actual traffic flow of each of a plurality of channels in the current period, wherein the actual traffic flow can be the number of vehicles passing through traffic bayonets of the channel in the current period; the actual traffic saturation for the current period of the channel may then be determined based on the ratio of the actual traffic flow for the channel to the saturated traffic flow for the channel.
In some embodiments, the saturated traffic flow of the channel may be, for example, a constant. For example, if a vehicle is traveling a certain distance in front of and behind the vehicle, and if saturated, a vehicle will pass through for typically 2-3 seconds, the saturated traffic flow for one hour of a lane may be 1800 vehicles, for example.
In some embodiments, in order to make saturation between channels more uniform, especially during the early and late peak periods, channels which are not too congested and channels which are not too unblocked are not present, traffic capacity of each channel is fully utilized, traffic flow efficiency between areas is improved, and target saturation of different channels needs to be set in different time periods.
In some embodiments, different target saturations may be set for each channel separately for different ones of a plurality of predetermined periods of the day (e.g., each hour of the day). In some embodiments, the target saturation of each channel may not be set or only the target saturation of a part of channels may be set, and the channel default without the saturation target may be used as an evacuation channel to split the saturated channel vehicle. The saturation channel indicates a channel with actual traffic saturation larger than target saturation corresponding to the current time period; the evacuation channel indicates a channel of which the actual traffic saturation does not exceed the target saturation corresponding to the current period. In some embodiments, vehicles in a saturated aisle may be evacuated into an evacuation aisle.
In some embodiments, for some preset period of time, a respective target saturation may also be set for each of the plurality of channels. The target saturation has a value interval of [0,1], for example, for the channel 301 (T 1), the channel 302 (T 2), the channel 303 (T 3), and the channel 304 (T 4), the target saturation in the preset period of 8 to 9 points can be shown in the following table.
In some embodiments, to ensure that the normal travel of the user is not affected during the vehicle adjustment process, i.e., to ensure that the start and end points of the user are unchanged, it is necessary to first determine a corresponding plurality of routes based on a plurality of channels, wherein the start and end points of the plurality of routes are the same.
According to some embodiments, as shown in fig. 4, the acquisition of the start and end points of the plurality of routes may include: step S401, at least one upstream trunk road of each channel in a plurality of channels is obtained, so as to obtain a plurality of upstream trunk roads; step S402, determining an intersection point, close to a plurality of channels, of a first road and a second road in a plurality of upstream main roads as a first starting point of a plurality of routes; step S403, obtaining at least one downstream trunk road of each channel in the plurality of channels so as to obtain a plurality of downstream trunk roads; and step S404, determining an intersection point of a third road and a fourth road, which is close to the plurality of channels, in the plurality of downstream main roads as a first end point of the plurality of routes.
Therefore, by traversing each trunk road extending towards the upstream and the downstream of the channels and respectively determining the intersection points formed by extending of each trunk road at the upstream and the downstream as the starting point and the end point, a plurality of groups of routes which more comprehensively pass through the channels can be obtained, and the balance effect of traffic flow in the channels is further optimized.
In some exemplary embodiments, the multiple channels are traced upstream according to road network topology, and an upstream arterial road (which may include, for example, an upstream expressway, an arterial road, a secondary arterial road, etc., which may be obtained based on map data in road network topology, for example) of each channel is selected first, and an intersection point of two or more upstream arterial roads near the multiple channels is taken as a split point (denoted as an O point), that is, a start point of multiple routes passing through the split point. With continued reference to fig. 3, taking the channel 301 (T 1) and the channel 302 (T 2) as examples, the upstream thereof is traced back to obtain the upstream trunk road 305 and the upstream trunk road 306, respectively, and the intersection point of the two upstream trunk roads can be regarded as the starting points 311 (which may be denoted as O 1) of two routes respectively passing through the channel 301 (T 1) and the channel 302 (T 2).
Similarly, the multiple channels may be traced back downstream according to the road network topology, and the downstream main road of each channel (for example, may include a downstream expressway, a main road, a secondary main road, etc., which may be obtained based on map data in the road network topology, for example) is selected, and the intersection point of two or more downstream main roads near the multiple channels is taken as a junction point (denoted as a point D), that is, the end point of the multiple routes passing through the junction point. With continued reference to fig. 3, taking the channel 301 (T 1) and the channel 302 (T 2) as examples, the downstream thereof is traced, so as to obtain the downstream trunk road 307 and the downstream trunk road 308, respectively, and the intersection point of the two downstream trunk roads can be regarded as the end point 321 (which may be denoted as D 1) of two routes respectively passing through the channel 301 (T 1) and the channel 302 (T 2).
In some embodiments, the start point and the end point may be manually adjusted after determining according to the road network topology relationship, so as to ensure that each start point and each end point are respectively located at the section positions of the road sections before and after the diversion, so as to be capable of acquiring the traffic flow through the sections.
In some embodiments, only a set of start points and end points may be acquired for the plurality of channels, and each route of the plurality of routes determined based on the start points, the end points, and the plurality of channels, respectively, is passed through the corresponding channel.
In some embodiments, for the above-mentioned multiple routes, the actual traffic saturation in the channel corresponding to each route may be calculated respectively, and the current saturation channel and the evacuation channel may be determined by comparing the actual traffic saturation with the target saturation corresponding to each channel in the current period, and then the route corresponding to the saturation channel and the route corresponding to the evacuation channel may be obtained accordingly. Correspondingly, the vehicle guidance direction can be determined to be from the route passing through the saturation passage to the route passing through the evacuation passage.
In some embodiments, determining the vehicle induction direction in a plurality of routes respectively passing through the plurality of channels based on the saturated channel and the evacuation channel in the plurality of channels may include: determining a current traffic cost for each of the plurality of routes, the current traffic cost determined based on a corresponding current predicted transit time for the route; and determining the vehicle guidance direction as being guidance from the first route to the second route in response to the plurality of routes including the first route and the second route meeting the preset condition, wherein the preset condition includes the first route passing through the saturation passage, the second route passing through the evacuation passage, and the current traffic cost of the second route being less than the current traffic cost of the first route.
Therefore, when the guidance direction is determined, the current traffic cost of each route is further considered, so that traffic flow balance is ensured, and meanwhile, traffic efficiency is also ensured.
In some embodiments, the projected transit time for the current time period may be first obtained before calculating the traffic cost for each route for the current time period. Wherein the expected arrival time may be obtained through an internet map open platform, the data is typically updated every 5 minutes.
The estimated time of passage for the current time period may be determined based on an average of a plurality of estimated times of arrival within the previous hour. For example, the current time period is 4:00-4:30, and the estimated transit time applied may be the average of the estimated transit times of 3:00-4:00 of the day.
In some embodiments, assuming each individual trip is rational, targeting transit time optimization, the current traffic cost may be equivalent to the current predicted transit time.
In some embodiments, the current traffic cost may also be determined jointly based on current projected time of flight, distance of flight, fuel consumption, and like reference factors. It is understood that the manner of calculating the current traffic cost based on the current estimated traffic time, traffic distance, and fuel consumption may be determined by itself based on actual needs, and is not limited herein.
In some embodiments, the corresponding current traffic cost is obtained for each route, and further, the determination of the vehicle guidance direction may further introduce the reference factor of the current traffic cost, and only the route that passes through the evacuation channel and has the current traffic cost smaller than the route to be shunted (the route passing through the saturation channel) is taken as the shuntable route.
In some embodiments, as shown in fig. 5, the traffic flow adjustment method may further include: step S501, acquiring each route in a plurality of routes, and historical traffic flow in each preset time period in a plurality of preset time periods; step S502, determining the total traffic regulation amount among a plurality of channels based on the actual traffic saturation, the target saturation and the saturated traffic volume of each of the plurality of channels in the current period; and step S503, responding to the plurality of routes and comprising at least one inducible route group, and determining the traffic adjustment quantity in the inducible route group based on the corresponding historical traffic flow of the reference route in each of the at least one inducible route group in a first period, wherein each of the at least one inducible route group comprises a corresponding first route and a corresponding second route, the first period is a preset period corresponding to the current period in a plurality of preset periods, and the reference route is the first route or the second route in the corresponding inducible route group.
Thereby, determining an inducible traffic conditioning total amount by the actual saturation and the target saturation information of each channel; and then, based on the counted historical traffic flow of each route in a corresponding preset period, respectively determining the adjustment traffic flow of each inducible route group, so that reasonable traffic flow adjustment values can be obtained, and based on the specific adjustment values, the traffic flow in the corresponding route is adjusted, so that the adjustment and balance of the traffic flow among a plurality of channels between two areas are further improved.
In some embodiments, after determining the vehicle guidance direction, the traffic adjustment amount for each route to be split in the corresponding plurality of routes may be further used to accurately control the traffic flow of the plurality of channels.
In some embodiments, before the calculation of the traffic adjustment amount for each route to be split is performed, statistics of historical traffic flow may be first performed for each route as a reference for subsequent calculation of the traffic adjustment amount for each route to be split.
In some embodiments, obtaining each route of the plurality of routes, the historical traffic flow for each of the plurality of predetermined periods comprises: for each route of the plurality of routes, performing the following: acquiring traffic flow of the route for each of a plurality of predetermined time periods of each day in a plurality of days of the recent history; and calculating, for each of a plurality of predetermined time periods, a mean of traffic flow for a last historical number of days of the route as a historical traffic flow for the route over the predetermined time period.
Therefore, the rolling update of the historical traffic flow can be carried out based on the average value of the historical multi-day data by collecting the traffic flow of each time period on each route every day, so that the timeliness and the accuracy of the traffic adjustment are further improved.
In some embodiments, for each of the plurality of routes, traffic flow is acquired for each predetermined period of time each day over its history of multiple days, respectively. Wherein for a predetermined period, a first period is first determined for which the vehicle reaches the route end based on the predetermined period and a maximum and a minimum of a plurality of estimated transit times in the period; then, by license plate matching, vehicles passing through the route start point in the predetermined period and the route start point in the first period are determined, thereby obtaining traffic flow in the predetermined period on the same day of the route.
The average of traffic flow may then be obtained as a historical traffic flow for the route for the predetermined period based on the traffic flow for the predetermined period for each of a plurality of recent historical days of the route.
In some embodiments, the recent history may be further divided into a working day and a holiday, that is, the historical traffic flow of each route of the recent history of the working day and the holiday is calculated respectively, and the historical traffic flow of the corresponding type is selected according to the current date type for subsequent calculation.
Subsequently, a calculation may be performed based on the actual traffic saturation, the target saturation, and the saturated traffic volume of each channel for the current period to obtain the total amount of traffic adjustment that needs to be adjusted. In some embodiments, the total amount of traffic Q to be diverted (to be diverted) for the saturated channel may be expressed as:
Where α Actual practice is that of represents the actual traffic saturation of the corresponding channel, α Target object represents the target saturation of the corresponding channel, and Q Saturation represents the saturated traffic volume of the corresponding channel.
Similarly, the total amount of shuntable traffic Q (shuntable) of an evacuation channel can be expressed as:
in some embodiments, the total traffic regulation among the plurality of channels can be determined as the shuntable total traffic of the evacuation channel, so as to avoid the oversaturation condition of the evacuation channel caused by excessive regulation.
In some embodiments, the plurality of routes includes at least one inducible route group during the current time period, wherein a first route and a second route meeting the preset condition are included in each inducible route group, that is, the first route passes through the saturation passage, the second route passes through the evacuation passage, and the current traffic cost of the second route is less than the current traffic cost of the first route.
In some embodiments, since the traffic accommodation total is determined as the shuntable traffic total of the evacuation channel, the determination of the allocated traffic accommodation amount for each inducible route group may be determined based on the historical traffic flow of the second route in each inducible route group. Specifically, the sum of the historical traffic flows of the second route in each inducible route group corresponding to the current period may be calculated first, and the ratio of the historical traffic flows of the second route in each inducible route group to the sum may be used as the distributable proportion thereof in the total traffic adjustment amount, so as to obtain the traffic adjustment amounts in the corresponding inducible route groups based on the corresponding proportions. Then, a corresponding number of vehicles on a first route in the inducible set of routes may be induced to a second route in the inducible set of routes based on the traffic adjustment.
In some embodiments, the plurality of channels include different sets of start points and end points, the sets of start points and end points respectively corresponding to a plurality of route sets, each of the plurality of route sets including a plurality of routes respectively passing through the plurality of channels, as shown in fig. 6, the traffic flow adjustment method further includes: step S601, acquiring each route in each route set in a plurality of route sets, and historical traffic flow in each preset time period in a plurality of preset time periods; step S602, determining at least one inducible set in a plurality of route sets, wherein each inducible set in the at least one inducible set comprises at least one inducible route group; step 603, for each inducible set in at least one inducible set, determining a historical traffic total corresponding to the inducible set based on the historical traffic flow corresponding to the reference route of each inducible route group in the inducible set in the first period; step S604, determining an intra-set adjustment total amount of each inducible set based on the historical traffic total amount and the traffic adjustment total amount of each inducible set in at least one inducible set; and step S605, for each inducible set in at least one inducible set, determining the traffic regulation amount in each inducible set of the inducible sets based on the historical traffic flow corresponding to the first period of the reference route in each inducible set of the at least one inducible set of the inducible sets.
Therefore, when the channels correspond to the route sets, reasonable traffic flow adjustment values of the inducible route groups can be obtained, and the traffic flow in the corresponding routes is adjusted based on the specific adjustment values, so that the adjustment and balance of the traffic flow among the channels between the two areas are further improved.
With continued reference to fig. 3, by the above-described method for determining the split point and the merge point, based on the channel 301 (T 1), the channel 302 (T 2), the channel 303 (T 3), and the channel 304 (T 4), the start point 311 (O 1), the start point 312 (O 2), and the end point 321 (D 1), and the end point 322 (D 2) are respectively acquired, and then the corresponding route sets respectively include route sets O 1D1、O1D2、O2D1、O2D2, where each route set includes 4 routes respectively passing through the 4 channels.
When multiple route sets (corresponding to multiple sets of OD point pairs) are acquired based on multiple channels, the historical traffic flow for each route in each route set may be acquired first. Wherein the historical traffic flow for each of a plurality of predetermined time periods for each route may be counted based on the method described above.
In some examples, for the route set O 1D1、O1D2、O2D1、O2D2, a historical traffic flow matrix as shown in the following table may be obtained, taking the predetermined period of 08:00-09:00 as an example, where,A historical traffic flow over a predetermined period of time for a route that starts at O i, ends at D j, and passes through channel T l is represented:
In some exemplary embodiments, the historical traffic flow matrix for each hour of the previous day may be calculated at 24 points per day; the historical traffic flow matrix for each hour of the day may be calculated using the average of the corresponding data of the historical traffic flow matrix for the corresponding time period within the same date type for 7 days of the history. The method specifically comprises the following steps:
first, a predicted arrival time dataset for each of 24 hours is obtained. The Estimated Time of Arrival (ETA) data from O i to D j, i.e., { ETA1, ETA2, …, ETA12} (12 5 minutes per hour) can be acquired in real time every 5 minutes, for example, through an internet map open platform.
Subsequently, a minimum value T ij (min) and a maximum value T ij (max) of the expected arrival time dataset in each hour are calculated. Taking [ 08:00-09:00 ] as an example, electric warning bayonet data of a road section where O i and D j are located are respectively selected for license plate matching, the number of vehicles which pass through O i in a time interval [08:00, 09:00] and pass through D j in a time interval [08:00+T ij(min),09:00+Tij (max) ] and pass through a channel T l at the same time is counted as the historical traffic flow of the day of the preset time period on a corresponding road, wherein T ij (min) and T ij (max) represent the minimum and maximum travel time of O i to D j, the minimum value of the expected arrival time in a T ij (min) value [ 08:00-09:00 ], and the maximum value of the expected arrival time in a T ij (max) value [ 08:00-09:00 ].
24 Historical traffic flow matrices corresponding to 24 predetermined time periods of the same day are calculated at 24 points per day. For ease of calculation, 7 days of historical data were taken for calculation. For example, when calculating the historical traffic flow matrix of 08:00-09:00 today, the average value of each Q ij_Tl in the historical traffic flow matrix of 08:00-09:00 is taken to update the historical traffic flow matrix in the current time interval, wherein the date type is the same in the last 7 days (the corresponding time period data in the working days in the last 7 days is taken if the current day is the working day, and the corresponding time period data in the non-working days in the last 7 days is taken if the current day is the non-working day).
In some embodiments, at least one inducible set of the plurality of route sets may be further determined, wherein each inducible set includes at least one inducible route group therein.
In some examples, for 08:00-09:00, the corresponding target saturation for each channel for the predetermined period is shown in the following table:
channel 301 Channel 302 Channel 303 Channel 304
0.8 0.8 0.8 0.8
Meanwhile, by carrying out statistics of actual traffic flow, the actual traffic saturation of each channel is shown in the following table:
channel 301 Channel 302 Channel 303 Channel 304
0.81 0.85 0.75 0.77
It may be determined that the channel 301 and the channel 302 are saturated channels and the channel 303 and the channel 304 are evacuation channels.
Subsequently, the current traffic costs of the multiple routes in each route set O iDj are further determined, taking route set O 1D1 as an example, the current traffic costs of the individual routesThe following table shows: /(I)
Then for route set O 1D1, its vehicle induction direction may be determined as T 1→T3 and T 2→T3. That is, the route set includes two inducible route groups (T 1→T3) and (T 2→T3), and the route set is an inducible set.
Similarly, the determination of the inducible route groups may also be performed in a similar manner to that described above for other route sets, thereby obtaining all of the inducible sets in the plurality of route sets, and determining each of the inducible route groups in each of the inducible sets, for example, as shown in the following table:
Then, the traffic to be split of the saturation passage and the splittable traffic of the evacuation passage in the above example may be calculated based on the above method, respectively:
In some embodiments, determining the total amount of traffic adjustment between the plurality of channels based on the actual traffic saturation, the target saturation, and the saturated traffic volume for each of the plurality of channels for the current period comprises: determining the total traffic quantity to be shunted of the saturated channels in the plurality of channels based on the corresponding actual traffic saturation, target saturation and saturated traffic quantity of each first saturated channel in at least one first saturated channel in the plurality of channels in the current period; determining the shuntable traffic total of the evacuation channels in the plurality of channels based on the corresponding actual traffic saturation, target saturation and saturated traffic volume of each of the at least one first evacuation channel in the plurality of channels in the current period; and determining the minimum value of the total traffic quantity to be shunted and the total traffic quantity which can be shunted as the total traffic regulation quantity.
Therefore, the total quantity which can be split and the total quantity to be split are calculated respectively, and the minimum value in the total quantity is determined to be the adjustment total quantity, so that oversaturation of the evacuation channel caused by excessive adjustment is avoided.
In some examples, the total amount of traffic adjustment may be obtained based on Q (to be split) and Q (splittable) calculated as described above:
Δq=min { Q (to be split), Q (splittable) }
In some embodiments, the traffic flow adjustment method further includes: responsive to the traffic accommodation total being determined as the total traffic to be diverted, determining a reference route as a first route in the respective inducible route group; and responsive to the traffic accommodation total being determined to be the shuntable traffic total, determining the reference route as a second route in the respective inducible route group.
Therefore, the rationality and the accuracy of the traffic quantity adjustment of each inducible route are further improved, and the traffic flow balance effect is further improved.
In some embodiments, when Δq=q (to be split), then the sum may be calculated for the historical traffic flow for the corresponding period of the first route in each inducible set of routes in each inducible set, thereby obtaining a historical total amount of traffic for each inducible set, continuing with the above example, then
Similarly, in some embodiments, when Δq=q (shuntable), then the sum of the historical traffic flows for the corresponding period of the second route in each inducible group of routes in each inducible set may be calculated to obtain a historical total amount of traffic for each inducible set, continuing with the example above
The corresponding intra-set adjustment total Δq' 11 for the inducible set O 1D1 may be expressed as:
The corresponding total intra-set adjustment Δq' 22 for the inducible set O 2D2 can be expressed as:
The amount of traffic adjustment within each inducible route group may then be determined based on the respective intra-set adjustment total amount Δq' ij for each inducible set O iDj and the historical traffic flow for the respective period for the reference route in each of the at least one inducible route group in the inducible set.
With continued reference to the above example, when Δq=q (to be split), the traffic adjustment amounts corresponding to the inducible route groups Q '11(T1→T3) and Q' 11(T2→T3) can be expressed as:
When Δq=q (shuntable), the traffic adjustment amounts corresponding to the inducible route groups Q '11(T1→T3) and Q' 11(T2→T3) can be expressed as:
Thus, the amount of traffic adjustment within each inducible route group may be determined based on the respective total amount of intra-set adjustment for each inducible set, and the historical traffic flow for the respective period for the reference route in each inducible route group in at least one of the inducible sets.
In some embodiments, as shown in fig. 7, there is also provided a traffic flow adjusting apparatus 700, comprising: a first determining unit 710 configured to determine, for each of a plurality of channels, an actual traffic saturation of the channel in a current period, wherein each of the plurality of channels is a backbone channel leading from a first region to a second region; a second determining unit 720 configured to determine a saturated channel and an evacuated channel of the plurality of channels based on the actual traffic saturation of each of the plurality of channels and the corresponding target saturation; and a third determining unit 730 configured to determine a vehicle inducing direction among a plurality of routes respectively passing through the plurality of channels based on the saturated channel and the evacuation channel among the plurality of channels, for performing traffic flow adjustment of the corresponding channel among the plurality of routes based on the vehicle inducing direction, wherein the plurality of routes include the same starting point and ending point, and the vehicle inducing direction is used for inducing the vehicle from the route passing through the saturated channel among the plurality of routes to the route passing through the evacuation channel among the plurality of routes.
The operations performed by the units 710 to 730 in the traffic flow control device 700 are similar to the operations performed in the steps S201 to S203 in the traffic flow control method described above, and are not described herein.
In some embodiments, the third determining unit comprises: a first determination subunit configured to determine a current traffic cost for each of the plurality of routes, the current traffic cost determined based on a respective current predicted transit time for that route; and a second determination subunit configured to determine, in response to the plurality of routes including the first route and the second route conforming to a preset condition including the first route passing through the saturated passage and the second route passing through the evacuation passage, a vehicle guidance direction as guidance from the first route to the second route, and a current traffic cost of the second route being smaller than a current traffic cost of the first route.
In some embodiments, the traffic flow adjusting device may further include: a first acquisition unit configured to acquire each of a plurality of routes, a historical traffic flow in each of a plurality of predetermined periods; a fourth determination unit configured to determine a traffic adjustment total amount between the plurality of channels based on an actual traffic saturation, a target saturation, and a saturated traffic amount of each of the plurality of channels in the current period; and a fifth determining unit configured to determine, in response to at least one inducible route group included in the plurality of routes, an amount of traffic adjustment within the inducible route group based on a respective historical traffic flow of a reference route in each of the at least one inducible route group over a first period, wherein each of the at least one inducible route group includes a respective first route and a second route, the first period being a predetermined period corresponding to a current period of the plurality of predetermined periods, the reference route being either the first route or the second route of the respective inducible route group.
In some embodiments, the plurality of channels include different sets of start points and end points, the sets of start points and end points respectively corresponding to a plurality of route sets, each of the plurality of route sets including a plurality of routes respectively passing through the plurality of channels, and the traffic flow adjusting apparatus may further include: a second acquisition unit configured to acquire each route in each of a plurality of route sets, a historical traffic flow in each of a plurality of predetermined periods; a sixth determining unit configured to determine at least one inducible set of the plurality of route sets, wherein each of the at least one inducible set includes at least one inducible route group; a seventh determining unit configured to determine, for each of the at least one inducible set, a total amount of historical traffic corresponding to the inducible set based on a corresponding historical traffic flow of a reference route of each of the inducible route groups in the inducible set in a first period; an eighth determination unit configured to determine an intra-set adjustment total amount for each of the at least one inducible set based on a historical traffic total amount and a traffic adjustment total amount for each of the inducible sets; and a ninth determination unit configured to determine, for each of the at least one inducible set, an amount of traffic regulation within each of the at least one inducible route group based on a respective historical traffic flow of a reference route in the inducible route group for the first period.
In some embodiments, the fourth determining unit may include: a third determining subunit configured to determine a total amount of traffic to be split for the saturated channels in the plurality of channels based on the respective actual traffic saturation, the target saturation, and the saturated traffic volume for each of the at least one first saturated channel in the plurality of channels in the current period; a fourth determining subunit configured to determine, based on the respective actual traffic saturation, the target saturation, and the saturated traffic volume for each of at least one first evacuation channel in the plurality of channels in the current period, a total amount of shuntable traffic for the evacuation channel in the plurality of channels; and a fifth determination subunit configured to determine, as the traffic adjustment total amount, the minimum value of the total amount of traffic to be split and the total amount of traffic that can be split.
In some embodiments, the traffic flow adjusting apparatus described above may further include a tenth determining unit configured to: responsive to the traffic accommodation total being determined as the total traffic to be diverted, determining a reference route as a first route in the respective inducible route group; and responsive to the traffic accommodation total being determined to be the shuntable traffic total, determining the reference route as a second route in the respective inducible route group.
In some embodiments, the first acquisition unit may be further configured to: for each route of the plurality of routes, performing the following: acquiring traffic flow of the route for each of a plurality of predetermined time periods of each day in a plurality of days of the recent history; and calculating, for each of a plurality of predetermined time periods, a mean of traffic flow for a last historical number of days of the route as a historical traffic flow for the route over the predetermined time period.
In some embodiments, the third determining unit may be further configured to: acquiring at least one upstream trunk road of each channel in a plurality of channels to acquire a plurality of upstream trunk roads; determining an intersection of a first road and a second road of the plurality of upstream trunk roads, which is close to the plurality of channels, as a first starting point of the plurality of routes; acquiring at least one downstream trunk road of each channel in the plurality of channels to acquire a plurality of downstream trunk roads; and determining an intersection of a third link and a fourth link of the plurality of downstream trunk links proximate to the plurality of lanes as a first endpoint of the plurality of routes.
According to embodiments of the present disclosure, there is also provided an electronic device, a readable storage medium and a computer program product.
Referring to fig. 8, a block diagram of an electronic device 800 that may be a server or a client of the present disclosure, which is an example of a hardware device that may be applied to aspects of the present disclosure, will now be described. Electronic devices are intended to represent various forms of digital electronic computer devices, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other suitable computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the disclosure described and/or claimed herein.
As shown in fig. 8, the electronic device 800 includes a computing unit 801 that can perform various appropriate actions and processes according to a computer program stored in a Read Only Memory (ROM) 802 or a computer program loaded from a storage unit 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data required for the operation of the electronic device 800 can also be stored. The computing unit 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to the bus 804.
Various components in electronic device 800 are connected to I/O interface 805, including: an input unit 806, an output unit 807, a storage unit 808, and a communication unit 809. The input unit 806 may be any type of device capable of inputting information to the electronic device 800, the input unit 806 may receive input numeric or character information and generate key signal inputs related to user settings and/or function control of the electronic device, and may include, but is not limited to, a mouse, a keyboard, a touch screen, a trackpad, a trackball, a joystick, a microphone, and/or a remote control. The output unit 807 may be any type of device capable of presenting information and may include, but is not limited to, a display, speakers, video/audio output terminals, vibrators, and/or printers. The storage unit 808 may include, but is not limited to, magnetic disks, optical disks. The communication unit 809 allows the electronic device 800 to exchange information/data with other devices over computer networks, such as the internet, and/or various telecommunications networks, and may include, but is not limited to, modems, network cards, infrared communication devices, wireless communication transceivers and/or chipsets, such as bluetooth (TM) devices, 802.11 devices, wiFi devices, wiMax devices, cellular communication devices, and/or the like.
The computing unit 801 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 801 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The calculation unit 801 performs the respective methods and processes described above, such as the traffic flow adjustment method described above. For example, in some embodiments, the traffic flow adjustment methods described above may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as the storage unit 808. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 800 via the ROM 802 and/or the communication unit 809. When a computer program is loaded into RAM 803 and executed by computing unit 801, one or more steps of the above-described traffic flow adjustment method may be performed. Alternatively, in other embodiments, the computing unit 801 may be configured to perform the above-described traffic flow adjustment method by any other suitable means (e.g., by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), complex Programmable Logic Devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present disclosure may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server incorporating a blockchain.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps recited in the present disclosure may be performed in parallel, sequentially or in a different order, provided that the desired results of the disclosed aspects are achieved, and are not limited herein.
Although embodiments or examples of the present disclosure have been described with reference to the accompanying drawings, it is to be understood that the foregoing methods, systems, and apparatus are merely exemplary embodiments or examples, and that the scope of the present invention is not limited by these embodiments or examples but only by the claims following the grant and their equivalents. Various elements of the embodiments or examples may be omitted or replaced with equivalent elements thereof. Furthermore, the steps may be performed in a different order than described in the present disclosure. Further, various elements of the embodiments or examples may be combined in various ways. It is important that as technology evolves, many of the elements described herein may be replaced by equivalent elements that appear after the disclosure.

Claims (12)

1. A method of traffic flow regulation, the method comprising:
Determining, for each of a plurality of channels, an actual traffic saturation of the channel over a current period of time, wherein each of the plurality of channels is a backbone channel from a first region to a second region;
determining a saturated channel and an evacuated channel in the plurality of channels based on the actual traffic saturation of each of the plurality of channels and the corresponding target saturation;
Determining a vehicle guidance direction among a plurality of routes respectively passing through the plurality of channels based on a saturated channel and an evacuation channel among the plurality of channels, to perform traffic flow adjustment of the corresponding channel among the plurality of routes based on the vehicle guidance direction, wherein the plurality of routes include the same starting point and ending point, the vehicle guidance direction is used for guiding a vehicle from the route passing through the saturated channel among the plurality of routes to the route passing through the evacuation channel among the plurality of routes, wherein the determining the vehicle guidance direction among the plurality of routes respectively passing through the plurality of channels based on the saturated channel and the evacuation channel among the plurality of channels includes:
Determining a current traffic cost for each of the plurality of routes, the current traffic cost determined based on a respective current predicted transit time for the route; and
Determining the vehicle guidance direction as being guidance from a first route to a second route in response to the plurality of routes including the first route and the second route meeting a preset condition, wherein the preset condition includes the first route passing through a saturated passage, the second route passing through an evacuation passage, and a current traffic cost of the second route being less than a current traffic cost of the first route;
acquiring historical traffic flow for each of the plurality of routes for each of a plurality of predetermined time periods;
determining a total amount of traffic to be shunted for each of the plurality of channels of saturation and a total amount of shuntable traffic for an evacuation channel based on an actual traffic saturation, a target saturation, and a saturated traffic volume for each of the plurality of channels of a current time period to determine one of the total amount of traffic to be shunted and the total amount of shuntable traffic as a traffic adjustment total amount between the plurality of channels based on the total amount of traffic to be shunted and the total amount of shuntable traffic;
Determining, in response to the plurality of routes including at least one inducible route group, a sum of historical traffic flows of a reference route for each of the at least one inducible route group over a first period, wherein each of the at least one inducible route group includes a respective first route and second route, the first period being a predetermined period corresponding to a current period of the plurality of predetermined periods, and the determining of the reference route includes:
responsive to the traffic accommodation total being determined as the total traffic to be diverted, determining the reference route as a first route in a respective inducible route group; and
Responsive to the traffic accommodation total being determined to be the shuntable traffic total, determining the reference route as a second route in the respective inducible route group; and
For each of the at least one inducible route group, calculating a ratio of historical traffic flow to the sum of reference routes for each of the inducible route groups over the first period to determine an amount of traffic adjustment within each of the inducible route groups based on the respective ratio of each of the inducible route groups and the total amount of traffic adjustment.
2. The method of claim 1, the plurality of channels comprising different sets of start points and end points, the sets of start points and end points corresponding respectively to a plurality of route sets, each route set of the plurality of route sets comprising a plurality of routes respectively passing through the plurality of channels, the method further comprising:
acquiring each route in each route set in the plurality of route sets, and historical traffic flow in each predetermined period in the plurality of predetermined periods;
Determining at least one inducible set of the plurality of route sets, wherein each inducible set of the at least one inducible set includes at least one inducible route group;
for each inducible set in the at least one inducible set, determining a historical traffic total corresponding to the inducible set based on the historical traffic flow corresponding to the reference route of each inducible route group in the inducible set in the first period;
Determining an intra-set adjustment total amount for each inducible set based on a historical traffic total amount for each inducible set of the at least one inducible set and the traffic adjustment total amount; and
For each of the at least one inducible set, determining an amount of traffic regulation within each of the at least one inducible route group based on a corresponding historical traffic flow for the first period for a reference route in the inducible route group.
3. The method of claim 1 or 2, wherein the determining a total amount of traffic to be split for a saturated channel and a total amount of shuntable traffic for an evacuation channel in the plurality of channels based on the actual traffic saturation, the target saturation, and the saturated traffic volume for each channel in the plurality of channels for the current time period to determine one of the total amount of traffic to be split and the total amount of shuntable traffic as a total amount of traffic adjustment between the plurality of channels based on the total amount of traffic to be split and the total amount of shuntable traffic comprises:
determining the total traffic quantity to be shunted of saturated channels in a plurality of channels based on the corresponding actual traffic saturation, target saturation and saturated traffic quantity of each first saturated channel in at least one first saturated channel in the plurality of channels in the current period;
Determining the shuntable traffic total of the evacuation channels in the plurality of channels based on the corresponding actual traffic saturation, target saturation and saturated traffic volume of each first evacuation channel in at least one first evacuation channel in the plurality of channels in the current period; and
And determining the minimum value of the total traffic quantity to be shunted and the total traffic quantity capable of being shunted as the total traffic regulation quantity.
4. The method of claim 1 or 2, wherein the acquiring each of the plurality of routes, the historical traffic flow for each of a plurality of predetermined periods comprises:
For each route of the plurality of routes, performing the following:
acquiring traffic flow of the route for each of the plurality of predetermined time periods for each day of the recent history of multiple days; and
For each of the plurality of predetermined time periods, calculating a mean value of traffic flow for the most recent historical days for the route as historical traffic flow for the route over the predetermined time period.
5. The method of claim 1 or 2, wherein the obtaining of the start and end points of the plurality of routes comprises:
acquiring at least one upstream trunk road of each channel in the plurality of channels to acquire a plurality of upstream trunk roads;
determining an intersection of a first road and a second road of the plurality of upstream trunk roads near the plurality of channels as a first origin of the plurality of routes;
acquiring at least one downstream trunk road of each channel in the plurality of channels to acquire a plurality of downstream trunk roads; and
An intersection of a third link and a fourth link of the plurality of downstream trunk links proximate to the plurality of lanes is determined as a first endpoint of the plurality of routes.
6. A traffic flow regulating device, the device comprising:
A first determining unit configured to determine, for each of a plurality of channels, an actual traffic saturation of the channel in a current period, wherein each of the plurality of channels is a backbone channel leading from a first region to a second region;
A second determining unit configured to determine a saturated channel and an evacuated channel of the plurality of channels based on an actual traffic saturation of each of the plurality of channels and a corresponding target saturation;
A third determination unit configured to determine, based on a saturated passage and an evacuation passage of the plurality of passages, a vehicle guidance direction among a plurality of routes respectively passing through the plurality of passages, for performing traffic flow adjustment of the respective passages among the plurality of routes based on the vehicle guidance direction, wherein the plurality of routes include the same start point and end point, the vehicle guidance direction being for guiding a vehicle from a saturated passage-passing route of the plurality of routes onto an evacuation passage-passing route of the plurality of routes, wherein the third determination unit includes:
A first determination subunit configured to determine a current traffic cost for each of the plurality of routes, the current traffic cost determined based on a respective current predicted transit time for that route; and
A second determination subunit configured to determine the vehicle guidance direction as being guidance from a first route to a second route in response to the plurality of routes including the first route and the second route meeting a preset condition, wherein the preset condition includes the first route passing through a saturated passage, the second route passing through an evacuation passage, and a current traffic cost of the second route being smaller than a current traffic cost of the first route;
A first acquisition unit configured to acquire a historical traffic flow for each of the plurality of routes for each of a plurality of predetermined periods;
A fourth determination unit configured to determine a total amount of traffic to be split for a saturated channel and a total amount of traffic to be split for an evacuation channel in the plurality of channels based on an actual traffic saturation, a target saturation, and a saturated traffic volume for each of the plurality of channels in a current period, to determine one of the total amount of traffic to be split and the total amount of traffic to be split as a traffic adjustment total amount between the plurality of channels based on the total amount of traffic to be split and the total amount of traffic to be split; and
A fifth determination unit configured to:
Determining, in response to the plurality of routes including at least one inducible route group, a sum of historical traffic flows of a reference route for each of the at least one inducible route group over a first period, wherein each of the at least one inducible route group includes a respective first route and second route, the first period being a predetermined period corresponding to a current period of the plurality of predetermined periods, and the determining of the reference route includes:
responsive to the traffic accommodation total being determined as the total traffic to be diverted, determining the reference route as a first route in a respective inducible route group; and
Responsive to the traffic accommodation total being determined to be the shuntable traffic total, determining the reference route as a second route in the respective inducible route group; and
For each of the at least one inducible route group, calculating a ratio of historical traffic flow to the sum of reference routes for each of the inducible route groups over the first period to determine an amount of traffic adjustment within each of the inducible route groups based on the respective ratio of each of the inducible route groups and the total amount of traffic adjustment.
7. The apparatus of claim 6, the plurality of channels comprising different sets of start points and end points, the sets of start points and end points corresponding respectively to a plurality of route sets, each route set of the plurality of route sets comprising a plurality of routes respectively passing through the plurality of channels, the apparatus further comprising:
A second acquisition unit configured to acquire each route in each of the plurality of route sets, a historical traffic flow in each of the plurality of predetermined periods;
a sixth determining unit configured to determine at least one inducible set of the plurality of route sets, wherein each of the at least one inducible set includes at least one inducible route group;
A seventh determining unit configured to determine, for each of the at least one inducible set, a total amount of historical traffic corresponding to the inducible set based on a historical traffic flow corresponding to a reference route of each of the inducible route groups in the inducible set in the first period;
An eighth determination unit configured to determine an intra-set adjustment total amount for each of the at least one inducible set based on a historical traffic total amount for each of the inducible sets and the traffic adjustment total amount; and
A ninth determination unit configured to determine, for each of the at least one inducible set, an amount of traffic regulation within each of the at least one inducible route group based on a respective historical traffic flow of a reference route in the inducible route group for the first period.
8. The apparatus according to claim 6 or 7, wherein the fourth determination unit comprises:
A third determining subunit configured to determine a total amount of traffic to be split for a saturated channel in the plurality of channels based on a corresponding actual traffic saturation, a target saturation, and a saturated traffic volume for each of at least one first saturated channel in the plurality of channels in the current period;
a fourth determining subunit configured to determine, based on the respective actual traffic saturation, the target saturation, and the saturated traffic volume for each of at least one first evacuation channel of the plurality of channels in the current period, a total amount of shuntable traffic for the evacuation channel of the plurality of channels; and
And a fifth determination subunit configured to determine, as the traffic adjustment total amount, a minimum value of the total amount of traffic to be split and the total amount of traffic that can be split.
9. The apparatus of claim 6 or 7, wherein the first acquisition unit is further configured to:
For each route of the plurality of routes, performing the following:
acquiring traffic flow of the route for each of the plurality of predetermined time periods for each day of the recent history of multiple days; and
For each of the plurality of predetermined time periods, calculating a mean value of traffic flow for the most recent historical days for the route as historical traffic flow for the route over the predetermined time period.
10. An electronic device, comprising:
At least one processor; and
A memory communicatively coupled to the at least one processor; wherein the method comprises the steps of
The memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-5.
11. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-5.
12. A computer program product comprising a computer program, wherein the computer program, when executed by a processor, implements the method of any of claims 1-5.
CN202211370300.XA 2022-11-03 2022-11-03 Traffic flow regulating method, device, equipment and medium Active CN115830851B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211370300.XA CN115830851B (en) 2022-11-03 2022-11-03 Traffic flow regulating method, device, equipment and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211370300.XA CN115830851B (en) 2022-11-03 2022-11-03 Traffic flow regulating method, device, equipment and medium

Publications (2)

Publication Number Publication Date
CN115830851A CN115830851A (en) 2023-03-21
CN115830851B true CN115830851B (en) 2024-05-31

Family

ID=85526419

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211370300.XA Active CN115830851B (en) 2022-11-03 2022-11-03 Traffic flow regulating method, device, equipment and medium

Country Status (1)

Country Link
CN (1) CN115830851B (en)

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109887288A (en) * 2019-03-27 2019-06-14 江苏智通交通科技有限公司 A kind of city road network induction scheme dissemination method and system based on travel components
CN111915887A (en) * 2020-07-10 2020-11-10 广州运星科技有限公司 Integration and processing system and method based on multi-source heterogeneous traffic data
CN112311687A (en) * 2020-10-26 2021-02-02 新华三大数据技术有限公司 Traffic scheduling method and device
CN112818497A (en) * 2021-04-19 2021-05-18 腾讯科技（深圳）有限公司 Traffic simulation method, traffic simulation device, computer equipment and storage medium
CN113763741A (en) * 2021-08-20 2021-12-07 东南大学 Trunk road traffic guidance method in Internet of vehicles environment
CN114566041A (en) * 2022-01-27 2022-05-31 苏州大学 Multi-source data fusion urban congestion road section multi-mode travel induction method and equipment
CN114758514A (en) * 2022-03-24 2022-07-15 山东省交通规划设计院集团有限公司 Path induction method and system based on road use mode
CN115188199A (en) * 2022-09-13 2022-10-14 深圳市城市交通规划设计研究中心股份有限公司 Traffic guidance and signal control collaborative optimization method, electronic device and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113592136A (en) * 2021-06-18 2021-11-02 阿波罗智联(北京)科技有限公司 Traffic data prediction method and device and electronic equipment

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109887288A (en) * 2019-03-27 2019-06-14 江苏智通交通科技有限公司 A kind of city road network induction scheme dissemination method and system based on travel components
CN111915887A (en) * 2020-07-10 2020-11-10 广州运星科技有限公司 Integration and processing system and method based on multi-source heterogeneous traffic data
CN112311687A (en) * 2020-10-26 2021-02-02 新华三大数据技术有限公司 Traffic scheduling method and device
CN112818497A (en) * 2021-04-19 2021-05-18 腾讯科技（深圳）有限公司 Traffic simulation method, traffic simulation device, computer equipment and storage medium
CN113763741A (en) * 2021-08-20 2021-12-07 东南大学 Trunk road traffic guidance method in Internet of vehicles environment
CN114566041A (en) * 2022-01-27 2022-05-31 苏州大学 Multi-source data fusion urban congestion road section multi-mode travel induction method and equipment
CN114758514A (en) * 2022-03-24 2022-07-15 山东省交通规划设计院集团有限公司 Path induction method and system based on road use mode
CN115188199A (en) * 2022-09-13 2022-10-14 深圳市城市交通规划设计研究中心股份有限公司 Traffic guidance and signal control collaborative optimization method, electronic device and storage medium

Also Published As

Publication number Publication date
CN115830851A (en) 2023-03-21

Similar Documents

Publication Publication Date Title
EP3407018B1 (en) Navigation route display method and device, and storage medium
US20230243661A1 (en) Navigation path planning method and apparatus, device, and storage medium
US20230316902A1 (en) Traffic flow migration situation display method and apparatus, device, medium and product
CN110823237B (en) Starting point binding and prediction model obtaining method, device and storage medium
EP4119896A2 (en) Method and apparatus for processing high-definition map data, electronic device, medium and product
CN114063858B (en) Image processing method, image processing device, electronic equipment and storage medium
CN115265559A (en) Map automatic generation method, device, equipment and medium
CN114413920A (en) Lane data processing method, navigation method and device
CN113899381B (en) Method, apparatus, device, medium, and product for generating route information
CN115830851B (en) Traffic flow regulating method, device, equipment and medium
CN113706857A (en) Method, device and equipment for determining road trafficability and storage medium
CN115979296A (en) Navigation method, navigation device, electronic equipment and medium
CN114923498A (en) Navigation route planning method and device, equipment and medium
CN115206102A (en) Method, apparatus, electronic device, and medium for determining traffic path
CN113450569A (en) Method, device, electronic equipment and storage medium for determining intersection state
CN114964295A (en) Navigation method, device and system and electronic equipment
CN115168527A (en) Real-time track data processing method, device and system and electronic equipment
CN113447034A (en) Road network data processing method and device, electronic equipment and readable storage medium
CN112381305A (en) Taxi taking time estimation method and device, electronic equipment and storage medium
CN114440918B (en) Charging pile navigation method and device, electronic equipment and automatic driving vehicle
EP4180765A1 (en) High-precision-map data collection method and system
US20230228579A1 (en) Navigating method, electronic device and medium
CN114333326B (en) Intersection congestion detection method and device and electronic equipment
CN115507866B (en) Map data processing method and device, electronic equipment and medium
CN113284484B (en) Model training method and device, voice recognition method and voice synthesis method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant