CN111210625B

CN111210625B - Traffic control method and device and electronic equipment

Info

Publication number: CN111210625B
Application number: CN202010028150.9A
Authority: CN
Inventors: 于津强
Original assignee: Alibaba Group Holding Ltd
Current assignee: Alibaba Group Holding Ltd
Priority date: 2020-01-10
Filing date: 2020-01-10
Publication date: 2022-06-07
Anticipated expiration: 2040-01-10
Also published as: CN111210625A

Abstract

The invention discloses a traffic control method, a traffic control device and electronic equipment, wherein the method comprises the following steps: acquiring the associated parameters of a plurality of pairs of intersections in the region to be partitioned in a plurality of time slices of a historical statistical period; dividing the region to be divided into a plurality of initial sub-regions according to the associated parameters of each time slice respectively to obtain the division result of the corresponding time slice; dividing the region to be divided into a plurality of independent regions according to the division result of each time slice; dividing the historical statistic period into a plurality of historical time periods corresponding to the independent areas according to the division results of the intersections in each independent area in the plurality of time slices; dividing the corresponding independent area according to the associated parameters in the time slices contained in each historical time period to obtain the division result in the corresponding historical time period; and carrying out traffic control on the area to be segmented in the target time period according to the segmentation result in the historical time period corresponding to the target time period.

Description

Traffic control method and device and electronic equipment

Technical Field

The present invention relates to the field of signal control technologies, and in particular, to a traffic control method, a traffic control apparatus, an electronic device, and a computer-readable medium.

Background

Green wave control of traffic signals at urban intersections generally refers to coordinated control among traffic signals at a number of successive intersections within a sub-area. The purpose is to make the vehicles running at the crossroads in the subzone pass through each crossroad in the subzone without meeting red light or less meeting red light. The traffic signal coordination control method is called as "green band" control, in which green lights advance like waves to form green waves from the light colors of intersections in the controlled sub-area. If the green wave band exists, the vehicle flow which is kept smooth preferentially can pass through the subarea of the vehicle flow by the green light, and the staying time at the intersection is reduced as much as possible.

The traffic signal optimization product needs to perform timing optimization and coordination control on traffic signal lamps in the whole to-be-segmented area. When signal coordination control is carried out, a large area to be divided is often required to be divided into a plurality of relatively independent sub-areas. Each subarea can execute a corresponding control scheme according to the respective traffic characteristics. The division of the sub-areas is beneficial to executing a flexible control strategy, so that all the blocks with different traffic characteristics can obtain the best control effect.

The traditional division mode of the area to be divided is fixed and unchanged. But the actual traffic flow does not change short of time. The peak period is suitable for intersections in the same sub-area, and the peak-flat period may not be suitable for intersections in the same sub-area.

Therefore, in order to better control the traffic of the area to be partitioned and make the traffic operation of the area to be partitioned more efficient, it is very valuable to provide a flexible and variable traffic control method.

Disclosure of Invention

One object of the present invention is to provide a new solution for traffic control.

According to a first aspect of the present invention, there is provided a traffic control method comprising:

acquiring the associated parameters of a plurality of pairs of intersections in the region to be partitioned in a plurality of time slices of a historical statistical period;

dividing the region to be divided into a plurality of initial sub-regions according to the associated parameters of each time slice respectively to obtain the division result corresponding to the time slice;

dividing the region to be divided into a plurality of independent regions according to the division result of each time slice;

splitting the historical statistic cycle into a plurality of historical time periods corresponding to the independent areas according to the splitting results of the intersections in each independent area in the plurality of time slices, wherein each historical time period comprises at least one continuous time slice;

dividing the corresponding independent area according to the associated parameters in the time slices contained in each historical time period to obtain the division result in the corresponding historical time period;

and carrying out traffic control on the area to be segmented in the target time period according to the segmentation result in the historical time period corresponding to the target time period.

Optionally, the association parameters of a pair of intersections at least include any one or more of the following: the traffic flow between the pair of intersections, the signal cycle duration of each of the pair of intersections, and the distance between the pair of intersections.

Optionally, the dividing, according to the division result of each time slice, the region to be divided into a plurality of independent regions includes:

for each pair of intersections in the region to be segmented, acquiring the number of time slices of which the segmentation results belong to the same initial subregion;

dividing a pair of intersections of which the number is greater than or equal to a preset number threshold value into the same independent area, and dividing a pair of intersections of which the number is less than the number threshold value into different independent areas.

Optionally, the splitting the historical statistics cycle into a plurality of historical time periods corresponding to the independent regions according to the splitting results of the intersections in each independent region in the plurality of time slices respectively includes:

for each independent area, obtaining an intersection relation vector of the corresponding independent area in each time slice according to the segmentation result of each time slice;

and for each independent area, splitting the historical statistics period into a plurality of historical time periods according to the intersection relation vector of each time slice.

Optionally, the segmenting the corresponding independent region according to the associated parameter in the time slice included in each historical time period, respectively, and obtaining the segmentation result in each historical time period includes:

obtaining the associated parameters of a plurality of pairs of intersections in each independent area in each historical time period according to the associated parameters in the time slices contained in each historical time period;

and respectively dividing the corresponding independent region into a plurality of final sub-regions according to the associated parameters in each historical time period to obtain the division result in each historical time period.

Optionally, the association parameter of the pair of intersections includes a traffic flow between the pair of intersections;

the obtaining of the associated parameters of the multiple pairs of intersections in each independent area in each historical time period according to the associated parameters in the time slices contained in each historical time period respectively comprises:

and respectively counting the sum of the traffic flow in all time slices contained in each corresponding historical time period for each pair of intersections of each independent area, wherein the sum is used as the associated parameter in the corresponding historical time period.

Optionally, the association parameter of the pair of intersections includes a signal cycle duration of each intersection of the pair of intersections;

the obtaining of the association parameters of the multiple pairs of intersections in each independent area in each historical time period according to the association parameters in the time slices contained in each historical time period comprises:

and respectively counting the average value of the signal cycle duration in all time slices contained in each corresponding historical time period as the associated parameter in the corresponding historical time period for each intersection of each independent area.

Optionally, the step of segmenting the designated area according to the associated parameters includes:

determining the association degree between each pair of intersections in the specified area according to the association parameters;

dividing the region to be divided according to the relevance between each pair of intersections to obtain a plurality of corresponding sub-regions;

the designated area is an area to be divided or an independent area.

Optionally, the association parameters of a pair of intersections include the traffic flow between the pair of intersections;

the determining the association degree between each pair of intersections in the designated area according to the association parameters comprises:

determining the maximum value of the vehicle flow of the multiple pairs of intersections in the area to be divided as the maximum vehicle flow;

and determining the association degree of each pair of intersections according to the maximum traffic flow and the traffic flow of each pair of intersections.

Optionally, the association parameters of a pair of intersections include a signal cycle duration of each intersection of the pair of intersections;

determining the difference of signal cycle duration of each pair of intersections;

and determining the association degree of each pair of intersections according to the signal period duration of each pair of intersections and the difference.

Optionally, the association parameter of a pair of intersections includes a distance between the pair of intersections;

acquiring a preset maximum intersection distance value;

determining the difference between the maximum intersection distance and the distance between each pair of intersections as the corresponding difference of each pair of intersections;

and determining the association degree between each pair of intersections according to the maximum intersection distance and the corresponding difference value of each pair of intersections.

Optionally, the association parameters of a pair of intersections at least include the traffic flow between the pair of intersections, the signal period duration of each of the pair of intersections, and the distance between the pair of intersections;

determining a first degree of association between each pair of intersections according to the traffic flow between each pair of intersections;

determining a second degree of association between each pair of intersections according to the signal period duration of each intersection in each pair of intersections;

determining a third degree of association between each pair of intersections according to the distance between each pair of intersections and the preset maximum intersection distance;

and carrying out weighted summation on the first relevance degree, the second relevance degree and the third relevance degree between each pair of intersections according to preset weights to obtain the relevance degree between each pair of intersections.

Optionally, the segmenting the region to be segmented according to the relevance between each pair of intersections to obtain a plurality of corresponding sub-regions includes:

determining whether each pair of intersections are located in the same subarea according to the association degree between each pair of intersections;

and dividing the designated area into a plurality of corresponding sub-areas according to the determination result of whether each pair of intersections is located in the same sub-area.

Optionally, the determination result that the pair of intersections are located in the same sub-area is used as a first set value, and the determination result that the pair of intersections are located in different sub-areas is used as a second set value;

the determining whether each pair of intersections are located in the same sub-area according to the association degree between each pair of intersections comprises:

obtaining a mapping function between a determination result of whether each pair of intersections are located in the same sub-area and an index for measuring segmentation quality according to the relevance between each pair of intersections;

and determining whether each pair of intersections is located in the same sub-area under the condition that the index for measuring the segmentation quality is maximum according to the mapping function.

Optionally, the determining whether each pair of intersections are located in the same sub-area according to the degree of association between each pair of intersections includes:

judging whether the association degree between each pair of intersections is greater than or equal to a preset association degree threshold value or not;

and determining that a pair of intersections with the association degree greater than or equal to the association degree threshold value are positioned in the same sub-area.

Optionally, the performing, according to a segmentation result in a historical time period corresponding to a target time period, traffic control on the to-be-segmented area in the target time period includes:

acquiring traffic characteristics of each final subarea in a historical time period corresponding to a target time period, wherein the traffic characteristics comprise characteristics influencing traffic states of the corresponding final subareas;

and respectively carrying out traffic control on the corresponding final subarea in the target time period according to the traffic characteristics of each final subarea in the historical time period corresponding to the target time period.

Optionally, the performing traffic control on the corresponding final sub-area in the target time period according to the traffic characteristics of each final sub-area in the historical time period corresponding to the target time period includes:

determining target phase differences of a plurality of intersections in the corresponding final subarea in at least one phase according to the traffic characteristics of each final subarea in the historical time period corresponding to the target time period;

and in the target time period, respectively carrying out traffic control on the corresponding independent areas according to the target phase difference of the multiple intersections in each final subarea in at least one phase.

According to a second aspect of the present invention, there is provided a traffic control device comprising:

the correlation parameter acquisition module is used for acquiring correlation parameters of a plurality of pairs of intersections in the to-be-segmented area in a plurality of time slices of a historical statistical period;

the first region segmentation module is used for segmenting the region to be segmented into a plurality of initial sub-regions according to the associated parameters of each time slice respectively to obtain segmentation results corresponding to the time slices;

the second region segmentation module is used for segmenting the region to be segmented into a plurality of independent regions according to the segmentation result of each time slice;

the time division module is used for dividing the historical statistic cycle into a plurality of historical time periods corresponding to the independent areas according to the division results of the intersections in the independent areas in the time slices, wherein each historical time period comprises at least one continuous time slice;

the third region segmentation module is used for segmenting the corresponding independent region according to the associated parameters in the time slices contained in each historical time period to obtain the segmentation result in the corresponding historical time period;

and the traffic control module is used for carrying out traffic control on the area to be segmented in the target time period according to the segmentation result in the historical time period corresponding to the target time period.

According to a third aspect of the invention, there is provided an electronic device comprising an apparatus according to the second aspect of the invention; or a processor and a memory for storing executable instructions for controlling the processor to perform the method according to the first aspect of the invention.

According to a fourth aspect of the present invention, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the method according to the first aspect of the present invention.

In the embodiment of the invention, each independent area is divided in each corresponding historical time period to obtain the division result of each historical time period of each independent area, and the division result is more suitable for the actual situation and more flexible. Therefore, when each final sub-area in the area to be segmented is respectively subjected to traffic control in the target time period according to the segmentation result of the historical time period corresponding to the target time period, signals of intersections in each final sub-area can be better regulated and controlled, and traffic operation of each final sub-area is more efficient.

Other features of the present invention and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description, serve to explain the principles of the invention.

Fig. 1 is a block diagram of one example of a hardware configuration of an electronic device that can be used to implement an embodiment of the present invention.

FIG. 2 is a block diagram of another example of a hardware configuration of an electronic device that may be used to implement an embodiment of the invention;

FIG. 3 is a flow chart diagram of a traffic control method according to an embodiment of the invention;

fig. 4 is a schematic diagram of a traffic control method according to an embodiment of the present invention for segmenting a region to be segmented;

FIG. 5 is a flow chart diagram of one example of a traffic control method according to an embodiment of the invention;

FIG. 6 is a functional block diagram of a traffic control device according to one embodiment of the present invention;

FIG. 7 is a functional block diagram of an electronic device provided in accordance with a first embodiment of the invention;

fig. 8 is a schematic diagram of a hardware structure of an electronic device according to a second embodiment of the present invention.

Detailed Description

Various exemplary embodiments of the present invention will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present invention unless specifically stated otherwise.

The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the invention, its application, or uses.

Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.

In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.

< hardware configuration >

Fig. 1 and 2 are block diagrams of hardware configurations of an electronic device 1000 that can be used to implement a traffic control method of any embodiment of the present invention.

In one embodiment, as shown in FIG. 1, the electronic device 1000 may be a server 1100.

The server 1100 provides a service point for processes, databases, and communications facilities. The server 1100 can be a unitary server or a distributed server across multiple computers or computer data centers. The server may be of various types, such as, but not limited to, a web server, a news server, a mail server, a message server, an advertisement server, a file server, an application server, an interaction server, a database server, or a proxy server. In some embodiments, each server may include hardware, software, or embedded logic components or a combination of two or more such components for performing the appropriate functions supported or implemented by the server. For example, a server, such as a blade server, a cloud server, etc., or may be a server group consisting of a plurality of servers, which may include one or more of the above types of servers, etc.

In this embodiment, the server 1100 may include a processor 1110, a memory 1120, an interface device 1130, a communication device 1140, a display device 1150, and an input device 1160, as shown in fig. 1.

In this embodiment, the server 1100 may also include a speaker, a microphone, and the like, which are not limited herein.

The processor 1110 may be a dedicated server processor, or may be a desktop processor, a mobile version processor, or the like that meets performance requirements, and is not limited herein. The memory 1120 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device 1130 includes various bus interfaces such as a serial bus interface (including a USB interface), a parallel bus interface, and the like. The communication device 1140 is capable of wired or wireless communication, for example. The display device 1150 is, for example, a liquid crystal display panel, an LED display panel touch display panel, or the like. Input devices 1160 may include, for example, a touch screen, a keyboard, and the like.

In this embodiment, the memory 1120 of the server 1100 is configured to store instructions for controlling the processor 1110 to operate at least to perform a traffic control method according to any embodiment of the present invention. The skilled person can design the instructions according to the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.

Although shown as multiple devices in fig. 1, the present invention may relate to only some of the devices, e.g., server 1100 may relate to only memory 1120 and processor 1110.

In one embodiment, the electronic device 1000 may be a terminal device 1200 such as a PC, a notebook computer, or the like used by an operator, which is not limited herein.

In this embodiment, referring to fig. 2, the terminal apparatus 1200 may include a processor 1210, a memory 1220, an interface device 1230, a communication device 1240, a display device 1250, an input device 1260, a speaker 1270, a microphone 1280, and the like.

The processor 1210 may be a mobile version processor. The memory 1220 includes, for example, a ROM (read only memory), a RAM (random access memory), a nonvolatile memory such as a hard disk, and the like. The interface device 1230 includes, for example, a USB interface, a headphone interface, and the like. The communication device 1240 may be capable of wired or wireless communication, for example, the communication device 1240 may include a short-range communication device, such as any device that performs short-range wireless communication based on short-range wireless communication protocols, such as the Hilink protocol, WiFi (IEEE 802.11 protocol), Mesh, bluetooth, ZigBee, Thread, Z-Wave, NFC, UWB, LiFi, and the like, and the communication device 1240 may also include a long-range communication device, such as any device that performs WLAN, GPRS, 2G/3G/4G/5G long-range communication. The display device 1250 is, for example, a liquid crystal display, a touch panel, or the like. The input device 1260 may include, for example, a touch screen, a keyboard, and the like. A user can input/output voice information through the speaker 1270 and the microphone 1280.

In this embodiment, the memory 1220 of the terminal device 1200 is used to store instructions for controlling the processor 1210 to operate at least to perform a traffic control method according to any of the embodiments of the present invention. The skilled person can design the instructions according to the disclosed solution. How the instructions control the operation of the processor is well known in the art and will not be described in detail herein.

Although a plurality of devices of the terminal apparatus 1200 are shown in fig. 2, the present invention may relate only to some of the devices, for example, the terminal apparatus 1200 relates only to the memory 1220 and the processor 1210 and the display device 1250.

< method examples >

In the present embodiment, a traffic control method is provided. The traffic control method may be implemented by an electronic device. The electronic device may be the server 1100 as shown in fig. 1 or the terminal device 1200 as shown in fig. 2.

As shown in fig. 3, the traffic control method of the present embodiment may include the following steps S3100 to S3600:

step S3100, acquiring correlation parameters of multiple pairs of intersections in the to-be-segmented area in multiple time slices of a historical statistical period.

The region to be segmented may be a region that needs to be segmented, which is determined according to an application scenario or a specific requirement. Specifically, the area to be partitioned may be a selected city, or may be an area in the selected city.

The traffic objects moving in the area to be divided may include vehicles such as automobiles, bicycles, electric vehicles, motorcycles, logistics vehicles, or unmanned automobiles, and may also include pedestrians. In the embodiment of the present invention, a traffic object is taken as an example of a vehicle.

Further, the area to be divided may be selected by a user inputting a corresponding area name through the electronic device, or may be selected by a user demarcating the area through the electronic device. The region to be divided can be selected by the user through the terminal device, and the selected result of the region to be divided is input into the electronic device executing the embodiment of the invention by the terminal device for setting.

Each pair of intersections in this embodiment includes two intersections.

In one example, the multiple pairs of intersections may be n intersections in the region to be partitioned, and C is obtained_n ²And (6) aiming at the intersection. For example, if intersection 1, intersection 2, and intersection 3 are included in the region to be divided, intersection 1 and intersection 2 may serve as a pair of intersections, intersection 2 and intersection 3 may serve as a pair of intersections, and intersection 1 and intersection 3 may serve as a pair of intersections.

In another example, the multiple pairs of intersections may be all intersections in the area to be partitioned, and adjacent intersections are combined to obtain multiple pairs of intersections. For example, the area to be divided includes intersection 1, intersection 2, and intersection 3, if intersection 1 is only adjacent to intersection 2, intersection 2 is adjacent to intersection 1 and intersection 3, and intersection 3 is only adjacent to intersection 2, then intersection 1 and intersection 2 can be regarded as a pair of intersections, and intersection 2 and intersection 3 can be regarded as a pair of intersections.

The associated parameters of a pair of intersections may include the amount of traffic between the pair of intersections, the signal cycle duration of each of the pair of intersections, or the distance between the pair of intersections.

In the embodiment where the association parameter includes the traffic flow between a pair of intersections, the map track data of the to-be-segmented area in each time slice of the historical statistical period may be extracted, so as to obtain the traffic flow passing through each pair of intersections in the set period according to the map track data. The map trajectory data may be data reflecting a vehicle travel trajectory in a map.

The method can also be used for acquiring images acquired by a camera in the to-be-segmented area in each time slice of the historical statistical period so as to acquire the traffic flow passing through each pair of intersections in each set time slice of the set period from the acquired images.

In the present embodiment, the historical statistic period may be set according to a specific application scenario or application requirement, for example, may be set to one week. The length of the time slice may be set according to a specific application scenario or application requirements, and may be set to 10 minutes, for example. Then a week may be divided into 1008 time slices.

For example, the amount of traffic between a pair of intersections (including intersection i and intersection j) can be vol_i,jThe specific determination method may be:

wherein, dir_vFor one of the turns at intersection i, dir_wFor one of the turns at the intersection j,

for turning dir at intersection i_vSteering dir to intersection j_wThe traffic flow in each set period of the set period,

at intersection jSteering dir_wSteering dir to intersection i_vThe traffic flow in each set period of the set cycle.

Step S3200, dividing the region to be divided into a plurality of initial sub-regions according to the associated parameter of each time slice, and obtaining a division result corresponding to the time slice.

In this embodiment, the segmentation result may indicate that the region to be segmented is segmented into a plurality of initial sub-regions within the corresponding time slice. For the segmentation results of different time slices, the initial sub-regions obtained by segmenting the region to be segmented may be the same or different, and the intersections contained in the initial sub-regions may be the same or different.

In step S3300, the region to be divided is divided into a plurality of independent regions according to the division result of each time slice.

In one embodiment of the present invention, the step of dividing the region to be divided into a plurality of independent regions according to the division result of each time slice may include steps S3310 to S3320 as follows:

step S3310, for each pair of intersections in the region to be segmented, obtain the number of time slices whose segmentation result belongs to the same initial sub-region.

Specifically, if a pair of intersections is divided into the same initial sub-area within N time slices, the number of time slices in which the pair of intersections belongs to the same initial sub-area is N.

Step S3320, a pair of intersections with the number greater than or equal to the preset number threshold are divided into the same independent area, and a pair of intersections with the number less than the number threshold are divided into different independent areas.

In one embodiment of the present invention, the number threshold may be a fixed value set in advance according to an application scenario or specific requirements. For example, the quantity threshold may be 100.

In another embodiment of the present invention, the number threshold may also be determined according to the total number of time slices in the historical statistical period, i.e. the ratio of the number threshold to the total number may be a preset fixed value. For example, the quantity threshold may be 50% of the total number of time slices in the historical statistics period, and then the quantity threshold may be 504 where the total number of time slices in the historical statistics period is 1008.

In an embodiment of the present invention, intersections can also be used as nodes, edges connecting the nodes are constructed according to the number of time slices of each pair of intersections belonging to the same initial sub-area, a node relation graph is obtained, and intersections included in each independent area are obtained according to the node relation graph.

Specifically, an edge may be added between two nodes corresponding to a pair of intersections whose division results belong to the same initial sub-area, and an edge is not added between two nodes corresponding to a pair of intersections whose division results belong to the same initial sub-area, and whose number of time slices is less than the number threshold, so as to obtain a node relationship graph.

And finding a plurality of maximum connection subgraphs from the node relation graph, wherein intersections corresponding to the nodes in each maximum connection subgraph belong to the same independent area.

Step S3400, splitting the historical statistics cycle into a plurality of historical time periods corresponding to the independent areas according to the splitting result of the intersection in each time slice in each independent area, wherein each historical time period comprises at least one continuous time slice.

In the present embodiment, each independent area has a corresponding plurality of history time periods. The splitting results of the historical statistic periods can be the same or different for different independent areas. Specifically, the number of corresponding history time periods may be the same or different for different independent areas.

The sub-regions within the same independent region may share the partitioning of the history time period, while the partitioning of the history time period between independent regions does not interfere with each other.

In an embodiment of the present invention, the step of splitting the history statistics period into a plurality of history time periods corresponding to the independent areas may include steps S3410 to S3420 shown as follows, for each of the independent areas:

step S3410, for each independent region, obtaining an intersection relationship vector of the corresponding independent region in each time slice according to the segmentation result of each time slice.

For any independent area, whether each pair of included intersections belong to the same initial sub-area in each time slice can be determined, if so, the corresponding element in the intersection relation vector is set to be a third set value, and if not, the corresponding original element in the intersection relation vector is set to be a fourth set value.

The third setting value and the fourth setting value may be set in advance according to an application scenario or a specific requirement, and the third setting value and the fourth setting value are different. For example, the third set value may be 1, and the fourth set value may be 0.

In this embodiment, in the intersection relationship vectors of different time slices in the same independent area, a pair of intersections corresponding to the elements at the same position is also the same.

Step S3420, for each independent area, splitting the history statistics period into a plurality of history time periods according to the intersection relation vector of each time slice.

Specifically, the historical statistical period may be split into multiple historical time periods according to intersection relation vectors of each independent area in all time slices through a segmentation algorithm, so that the time slices in each historical time period are continuous, intersection relation vector distances of the time slices belonging to the same historical time period are smaller, and intersection relation vector distances of the time slices belonging to different historical time periods are larger. The segmentation algorithm may be, for example, but not limited to, a Fisher optimization segmentation algorithm.

In another embodiment of the present invention, each time slice may be taken as a historical time period.

Step S3500, segmenting the corresponding independent region according to the associated parameters in the time slice included in each historical time slice, and obtaining the segmentation result in the corresponding historical time slice.

In embodiments where the association parameter includes the distance between each pair of intersections, the segmentation result within each historical time period and the segmentation result within each time slice may be the same for each independent region since the distance between intersections does not change over time.

In an embodiment of the present invention, the step of dividing the corresponding independent area according to the associated parameters in the time slices included in each historical time slice to obtain the division result in the corresponding historical time slice may include steps S3510 to S3520 as follows:

step S3510, obtaining the association parameters of the multiple pairs of intersections in each independent area in each historical time period according to the association parameters in the time slices contained in each historical time period.

In the embodiment that the association parameter includes the traffic flow between each pair of intersections, for each pair of intersections in each independent area, the sum of the traffic flows in all time slices included in each corresponding historical time period may be respectively counted, and the sum is used as the association parameter of the pair of intersections in the corresponding historical time period.

In the embodiment that the association parameter includes the signal cycle duration of each intersection, for each intersection in each independent area, the average value of the signal cycle durations in all time slices included in each corresponding time period may be respectively counted, and the average value is used as the association parameter of the intersection in the corresponding historical time period.

Step S3520, the corresponding independent area is divided into a plurality of final sub-areas according to the associated parameters in each historical time period, and the division result in each historical time period is obtained.

In particular, each individual region may be divided into at least one final sub-region for each historical time period.

In the embodiment of the present invention, the dividing of the corresponding independent region into a plurality of final sub-regions according to the association parameter in any historical time period and the dividing of the region to be divided into a plurality of initial sub-regions according to the association parameter in any time slice may include steps S4100 to S4200 as follows:

step S4100, determining the association degree between each pair of intersections according to the association parameters of the plurality of pairs of intersections in the designated area.

The designated area may be an area to be partitioned, and then the association parameter may be an association parameter of a plurality of pairs of intersections in the area to be partitioned in any time slice. The designated area can also be any independent area, and then the associated parameter can be the associated parameter of a plurality of pairs of intersections in the independent area in any historical time period.

Example 1

In this embodiment, the association parameter may include a traffic flow between a pair of intersections, and then the manner of determining the association degree between each pair of intersections according to the association parameter between each pair of intersections may include steps S4111 to S4112 as follows:

step S4111, determining the maximum value of the traffic flow of a plurality of pairs of intersections in the designated area as the maximum traffic flow.

In one embodiment, the traffic flows of multiple pairs of intersections in the designated area can be sorted, and the maximum value of the traffic flows is selected as the maximum traffic flow.

The method for sequencing the traffic flow of multiple pairs of intersections can be, but is not limited to, bubble sequencing, selection sequencing, insertion sequencing, hill sequencing, quick sequencing, merge sequencing, heap sequencing and the like.

In another embodiment, the maximum traffic flow obtained after sorting the traffic flows of a plurality of pairs of intersections in the designated area and discarding the traffic flow with the maximum set percentage can be the maximum traffic flow.

The set percentage can be set according to application scenarios or specific requirements. For example, the set percentage may be 15%. Then, in the case where 100 pairs of intersections are included in the specified area, the traffic flows of the 100 pairs of intersections are sorted, and the sorting value of the traffic flow of each pair of intersections is determined. 15% of the maximum traffic flow is discarded. When the rank value with the largest traffic flow rate is 1, the traffic flow rate with the rank value of 1 to 15 may be discarded, and the traffic flow rate with the rank value of 16 may be set as the maximum traffic flow rate. When the rank value at which the traffic flow rate is maximum is 100, the traffic flow rate at which the rank value is 86 to 100 may be discarded, and the traffic flow rate at which the rank value is 85 may be set as the maximum traffic flow rate.

Step S4112, determining the association degree between each pair of intersections according to the maximum traffic flow and the traffic flow of each pair of intersections.

In the embodiment that the maximum value of the vehicle flow at the multiple pairs of intersections in the designated area is used as the maximum vehicle flow, the ratio between the vehicle flow and the maximum vehicle flow at each pair of intersections may be calculated, and the ratio corresponding to each pair of intersections is used as the association degree between each pair of intersections.

Specifically, the degree of association between each pair of intersections (intersection i and intersection j)

The formula of (c) may be:

wherein, vol_i,jIs the traffic flow between a pair of intersections (including intersection i and intersection j), vol_maxIs the maximum traffic flow.

After sequencing the vehicle flows of a plurality of pairs of intersections in the designated area, abandoning the vehicle flow with the maximum set percentage to obtain the maximum vehicle flow, wherein in the embodiment of the maximum vehicle flow, the ratio between the vehicle flow and the maximum vehicle flow of each pair of intersections can be calculated and used as the corresponding ratio of each pair of intersections; and selecting the smaller value between the ratio corresponding to each pair of intersections and 1 as the degree of association between each pair of intersections.

The calculation formula of (c) may be:

wherein, vol_v,wIs the traffic flow between a pair of intersections (including intersection i and intersection j), vol_maxIs the maximum traffic flow.

In one example, if

Can make

Example 2

The correlation parameter of a pair of intersections in this embodiment may include a signal cycle duration of each intersection in the pair of intersections. Then, the manner of determining the association degree between each pair of intersections according to the association parameters between each pair of intersections may include steps S4121 to S4122 as follows:

step S4121, determining the difference between the signal cycle durations of each pair of intersections.

The signal period duration refers to the time required for the signal to run for one cycle when the signal changes, and is equal to the sum of the green, yellow and red light times; and also equal to the sum of the green and yellow lamp times (which are typically fixed) required for all phases.

Since the signal cycle duration of each intersection in the statistical period may be a variation, it may be determined as the signal cycle duration of each intersection acquired in step S3100 an average of all the signal cycle durations of each intersection in the statistical period.

Specifically, if the signal period duration of the intersection i is c_iThe signal period duration of the intersection j is c_jThen, the difference in signal cycle duration for a pair of intersections (intersection i and intersection j) can be | c_i-c_j|。

Step S4122, determining the association degree between each pair of intersections according to the signal cycle duration of each intersection in each pair of intersections and the difference between the signal cycle durations of each pair of intersections.

Specifically, the signal period duration c of the intersection i may be determined_iSignal period duration c of intersection j_jMax (c) of_i,c_j) Then, the larger value max (c) is determined_i,c_j) Anddifference in signal period duration | c_i-c_jI, taking the ratio of the difference to a larger value as the first ratio, the association between intersection i and intersection j may be the first ratio.

It can also be a signal cycle duration c for determining the intersection i_iSignal period duration c of intersection j_jMax (c) of_i,c_j) And a smaller value min (c)_i,c_j) Then, the larger value max (c) is determined_i,c_j) And a smaller value min (c)_i,c_j) The larger value of 2 times max (max (c)_i,c_j),2*min(c_i,c_j) And a larger value max (c)_i,c_j) And smaller value min (c)_i,c_j) 2 times of absolute value | max (c)_i,c_j)-2*min(c_i,c_j) L, and then the larger value max (max (c)_i,c_j),2*min(c_i,c_j) With absolute value | max (c)_i,c_j)-2*min(c_i,c_j) The difference of | and the larger value max (c_i,c_j),2*min(c_i,c_j) ) as the second ratio, the degree of association between intersection i and intersection j may also be the second ratio.

Further, the degree of association between intersection i and intersection j may also be the greater of the first ratio and the second ratio.

On the basis, the greater the difference of the signal cycle duration of a pair of intersections is, the smaller the association degree of the pair of intersections is; the smaller the difference of the signal cycle duration of a pair of intersections is, the greater the degree of association between the pair of intersections is.

Example 3

The association parameter of a pair of intersections in this embodiment may include a distance between a pair of intersections. Then, the manner of determining the association degree between each pair of intersections according to the association parameters between each pair of intersections may include steps S4131 to S4133 as follows:

step S4131, a preset maximum intersection distance value is obtained.

The maximum intersection distance value can be preset according to an application scene or specific requirements. For example, the intersection distance maximum may be 2000 m.

Step S4132, determining a difference between the maximum intersection distance and the distance between each pair of intersections as a corresponding difference between each pair of intersections.

The distance between a pair of intersections in this embodiment may be the shortest path length between a pair of intersections.

Specifically, if the maximum intersection distance is dis_maxThe distance between a pair of intersections (including intersection i and intersection j) is dis_i,jThe difference between the maximum intersection distance and the distance between each pair of intersections, that is, the difference corresponding to a pair of intersections (including intersection i and intersection j), may be dis_max-dis_i,j。

Step S4133, determining a correlation degree between each pair of intersections according to the maximum intersection distance and the difference corresponding to each pair of intersections.

Specifically, a third degree of association between a pair of intersections (intersection i and intersection j)

Can be as follows: difference dis corresponding to a pair of intersections (including intersection i and intersection j)_max-dis_i,jMaximum distance dis from intersection_maxThe ratio therebetween.

Example 4

In this embodiment, the association parameters of a pair of intersections may include the traffic flow between a pair of intersections, the signal period duration of each of a pair of intersections, and the distance between a pair of intersections. Then, according to the association parameter between each pair of intersections, the manner of determining the association degree between each pair of intersections may include steps S4110 to S4140 as follows:

step S4110, determining a first degree of association between each pair of intersections according to the traffic flow between each pair of intersections.

The specific determination method of the first association degree may refer to embodiment 1, and is not described herein again.

Step S4120, determining a second degree of association between each pair of intersections according to the signal period duration of each intersection in each pair of intersections.

The specific determination method of the second degree of association may refer to embodiment 2, and is not described herein again.

Step S4130, determining a third degree of association between each pair of intersections according to the intersection distance and the preset maximum intersection distance.

The specific method for determining the third degree of association may refer to embodiment 3, and is not described herein again.

Step S4140, performing weighted summation on the first relevance, the second relevance, and the third relevance between each pair of intersections according to a preset weight, to obtain the relevance between each pair of intersections.

Specifically, the degree of association ω between each pair of intersections_i,jThe formula of (c) may be:

wherein, the first and the second end of the pipe are connected with each other,

is the first degree of association and is,

in order to be the second degree of association,

is a third degree of correlation, α_volIs a weight of the first degree of association, α_cycleIs a weight of the second degree of association, α_disIs the weight of the third degree of association.

After the degree of association between each pair of intersections is obtained, step S4200 described below is executed.

Step S4200, the designated area is divided according to the degree of association between each pair of intersections to obtain a plurality of sub-areas.

And under the condition that the designated area is the area to be divided, obtaining a plurality of sub-areas as initial sub-areas. In the case where the designated area is an independent area, the resulting plurality of sub-areas are final sub-areas.

Specifically, the dividing the designated area according to the degree of association between each pair of intersections to obtain a plurality of sub-areas may further include steps S4210 to S4220 as follows:

step S4210, determining whether each pair of intersections is located in the same sub-area according to the degree of association between each pair of intersections.

In one embodiment, according to the degree of association between each pair of intersections, the way of determining whether each pair of intersections are located in the same sub-area may be: judging whether the association degree between each pair of intersections is greater than or equal to a preset association degree threshold value, and determining that the intersections with the association degree greater than or equal to the association degree threshold value are located in the same subarea.

The threshold of the degree of association may be preset according to an application scenario or specific requirements. For example, the association degree threshold may be set to ω_th. If the degree of association omega between intersection 1 and intersection 2_1,2≥ω_thThen, intersection 1 and intersection 2 can be determined to be located within the same sub-area. If the degree of association omega between intersection 1 and intersection 3_1,3<ω_thThen, intersection 1 and intersection 3 can be determined to be located in different sub-regions.

In another embodiment, it may be the result of the determination δ that a pair of intersections (intersection i and intersection j) are located in the same sub-area_i,jAs 1, the determination result δ that a pair of intersections (intersection i and intersection j) are located in different sub-areas_i,jAs 0.

Then, this step S4210 may further include the following steps S4211 to S4212:

step S4211, according to the degree of association between each pair of intersections, a mapping function between the determination result of whether each pair of intersections is located in the same sub-area and the index for measuring the segmentation quality is obtained.

The mapping function F (delta)_i,j) The independent variable is the determination result delta of whether each pair of intersections (intersection i and intersection j in the designated area) are located in the same signal area_i,jDependent variable F (delta)_i,j) That is, the determination result delta of whether each pair of intersections in the designated area are located in the same sub-area_i,jAnd determining an index Q for measuring the segmentation quality. Wherein, delta_i,jAnd a determination result indicating whether intersection i and intersection j are located in the same sub-area. In the case where n intersections are included in the specified area, i, j ∈ [1, n ]]。

Specifically, the third ratio may be determined by first determining the sum of the association degrees between each pair of intersections in the designated area and determining the sum of the association degrees of each pair of intersections located in the same sub-area, and then determining the ratio between the sum of the association degrees of each pair of intersections located in the same sub-area and the sum of the association degrees of each pair of intersections located in the designated area.

Further, on the basis of the obtained association degree of each pair of intersections, the designated area can be randomly divided into a plurality of candidate sub-areas in advance. On the basis, the sum of the relevance between each pair of intersections in the same alternative subarea can be determined. And determining the ratio of the sum of the association degrees between each pair of intersections in the same alternative subarea to the sum of the association degrees between each pair of intersections in the designated area as a fourth ratio.

And determining the difference between the third ratio and the fourth ratio to obtain an index Q for measuring the segmentation quality, namely obtaining a mapping function between the determination result of whether each pair of intersections are positioned in the same sub-area and the index for measuring the segmentation quality.

Step S4212, determining whether each pair of intersections is located in the same sub-area under the condition that the index for measuring the segmentation quality is the maximum according to the mapping function.

In an embodiment, a heuristic solver Louvain algorithm may be used to solve the mapping function, so as to obtain a determination result of whether each pair of intersections are located in the same sub-area.

Specifically, it may be determined whether all intersections should be left in the current sub-area or moved to an adjacent sub-area. The criterion is that the motion maximizes the metric Q that measures the segmentation quality.

And then, taking the small sub-areas as a node, and sequentially judging whether the node is left in the current sub-area or moved to an adjacent sub-area. The criterion is that the motion maximizes the metric Q that measures the segmentation quality. The steps are repeated until the index Q for measuring the segmentation quality is not improved any more.

Step S4220, dividing the designated area into a plurality of sub-areas according to the determination result of whether each pair of intersections is located in the same sub-area.

Specifically, a pair of intersections located in the same sub-area in the designated area may be divided into the same sub-area, and a pair of intersections located in different sub-areas may be divided into different sub-areas, so that the effect of dividing the designated area into a plurality of sub-areas may be achieved.

In the embodiment of the invention, the association degree of each pair of intersections is determined according to the association parameters of a plurality of pairs of intersections in the designated area, and then the designated area is divided according to the association degree of each pair of intersections to obtain a plurality of sub-areas. Therefore, the relevance of each pair of intersections in the designated area is comprehensively considered, the designated area is automatically segmented to obtain a plurality of sub-areas, the segmentation quality can be improved, and the global optimum is achieved. In addition, the defects that the manual segmentation of the subarea lacks quantitative basis, cannot be copied in a large scale and cannot achieve global optimization can be overcome.

And step S3600, performing traffic control on the area to be segmented in the target time period according to the segmentation result in the historical time period corresponding to the target time period.

In the embodiment of the present invention, the target time period may be any time period after the historical statistical period of the present embodiment.

The target time period may be a time period within a target statistical period, the target statistical period may be divided into a plurality of target time periods in the same manner as the historical statistical period is divided into a plurality of historical time periods, and a difference between the target statistical period and the historical statistical period is a set number of statistical periods, where the set number may be an integer greater than or equal to zero.

The history time period corresponding to the target time period may be a history time period including the same time slice as the target time period. For example, the historical statistical period may be monday to sunday, and the length of the time slice may be 10 minutes, so that if the target time slice includes time slices from 09:00:01 to 09:10:00 to 09:50:01 to 10:00:00, the historical time slice including time slices from 09:00:01 to 09:10:00 to 10:00 is the historical time slice corresponding to the target time slice.

After obtaining a plurality of final sub-areas of each historical time period, traffic control can be individually performed on each final sub-area in the historical time period corresponding to the target time period in the target time period, wherein the traffic control includes at least one of the following: controlling the phase difference of a plurality of intersections in the final subarea corresponding to the historical time period in at least one phase, controlling the phase of each intersection in the final subarea corresponding to the historical time period, controlling the signal cycle time of each intersection in the final subarea corresponding to the historical time period, and controlling the green light time of each intersection in the final subarea corresponding to the historical time period, so that each final subarea can achieve a green wave effect in a target time period.

In one embodiment, the traffic control method may further include: acquiring traffic characteristics of each final subarea in a historical time period corresponding to the target time period; and respectively carrying out traffic control on the corresponding final subarea according to the traffic characteristics of each final subarea in the historical time period.

The traffic characteristics in this embodiment may include characteristics that affect the traffic state of the corresponding final sub-area.

In particular, the traffic characteristics may include any one or more of: the time length of a signal cycle corresponding to at least one intersection in the final sub-area, the signal phase corresponding to at least one intersection in the final sub-area, the green light time and the traffic flow direction corresponding to each phase of at least one intersection in the final sub-area, the traffic time from an upstream intersection in at least one path in the final sub-area to a downstream intersection in the corresponding path, and the traffic flow passing through at least one path in the final sub-area in the corresponding historical time period.

The phase of the signal in the present invention is known in the art. For example, it may include that within a signal cycle, a sequence of signal states of one or several traffic flows with the same signal light color is called a signal phase. The signal phases are divided according to the time sequence of the signal display obtained by the traffic flow, and there are several phases according to different time sequence arrangements. Each control state corresponds to a different set of lamp color combinations, called a phase. In short, one phase is also referred to as one control state. For another example, the signal display states corresponding to a group of traffic flows which do not conflict with each other and simultaneously obtain the right of way may be referred to as signal phases. It can be seen that the signal phases are divided according to the alternation of the right of way in the intersection within one signal cycle.

The signal period duration, including the time required for the signal to run for a cycle when the signal changes, is equal to the sum of the green, yellow and red light times; and also equal to the sum of the green and yellow lamp times (which are typically fixed) required for all phases. In this embodiment, to ensure that the phase difference between intersections in the preset area is constant, the signal cycle durations of the intersections in the preset area may be set to be equal.

The green light time in this embodiment may be an actual green light time or an effective green light time. The actual green light time may be the time taken for the green light to turn on until the green light is turned off. The valid green light time includes the actual vehicle transit time that is effectively utilized. It is equal to the sum of the green and yellow times minus the lost time. The lost time comprises two parts, namely the time when the green light signal is turned on and the vehicle is started; when the green light is turned off and the yellow light is turned on, only the vehicle passing the stop line can pass continuously, so that a part of the lost time is the delay time of the acceleration ending of the actual green light time minus the starting time. The end lag time is the fraction of the yellow lamp time that is effectively utilized. The loss time for each phase is the difference between the start delay time and the end delay time.

Phase difference: the two signal intersections refer to the difference between the start times of green (or red) lights in the same phase of two adjacent intersections.

The transit time of an upstream intersection to a downstream intersection in a corresponding path may include: and the automobile running on the corresponding path does not stop running from the upstream intersection to the corresponding downstream intersection according to the preset running speed.

The above definitions are only for exemplifying the description of the specific embodiments of the present invention and are not to be construed as limiting the scope of the invention.

Thus, each final subarea can execute a corresponding control strategy according to the respective traffic characteristics. Finally, the division of the sub-areas is beneficial to executing a flexible control strategy, so that all the blocks with different traffic characteristics can obtain the best control effect.

In this embodiment, the step of performing traffic control on the corresponding final sub-area in the target time period according to the traffic characteristics of each final sub-area in the historical time period may further include:

determining a target phase difference corresponding to at least one phase of a plurality of intersections in the final subarea according to the traffic characteristics of each final subarea in the historical time period corresponding to the target time period; and respectively carrying out traffic control on the corresponding final subareas in the target time period according to the target phase difference of at least one phase of the plurality of intersections in each final subarea.

Thus, the phase difference of the intersections in each final subarea is respectively controlled, so that vehicles on at least one path in each final subarea in the target time period can enjoy the green wave effect of continuously passing through a plurality of intersections on the corresponding path without stopping.

< example >

The traffic control method of the present embodiment will be described by taking the intersection in the to-be-divided area shown in fig. 4 as an example. The method may include steps S5001 to S5010 as shown in fig. 5:

step S5001, obtaining the associated parameters of a plurality of pairs of intersections in the to-be-segmented area in a plurality of time slices of the historical statistical period.

Step S5002, the region to be divided is divided into a plurality of initial sub-regions according to the associated parameters of each time slice, and the division result corresponding to the time slice is obtained.

In the example shown in fig. 4, each node represents an intersection, the historical statistic cycle includes 3 time slices, and in the segmentation result of each time slice, a dashed box can represent an initial sub-area.

Step S5003, for each pair of intersections in the region to be segmented, acquiring the number of time slices of which the segmentation result belongs to the same initial subregion.

Step S5004, taking the intersection as a node, adding edges between two nodes corresponding to a pair of intersections of which the number of time slices belonging to the same initial subregion is greater than or equal to a preset number threshold, and not adding edges between two nodes corresponding to a pair of intersections of which the number of time slices belonging to the same initial subregion is less than the number threshold to obtain a node relation graph.

Step S5005, finding multiple maximum connection subgraphs from the node relationship graph, and dividing intersections corresponding to nodes in each maximum connection subgraph into the same independent area.

In the example shown in fig. 4, in the division result of dividing the region to be divided into a plurality of independent regions, the dashed-line box may represent one independent region.

Step S5006, for each independent area, obtaining intersection relation vectors of the corresponding independent areas in each time slice according to the segmentation result of each time slice.

Step S5007, for each independent area, splitting the historical statistics period into a plurality of historical time periods according to the intersection relation vector of each time slice.

In the example shown in fig. 4, for the independent area 1, it may be that the history statistics period is split into the history time period 1 and the history time period 2. For the independent area 2, it may be that the historical statistics period is split into historical time periods 3. For the independent area 3, it may be that the historical statistics period is split into a historical period 4 and a historical period 5.

Step S5008, obtaining the association parameters of multiple pairs of intersections in each independent area in each historical time period according to the association parameters in the time slices included in each historical time period.

Step S5009, dividing the corresponding independent region into a plurality of final sub-regions according to the associated parameters in each historical time period, and obtaining a division result in each historical time period.

In the example shown in fig. 4, in the division result for each history period, a dashed-line box may represent one independent area. The segmentation result of each independent area in each corresponding historical time period can be obtained.

And step S5010, carrying out traffic control on the area to be segmented in the target time period according to the segmentation result in the historical time period corresponding to the target time period.

< apparatus embodiment >

In this embodiment, a traffic control device 6000 is provided, as shown in fig. 6, including an associated parameter obtaining module 6100, a first area dividing module 6200, a second area dividing module 6300, a time dividing module 6400, a third area dividing module 6500, and a traffic control module 6600.

The related parameter acquiring module 6100 is configured to acquire related parameters of multiple pairs of intersections in multiple time slices of the historical statistics period in the region to be partitioned.

The first area segmentation module 6200 is configured to segment the area to be segmented into a plurality of initial sub-areas according to the associated parameter of each time slice, so as to obtain a segmentation result corresponding to the time slice.

The second region segmentation module 6300 is configured to segment the region to be segmented into a plurality of independent regions according to the segmentation result of each time slice.

The time division module 6400 is configured to divide the historical statistics period into a plurality of historical time periods corresponding to the independent areas according to the division result of the intersection in the plurality of time slices in each independent area, where each historical time period includes at least one continuous time slice.

The third region dividing module 6500 is configured to divide the corresponding independent region according to the associated parameters in the time slice included in each historical time period, so as to obtain the division result in the corresponding historical time period.

The traffic control module 6600 is configured to perform traffic control on the to-be-segmented area in the target time period according to the segmentation result in the historical time period corresponding to the target time period.

In one embodiment of the invention, the association parameters of a pair of intersections include at least any one or more of the following: the traffic flow between a pair of intersections, the signal period duration of each of the pair of intersections, and the distance between the pair of intersections.

In an embodiment of the present invention, the second region segmentation module 6300 may further be configured to:

for each pair of intersections in the area to be segmented, acquiring the number of time slices of which the segmentation results belong to the same initial sub-area;

In one embodiment of the invention, the time slicing module 6400 may be further configured to:

In an embodiment of the present invention, the third region splitting module 6500 may be further configured to:

In one embodiment of the invention, the association parameters for a pair of intersections include the amount of traffic between a pair of intersections;

obtaining the association parameters of the multiple pairs of intersections in each independent area in each historical time period according to the association parameters in the time slices contained in each historical time period respectively comprises the following steps:

