Shortest path-based network division method

A shortest path, wire network technology, used in data processing applications, forecasting, computing, etc.

Inactive Publication Date: 2017-05-10
北京市第四中学 +1
View PDF4 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

This method can effectively solve the distribution of public infrastructure (gas stations, charging stations, sanitation facilities) on urban roads, the distribution of logistics storage nodes, etc.

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
  • Shortest path-based network division method
  • Shortest path-based network division method
  • Shortest path-based network division method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0009] Wire net model definition:

[0010] The wire network model represents a set of vertices and the connection relationship between vertices, and has a wide range of applications in path planning. We define the line network G=(V,E) in N-dimensional space, such as figure 1 (a) Shown. The set of vertices is:

[0011]

[0012] The edge set is:

[0013] In a continuous curve of finite length¶ ij By v i And v j End and not passing

[0014]

[0015]

[0016] In the shortest path problem, generally it is also each edge of the network (v i ,v j )∈E gives weight w i,j . From vertex v i To v j The sum of the weights of the successive edges on the path is called the weight of the path. From vertex v i To v j The path with the smallest weight is called vertex v i To v j The shortest path, the corresponding weight is called vertex v i To v j The shortest distance, denoted as d i,j . If there is a path between any two points in the set of vertices, the line network is said to be connecte...

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 present invention relates to an undirected connected network shortest path-based network division method. The objective of the invention is to solve practical problems. When a Voronoi diagram is generated on the network, the L2 Euclidean distance is replaced by a shortest path in connected lines between nodes along the network. According to the undirected connected network shortest path-based network division method, after a group of randomly distributed seed points are provided, Voronoi units on the current network are calculated based on the shortest path; a Voronoi diagram in the Euclidean space is generalized into the Voronoi diagram in the connected network through a CVT (centroidal Voronoi tessellation) algorithm; and iteration is performed, the weighting length of the network corresponding to each seed point on the network is made to be identical as much as possible, and therefore, the optimal division of the network model is obtained. With the method of the invention adopted, problems in the distribution of public infrastructure such as gas stations, charging stations and sanitation facilities, and the distribution of logistics warehouse nodes on urban road can be solved.

Description

Technical field [0001] The invention relates to a method for dividing a line network based on the shortest path. Background technique [0002] How to divide a plane based on a set of points on a given plane is an important mathematical problem, which has important practical value in important fields such as communication node optimization, logistics distribution, and urban planning. The division of planes through the Voronoi diagram is the most common form. Voronoi diagram is a very important geometric structure in mathematics. It has been widely used as an important abstract model representation in many fields such as physics, chemistry, biology, and engineering. Given a set of discrete points on a plane P, each point is called a seed point and corresponds to a division unit. If the distance from any point in the division unit to this seed point is less than the distance to other seed points, we call the plane division as Voronoi subdivision, the corresponding division unit is...

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 Applications(China)
IPC IPC(8): G06Q10/04
CPCG06Q10/047
Inventor 胡泽涵王泽宇
Owner 北京市第四中学
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap