CN105512169A - Shortest route searching method based on route and weight - Google Patents
Shortest route searching method based on route and weight Download PDFInfo
- Publication number
- CN105512169A CN105512169A CN201510790636.5A CN201510790636A CN105512169A CN 105512169 A CN105512169 A CN 105512169A CN 201510790636 A CN201510790636 A CN 201510790636A CN 105512169 A CN105512169 A CN 105512169A
- Authority
- CN
- China
- Prior art keywords
- path
- footpath
- new
- polygon
- route
- 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
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
Abstract
The invention aims to provide a shortest route searching method based on a route and weight. The shortest route searching method comprises the following steps that (1) the length of route each road equals a value of a real distance dividing a weight value; (2) each road in a to-be-analyzed area is connected; (3) starting points and terminal points are connected to achieve connection lines, so a plurality of initial route polygons can be achieved; (4) the plurality of initial route polygons are combined to achieve a coated polygon; (5) with the connection lines as a border, a starting left route and a starting right route of the coated polygon can be achieved; (6) a shorter connection line is employed to replace a connection line of two points corresponding to the starting routes and search is orderly continued to achieved a new left route and a new right route; (7) if the new left route and the new right routes are overlapped, the overlapped part is sure to be the shortest route part; if the new left route and the new right route are not overlapped, a final left route and a final right route can be achieved; (8) middle polygons in the final left route and the final right route are combined to achieved a combined polygon; and (9) a public part of the new left and right routes is combined with an acquired result to achieve the final shortest route. The shortest route searching method based on route and weight has high searching efficiency and precision, and can be applied to current each space data processing software platforms.
Description
Technical field
The present invention relates to mathematics and computer science graphics field, be specifically related to a kind of method for searching shortest route based on path and power.
Background technology
Shortest Path Searching is common dijkstra's algorithm (signal source shortest path), Floyd algorithm (interpolation point method), AStar algorithm (heuristic shortest path first) etc., and wherein foremost algorithm is Djikstra algorithm.The realization of this algorithm is based on the adjacency matrix method of figure, and it can not only find the shortest path of any two points, and certain specified point can also be found to the shortest path on other all summits.Although dijkstra's algorithm is simple, need all paths in hunting zone, as net internal segment is counted very large, then counting yield will sharply decline.The advantage of Floyd algorithm proposes starting condition, avoid dijkstra's algorithm search without purpose, search efficiency improves a lot, but initial path of its hypothesis is still counted relevant with whole hunting zone internal segment, the still not high and net result not necessarily shortest path of search efficiency.AStar algorithm is actual is a kind of heuristic search, utilizes the path of an each search of evaluation function assessment exactly, determines to select suitable valuation functions.Can optimize the route searching of common breadth First so greatly, but search accuracy is subject to the impact of evaluation function, its result not necessarily shortest path.
Although above method can realize Shortest Path Searching problem, there is following shortcoming and defect: 1) search efficiency is low, Search Results and efficiency are difficult to obtain balanced; 2) complex disposal process, although algorithm is ripe, fails to promote search efficiency and accuracy rate in conjunction with spatial relationship; 3) road conditions is different, current Shortest Path Searching Algorithm many considerations geometry shortest path, little dynamic in time according to road conditions real-time update shortest path and need again again search for.
Summary of the invention
The object of the present invention is to provide a kind of method for searching shortest route based on path and power.The present invention is by the advantage in conjunction with various algorithm, a kind of brand-new Shortest Path Searching Algorithm is proposed, Shortest Path Searching is expanded to surface layer, utilizes the topological relation of point-line-surface, realize not affecting by hunting zone, weights, simple efficient Shortest Path Searching can be adjusted according to road conditions.
Technical scheme of the present invention is as follows: the method for searching shortest route based on path and power of the present invention, comprises the following steps:
1) first give different weights by dissimilar road, the path on Mei Duan road is that actual distance is divided by weights;
2) connected by bar road each in region to be analyzed, space topology analyzing, by the Road structure face in region again;
3) straight line connection starting point and terminal obtain connecting line, carry out space querying analysis, obtain the multiple initial path polygons with connecting line space intersection to connecting line by the space querying function of GIS platform;
4) the multiple initial path polygons obtained are merged by GIS platform, obtain outsourcing polygon;
5) take connecting line as boundary, direction is that starting point arrives terminal, obtains the polygonal initial left footpath of outsourcing and initial right wing footpath, gets initial left footpath and initial right wing footpath is initial path;
6) be as the criterion with this initial path, from starting point, check multiple paths polygon successively, if the connection line electrical path length at Zhong Gaiduan two ends, initial path is greater than the path of the line of another side in respective path polygon, replace the connecting line in corresponding 2 of initial path with shorter line, search obtains new left and new right wing footpath successively;
7) with new left footpath and new right wing footpath for starting at, if there is overlap in new left footpath and new right wing footpath, the public part in path, new left and right, then lap must be shortest path part, if new left footpath and new right wing footpath underlapped, with the joining in new left footpath and new right wing footpath for cut-point, new left footpath and new right wing footpath in adjacent path, new left and right polygon are passed through and there is the polygonal meshes of common edge, repeat above step 6,7, obtain final left footpath and final right wing footpath;
8) merge the middle polygon in final left footpath and final right wing footpath, obtain merging polygon, try to achieve the path between two path, adjacent left and right intersection points, get short person for result;
9) again the public part in path, new left and right is merged with the result of trying to achieve, obtain final shortest path.
Above-mentioned steps 1) comprise the following steps:
11) first by road according to different grades, give different weights respectively;
12) physical length of every section of road is obtained;
13) length and weights are divided by, obtain the path on Mei Duan road.
Above-mentioned steps 2) comprise the following steps:
21) check that road connects Topology Error by GIS platform, guarantee the annexation that every bar road is correct;
22) space topology analyzing is carried out by GIS platform, by the road topology structure face in region;
23) checking topological structure face mistake by GIS platform, as there is dead end highway etc., not participating in structure face;
24) polygon after the success of structure face should be connected successively, concurrent or common limit;
25) if occur not be successively connected polygon, check mistake, if there is mistake, repeat step 22), 23), 24);
26) if there is not mistake, then do not connect path between polygon and isolate the part that limit must be shortest path, record this isolated line segment.
Above-mentioned steps 3) comprise the following steps:
31) connect starting point and terminal, obtain the connecting line of point-to-point transmission, be the theoretical bee-line of point-to-point transmission;
32) be as the criterion with connecting line, had living space crossing multiple initial path polygons by GIS platform space querying and connecting line.
Above-mentioned steps 4) comprise the following steps:
41) obtain multiple initial polygon by GIS platform inspection inquiry, if be connected successively, then polygon GIS platform merged, obtain outsourcing polygon, enter step 5);
42) if there is the situation that is not connected, then by GIS platform, the polygonal segment be connected is merged, proceed to step 43);
43) the outsourcing polygon after record merging, if there is isolated line, this wiring path must be a part for shortest path.
Above-mentioned steps 5) comprise the following steps:
51) take connecting line as boundary, direction is that terminal arrives starting point;
52) if path polygon does not connect, be public part with isolated line, then sideline, left and right and isolated line are connected respectively and are left side bearing and right side bearing;
53) if path polygon connects, the polygonal initial left footpath of this outsourcing and initial right wing footpath is obtained, as initial path.
Above-mentioned steps 6) comprise the following steps:
61) be as the criterion with this initial path, from starting point, check multiple initial path polygon successively, if the connection line electrical path length at Zhong Gaiduan two ends, initial path is greater than the path of the line of another side in the polygon of path, replace the connecting line in corresponding 2 of initial path with shorter line;
62) search for each path polygon successively, obtain new left footpath and new right wing footpath.
Above-mentioned steps 7) comprise the following steps:
71) if there is overlap in new left footpath and new right wing footpath, then lap must be shortest path part;
72) if new left footpath and new right wing footpath underlapped, with new left footpath and new right wing footpath joining for cut-point, adjacent new left footpath and new right wing footpath are passed through and there is path, the left and right polygonal meshes of common edge:
73) repeat above step 6,7, obtain final left footpath and final right wing footpath.
Above-mentioned steps 8) comprise the following steps:
81) merge polygon in the middle of path that final left footpath and final right wing footpath comprise, obtain merging polygon;
82) be as the criterion to merge polygon, try to achieve the shortest left footpath between two adjacent cut-points and the shortest right wing footpath, get short person for result.
Above-mentioned steps 9) comprise the following steps:
91) if not be dead end highway, again the public part in path, new left and right is merged with the result of trying to achieve, obtain final shortest path 19;
92) if dead end highway, search for the shortest path connection dead end highway obtained and be final shortest path.
Method for searching shortest route of the present invention preferably uses the Shortest Path Searching environment of the complicated road conditions in city.The present invention, by the traditional algorithm of method for searching shortest route is expanded to space field, utilizes the requirement of spatial relationship and shortest path, has both achieved the rapid of initial path and has determined, searching algorithm scientific, achieves again the high efficiency of search procedure efficiency.The method can realize in each large space data processing platform (DPP), has principle simple, and be easy to realize, the feature of efficient stable, can promote search efficiency and accuracy greatly.
Accompanying drawing explanation
Fig. 1 is the schematic flow sheet of the method for searching shortest route that the present invention is based on path and power;
Fig. 2 to Fig. 9 is the search procedure schematic diagram of the method for searching shortest route embodiment that the present invention is based on path and power.。
Embodiment
The present invention is elaborated below in conjunction with embodiment.
Embodiment 1
The present embodiment, based on the method for searching shortest route of path and power, comprises the following steps:
The present embodiment city main city zone point-to-point transmission Shortest Path Searching, operation platform is the Windows7 operating system on PC, and GIS Development platform is Beijing hypergraph geographical information platform software 5.3.3 version.
In order to accurate definition concept, guarantee the correctness of language expression and be convenient to program realization, spy is described following content and defines:
Node: the unique point of road;
Degree: the number of node connecting line, degree is 2 is be ordinary node, and degree is greater than 2 for node;
Node: the intersection point of different road;
Road: natural road;
Path polygon: the region that all segmental arcs surround.
Four relations: node is the unique point of road, during two ends (degree is greater than 2), are node.Close on node line and be segmental arc, the degree of node is greater than 2.Segmental arc is these polygonal borders, and each segmental arc is the common edge of two adjacent polygons and spatial relationship is crossing.
Concrete steps are as follows:
1) first give different weights by dissimilar road, the path on Mei Duan road is that actual distance is divided by weights;
2) again bar road each in region to be analyzed is connected, analyzed by the space topological function of Beijing hypergraph geographical information platform software, by the spatial data handling function structure face of the Road in region by Beijing hypergraph geographical information platform software;
3) starting point 1 shown in straight line connection layout 2 and terminal 2, carries out space querying analysis to connecting line 3 by the space querying function of Beijing hypergraph geographical information platform software, obtains and the initial path polygon 4 shown in multiple Fig. 2 of this connecting line 3 space intersection;
4), by Beijing hypergraph geographical information platform software initial path polygon 4 is merged, outsourcing polygon 5 shown in the Fig. 2 obtaining this connecting line;
5) with connecting line 3 shown in Fig. 2 for boundary, direction be Fig. 2 terminal 1 to Fig. 2 starting point 2, obtain the initial left footpath 6 of Fig. 3 outsourcing polygon 1 and initial right wing footpath 7, get Fig. 3 initial left footpath 6 and initial right wing footpath 7 is initial path;
6) be as the criterion with this initial path, from Fig. 2 starting point 1, check Fig. 2 multiple paths polygon 4 successively, if the connection line electrical path length at Zhong Gaiduan two ends, initial path is greater than the path of the line of another side in respective path polygon, replace the connecting line in corresponding 2 of initial path with shorter line, search obtains new left footpath 9 and new right wing footpath 10 shown in Fig. 4 successively;
7) start at left footpath 9 new shown in Fig. 4 and new right wing footpath 10, if new left footpath 9 and new right wing footpath 10 overlap, the public part 11 in path, new left and right then shown in lap Fig. 4 must be shortest path part, if new left footpath 9 and new right wing footpath 100 underlapped, with path, the left and right intersection point 15 shown in adjacent Fig. 5 for cut-point, by Beijing hypergraph new left footpath 9 and new right wing footpath 10 pass through and there is path, the left and right polygonal meshes of common edge, repeat above step 6,7, obtain final path 13 and final right wing footpath 14;
8) merge the polygon in final left footpath 13 shown in Fig. 5 and final right wing footpath 14, obtain the merging polygon 16 shown in Fig. 6, try to achieve the path of path, final left and right intersection point 15 the right and lefts shown in two adjacent Fig. 5, get short person for result;
9) by the spatial data handling function of Beijing hypergraph geographical information platform software, again public for the path, new left and right shown in Fig. 4 part 11 is merged with the result of trying to achieve, obtain final shortest path 19 shown in Fig. 8.
Step 1 comprises the following steps:
11) first by road according to different grades, give different weights P respectively, if major trunk roads weights are 1, subsidiary road is 0.8, and branch road is 0.6;
12) the physical length L of every section of road is obtained;
13) length and weights are divided by, obtain the path L/P on Mei Duan road;
Step B comprises the following steps:
21) check that road connects Topology Error by Beijing hypergraph geographical information platform software, the path with Topology Error is checked, guarantees the annexation that every bar road is correct;
22) space line topology is carried out by Beijing hypergraph geographical information platform software, by the road topology structure face in region;
23) again check topological structure face mistake by Beijing hypergraph geographical information platform software, still there is the road of Topology Error after namely dead end highway checks as occurred, not participating in structure face;
24) should be connected successively by the polygon after the success of hypergraph geographical information platform software structure face, Beijing, concurrent or common limit, spatial relationship is tangent between face, face;
25) if occur not be successively connected polygon, check mistake, if there is mistake, repeat 22), 23), 24);
26) if there is not mistake, then not connecting isolated path 1 shown in path profile 9 between polygon must be a part for shortest path, records this isolated line segment;
Step 3) comprises the following steps:
31) if terminal 2 is on dead end highway shown in starting point 1 shown in Fig. 2 or Fig. 2, then starting point 1 or terminal 2 are searched corresponding path polygon, using the polygonal intersection point of dead end highway and path as starting point 1 or terminal 2 along dead end highway;
32) terminal 1 shown in starting point 1 and Fig. 2 shown in connection layout 2, connecting line segment 3 shown in the Fig. 2 obtaining point-to-point transmission, is the theoretical bee-line of point-to-point transmission;
33) be as the criterion with connecting line segment, had living space the multiple paths polygon 4 shown in crossing Fig. 2 by the inquiry of Beijing hypergraph geographical information platform software space and connecting line;
Step 4 comprises the following steps:
41) the multiple paths polygon 4 obtained is inquired about by Beijing hypergraph geographical information platform software space, if be connected successively, then by the spatial data handling function of Beijing hypergraph geographical information platform software, polygonal meshes is obtained the outsourcing polygon 5 shown in Fig. 3, enter step 5);
42) if there is the situation that is not connected, then by Beijing hypergraph geographical information platform software, the merging of connected polygonal segment is obtained the outsourcing polygon 5 shown in Fig. 3, proceed to 43);
43) isolated line 20 shown in line graph 9 between the outsourcing polygon after record merging, this wiring path must be a part for shortest path;
Step 5 comprises the following steps:
51) with connecting line 3 shown in Fig. 2 for boundary, direction is starting point 1 shown in terminal 2 shown in Fig. 2 to Fig. 2, obtains initial left side bearing 6 and the initial right side bearing 7 of the polygon of outsourcing shown in Fig. 35;
52) if path polygon does not connect, then left side bearing 21 shown in Fig. 9 is connected respectively with right side bearing 22 and isolated line 20 and is initial left side bearing 6 and initial right side bearing 7;
53) be initial path with initial left side bearing 6 and initial right side bearing 7, enter step 6;
Step 6) comprises the following steps:
61) be as the criterion with this initial path, from the off, check the multiple initial path polygons 4 shown in Fig. 2 successively, if the connection line electrical path length at Zhong Gaiduan two ends, initial path is greater than the path of the line of another side in the polygon of path, replace the connecting line in corresponding 2 of initial path with shorter line;
62) search for each path polygon successively, obtain new left footpath 9 and new right wing footpath 10 shown in new Fig. 4;
Step 7) comprises the following steps:
71) with left footpath 9 new shown in Fig. 4 and new right wing footpath 10 for starting at, if there is the public part 11 in path, new left and right shown in overlay chart 4 in new left footpath 9 and new right wing footpath 10, then lap must be shortest path part;
72) if new left footpath 9 and new right wing footpath 10 underlapped, to close on path, left and right intersection point 15 for starting point shown in Fig. 5, by the spatial data handling function of Beijing hypergraph geographical information platform software adjacent, new left footpath 9 and new right wing footpath 10 are passed through and there is the polygonal meshes of common edge;
73) repeat above step 6,7, finally obtain the final left footpath 13 shown in Fig. 5 and final right wing footpath 14, the intersection point in final left footpath 13 and final right wing footpath 14 is path, final left and right intersection points 15;
Step 8) comprises the following steps:
81) merge the polygon in final left footpath 13 shown in Fig. 5 and final right wing footpath 14 by the spatial data handling ability of Beijing hypergraph geographical information platform software, obtain the multiple merging polygons 16 shown in Fig. 6;
82), shown in the shortest left footpath 17 of trying to achieve the right and left between two adjacent cut-points and the shortest right wing footpath 18, Fig. 7, short person is got for result;
Step 9 comprises the following steps:
91) if not be dead end highway, again public for the path, new left and right shown in Fig. 4 part 11 is merged with the result of trying to achieve, obtain final shortest path 19 shown in Fig. 8;
92) if dead end highway, search for the shortest path connection dead end highway obtained and be final shortest path.
Claims (10)
1., based on a method for searching shortest route for path and power, it is characterized in that comprising the following steps:
1) first give different weights by dissimilar road, the path on Mei Duan road is that actual distance is divided by weights;
2) connected by bar road each in region to be analyzed, space topology analyzing, by the Road structure face in region again;
3) straight line connection starting point and terminal obtain connecting line, carry out space querying analysis, obtain the multiple initial path polygons with connecting line space intersection to connecting line by the space querying function of GIS platform;
4) the multiple initial path polygons obtained are merged by GIS platform, obtain outsourcing polygon;
5) take connecting line as boundary, direction is that starting point arrives terminal, obtains the polygonal initial left footpath of outsourcing and initial right wing footpath, gets initial left footpath and initial right wing footpath is initial path;
6) be as the criterion with this initial path, from starting point, check multiple paths polygon successively, if the connection line electrical path length at Zhong Gaiduan two ends, initial path is greater than the path of the line of another side in respective path polygon, replace the connecting line in corresponding 2 of initial path with shorter line, search obtains new left and new right wing footpath successively;
7) with new left footpath and new right wing footpath for starting at, if there is overlap in new left footpath and new right wing footpath, the public part in path, new left and right, then lap must be shortest path part, if new left footpath and new right wing footpath underlapped, with the joining in new left footpath and new right wing footpath for cut-point, new left footpath and new right wing footpath in adjacent path, new left and right polygon are passed through and there is the polygonal meshes of common edge, repeat above step 6,7, obtain final left footpath and final right wing footpath;
8) merge the middle polygon in final left footpath and final right wing footpath, obtain merging polygon, try to achieve the path between two path, adjacent left and right intersection points, get short person for result;
9) again the public part in path, new left and right is merged with the result of trying to achieve, obtain final shortest path.
2. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 1) comprise the following steps:
11) first by road according to different grades, give different weights respectively;
12) physical length of every section of road is obtained;
13) length and weights are divided by, obtain the path on Mei Duan road.
3. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 2) comprise the following steps:
21) check that road connects Topology Error by GIS platform, guarantee the annexation that every bar road is correct;
22) space topology analyzing is carried out by GIS platform, by the road topology structure face in region;
23) checking topological structure face mistake by GIS platform, as there is dead end highway etc., not participating in structure face;
24) polygon after the success of structure face should be connected successively, concurrent or common limit;
25) if occur not be successively connected polygon, check mistake, if there is mistake, repeat step 22), 23), 24);
26) if there is not mistake, then do not connect path between polygon and isolate the part that limit must be shortest path, record this isolated line segment.
4. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 3) comprise the following steps:
31) connect starting point and terminal, obtain the connecting line of point-to-point transmission, be the theoretical bee-line of point-to-point transmission;
32) be as the criterion with connecting line, had living space crossing multiple initial path polygons by GIS platform space querying and connecting line.
5. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 4) comprise the following steps:
41) obtain multiple initial polygon by GIS platform inspection inquiry, if be connected successively, then polygon GIS platform merged, obtain outsourcing polygon, enter step 5);
42) if there is the situation that is not connected, then by GIS platform, the polygonal segment be connected is merged, proceed to step 43);
43) the outsourcing polygon after record merging, if there is isolated line, this wiring path must be a part for shortest path.
6. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 5) comprise the following steps:
51) take connecting line as boundary, direction is that terminal arrives starting point;
52) if path polygon does not connect, be public part with isolated line, then sideline, left and right and isolated line are connected respectively and are left side bearing and right side bearing;
53) if path polygon connects, the polygonal initial left footpath of this outsourcing and initial right wing footpath is obtained, as initial path.
7. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 6) comprise the following steps:
61) be as the criterion with this initial path, from starting point, check multiple initial path polygon successively, if the connection line electrical path length at Zhong Gaiduan two ends, initial path is greater than the path of the line of another side in the polygon of path, replace the connecting line in corresponding 2 of initial path with shorter line;
62) search for each path polygon successively, obtain new left footpath and new right wing footpath.
8. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 7) comprise the following steps:
71) if there is overlap in new left footpath and new right wing footpath, then lap must be shortest path part;
72) if new left footpath and new right wing footpath underlapped, with new left footpath and new right wing footpath joining for cut-point, adjacent new left footpath and new right wing footpath are passed through and there is path, the left and right polygonal meshes of common edge:
73) repeat above step 6,7, obtain final left footpath and final right wing footpath.
9. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 8) comprise the following steps:
81) merge polygon in the middle of path that final left footpath and final right wing footpath comprise, obtain merging polygon;
82) be as the criterion to merge polygon, try to achieve the shortest left footpath between two adjacent cut-points and the shortest right wing footpath, get short person for result.
10. the method for searching shortest route based on path and power according to claim 1, is characterized in that above-mentioned steps 9) comprise the following steps:
91) if not be dead end highway, again the public part in path, new left and right is merged with the result of trying to achieve, obtain final shortest path 19;
92) if dead end highway, search for the shortest path connection dead end highway obtained and be final shortest path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510790636.5A CN105512169B (en) | 2016-03-10 | 2016-03-10 | Method for searching shortest route based on path and power |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510790636.5A CN105512169B (en) | 2016-03-10 | 2016-03-10 | Method for searching shortest route based on path and power |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105512169A true CN105512169A (en) | 2016-04-20 |
| CN105512169B CN105512169B (en) | 2018-05-15 |
Family
ID=55720151
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510790636.5A Active CN105512169B (en) | 2016-03-10 | 2016-03-10 | Method for searching shortest route based on path and power |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105512169B (en) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107341633A (en) * | 2017-06-26 | 2017-11-10 | 海航创新科技研究有限公司 | Regulate and control the method and apparatus of logistics route |
| CN107423360A (en) * | 2017-06-19 | 2017-12-01 | 广东中冶地理信息股份有限公司 | A kind of labyrinth method for solving based on path center line |
| CN107480804A (en) * | 2017-06-19 | 2017-12-15 | 广西银翔科技有限公司 | A kind of labyrinth method for solving based on line space of planes relation |
| CN108120444A (en) * | 2016-11-29 | 2018-06-05 | 高德信息技术有限公司 | A kind of electronic map data processing method and device |
| CN108170807A (en) * | 2017-12-28 | 2018-06-15 | 百度在线网络技术（北京）有限公司 | Processing, method for drawing map, device, equipment and the storage medium of map datum |
| CN108628952A (en) * | 2018-04-03 | 2018-10-09 | 佛山市测绘地理信息研究院 | Access analysis method and system inside complicated road based on center line of road |
| CN109783591A (en) * | 2018-12-29 | 2019-05-21 | 北京辰安科技股份有限公司 | Space data acquisition method and device based on Internet map |
| CN109858703A (en) * | 2019-02-15 | 2019-06-07 | 中国环境监测总站 | A kind of method and system for the shortest path obtaining sampling |
| CN110263840A (en) * | 2019-06-13 | 2019-09-20 | 东软集团股份有限公司 | A kind of circuit analysis method, apparatus and program product, storage medium |
| CN110887502A (en) * | 2019-11-18 | 2020-03-17 | 广西华蓝岩土工程有限公司 | Must-pass node shortest path searching method |
| CN111461408A (en) * | 2020-03-10 | 2020-07-28 | 广东中达规谷地信科技有限公司 | Shortest path searching method, device and storage medium |
| CN111612257A (en) * | 2020-05-26 | 2020-09-01 | 广西翔路建设有限责任公司 | Shortest path solving method based on space regression |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090040931A1 (en) * | 2007-08-10 | 2009-02-12 | Max-Planck-Gesellschaft Zur Forderung Der Wissenschaften E.V. | Method and device for determining the length of a shortest path in a network |
| CN103837154A (en) * | 2014-03-14 | 2014-06-04 | 北京工商大学 | Path planning method and system |
| CN104457775A (en) * | 2014-12-12 | 2015-03-25 | 北京航天宏图信息技术有限责任公司 | Path determination method and device, and navigation instrument |
-
2016
- 2016-03-10 CN CN201510790636.5A patent/CN105512169B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090040931A1 (en) * | 2007-08-10 | 2009-02-12 | Max-Planck-Gesellschaft Zur Forderung Der Wissenschaften E.V. | Method and device for determining the length of a shortest path in a network |
| CN103837154A (en) * | 2014-03-14 | 2014-06-04 | 北京工商大学 | Path planning method and system |
| CN104457775A (en) * | 2014-12-12 | 2015-03-25 | 北京航天宏图信息技术有限责任公司 | Path determination method and device, and navigation instrument |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108120444A (en) * | 2016-11-29 | 2018-06-05 | 高德信息技术有限公司 | A kind of electronic map data processing method and device |
| CN107423360A (en) * | 2017-06-19 | 2017-12-01 | 广东中冶地理信息股份有限公司 | A kind of labyrinth method for solving based on path center line |
| CN107480804A (en) * | 2017-06-19 | 2017-12-15 | 广西银翔科技有限公司 | A kind of labyrinth method for solving based on line space of planes relation |
| CN107480804B (en) * | 2017-06-19 | 2020-04-14 | 广西回归线信息科技有限公司 | Maze solving method based on line-surface spatial relation |
| CN107341633A (en) * | 2017-06-26 | 2017-11-10 | 海航创新科技研究有限公司 | Regulate and control the method and apparatus of logistics route |
| CN108170807B (en) * | 2017-12-28 | 2020-12-22 | 百度在线网络技术（北京）有限公司 | Map data processing method, map drawing method, map data processing device, map drawing device, map data processing equipment and storage medium |
| CN108170807A (en) * | 2017-12-28 | 2018-06-15 | 百度在线网络技术（北京）有限公司 | Processing, method for drawing map, device, equipment and the storage medium of map datum |
| CN108628952A (en) * | 2018-04-03 | 2018-10-09 | 佛山市测绘地理信息研究院 | Access analysis method and system inside complicated road based on center line of road |
| CN109783591A (en) * | 2018-12-29 | 2019-05-21 | 北京辰安科技股份有限公司 | Space data acquisition method and device based on Internet map |
| CN109783591B (en) * | 2018-12-29 | 2021-09-03 | 北京辰安科技股份有限公司 | Spatial data acquisition method and device based on Internet map |
| CN109858703A (en) * | 2019-02-15 | 2019-06-07 | 中国环境监测总站 | A kind of method and system for the shortest path obtaining sampling |
| CN109858703B (en) * | 2019-02-15 | 2021-04-27 | 中国环境监测总站 | Method and system for acquiring shortest path of sampling |
| CN110263840A (en) * | 2019-06-13 | 2019-09-20 | 东软集团股份有限公司 | A kind of circuit analysis method, apparatus and program product, storage medium |
| CN110887502A (en) * | 2019-11-18 | 2020-03-17 | 广西华蓝岩土工程有限公司 | Must-pass node shortest path searching method |
| CN111461408A (en) * | 2020-03-10 | 2020-07-28 | 广东中达规谷地信科技有限公司 | Shortest path searching method, device and storage medium |
| CN111461408B (en) * | 2020-03-10 | 2022-06-07 | 广东中达规谷地信科技有限公司 | Shortest path searching method, device and storage medium |
| CN111612257A (en) * | 2020-05-26 | 2020-09-01 | 广西翔路建设有限责任公司 | Shortest path solving method based on space regression |
| CN111612257B (en) * | 2020-05-26 | 2023-05-02 | 广西北投公路建设投资集团有限公司 | Shortest path solving method based on space normalization |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105512169B (en) | 2018-05-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105512169A (en) | Shortest route searching method based on route and weight | |
| KR101932623B1 (en) | Modeling method and device for three-dimensional road model, and storage medium | |
| US6594581B2 (en) | Route guidance apparatus and method | |
| US9322660B2 (en) | Incremental map generation, refinement and extension with GPS traces | |
| US6622089B2 (en) | Route guidance apparatus and method | |
| Althoff et al. | Automatic conversion of road networks from opendrive to lanelets | |
| CN107228677A (en) | Driftage recognition methods and device | |
| Kolovou et al. | Road centre line simplification principles for angular segment analysis | |
| CN105043403A (en) | High precision map path planning system and method | |
| WO2023274229A1 (en) | Vehicle trajectory deviation correction method and apparatus, and electronic device | |
| CN111024079B (en) | Method and system for matching with route according to multiple position points | |
| Andreev et al. | Towards realistic pedestrian route planning | |
| Perrine et al. | Map-matching algorithm for applications in multimodal transportation network modeling | |
| Vuurstaek et al. | GTFS bus stop mapping to the OSM network | |
| JP2003207358A (en) | Road guidance unit and program | |
| CN112800161A (en) | Road network matching method and device, storage medium and electronic equipment | |
| JP6572672B2 (en) | Route graph generation method, apparatus, and program | |
| Guo et al. | A scalable method to construct compact road networks from GPS trajectories | |
| CN112269845B (en) | Method for quickly matching electronic road map and bus route facing to different source data | |
| WO2020230277A1 (en) | Route search device, route search method, and route search program | |
| Stankutė et al. | An integrative approach to geospatial data fusion | |
| JP2001084357A (en) | Method for extracting road width data | |
| Drozdzynski et al. | On constructing a base map for collaborative map generation and its application in urban mobility planning | |
| CN112101679B (en) | Navigation road selection method and device based on artificial intelligence | |
| Röman et al. | Algorithmic Approach to Error Correction in Map Data-sets using Conflation Techniques |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |