CN107180541A - A kind of dynamic adjusting method of traffic control cell - Google Patents
A kind of dynamic adjusting method of traffic control cell Download PDFInfo
- Publication number
- CN107180541A CN107180541A CN201710402885.1A CN201710402885A CN107180541A CN 107180541 A CN107180541 A CN 107180541A CN 201710402885 A CN201710402885 A CN 201710402885A CN 107180541 A CN107180541 A CN 107180541A
- Authority
- CN
- China
- Prior art keywords
- mrow
- msub
- traffic control
- control cell
- msubsup
- 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.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/07—Controlling traffic signals
- G08G1/08—Controlling traffic signals according to detected number or speed of vehicles
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/07—Controlling traffic signals
- G08G1/081—Plural intersections under common control
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of dynamic adjusting method of traffic control cell, this method is the cell boarder Adjacent Intersections traffic degree of association under distribution and original state and new state by analyzing initial cell, the intersection judged is needed under selection new state, judge which cell these intersections particularly belong to, then count the intersection number of all cells and judge each cell one by one, if beyond lower limit, by the cell combining to the maximum cell of the neighbor cell degree of association；If beyond the upper limit, splitting the cell.The inventive method further increases the validity of traffic administration and control program, improves vehicle operational efficiency, more preferable road network traffic control effect is obtained, with more preferable Social benefit and economic benefit.
Description
Technical field
The present invention relates to the technical field of road traffic control, a kind of dynamic adjustment side of traffic control cell is referred in particular to
Method.
Background technology
With the quick increase of city automobile recoverable amount, cause Urban Traffic Jam Based increasingly severe, wherein causing
The main cause of urban traffic blocking is lack of uniformity of the city road network traffic flow supply and demand in room and time distribution and not
With property.The trend of normalization and compartmentalization has been presented in traffic congestion, and current city manager increasingly payes attention to the letter of road grid traffic
The application of number control strategy, each city has gradually built up urban traffic control system.Control mode includes single-point control, arterial highway association
Regulation and control system and Region control.Region control then includes intersection control, regional area control and center and controls three aspects, its
Center control is that whole control range is divided into some cells, and control is uniformly coordinated by center, regional area control by
The sub-district control of several single-points composition.In urban traffic control and control, Region control is widely used.Carry out Region control
When, it is necessary to whole road network carry out subregion (such as traffic control cell), corresponding traffic control side then is taken to each subregion
Case, achieves good control effect among the practice in each city at present.
For traffic control cell, many researchs and application have been carried out both at home and abroad.The division methods master of traffic control cell
It is divided into static division method and method for dynamically partitioning.Traffic control cell static division method using the physical features of road network as according to
According to based on urban land use property, the division of administrative region function, Urban Population Distribution, physical relief landforms, road network knot
Structure and layout and correlated characteristic etc. are studied.With the development of traffic, the static division method of cell does not adapt to road
The demand of road grid traffic dynamic change, researcher starts to be studied from dynamic angle.Traffic control district dynamic is divided
Method is that based on the physical features and traffic characteristic of road network, area will be studied by Clustering Model, traffic related degree model etc.
Domain is dynamically divided into several cells.In addition, existing urban traffic signal control system SCATS, SCOOT etc. use subregion
The theory of control, and the division of the traffic control cell of these control systems is more based on dividing manually.
But at present, also it is not based on initial traffic control cell and road traffic dynamic change is combined to realize traffic control
The achievement in research of district dynamic adjustment processed and application.The present invention is the characteristic that can be varied widely according to road traffic state,
Initial traffic control cell is finely adjusted, split, merged, so that the traffic control cell of suitable different traffic is set up,
Obtain more preferable road network traffic control effect.
The content of the invention
It is an object of the invention to the shortcoming and deficiency for overcoming prior art, there is provided a kind of effective traffic control
The dynamic adjusting method of cell, sets up the traffic control cell for being adapted to different traffic, so that can take significantly more efficient
Traffic administration and control, further improve the validity of traffic administration and control program, improve vehicle operational efficiency, obtain more
Good road network traffic control effect, with more preferable Social benefit and economic benefit.
To achieve the above object, technical scheme provided by the present invention is：A kind of dynamic adjustment side of traffic control cell
Method, comprises the following steps：
1) basic data prepares
Including road network dispatch figure, the distribution of each initial traffic control cell and intersection number, original state and
The Adjacent Intersections traffic degree of association of new state；
2) intersection judged is needed under selection new state
2.1) initial adjacent traffic control cell boarder section and corresponding Adjacent Intersections are determined；
2.2) traffic degree of association difference DELTA w of the above-mentioned Adjacent Intersections under original state and new state is calculated, with the difference
It is worth for sort by, Adjacent Intersections are ranked up by the way of descending；
2.3) average of traffic degree of association difference is set as threshold value M, and the Adjacent Intersections that difference is more than or equal to threshold value M are true
It is set to the object of needs judgement, the Adjacent Intersections that difference is less than threshold value M are not required to judge, keep original traffic control cell to return
Category state；
2.4) determined to need the specific friendship of the Adjacent Intersections of judgement according to the direction of the Adjacent Intersections traffic degree of association
Prong, including Adjacent Intersections i and j, the direction of the traffic degree of association are to point to j from i, then need the intersection judged can determine that
For i；
3) ownership of the specific traffic control cell of selected intersection is judged
3.1) intersection for needing to judge ownership is individually come out from original traffic control cell；
3.2) calculate node hypotaxis degree
Intersection node i is calculated to certain adjacent to the subordinate degree of traffic control cell, calculating formula is：
In formula, VuRepresent traffic control cell GuThe set of internal chiasma mouthful node, V represents traffic control cell GuIt is interior
The set on the side on portion and border, wijRepresent the weighted value on the section side between Adjacent Intersections i and j, the bigger table of node hypotaxis degree
Bright node and the degree of contact of traffic control cell are closer；
3.3) cell association tight ness rating gain is calculated
3.3.1 traffic control cell G) is calculateduTightness degree between internal node, calculating formula is：
In formula,Represent traffic control cell GuThe weighted value sum on the section side of internal chiasma mouthful node,Represent
Traffic control cell GuThe weighted value sum on side that is connected with outside intersection node of internal chiasma mouthful node；
3.3.2 traffic control cell association tight ness rating gain) is calculated, calculating formula is：
In formula,Refer to be merged into traffic control cell G in all sides being connected with intersection node iuSide weight
Value,Refer to not be merged into traffic control cell G in all sides being connected with intersection node iuSide weighted value, hand over
Logical control cell association tight ness rating gain is bigger, and showing that intersection node i is added increases the traffic control after the traffic control cell
The tightness degree of Intra-cell processed is also bigger；
3.4) Rule of judgment
The ownership of traffic control cell is redefined to the intersection of above-mentioned judgement in need, for single intersection
Rule of judgment is as follows：
If meeting, i ∈ Gv；If it is not satisfied, i keeps original traffic control cell ownership, i.e. i ∈ Gu；
4) merging and segmentation of traffic control cell
4.1) the intersection node number of all cells is counted, the lower limit of the intersection number of traffic control cell is set
Min and upper limit value M ax, and each cell is judged one by one；
4.2) if the intersection number for having traffic control cell exceeds lower limit, step is performed to the traffic control cell
4.3)；If the intersection number for having traffic control cell exceeds the upper limit, step 4.4 is performed to the traffic control cell)；If having
The intersection number of traffic control cell is eligible, then performs step 5 to the traffic control cell)；
4.3) traffic control cell combining
4.3.1 too small traffic control cell G) is calculateduRelative to traffic control cell GvAssociation tight ness rating, computational chart
It is as follows up to formula：
In formula, W (Gu,Gv) represent traffic control cell GuAnd GvBetween all connected sides weighted value sum；
4.3.2 the traffic control cell combining) is controlled into cell to the maximum adjacent traffic of tight ness rating is associated；
4.3.3) if the new traffic control cell intersection number after merging exceeds the upper limit, step 4.4 is performed)；Otherwise hold
Row step 5)；
4.4) traffic control cell is split
4.4.1) split using the road spectral clustering division methods of traffic control cell two, segmentation step is as follows：
A) matrix W, the side connected according to intersection node are built according to the Adjacent Intersections traffic degree of association under new state
Number structure degree matrix D, sets up Laplacian Matrix
B) characteristic value and characteristic vector for calculating Laplacian Matrix L are sought；
C) characteristic value is ranked up, the second small characteristic value of selection and corresponding characteristic vector, wherein in characteristic vector
I-th row represents i-th of intersection of survey region；
D) to this feature vector element be ranked up, selection needed for cut-point by node division be two classes, i.e. B1 and
B2；
4.4.2 set B1 and B2 magnitude relationship of the element number with lower limit Min) are judged
If a) set B1 and B2 element number is all higher than being equal to lower limit Min, step 5 is performed)；
If b) set B1 or B2 element number is less than lower limit Min, step is performed to the set less than lower limit
4.4.3)；
4.4.3) the corresponding traffic control cell G of set of computations B1 and B2B1And GB2Each edge circle be connected section LijPhase
Adjacent intersection is in traffic control cell GB2Cut is compared in association loss on directionijj, wherein,Intersection i belongs to
In the few traffic control cell G of intersection numberB1, j belongs to the traffic control cell G more than the number of intersectionB2, WjRefer to intersecting
Adjacent Intersections degree of association sum corresponding to section connected mouth j；
4.4.4 lower limit Min and traffic control cell G) is calculatedB1Intersection number difference DELTAMinB1, to cutijEnter
Row sequence, selects minimum ΔMinXCut is compared in individual association lossijCorresponding intersection j is divided to traffic control cell GB1, from
And the traffic control cell ownership of the intersection after segmentation is determined, two qualified traffic control cells are formed, step is performed
It is rapid 5)；
5) result is preserved.
In step 4) in, it is necessary to set the lower limit Min and upper limit value M ax of the intersection number of traffic control cell, root
According to traffic control cordon traffic signal coordinated control attribute, two adjacent signalized crossings can carry out coordination control,
In order to obtain more preferable trade-off effect, it is proposed that the lower limit Min spans of the Adjacent Intersections number of signal coordinated control are 2
~4；In addition, intersection coordinate control be not more multi-intersection it is better, it is necessary to consider city road network density, intersection spacing,
Traffic control system, therefore suggestion upper limit value M ax minimum value is twice of lower limit Min maximum occurrences, i.e. upper limit value M ax should
More than or equal to 8.
In step 4) in, it is necessary to select required cut-point by node division be two classes, i.e. B1 and B2, it is proposed that selection 0 make
For cut-point, the element less than 0 is divided to set A1 first, the element that will be greater than 0 is divided to set A2, statistics set A1 and
A2 element number, if set A1 and A2 element number are equal, when having element 0 in characteristic vector, collection is divided to by element 0
A2 is closed, the collection not comprising element 0 B1 is collectively referred to as, the collection comprising element 0 is collectively referred to as B2；If set A1 and A2 element number are not
When equal, element 0 is divided to the small set of number, the collection comprising element 0 is collectively referred to as B1, the collection not comprising element 0 is collectively referred to as
For B2.
The present invention compared with prior art, has the following advantages that and beneficial effect：
1st, the present invention proposes a kind of new traffic control district dynamic method of adjustment, divides and obtains according to the inventive method
Traffic control cell can take more efficiently traffic administration and control program, improve vehicle operational efficiency, obtain more preferable
Road network traffic control effect.
2nd, the inventive method is relative to existing static division method and common method for dynamically partitioning, with road traffic shape
The matching degree of state is higher, can further improve Social benefit and economic benefit.
Brief description of the drawings
Fig. 1 is the logical flow chart of the inventive method.
Fig. 2 finely tunes schematic diagram for the intersection ownership of the inventive method.
Fig. 3 is the traffic control cell combining schematic diagram of the inventive method.
Fig. 4 splits schematic diagram for the traffic control cell of the inventive method.
Fig. 5 is the road network figure that case is embodied in the inventive method.
Fig. 6 is the distribution of initial traffic control cell and the association scale designation figure that case is embodied in the inventive method.
Fig. 7 is the traffic control cell fine setting result figure that case is embodied in the inventive method.
Fig. 8 is the result figure that the inventive method is embodied after the traffic control cell combining of case and segmentation.
Embodiment
With reference to specific embodiment, the invention will be further described.
The dynamic adjusting method for the traffic control cell that the present embodiment is provided, its basic thought is by inputting basic number
According to needing the intersection judged under selection new state, judge the ownership of the specific traffic control cell of selected intersection, Ran Houtong
Count the node number of all cells and judge each cell one by one, and corresponding traffic control cell is carried out according to judged result
Merge or split.
As shown in figure 1, the dynamic adjusting method of described traffic control cell, comprises the following steps：
Step 1：Prepare basic data：Including road network dispatch figure, the distribution of each initial traffic control cell and
The Adjacent Intersections traffic degree of association of intersection number, original state and new state.
Step 2：The intersection judged is needed under selection new state
2.1) initial adjacent traffic control cell boarder section and corresponding Adjacent Intersections are determined.
2.2) traffic degree of association difference DELTA w of the above-mentioned Adjacent Intersections under original state and new state is calculated, with the difference
It is worth for sort by, Adjacent Intersections are ranked up by the way of descending.
2.3) average of traffic degree of association difference is set as threshold value M, and the Adjacent Intersections that difference is more than or equal to threshold value M are determined
To need the object judged, the Adjacent Intersections that difference is less than threshold value M are not required to judge, keep original traffic control cell ownership
State.
2.4) determined to need the specific friendship of the Adjacent Intersections of judgement according to the direction of the Adjacent Intersections traffic degree of association
Prong, such as Adjacent Intersections i and j, the direction of the traffic degree of association are to point to j from i, then need the intersection judged can be identified as
i。
Step 3：Judge the ownership of the specific traffic control cell of selected intersection
3.1) intersection for needing to judge ownership is individually come out from original traffic control cell, as shown in Figure 2.
3.2) calculate node hypotaxis degree
Intersection node i is calculated to certain adjacent to the subordinate degree of traffic control cell, calculating formula is：
Wherein, VuRepresent traffic control cell GuThe set of internal chiasma mouthful node, V represents traffic control cell GuIt is interior
The set on the side on portion and border, wijRepresent the weighted value on the section side between Adjacent Intersections i and j, the bigger table of node hypotaxis degree
Bright node and the degree of contact of traffic control cell are closer.
3.3) cell association tight ness rating gain is calculated
3.3.1 traffic control cell G) is calculateduTightness degree between internal node, calculating formula is：
Wherein,Represent traffic control cell GuThe weighted value sum on the section side of internal chiasma mouthful node,Represent
Traffic control cell GuThe weighted value sum on side that is connected with outside intersection node of internal chiasma mouthful node.
3.3.2 traffic control cell association tight ness rating gain) is calculated, calculating formula is：
Wherein,Refer to be merged into traffic control cell G in all sides being connected with intersection node iuSide weight
Value,Refer to not be merged into traffic control cell G in all sides being connected with intersection node iuSide weighted value.Hand over
Logical control cell association tight ness rating gain is bigger, and showing that intersection node i is added increases the traffic control after the traffic control cell
The tightness degree of Intra-cell processed is also bigger.
3.4) Rule of judgment
The ownership of traffic control cell is redefined to the intersection of above-mentioned judgement in need.For single intersection
Rule of judgment is as follows：
If meeting, i ∈ Gv；If it is not satisfied, i keeps original traffic control cell ownership, i.e. i ∈ Gu。
Step 4：The merging and segmentation of traffic control cell
4.1) the intersection node number of all cells is counted, the lower limit of the intersection number of traffic control cell is set
Min and upper limit value M ax, and each cell is judged one by one.Wherein, according to traffic control cordon traffic signal coordinated control attribute,
Two adjacent signalized crossings can carry out coordination control, in order to obtain more preferable trade-off effect, it is proposed that signal coordinating
The lower limit Min spans of the Adjacent Intersections number controlled are 2~4；In addition, it is not hand over that control is coordinated in intersection more
Prong is better, it is necessary to consider city road network density, intersection spacing, traffic control system etc., therefore suggestion upper limit value M ax minimum
Value is twice of lower limit Min maximum occurrences, i.e. upper limit value M ax should be greater than or equal to 8.
If 4.2) the intersection number for having traffic control cell exceeds lower limit, as shown in figure 3, then to the traffic control cell
Perform step 4.3)；If the intersection number for having traffic control cell exceeds the upper limit, as shown in figure 4, then small to the traffic control
Area performs step 4.4)；If there is the intersection number of traffic control cell eligible, step is performed to the traffic control cell
It is rapid 5).
4.3) traffic control cell combining
4.3.1) the traffic control cell G that intersection number exceeds lower limit is calculateduRelative to traffic control cell GvAssociation
Tight ness rating, calculation expression is as follows：
Wherein, W (Gu,Gv) represent traffic control cell GuAnd GvBetween all connected sides weighted value sum.
4.3.2 the traffic control cell combining) is controlled into cell to the maximum adjacent traffic of tight ness rating is associated.
4.3.3) if the new traffic control cell intersection number after merging exceeds the upper limit, step 4.4 is performed)；Otherwise hold
Row step 5).
4.4) traffic control cell is split
4.4.1) split using the road spectral clustering division methods of traffic control cell two, segmentation step is as follows：
A) matrix W, the side connected according to intersection node are built according to the Adjacent Intersections traffic degree of association under new state
Number structure degree matrix D, sets up Laplacian Matrix
B) characteristic value and characteristic vector for calculating Laplacian Matrix L are sought；
C) characteristic value is ranked up, the second small characteristic value of selection and corresponding characteristic vector, wherein in characteristic vector
I-th row represents i-th of intersection of survey region；
D) element of this feature vector is ranked up, select appropriate cut-point by node division be two classes, i.e. B1 and
B2.Wherein, it is proposed that the element less than 0 is divided to set A1, the element that will be greater than 0 is divided to by selection 0 first as cut-point
Set A2, statistics set A1 and A2 element number if set A1 and A2 element number are equal, has element in characteristic vector
When 0, element 0 can be divided in arbitrary collection, this method, be divided to set A2, the collection not comprising element 0 is collectively referred to as
B1, the collection comprising element 0 is collectively referred to as B2.；If set A1 and A2 element number are unequal, by element 0 be divided to number compared with
Small set, B1 is collectively referred to as by the collection comprising element 0, and the collection not comprising element 0 is collectively referred to as B2.
4.4.2 set B1 and B2 magnitude relationship of the element number with lower limit Min) are judged
If a) set B1 and B2 element number is all higher than being equal to lower limit Min, step 5 is performed)；
If b) set B1 or B2 element number is less than lower limit Min, step is performed to the set less than lower limit
4.4.3)。
4.4.3) the corresponding traffic control cell G of set of computations B1 and B2B1And GB2Each edge circle be connected section LijPhase
Adjacent intersection is in larger traffic control cell GB2Cut is compared in association loss on directionijj, wherein,Intersection i
Belong to the less traffic control cell G of intersection numberB1, j belongs to the more traffic control cell G of intersection numberB2, Wj
Refer to the Adjacent Intersections degree of association sum corresponding to the section being connected with intersection j.
4.4.4 lower limit Min and less traffic control cell G) is calculatedB1Intersection number difference DELTAMinB1, it is right
cutijIt is ranked up, selects minimum ΔMinXCut is compared in individual association lossijCorresponding intersection j is divided to less traffic control
Cell G processedB1, so that it is determined that the traffic control cell ownership of the intersection after segmentation, forms two qualified traffic controls
Cell, performs step 5).
Step 5：Preserve result.
We say with reference to the dynamic adjusting method of the design parameter traffic control cell above-mentioned to the present embodiment below
Bright, its situation is as follows：
By taking the local road network of Yiwu City main city zone as an example, as shown in figure 5, the east of road network scope to Zong Ze North Roads, Nan Zhixi
City road, west to through sending out main road, north to road of supporting the army.Regional extent area is about 18 square kilometres, has 28 roads.The region
The traffic degree of association situation of initial traffic control cell distribution and new state is shown in Fig. 6, sets single traffic control Intra-cell
Signalized crossing quantity the upper limit be 9, lower limit is 3.
The intersection judged is needed under selection new state：
According to the basic data of preparation, the Adjacent Intersections relational degree taxis of initial traffic control cell border areas is obtained
It is as shown in table 1 below.
Table 1
When road network is from when being transitioned into the flat peak period peak period, the traffic behavior degree of association between Adjacent Intersections
Change therewith.As can be known from the above table, the change mean of the Adjacent Intersections traffic behavior degree of association of borderline region is 0.40, there is 15
The traffic degree of association change difference of section unit is located on change mean, therefore further clearly requires the intersection of judgement, such as
Shown in table 2 below.
Table 2
Judge the ownership of the specific traffic control cell of selected intersection：
The hypotaxis degree of corresponding intersection and the association tight ness rating gain of affiliated traffic control cell are calculated, is with intersection 15
Example：
Intersection 15, is belonged to originally in traffic control cell I：
Therefore, it can obtain
So intersection 15 still belongs to former traffic control cell I.
By calculating, the fine setting result of whole road network is as shown in table 3 below and Fig. 7.
Table 3
The intersection node number of all traffic control cells is counted, and judges each traffic control cell one by one, as a result
It is as shown in table 4 below.
Table 4
Traffic control cell is split：
Because after fine setting, the intersection number of traffic control cell I is 10, beyond the upper limit, therefore it need to be used
The road spectral clustering division methods of traffic control cell two are split to the traffic control cell, try to achieve the second small characteristic value corresponding
Characteristic vector for (0.4213,0.4016,0.3295,0.3373, -0.0790, -0.3816, -0.4612, -0.2120,
0.1083,0.1327)T, the element that will be greater than 0 is classified as a class, and the element less than or equal to 0 is classified as another kind of, segmentation result such as Fig. 8
It is shown.Former traffic control cell I has been divided 2 sub-districts, and the intersection number of sub-district 1 is 6, the intersection number of sub-district 2
For 4, so far, the intersection numbers of all traffic control cells is satisfied by requiring, traffic control cell is in this case
Dynamic adjustment terminates.
Embodiment described above is only the preferred embodiments of the invention, and the practical range of the present invention is not limited with this, therefore
The change that all shape, principles according to the present invention are made, all should cover within the scope of the present invention.
Claims (3)
1. a kind of dynamic adjusting method of traffic control cell, it is characterised in that comprise the following steps：
1) basic data prepares
Including road network dispatch figure, the distribution of each initial traffic control cell and intersection number, original state and new shape
The Adjacent Intersections traffic degree of association of state；
2) intersection judged is needed under selection new state
2.1) initial adjacent traffic control cell boarder section and corresponding Adjacent Intersections are determined；
2.2) calculate the traffic degree of association difference DELTA w of above-mentioned Adjacent Intersections under original state and new state, using the difference as
Sort by, Adjacent Intersections are ranked up by the way of descending；
2.3) average of traffic degree of association difference is set as threshold value M, and the Adjacent Intersections that difference is more than or equal to threshold value M are defined as
The object judged is needed, the Adjacent Intersections that difference is less than threshold value M are not required to judge, keep original traffic control cell ownership shape
State；
2.4) determined to need the specific intersection of the Adjacent Intersections of judgement according to the direction of the Adjacent Intersections traffic degree of association,
Including Adjacent Intersections i and j, the direction of the traffic degree of association is to point to j from i, then need the intersection judged to can be identified as i；
3) ownership of the specific traffic control cell of selected intersection is judged
3.1) intersection for needing to judge ownership is individually come out from original traffic control cell；
3.2) calculate node hypotaxis degree
Intersection node i is calculated to certain adjacent to the subordinate degree of traffic control cell, calculating formula is：
<mrow>
<mi>s</mi>
<mi>u</mi>
<mi>b</mi>
<msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>&Element;</mo>
<msub>
<mi>V</mi>
<mi>u</mi>
</msub>
</mrow>
</munder>
<msub>
<mi>w</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
<mrow>
<munder>
<mo>&Sigma;</mo>
<mrow>
<mi>j</mi>
<mo>&Element;</mo>
<mi>V</mi>
</mrow>
</munder>
<msub>
<mi>w</mi>
<mrow>
<mi>i</mi>
<mi>j</mi>
</mrow>
</msub>
</mrow>
</mfrac>
</mrow>
In formula, VuRepresent traffic control cell GuThe set of internal chiasma mouthful node, V represents traffic control cell GuInside and
The set on the side on border, wijThe weighted value on the section side between Adjacent Intersections i and j is represented, node hypotaxis degree shows more greatly section
Point and the degree of contact of traffic control cell are closer；
3.3) cell association tight ness rating gain is calculated
3.3.1 traffic control cell G) is calculateduTightness degree between internal node, calculating formula is：
<mrow>
<mi>C</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mrow>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
</mrow>
</mfrac>
</mrow>
In formula,Represent traffic control cell GuThe weighted value sum on the section side of internal chiasma mouthful node,Represent traffic
Control cell GuThe weighted value sum on side that is connected with outside intersection node of internal chiasma mouthful node；
3.3.2 traffic control cell association tight ness rating gain) is calculated, calculating formula is：
<mfenced open = "" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>&Delta;</mi>
<mi>C</mi>
<msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
</msub>
<mo>=</mo>
<mi>C</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mo>+</mo>
<mo>{</mo>
<mi>i</mi>
<mo>}</mo>
<mo>)</mo>
</mrow>
<mo>-</mo>
<mi>C</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mo>)</mo>
</mrow>
<mo>=</mo>
<mfrac>
<mrow>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<mi>i</mi>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
</mrow>
<mrow>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<mi>i</mi>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<mi>i</mi>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
</mrow>
</mfrac>
<mo>-</mo>
<mfrac>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mrow>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
</mrow>
</mfrac>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mo>=</mo>
<mfrac>
<mrow>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
<msubsup>
<mi>W</mi>
<mi>i</mi>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>-</mo>
<msubsup>
<mi>W</mi>
<mi>i</mi>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
</mrow>
<mrow>
<mo>(</mo>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<mi>i</mi>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<mi>u</mi>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
<mo>)</mo>
<mo>(</mo>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
<mo>)</mo>
</mrow>
</mfrac>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
In formula,Refer to be merged into traffic control cell G in all sides being connected with intersection node iuSide weighted value,Refer to not be merged into traffic control cell G in all sides being connected with intersection node iuSide weighted value, traffic control
Cell association tight ness rating gain processed is bigger, shows that intersection node i adds after the traffic control cell that to increase the traffic control small
Tightness degree inside area is also bigger；
3.4) Rule of judgment
The ownership of traffic control cell is redefined to the intersection of above-mentioned judgement in need, for the judgement of single intersection
Condition is as follows：
<mfenced open = "{" close = "">
<mtable>
<mtr>
<mtd>
<mrow>
<mi>s</mi>
<mi>u</mi>
<mi>b</mi>
<msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>G</mi>
<mi>v</mi>
</msub>
</msub>
<mo>-</mo>
<mi>s</mi>
<mi>u</mi>
<mi>b</mi>
<msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
</msub>
<mo>></mo>
<mn>0</mn>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>&Delta;</mi>
<mi>C</mi>
<msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>G</mi>
<mi>v</mi>
</msub>
</msub>
<mo>-</mo>
<mi>&Delta;</mi>
<mi>C</mi>
<msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
</msub>
<mo>></mo>
<mn>0</mn>
</mrow>
</mtd>
</mtr>
<mtr>
<mtd>
<mrow>
<mi>&Delta;</mi>
<mi>C</mi>
<msub>
<mrow>
<mo>(</mo>
<mi>i</mi>
<mo>)</mo>
</mrow>
<msub>
<mi>G</mi>
<mi>v</mi>
</msub>
</msub>
<mo>></mo>
<mn>0</mn>
</mrow>
</mtd>
</mtr>
</mtable>
</mfenced>
If meeting, i ∈ Gv；If it is not satisfied, i keeps original traffic control cell ownership, i.e. i ∈ Gu；
4) merging and segmentation of traffic control cell
4.1) the intersection node number of all cells is counted, the lower limit Min of the intersection number of traffic control cell is set
With upper limit value M ax, and each cell is judged one by one；
4.2) if the intersection number for having traffic control cell exceeds lower limit, step 4.3 is performed to the traffic control cell)；
If the intersection number for having traffic control cell exceeds the upper limit, step 4.4 is performed to the traffic control cell)；If there is traffic
Control the intersection number of cell eligible, then step 5 is performed to the traffic control cell)；
4.3) traffic control cell combining
4.3.1 too small traffic control cell G) is calculateduRelative to traffic control cell GvAssociation tight ness rating, calculation expression
It is as follows：
<mrow>
<mi>C</mi>
<msub>
<mrow>
<mo>(</mo>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mo>)</mo>
</mrow>
<msub>
<mi>G</mi>
<mi>v</mi>
</msub>
</msub>
<mo>=</mo>
<mfrac>
<mrow>
<mi>W</mi>
<mrow>
<mo>(</mo>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mo>,</mo>
<msub>
<mi>G</mi>
<mi>v</mi>
</msub>
<mo>)</mo>
</mrow>
</mrow>
<mrow>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>u</mi>
</msub>
<mrow>
<mi>i</mi>
<mi>n</mi>
</mrow>
</msubsup>
<mo>+</mo>
<msubsup>
<mi>W</mi>
<msub>
<mi>G</mi>
<mi>v</mi>
</msub>
<mrow>
<mi>o</mi>
<mi>u</mi>
<mi>t</mi>
</mrow>
</msubsup>
</mrow>
</mfrac>
</mrow>
In formula, W (Gu,Gv) represent traffic control cell GuAnd GvBetween all connected sides weighted value sum；
4.3.2 the traffic control cell combining) is controlled into cell to the maximum adjacent traffic of tight ness rating is associated；
4.3.3) if the new traffic control cell intersection number after merging exceeds the upper limit, step 4.4 is performed)；Otherwise step is performed
It is rapid 5)；
4.4) traffic control cell is split
4.4.1) split using the road spectral clustering division methods of traffic control cell two, segmentation step is as follows：
A) matrix W, the side number structure connected according to intersection node are built according to the Adjacent Intersections traffic degree of association under new state
Degree of building matrix D, sets up Laplacian Matrix
B) characteristic value and characteristic vector for calculating Laplacian Matrix L are sought；
C) characteristic value is ranked up, the second small characteristic value of selection and corresponding characteristic vector, the i-th row wherein in characteristic vector
Represent i-th of intersection of survey region；
D) element of this feature vector is ranked up, node division is two classes, i.e. B1 and B2 by the cut-point needed for selection；
4.4.2 set B1 and B2 magnitude relationship of the element number with lower limit Min) are judged
If a) set B1 and B2 element number is all higher than being equal to lower limit Min, step 5 is performed)；
If b) set B1 or B2 element number is less than lower limit Min, step 4.4.3 is performed to the set less than lower limit)；
4.4.3) the corresponding traffic control cell G of set of computations B1 and B2B1And GB2Each edge circle be connected section LijAdjacent friendship
Prong is in traffic control cell GB2Cut is compared in association loss on directionijj, wherein,Intersection i belongs to friendship
The few traffic control cell G of prong numberB1, j belongs to the traffic control cell G more than the number of intersectionB2, WjRefer to and intersection j
Adjacent Intersections degree of association sum corresponding to connected section；
4.4.4 lower limit Min and traffic control cell G) is calculatedB1Intersection number difference DELTAMinB1, to cutijArranged
Sequence, selects minimum ΔMinXCut is compared in individual association lossijCorresponding intersection j is divided to traffic control cell GB1, so that really
The traffic control cell ownership of intersection after fixed segmentation, forms two qualified traffic control cells, performs step 5)；
5) result is preserved.
2. a kind of dynamic adjusting method of traffic control cell according to claim 1, it is characterised in that：In step 4)
In, it is necessary to set the lower limit Min and upper limit value M ax of the intersection number of traffic control cell, handed over according to traffic control cell
Messenger coordinates controlled attribute, and two adjacent signalized crossings can carry out coordination control, in order to obtain more preferable association
Adjust effect, it is proposed that the lower limit Min spans of the Adjacent Intersections number of signal coordinated control are 2~4；In addition, intersection
It is not that more multi-intersection is better, it is necessary to consider city road network density, intersection spacing, traffic control system to coordinate control, therefore
It is recommended that upper limit value M ax minimum value is twice of lower limit Min maximum occurrences, i.e. upper limit value M ax should be greater than or equal to 8.
3. a kind of dynamic adjusting method of traffic control cell according to claim 1, it is characterised in that：In step 4)
In, it is necessary to select required cut-point to be two classes, i.e. B1 and B2 by node division, it is proposed that selection, first will be small 0 as cut-point
Element in 0 is divided to set A1, and the element that will be greater than 0 is divided to set A2, statistics set A1 and A2 element number, if collection
When conjunction A1 and A2 element number is equal, when having element 0 in characteristic vector, element 0 is divided to set A2, element will not included
0 collection is collectively referred to as B1, and the collection comprising element 0 is collectively referred to as B2；If set A1 and A2 element number are unequal, by 0 stroke of element
Divide to the small set of number, the collection comprising element 0 is collectively referred to as B1, the collection not comprising element 0 is collectively referred to as B2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710402885.1A CN107180541B (en) | 2017-06-01 | 2017-06-01 | Dynamic adjustment method for traffic control cell |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710402885.1A CN107180541B (en) | 2017-06-01 | 2017-06-01 | Dynamic adjustment method for traffic control cell |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107180541A true CN107180541A (en) | 2017-09-19 |
| CN107180541B CN107180541B (en) | 2020-01-14 |
Family
ID=59835223
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710402885.1A Active CN107180541B (en) | 2017-06-01 | 2017-06-01 | Dynamic adjustment method for traffic control cell |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107180541B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108320512A (en) * | 2018-03-30 | 2018-07-24 | 江苏智通交通科技有限公司 | Macroscopical road safety analytic unit choosing method based on Laplce's spectrum analysis |
| CN109559544A (en) * | 2018-11-20 | 2019-04-02 | 上海海事大学 | A kind of vehicle intelligent navigates the traffic fast selecting method under the traffic accident that happens suddenly |
| CN109887297A (en) * | 2019-04-23 | 2019-06-14 | 太原理工大学 | The division methods of urban traffic control sub-district based on quick global K-means spectral clustering |
| CN110322694A (en) * | 2019-07-16 | 2019-10-11 | 青岛海信网络科技股份有限公司 | A kind of method and device of urban traffic control piece Division |
| CN110335478A (en) * | 2019-07-10 | 2019-10-15 | 江苏航天大为科技股份有限公司 | Across sub-district inter-linked controlling method based on deep learning |
| CN110415523A (en) * | 2019-08-13 | 2019-11-05 | 东南大学 | A kind of signal control work zone division methods based on vehicle driving track data |
| CN111325979A (en) * | 2020-02-28 | 2020-06-23 | 海信集团有限公司 | Method and device for dividing traffic control multistage subareas |
| CN111462490A (en) * | 2020-04-03 | 2020-07-28 | 海信集团有限公司 | Road network visualization method and device based on multistage subregion division |
| CN112907939A (en) * | 2019-12-04 | 2021-06-04 | 杭州海康威视数字技术股份有限公司 | Traffic control subarea dividing method and device |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001165681A (en) * | 1999-12-09 | 2001-06-22 | Navitime Japan Co Ltd | Traffic network route searing method |
| US7447588B1 (en) * | 2007-07-16 | 2008-11-04 | Wenshine Technology Ltd. | Method and system for partitioning a continental roadway network for an intelligent vehicle highway system |
| CN101639978A (en) * | 2009-08-28 | 2010-02-03 | 华南理工大学 | Method capable of dynamically partitioning traffic control subregion |
| CN101819717A (en) * | 2010-03-05 | 2010-09-01 | 吉林大学 | Road network performance judgment method based on traffic state space-time model |
| CN102722986A (en) * | 2012-06-28 | 2012-10-10 | 吉林大学 | Urban road network traffic control subarea dynamic partitioning method |
| CN103544841A (en) * | 2013-10-22 | 2014-01-29 | 银江股份有限公司 | Method for dynamically dividing traffic control region |
| CN105225503A (en) * | 2015-11-09 | 2016-01-06 | 中山大学 | Traffic control subarea is optimized and self-adapting regulation method |
| CN105869401A (en) * | 2016-05-12 | 2016-08-17 | 华南理工大学 | Road network dynamic partitioning method based on different crowdedness degrees |
-
2017
- 2017-06-01 CN CN201710402885.1A patent/CN107180541B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001165681A (en) * | 1999-12-09 | 2001-06-22 | Navitime Japan Co Ltd | Traffic network route searing method |
| US7447588B1 (en) * | 2007-07-16 | 2008-11-04 | Wenshine Technology Ltd. | Method and system for partitioning a continental roadway network for an intelligent vehicle highway system |
| CN101639978A (en) * | 2009-08-28 | 2010-02-03 | 华南理工大学 | Method capable of dynamically partitioning traffic control subregion |
| CN101819717A (en) * | 2010-03-05 | 2010-09-01 | 吉林大学 | Road network performance judgment method based on traffic state space-time model |
| CN102722986A (en) * | 2012-06-28 | 2012-10-10 | 吉林大学 | Urban road network traffic control subarea dynamic partitioning method |
| CN103544841A (en) * | 2013-10-22 | 2014-01-29 | 银江股份有限公司 | Method for dynamically dividing traffic control region |
| CN105225503A (en) * | 2015-11-09 | 2016-01-06 | 中山大学 | Traffic control subarea is optimized and self-adapting regulation method |
| CN105869401A (en) * | 2016-05-12 | 2016-08-17 | 华南理工大学 | Road network dynamic partitioning method based on different crowdedness degrees |
Non-Patent Citations (1)
| Title |
|---|
| 马莹莹 等: "基于谱方法的城市交通信号控制网络小区划分方法", 《***工程理论与实践》 * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108320512A (en) * | 2018-03-30 | 2018-07-24 | 江苏智通交通科技有限公司 | Macroscopical road safety analytic unit choosing method based on Laplce's spectrum analysis |
| CN109559544B (en) * | 2018-11-20 | 2021-03-05 | 上海海事大学 | Traffic quick selection method of vehicle-mounted intelligent navigation under sudden traffic accident |
| CN109559544A (en) * | 2018-11-20 | 2019-04-02 | 上海海事大学 | A kind of vehicle intelligent navigates the traffic fast selecting method under the traffic accident that happens suddenly |
| CN109887297A (en) * | 2019-04-23 | 2019-06-14 | 太原理工大学 | The division methods of urban traffic control sub-district based on quick global K-means spectral clustering |
| CN109887297B (en) * | 2019-04-23 | 2021-03-26 | 太原理工大学 | Method for dividing urban traffic control subareas based on rapid global K-means spectral clustering |
| CN110335478A (en) * | 2019-07-10 | 2019-10-15 | 江苏航天大为科技股份有限公司 | Across sub-district inter-linked controlling method based on deep learning |
| CN110322694A (en) * | 2019-07-16 | 2019-10-11 | 青岛海信网络科技股份有限公司 | A kind of method and device of urban traffic control piece Division |
| CN110415523A (en) * | 2019-08-13 | 2019-11-05 | 东南大学 | A kind of signal control work zone division methods based on vehicle driving track data |
| CN110415523B (en) * | 2019-08-13 | 2021-07-30 | 东南大学 | Signal control subarea division method based on vehicle travel track data |
| CN112907939A (en) * | 2019-12-04 | 2021-06-04 | 杭州海康威视数字技术股份有限公司 | Traffic control subarea dividing method and device |
| CN112907939B (en) * | 2019-12-04 | 2022-05-20 | 杭州海康威视数字技术股份有限公司 | Traffic control subarea dividing method and device |
| CN111325979A (en) * | 2020-02-28 | 2020-06-23 | 海信集团有限公司 | Method and device for dividing traffic control multistage subareas |
| CN111462490A (en) * | 2020-04-03 | 2020-07-28 | 海信集团有限公司 | Road network visualization method and device based on multistage subregion division |
| CN111462490B (en) * | 2020-04-03 | 2022-06-21 | 海信集团有限公司 | Road network visualization method and device based on multistage subregion division |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107180541B (en) | 2020-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107180541A (en) | A kind of dynamic adjusting method of traffic control cell | |
| CN105869401A (en) | Road network dynamic partitioning method based on different crowdedness degrees | |
| CN109887297B (en) | Method for dividing urban traffic control subareas based on rapid global K-means spectral clustering | |
| CN103810849B (en) | A kind of traffic flow variation tendency extracting method based on floating car data | |
| CN105225503B (en) | Traffic control sub-district optimizes and self-adapting regulation method | |
| CN109272170B (en) | A kind of traffic zone dividing system based on Louvain algorithm | |
| CN109087502B (en) | Vehicle scheduling method, scheduling system and computer equipment based on order distribution | |
| CN114372117A (en) | Multi-scale aggregation mode analysis method for complex traffic network | |
| CN109446588B (en) | Shared bicycle analysis scheduling method based on stochastic Petri network model | |
| CN108518238B (en) | The judgment method of mine ventilation network optimization optimal solution | |
| CN109885639A (en) | Visual taxi is got on or off the bus characteristic analysis method | |
| Standfuß et al. | Dynamic airspace optimisation | |
| CN104268580B (en) | A kind of class caricature laying out images management method based on scene classification | |
| CN107194541A (en) | A kind of power distribution network power supply zone method based on adaptive weighting Voronoi diagram | |
| CN116564088A (en) | Urban traffic state monitoring and regional signal control system oriented to information physical fusion system | |
| CN116976045A (en) | Multi-target constraint simulation method for control subarea under non-congestion state | |
| Saeedmanesh et al. | Optimization-based clustering of traffic networks using distinct local components | |
| CN103226900B (en) | A kind of space domain sector division methods based on weighted graph model | |
| CN111429166B (en) | Electric vehicle charging demand spatial distribution prediction method based on maximum contour clustering | |
| CN116682259A (en) | Urban area road traffic coordination control method based on road network subarea division | |
| CN108053658B (en) | Expressway multi-turn-road coordination control method for congestion full-chain management | |
| CN111738527A (en) | Urban traffic zone dividing method based on hot spot detection model | |
| CN106354886A (en) | Method for screening nearest neighbor by using potential neighbor relation graph in recommendation system | |
| Moore et al. | Statistical designation of traffic control subareas | |
| CN109214459A (en) | Clustering division method for geographic suitability |
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 |