CN110968659A - Redundancy removing method for high-rise navigation road network based on continuous road chain - Google Patents
Redundancy removing method for high-rise navigation road network based on continuous road chain Download PDFInfo
- Publication number
- CN110968659A CN110968659A CN201911233142.1A CN201911233142A CN110968659A CN 110968659 A CN110968659 A CN 110968659A CN 201911233142 A CN201911233142 A CN 201911233142A CN 110968659 A CN110968659 A CN 110968659A
- Authority
- CN
- China
- Prior art keywords
- road
- road network
- continuous
- navigation
- navigation road
- 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
Images
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
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
The redundancy removing method of the high-rise navigation road network based on the continuous road chains generates all the continuous road chains in the high-rise navigation road network through interpretation and combination, and eliminates the continuous road chains in steps one by one from the high-rise navigation road network to be subjected to redundancy removal so as to obtain the simplest high-rise navigation road network. The redundancy removing method for the high-rise navigation road network based on the continuous road chain can remove the redundant data of the high-rise road network to the maximum extent, can achieve complete accuracy, and solves the problem that the path planning efficiency is influenced by the redundant data of the high-rise road network.
Description
Technical Field
The invention relates to the technical field of road networks for navigating electronic maps, in particular to a redundancy removing method for a high-rise navigation road network based on a continuous road chain.
Background
With the development of electronic map making, electronic navigation road networks are rapidly developed and utilized, and particularly, the popularization of internet navigation maps and the large-scale application of vehicle-mounted navigation maps are realized. The construction of the multi-level navigation road network improves the calculation speed and efficiency of the most available path, and particularly, the high-level navigation road network greatly shortens the long-distance calculation time of more than 1000 kilometers. However, the high-rise navigation road network mostly extracts high-level roads by attributes, topological features or other methods, which results in redundancy of road data and reduces the efficiency of road calculation.
Therefore, a method for removing redundant road data is urgently needed, so that an optimal and simplest high-rise navigation road network can be found, and the method is very meaningful work.
Disclosure of Invention
In order to solve the problems and the defects in the prior art, the invention provides the redundancy removing method of the high-rise navigation road network based on the continuous road chain, which can quickly, completely and accurately obtain the simplest high-rise navigation road network, improves the accuracy and has very high efficiency.
According to one aspect of the invention, a redundancy removing method for a high-rise navigation road network based on continuous road links is provided, which comprises the following steps:
step S1, preparing a middle-layer navigation road network and a high-layer navigation road network to be redundantly removed in a target area;
step S2, setting a road calculation starting point set and an end point set of the target area;
step S3, calculating the optimal paths from all the starting points to all the end points in the step S2 based on the middle navigation road network to obtain the comparison benchmark of the optimal paths;
step S4, interpreting and combining to generate all continuous road chains in the high-rise navigation road network;
step S5, removing the continuous road chains in the step S4 one by one from the high-level navigation road network to be subjected to redundancy removal in the step S1 to obtain the high-level navigation road network to be verified;
and step S6, forming a new double-layer navigation road network based on the high-layer navigation road network obtained in the step S5 and the middle-layer navigation road network obtained in the step S1, calculating and obtaining optimal paths from all starting points to all end points by using the new double-layer navigation road network, comparing the optimal paths with the comparison reference of the optimal paths obtained in the step S3, removing and changing the continuous road chains in the step S4 until all the continuous road chains are verified, and obtaining the simplest high-layer navigation road network.
On the basis of the above scheme, preferably, the detailed step of step S1 is:
and in the target area, acquiring and selecting a middle-layer navigation road network capable of completely covering all high-layer navigation road networks through the road basic attribute and the co-traveling attribute.
On the basis of the above scheme, preferably, the starting point set in step S2 includes all the nodes of the entering roads on the boundary of the target area, the representative points of all the towns inside the target area, and the representative points of all the towns of the adjacent area outside the target area.
Preferably, based on the above solution, the end point set in step S2 includes all nodes leaving the road on the boundary of the target area, the representative points of all towns inside the target area, and the representative points of all towns of the adjacent area outside the target area.
In addition to the above, preferably, the step S3 adopts a method of calculating a multiple optimal path based on a multi-layer road network by using a bidirectional target.
On the basis of the above scheme, the criteria of step S4 are preferably:
when the degree of any node of the continuous road chain is 2, merging the node with the connected next road continuous road chain;
when the degree of any node of the current road continuous road link is greater than 2 or equal to 1, the continuous road link stops searching.
According to the redundancy removing method for the high-rise navigation road network based on the continuous road chains, each continuous road chain of the high-rise road network is compared and verified, so that the redundant data of the high-rise road network is removed to the maximum extent, the method is completely accurate, and the problem that the path planning efficiency is influenced by the data redundancy of the high-rise road network is solved.
Drawings
Fig. 1 is a flow chart of a redundancy elimination method for a high-rise navigation network based on a continuous road link according to the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made in detail with reference to the accompanying drawings. The following examples are intended to illustrate the invention but are not intended to limit the scope of the invention.
Referring to fig. 1, a redundancy elimination method for a high-rise navigation road network based on continuous road links according to the present invention includes the following steps:
step S1, preparing a middle-layer navigation road network and a high-layer navigation road network to be redundantly removed in a target area;
step S2, setting a road calculation starting point set and an end point set of the target area;
step S3, calculating the optimal paths from all the starting points to all the end points in the step S2 based on the middle navigation road network to obtain the comparison benchmark of the optimal paths;
step S4, interpreting and combining to generate all continuous road chains in the high-rise navigation road network;
step S5, removing the continuous road chains in the step S4 one by one from the high-level navigation road network to be redundantly removed in the step S1 to obtain an upgraded high-level navigation road network;
and step S6, forming a new double-layer navigation road network based on the high-layer navigation road network obtained in the step S5 and the middle-layer navigation road network obtained in the step S1, calculating and obtaining optimal paths from all starting points to all end points by using the new double-layer navigation road network, comparing the optimal paths with the comparison reference of the optimal paths obtained in the step S3, and removing and changing the continuous road chains in the step S4 until all the continuous road chains are verified, so as to obtain the simplest high-layer navigation road network.
The middle navigation road network in step S1 is obtained and selected from the middle navigation road network that can completely cover all the high-rise navigation road networks in the target area according to the road basic attribute and the co-traveling attribute.
And the set of starting points in step S2 includes the nodes of all the incoming roads on the boundary of the target area, the representative points of all the towns inside the target area, and the representative points of all the towns of the adjacent area outside the target area. The end point set in step S2 includes all nodes off the road on the boundary of the target area, the representative points of all towns inside the target area, and the representative points of all towns of the adjacent area outside the target area. When the road organization on the boundary is separated in two directions, the starting point and the end point appear in groups; when the road organization on the boundary is bidirectional collinear, the starting point and the end point are one point; the starting point and the ending point of the representative points of all towns inside and outside the target area are the same.
Step S3 is based on the middle navigation road network in step S1, and a method for calculating a multiple-layer road network based on bidirectional targets is used to obtain a comparison reference for obtaining optimal paths from all the starting points to all the end points.
Further, the step S4 of the present invention has the following criteria:
when the degree of any node of the continuous road chain is 2, merging the node with the connected next road continuous road chain; when the degree of any node of the current road continuous road link is greater than 2 or equal to 1, the continuous road link stops searching.
That is, the degree of the nodes of the continuous link cannot be equal to 2, and must be 1 or greater than 2. The data structure of the method is designed as a table I, the sub-link of the continuous link chain is designed as a table II, and the matching identification in the two tables is redundant, so that the calculation efficiency can be improved.
A first table: continuous Road Chain Chain
| Field identification | Type of field | Key with a key body | Content of field |
| CRC_id | bigint | PK | Optimal path versus reference id |
| Start_node_id | bigint | FK | Starting point id |
| Start_node_degree | tinyint | Degree of origin | |
| End_node_id | bigint | FK | End point id |
| End_node_degree | bigint | FK | Degree of end point |
| Match_tag | BOOL | Identification of whether there is a match |
Table two: continuous reading Road chain sub-Road Continuous Road Link
| Field identification | Type of field | Key with a key body | Content of field |
| CRL_id | bigint | PK | |
| CRC_id | bigint | FK | Optimal path versus reference id |
| Link_id | bigint | FK | Road id |
| Link_no | tinyint | Serial number of road in chain | |
| Match_tag | BOOL | Identification of whether there is a match |
And the specific steps of step S5 and step S6 are to remove continuous road chains from the high-rise navigation road network one by one to generate a new high-rise navigation road network, then calculate the optimal paths from all the starting points to all the end points based on the new middle-high-rise double-layer road network, and compare the optimal paths with the optimal path comparison reference of the third step. If the paths are found to be consistent, the continuous road chain can be removed from the high-level navigation road network, and if the paths are not consistent, the continuous road chain cannot be removed. And obtaining the simplest high-level navigation road network until all the continuous road chains are compared, verified and eliminated.
The redundancy removing method for the high-rise navigation road network based on the continuous road chain can remove the redundant data of the high-rise road network to the maximum extent, can achieve complete accuracy, and solves the problem that the path planning efficiency is influenced by the redundant data of the high-rise road network.
The high-level navigation road network in the invention is connected with the most important city in a continent or a country; the middle-layer navigation road network consists of relatively important roads in a certain area; the low-level navigation road network consists of local ordinary roads or branches.
Finally, the method of the present application is only a preferred embodiment and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (6)
1. A redundancy removing method for a high-rise navigation road network based on continuous road chains is characterized by comprising the following steps:
step S1, preparing a middle-layer navigation road network and a high-layer navigation road network to be redundantly removed in a target area;
step S2, setting a road calculation starting point set and an end point set of the target area;
step S3, calculating the optimal paths from all the starting points in the starting point set to all the end points in the end point set in the step S2 based on the middle navigation road network so as to obtain the comparison reference of the optimal paths;
step S4, interpreting and combining to generate all continuous road chains in the high-rise navigation road network;
step S5, removing the continuous road chains in the step S4 one by one from the high-level navigation road network to be subjected to redundancy removal in the step S1 to obtain the high-level navigation road network to be verified;
and step S6, forming a new double-layer navigation road network based on the high-layer navigation road network obtained in the step S5 and the middle-layer navigation road network obtained in the step S1, calculating and obtaining optimal paths from all starting points to all end points by using the new double-layer navigation road network, comparing the optimal paths with the comparison reference of the optimal paths obtained in the step S3, removing and changing the continuous road chains in the step S4 if consistent results are obtained, and obtaining the simplest high-layer navigation road network until all the continuous road chains are verified.
2. The redundancy elimination method for the high-level navigation road network based on the continuous road link as claimed in claim 1, wherein said step S1 is detailed by the steps of:
and in the target area, acquiring and selecting a middle-layer navigation road network capable of completely covering all high-layer navigation road networks through the road basic attribute and the co-traveling attribute.
3. The redundancy elimination method for the high-level navigation road network based on the continuous road chain as claimed in claim 1, wherein the set of starting points in step S2 includes all the nodes of the entering roads on the boundary of the target area, all the representative points of the towns inside the target area and all the representative points of the towns of the neighboring areas outside the target area.
4. The redundancy elimination method for the high-level navigated road network based on continuous road links as claimed in claim 1, wherein said set of end points in step S2 comprises all nodes leaving the road on the boundary of the target area, all the representative points of towns inside the target area and all the representative points of towns in the neighboring area outside the target area.
5. The redundancy elimination method for the high-rise navigation road network based on the continuous road chain as claimed in claim 1, wherein said step S3 employs a bidirectional target a x optimal path calculation method based on the multi-layer road network.
6. The redundancy elimination method for high-level navigation road network based on continuous road chain as claimed in claim 5, wherein the criteria of step S4 are:
when the degree of any node of the continuous road chain is 2, merging the node with the connected next road continuous road chain;
when the degree of any node of the current road continuous road link is greater than 2 or equal to 1, the continuous road link stops searching.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911233142.1A CN110968659B (en) | 2019-12-05 | 2019-12-05 | High-level navigation road network redundancy removing method based on continuous road chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911233142.1A CN110968659B (en) | 2019-12-05 | 2019-12-05 | High-level navigation road network redundancy removing method based on continuous road chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110968659A true CN110968659A (en) | 2020-04-07 |
| CN110968659B CN110968659B (en) | 2023-07-25 |
Family
ID=70033126
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911233142.1A Active CN110968659B (en) | 2019-12-05 | 2019-12-05 | High-level navigation road network redundancy removing method based on continuous road chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110968659B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0987823A2 (en) * | 1998-09-17 | 2000-03-22 | Navigation Technologies Corporation | Method and system for compressing geographic data |
| CN101982735A (en) * | 2010-09-25 | 2011-03-02 | 上海美慧软件有限公司 | Method for calculating real-time dynamic travel time of key path |
| CN103389101A (en) * | 2013-07-19 | 2013-11-13 | 武汉睿数信息技术有限公司 | Layered structure-based road connectivity inspection method |
| CN104075721A (en) * | 2013-03-28 | 2014-10-01 | 北京百度网讯科技有限公司 | Navigation method and navigation server |
| CN106778605A (en) * | 2016-12-14 | 2017-05-31 | 武汉大学 | Remote sensing image road net extraction method under navigation data auxiliary |
| CN107084735A (en) * | 2017-04-26 | 2017-08-22 | 电子科技大学 | Guidance path framework suitable for reducing redundancy navigation |
| CN107330030A (en) * | 2017-06-23 | 2017-11-07 | 南京师范大学 | A kind of hierarchical network construction method that storage is compressed towards magnanimity road net data |
| CN107782323A (en) * | 2017-10-12 | 2018-03-09 | 湖北工业大学 | A kind of generation method of the high-grade navigation road network based on intercity optimal path |
| CN110516702A (en) * | 2019-07-18 | 2019-11-29 | 电子科技大学 | A kind of discreet paths planing method based on flow data |
| CN110531770A (en) * | 2019-08-30 | 2019-12-03 | 的卢技术有限公司 | One kind being based on improved RRT paths planning method and system |
-
2019
- 2019-12-05 CN CN201911233142.1A patent/CN110968659B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0987823A2 (en) * | 1998-09-17 | 2000-03-22 | Navigation Technologies Corporation | Method and system for compressing geographic data |
| US20010043745A1 (en) * | 1998-09-17 | 2001-11-22 | Matthew Friederich | Method and system for compressing data and a geographic database formed therewith and methods for use thereof in a navigation application program |
| CN101982735A (en) * | 2010-09-25 | 2011-03-02 | 上海美慧软件有限公司 | Method for calculating real-time dynamic travel time of key path |
| CN104075721A (en) * | 2013-03-28 | 2014-10-01 | 北京百度网讯科技有限公司 | Navigation method and navigation server |
| CN103389101A (en) * | 2013-07-19 | 2013-11-13 | 武汉睿数信息技术有限公司 | Layered structure-based road connectivity inspection method |
| CN106778605A (en) * | 2016-12-14 | 2017-05-31 | 武汉大学 | Remote sensing image road net extraction method under navigation data auxiliary |
| CN107084735A (en) * | 2017-04-26 | 2017-08-22 | 电子科技大学 | Guidance path framework suitable for reducing redundancy navigation |
| CN107330030A (en) * | 2017-06-23 | 2017-11-07 | 南京师范大学 | A kind of hierarchical network construction method that storage is compressed towards magnanimity road net data |
| CN107782323A (en) * | 2017-10-12 | 2018-03-09 | 湖北工业大学 | A kind of generation method of the high-grade navigation road network based on intercity optimal path |
| CN110516702A (en) * | 2019-07-18 | 2019-11-29 | 电子科技大学 | A kind of discreet paths planing method based on flow data |
| CN110531770A (en) * | 2019-08-30 | 2019-12-03 | 的卢技术有限公司 | One kind being based on improved RRT paths planning method and system |
Non-Patent Citations (3)
| Title |
|---|
| ESTHER GALBRUN等: "urban navigation beyond shortest route：the case of safe paths", INFORMATION SYSTEMS * |
| 郑年波等: "导航路网数据改进模型及其组织方法", 中国公路学报 * |
| 马建;孙守增;芮海田;王磊;马勇;张伟伟;张维;刘辉;陈红燕;刘佼;董强柱;: "中国筑路机械学术研究综述・2018", 中国公路学报 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110968659B (en) | 2023-07-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107798079B (en) | Road segment splicing method and system based on vehicle track data | |
| CN106840175B (en) | Method and device for matching vehicle running track with road network | |
| CN101650191B (en) | Road network topology aggregation method and device | |
| CN1590964A (en) | Iterative logical renewal of navigable map database | |
| CN103389101B (en) | A kind of path connected inspection method based on hierarchical structure | |
| CN104422451A (en) | Road recognition method and road recognition apparatus | |
| CN110990585A (en) | Multi-source data and time sequence processing method and device for constructing industry knowledge graph | |
| CN104679949A (en) | Method for creating Paramics road network based on XML (Extensive Markup Language) road network data | |
| CN105184393A (en) | Auxiliary path restoration method under complex path | |
| CN106021556A (en) | Address information processing method and device | |
| CN113177042B (en) | Map track line processing method and device | |
| CN108280463A (en) | Optimization method and device for double-layer path of vehicle-mounted unmanned aerial vehicle | |
| CN103838907A (en) | Curved surface cutting trajectory obtaining method based on STL model | |
| CN115481531B (en) | SUMO-based road network traffic flow real-time twin method and system | |
| CN109711425A (en) | Urban road skeleton hierarchical division method and system | |
| CN113408654B (en) | Urban road network fusion method, system and storage medium based on hierarchical merging | |
| CN113096389B (en) | Multi-source data-based national highway network topology construction method | |
| CN110968659A (en) | Redundancy removing method for high-rise navigation road network based on continuous road chain | |
| CN115309846B (en) | Road network structure identification method based on parallel coefficients | |
| CN110807061A (en) | Method for searching frequent subgraphs of uncertain graphs based on layering | |
| CN114637305B (en) | Unmanned aerial vehicle shortest path planning method and device | |
| CN113124878B (en) | Moon surface large-scale road topology network construction method, system and device | |
| CN110986983A (en) | High-grade navigation network generation method based on optimal path comparison verification | |
| CN111914039B (en) | Road network updating method and device | |
| CN107423520A (en) | Based on CAD secondary development rapid extraction pipeline information SWMM modeling methods |
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 |