Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Subdivision method of urban road traffic based on spectral clustering

A spectral clustering and traffic sub-technology, which is applied in the traffic control system of road vehicles, traffic flow detection, traffic control system, etc., can solve problems such as instability, low calculation efficiency, and large differences in similarity sub-intervals, achieving Stable acquisition, reduced iterative process, and guaranteed feature similarity effects

Active Publication Date: 2020-12-29
JIANGSU ZHITONG TRANSPORTATION TECH
View PDF2 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] The purpose of the present invention is to provide a method for dividing urban road traffic sub-regions based on spectral clustering, through multiple constraint conditions and iterative evaluation of similarity, to obtain the optimal solution with the largest similarity in the sub-region and the largest difference between sub-intervals, The algorithm for solving the bipartite clustering existing in the prior art does not make full use of other eigenvectors containing useful segmentation information when the graph segmentation results are obtained based on Laplacian non-zero small eigenvalues ​​and their eigenvector clustering, and in When multiple subgraphs need to be divided, it must be used iteratively, and the problems of large amount of information loss, low calculation efficiency and unstable defects appear

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Subdivision method of urban road traffic based on spectral clustering
  • Subdivision method of urban road traffic based on spectral clustering
  • Subdivision method of urban road traffic based on spectral clustering

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0030] A method for dividing urban road traffic subregions based on spectral clustering, comprising the following steps:

[0031] S1. Based on the topological structure of road network intersections and road sections and the traffic characteristic data of each node, establish a road network undirected graph G=(V, E), and calculate the road network density Laplacian matrix L.

[0032] S2. Calculate the first k smallest eigenvalues ​​and eigenvectors of the Laplacian matrix L except 0, where the initial value of k is 2; construct clusters according to the eigenvectors v1,...,vk corresponding to the k eigenvalues Basic matrix H=[v1,...,vk], implement K-means clustering algorithm on the row vectors of matrix H, and obtain k clusters;

[0033] Use the variance analysis test method to test the traffic feature correlation degree X in k groups, the test level is usually 0.05, if there is a significant difference, go to step S3; otherwise, k=k+1, repeat step S2.

[0034] S3. The initi...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a method for dividing urban road traffic sub-regions based on spectral clustering, establishes an undirected road network graph, and calculates the road network density Laplacian matrix L; according to the eigenvector v corresponding to k eigenvalues 1 ,...,v k Construct the clustering basic matrix, and implement the K-means clustering algorithm to obtain k clusters; form the initial sub-area; randomly merge isolated points into adjacent sub-areas to obtain the current total number of sub-areas; identify outliers through deviation detection , and solve the optimal outlier attribution problem through boundary adjustment; through the similarity evaluation inside and outside the sub-area and the similarity change analysis before and after sub-area splitting and merging, iteratively optimize the sub-area scheme, and finally obtain the nodes in the sub-area The road traffic network division scheme with the largest correlation similarity and the largest sub-interval difference. This method efficiently and stably obtains the division scheme of the traffic road network according to the similar characteristics of the node correlation degree, and guarantees the characteristic difference of the sub-interval and the similarity of the characteristics within the sub-region to the greatest extent.

Description

technical field [0001] The invention relates to a method for dividing urban road traffic sub-regions based on spectrum clustering. Background technique [0002] The urban road traffic network is a complex network with random characteristics. A collection of closely related intersections and road sections is composed of sub-areas, and the control, induction, management, and planning are implemented according to the characteristics of each sub-area, which can reduce the complexity of the road traffic system. Even from the macro level to achieve the effect of coordination and optimization. In the field of traffic signal control, dynamic control sub-area division can improve the stability and reliability of signal cooperative control; in the field of traffic guidance, the division of sub-areas provides support for the synergy induction effect; In terms of domains, static sub-divisions are mainly used, taking macroscopic characteristics such as land use, population, and economy ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G08G1/01G06K9/62
CPCG08G1/0137G06F18/23
Inventor 刘林陈凝吕伟韬李攀
Owner JIANGSU ZHITONG TRANSPORTATION TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products