In one embodiment of the invention, the correlation parameter of a pair of intersections includes a signal cycle duration of each intersection of the pair of intersections;

obtaining the association parameters of the multiple pairs of intersections in each independent area in each historical time period according to the association parameters in the time slices contained in each historical time period comprises the following steps:

and respectively counting the average value of the signal cycle duration in all the time slices contained in each corresponding historical time slice as the associated parameter in the corresponding historical time slice for each intersection of each independent area.

In an embodiment of the present invention, the manner of dividing the designated area according to the association parameter may include:

determining the association degree between each pair of intersections in the designated area according to the association parameters;

dividing the area to be divided according to the association degree between each pair of intersections to obtain a plurality of corresponding sub-areas;

wherein, the designated area is an area to be divided or an independent area.

determining the association degree between each pair of intersections in the designated area according to the association parameters comprises the following steps:

determining the maximum value of the vehicle flow of a plurality of pairs of intersections in the area to be partitioned as the maximum vehicle flow;

and determining the association degree of each pair of intersections according to the signal period duration and the difference of each pair of intersections.

In one embodiment of the invention, the association parameters of a pair of intersections include the distance between a pair of intersections;

acquiring a preset maximum intersection distance value;

determining the difference between the maximum intersection distance and the distance between each pair of intersections as the corresponding difference between each pair of intersections;

In one embodiment of the invention, the correlation parameters of a pair of intersections at least comprise the traffic flow between the pair of intersections, the signal period duration of each intersection in the pair of intersections and the distance between the pair of intersections;

In an embodiment of the present invention, segmenting the to-be-segmented region according to the degree of association between each pair of intersections to obtain a plurality of corresponding sub-regions includes:

In one embodiment of the invention, the determination result that a pair of intersections are located in the same subarea is used as a first set value, and the determination result that a pair of intersections are located in different subareas is used as a second set value;

determining whether each pair of intersections are located in the same subarea according to the association degree between each pair of intersections comprises the following steps:

obtaining a mapping function between a determination result of whether each pair of intersections are positioned in the same subarea and an index for measuring the segmentation quality according to the association degree between each pair of intersections;

In one embodiment of the present invention, determining whether each pair of intersections are located in the same sub-area according to the degree of association between each pair of intersections comprises:

In one embodiment of the invention, the traffic control module 6600 may also be used to:

acquiring traffic characteristics of each final subarea in a historical time period corresponding to the target time period, wherein the traffic characteristics comprise characteristics influencing traffic states of the corresponding final subareas;

In one embodiment of the present invention, the traffic control of the corresponding final sub-area in the target time period according to the traffic characteristics of each final sub-area in the historical time period corresponding to the target time period respectively comprises:

and in the target time period, respectively carrying out traffic control on the corresponding independent areas according to the target phase difference of the multiple intersections in each final subarea at least one phase.

It will be apparent to those skilled in the art that the traffic control device 6000 may be implemented in various ways. For example, the traffic control device 6000 may be implemented by an instruction configuration processor. For example, the traffic control device 6000 may be implemented by storing instructions in ROM and reading the instructions from ROM into a programmable device when the apparatus is activated. For example, the traffic control device 6000 may be cured into a dedicated device (e.g., ASIC). The traffic control device 6000 may be divided into units independent of each other, or may be implemented by combining them together. The traffic control device 6000 may be implemented by one of the various implementations described above, or may be implemented by a combination of two or more of the various implementations described above.

In the embodiment, the traffic control device 6000 may have various implementation forms, for example, the traffic control device 6000 may be any functional module running in a software product or an application program providing traffic control service, or a peripheral insert, a plug-in, a patch, etc. of the software product or the application program, and may also be the software product or the application program itself.

< electronic apparatus >

In this embodiment, an electronic device 1000 is also provided. The electronic device 1000 may be the server 1100 shown in fig. 1, or may be the terminal device 1200 shown in fig. 2.

In one aspect, as shown in fig. 7, the electronic device 1000 may include the aforementioned traffic control apparatus 6000 for implementing the traffic control method of any embodiment of the present invention.

In another aspect, as shown in fig. 8, the electronic device 1000 may further include a processor 1300 and a memory 1400, the memory 1400 for storing executable instructions; the processor 1300 is configured to operate the electronic device 1000 to perform a traffic control method according to any embodiment of the present invention according to the control of the instructions.

< computer-readable storage Medium >

In the present embodiment, there is also provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a traffic control method according to any of the embodiments of the present invention.

The present invention may be a system, method and/or computer program product. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied therewith for causing a processor to implement various aspects of the present invention.

The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: 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), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.

The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.

The computer program instructions for carrying out operations of the present invention may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer-readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, aspects of the present invention are implemented by personalizing an electronic circuit, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA), with state information of computer-readable program instructions, which can execute the computer-readable program instructions.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer-readable program instructions.

These computer-readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer-readable program instructions may also be stored in a computer-readable storage medium that can direct a computer, programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer-readable medium storing the instructions comprises an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer, other programmable apparatus or other devices implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions. It is well known to those skilled in the art that implementation by hardware, by software, and by a combination of software and hardware are equivalent.

Having described embodiments of the present invention, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein. The scope of the invention is defined by the appended claims.

Claims

1. A traffic control method, comprising:

dividing the corresponding independent area according to the associated parameters in the time slices contained in each historical time slice to obtain the division result in the corresponding historical time slice;

2. The method of claim 1, wherein the association parameters of a pair of intersections include at least any one or more of the following: the traffic flow between the pair of intersections, the signal cycle duration of each of the pair of intersections, and the distance between the pair of intersections.

3. The method of claim 2, wherein the segmenting the region to be segmented into a plurality of independent regions according to the segmentation result of each time slice comprises:

4. The method of claim 2, wherein the splitting the historical statistics cycle into a plurality of historical time segments corresponding to the independent regions according to the split result of the intersection in each independent region in the plurality of time slices respectively comprises:

5. The method according to claim 2, wherein the step of segmenting the corresponding independent region according to the associated parameters in the time slices included in each historical time period respectively to obtain the segmentation result in each historical time period comprises:

6. The method of claim 5, the association parameter for the pair of intersections comprising a traffic flow between the pair of intersections;

7. The method of claim 5, the association parameter for the pair of intersections comprising a signal cycle duration for each of the pair of intersections;

8. The method according to claim 1, wherein the controlling traffic of the area to be divided in the target time period according to the division result in the historical time period corresponding to the target time period comprises:

9. The method of claim 8, wherein the traffic control of the corresponding final sub-area in the target time period according to the traffic characteristics of each final sub-area in the historical time period corresponding to the target time period respectively comprises:

10. A traffic control device comprising:

the correlation parameter acquisition module is used for acquiring correlation parameters of a plurality of pairs of intersections in the region to be partitioned in a plurality of time slices of a historical statistics period;

the first region segmentation module is used for segmenting the region to be segmented into a plurality of initial sub-regions according to the associated parameters of each time slice respectively to obtain segmentation results of the corresponding time slices;

11. An electronic device comprising the apparatus of claim 10; or, comprising a processor and a memory for storing executable instructions for controlling the processor to perform the method according to any one of claims 1 to 9.

12. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1 to 9.