CN107782323B - High-grade navigation network generation method based on inter-city optimal path - Google Patents
High-grade navigation network generation method based on inter-city optimal path Download PDFInfo
- Publication number
- CN107782323B CN107782323B CN201710948528.5A CN201710948528A CN107782323B CN 107782323 B CN107782323 B CN 107782323B CN 201710948528 A CN201710948528 A CN 201710948528A CN 107782323 B CN107782323 B CN 107782323B
- Authority
- CN
- China
- Prior art keywords
- road network
- city
- important
- cities
- navigation
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/28—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network with correlation of data from several navigational instruments
- G01C21/30—Map- or contour-matching
- G01C21/32—Structuring or formatting of map data
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
The invention discloses a method for generating a high-grade navigation network based on an optimal path among cities, which comprises the steps of firstly, selecting cities which are in important connection with a target area; then selecting representative points of all cities according to limiting conditions so as to accurately acquire a necessary optimal path; then, according to a certain selection and rejection principle, preparing and generating a middle-layer navigation road network so as to improve the calculation efficiency of the method; calculating optimal paths between all important cities, which are mutually a starting point and a terminal point in pairs, based on the middle-layer navigation road network by an A-star algorithm (single-layer bidirectional mode); and finally, fusing all the optimal paths, and intercepting the roads in the target area to generate a high-level navigation road network. The invention utilizes the internal relation between the important city and the high-rise road network, combines the optimal paths among all the cities, and can quickly and accurately extract the high-rise navigation road network based on the middle-level navigation road network, thereby not only improving the accuracy, but also having very high efficiency.
Description
Technical Field
The invention belongs to the technical field of road networks for navigating electronic maps, and relates to a method for acquiring a high-rise navigation network by acquiring and merging optimal paths among all important cities based on a middle-level navigation network by utilizing internal connection between the important cities and the high-rise navigation network.
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. Then, because of the difference between the road network of the navigation electronic map and the traditional electronic map in the road connectivity, the original methods of adopting the raster data image recognition, adopting the road network synthesis method of the spatial topological relation network, adopting the same road element matching combination and the like can not meet the requirements of the navigation function. Further, although the road attributes of the existing electronic map database, particularly the attributes such as the function level and the road network level, may be used for extraction, problems such as the lack of guarantee of the connectivity of the road network and the unevenness of the road density may occur. Therefore, a new method is urgently needed to extract the middle and high-level road network of the navigation map, namely the field of road network synthesis of the navigation electronic map.
Disclosure of Invention
In order to solve the problems and the defects in the prior art, the invention provides the method for generating the high-level navigation network based on the optimal path among the important cities, which can quickly and accurately extract the high-level navigation network, thereby improving the accuracy and having very high efficiency.
The technical scheme adopted by the invention is as follows: a generation method of a high-grade navigation network based on an inter-city optimal path comprises the following steps:
step 1: selecting important cities connected with the target area, wherein the important cities comprise important cities outside the target area;
step 2: selecting representative points of all important cities to accurately acquire a necessary optimal path;
and step 3: preparing and generating a middle-layer navigation road network according to a certain selection and rejection principle;
and 4, step 4: calculating optimal paths between all important cities, which are mutually pairwise taken as a starting point and a terminal point, by a single-layer bidirectional algorithm based on the middle-layer navigation road network in the step 3;
and 5: and fusing all the optimal paths, and intercepting the roads in the target area to generate a high-level navigation road network.
The invention has the advantages that: the method utilizes the internal relation between the important city and the high-rise road network, combines the optimal paths among all the cities, and quickly and accurately extracts the high-rise navigation road network based on the middle-level navigation road network, thereby solving two defects of small-scale maps in the road network: the first is the problem that the connectivity between the selected high-level networks is broken; secondly, the problem of unbalanced distribution among the selected roads is solved, and the method greatly improves the efficiency of calculating the optimal path.
Drawings
FIG. 1 is a schematic flow diagram of an embodiment of the present invention;
FIG. 2 is a schematic diagram of the extraction effect of the embodiment of the present invention;
FIG. 3 is a diagram illustrating representative point selection results according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of a road network extraction result outside the target area according to the embodiment of the present invention;
fig. 5 is a schematic diagram of a road network extraction result in a target area according to an embodiment of the present invention.
Detailed Description
In order to facilitate the understanding and implementation of the present invention for those of ordinary skill in the art, the present invention is further described in detail with reference to the accompanying drawings and examples, it is to be understood that the embodiments described herein are merely illustrative and explanatory of the present invention and are not restrictive thereof.
Referring to fig. 1, the method for generating a high-grade navigation network based on an inter-city optimal path provided by the invention comprises the following steps:
step 1: selecting important cities connected with the target area, wherein the important cities comprise important cities outside the target area;
the selection of important cities is based on the following:
in a first aspect: the passenger capacity and the freight capacity reflect the degree of mobility of the city, and the city with high mobility can be regarded as an important city. In addition, the total number of urban people and the total amount of economy can be taken as one of the reference standards, and in the case that the total number of urban people or the total amount of economy is small, the city with higher traffic flow can be taken into consideration.
In a second aspect: administrative level of the city; if social and economic resources are concentrated in a city such that the city is at the same level as a province or a state, then the cities should be treated as important cities. In china, this is an important factor because the administrative level of the direct municipality lies between provinces and countries, such as Chongqing city, Tianjin city, etc.
In a third aspect: cities with special circumstances. For example, cities which are in the border of the country but where economy and trade are rapidly developed, goods collecting and distributing towns and important port cities in remote mountain areas, and the like.
In principle, all important cities near the target area, including both outside and inside cities, need to be extracted and selected. As shown in fig. 2: (a) a road network representing important cities in the target area; (b) a road network representing an important city outside the selected target area; (c) showing merging of road networks between the important cities selected in the step (a) and the step (b); (d) i.e. a high-rise network within the target area.
However, experiments show that if the economic trade relationship between the target area and the surrounding area is close, all the internal cities can be connected in series through a high-level road network formed by combining the optimal path networks among the external important cities, and the results of calculation participation of all the cities are consistent. Moreover, when the internal city participates in the calculation, if the selection of the city representative point is not appropriate, the interference of redundant middle-level road data will be caused, so that in the extraction of important cities, only the external city is generally selected, and the internal city is taken as a candidate.
However, in special cases, the interior cities must be screened out according to actual conditions. The method mainly comprises the following steps: 1) target areas are not close to the surrounding economic trade, for example, the openness of Chinese frontier province is not sufficient, and a road network connected with the outside is underdeveloped; 2) seashore or islands, without external connection regions. Such as the uk, japan, etc.
Step 2: selecting representative points of all important cities to accurately acquire a necessary optimal path;
the representative point is generally the most important bus stop in the city or the entrance and exit of the expressway in the city. The representative point serves as a start point or an end point of the optimal path. The representative point of the city outside the target area can be arbitrarily selected; and the cities within the target area are generally based on the representative point closest to the boundary.
The situation that may be encountered when selecting a representative point is shown in fig. 3: fig. 3 (a) is the expected result, which includes the arterial segment around the city. (b) Is an undesirable result because, although the line connection of the representative point (city center) to other important cities is guaranteed in (b), important arterial segments around the city are lost and some unnecessary other segments are included.
The representative point may be represented by a coordinate point (x _ coordinate, y _ coordinate), without z.
And step 3: preparing and generating a middle-layer navigation road network according to a certain selection and rejection principle;
the level of the navigation road network is divided into three levels according to the importance of the routes and nodes contained in the navigation road network: a high-rise navigation road network, a middle-level navigation road network and a low-level navigation road network; the high-level navigation road network 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.
Certain selection and elimination principles comprise:
principle 1: the roads with the function levels belonging to the high level and the middle level are all reserved;
principle 2: roads with functional levels belonging to low levels need to fully interpret the road network of the target area, wherein roads with higher levels are reserved;
principle 3: reserving a connection road between roads reserved in principle 1 and principle 2;
principle 4: judging the grade communication range of each level of network in the electronic map navigation road network, and reserving roads in the whole communication network in the target area;
principle 5: and specific low-level auxiliary road deletion comprises a walking road, a cell road, a service area road and a parallel auxiliary road.
Specifically, the middle navigation road network information is stored using the following two data tables.
A first table: node table Node of middle-level navigation road network
| Name of field | Type of field | Key with a key body | Content of field |
| Node_ID | int | PK | ID, primary key of node |
| Pass_time | float | Time of passing through node | |
| Coordinate_X | float | Precision (X coordinate) | |
| Coordinate_Y | float | Latitude (Y coordinate) |
Table two: node route table Link of middle-layer navigation road network
And 4, step 4: calculating optimal paths between all important cities, which are mutually pairwise taken as a starting point and a terminal point, by a single-layer bidirectional algorithm based on the middle-layer navigation road network in the step 3;
in the embodiment, a bidirectional target A-optimal path calculation method based on a single-layer road network is adopted, so that the accuracy and efficiency of an optimal path are ensured. The single-layer road network and the middle-layer navigation road network prepared in the step 3 are very critical. Two-way targets, i.e. between each two cities, the start and end points serve as the two targets of the a-x algorithm. All important cities need to be calculated two by two, and even if the two cities are in the same direction of the target area, the connected roads can pass through the target area due to the influence of geographical environment or political economy.
The data structure of the basic road unit stored in the optimal path is consistent with the table two in step 3, and a Link list is required to represent a complete path. The optimal path between two cities has two forward directions and two reverse directions, and is expressed by two groups of Link lists.
And 5: and fusing all the optimal paths, and intercepting the roads in the target area to generate a high-level navigation road network.
And carrying out effective merging, removing and intercepting on the selected path. Merging, namely forming a set by all the optimal paths through the road ID and forming a topology network; the elimination of invalid roads mainly consists of unnecessary middle-level road network data near the representative point of the internal city, and is determined mainly according to the function registration attribute or road network registration attribute of the road network. And removing the road network outside the target area, namely intercepting the road network inside the target area. The basic data structure of the high-level navigation road network is consistent with that of the middle-level navigation road network.
The effective merging, culling and pruning of the selected paths is illustrated in fig. 4 and 5. In fig. 4, (a) is a road network obtained by selecting an important city outside the target area, and (b) is a road network inside the target area obtained by the truncation, any type of representative point outside the target area can be selected, because a route outside the target area is not selected by people. In addition, if the target area is located near the sea, as shown in fig. 5, an important city located at a corner of the target area should be used as a start point or an end point, and an entrance and an exit of a highway or a main road near the city should be used as a representative point, so that the situation of (b) in fig. 3 can be avoided. In a similar situation, all important cities near the shore or country border within the target area should be selected, and at least 4 important cities outside the target area should be selected. Fig. 5 (b) is the road network in the target area obtained by the extraction.
The invention is a method for combining the optimal paths among all cities by utilizing the internal relation between important cities and a high-rise road network, can quickly and accurately extract the high-rise navigation road network based on a middle-level navigation road network, and solves two main problems: the first is the problem that the connectivity between the selected high-rise roads is broken; the second is the problem of unbalanced distribution among the selected roads. Meanwhile, the middle-layer navigation network is prepared as basic data for road calculation, so that most of invalid roads are reduced, the calculation speed of the optimal path is greatly increased, and the efficiency of the production method of the high-grade navigation network is improved.
It should be understood that parts of the specification not set forth in detail are well within the prior art.
It should be understood that the above description of the preferred embodiments is given for clarity and not for any purpose of limitation, and that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (3)
1. A method for generating a high-grade navigation network based on an inter-city optimal path is characterized by comprising the following steps:
step 1: selecting important cities connected with the target area, wherein the important cities comprise important cities outside the target area;
step 2: selecting representative points of all important cities to accurately acquire a necessary optimal path;
and step 3: preparing and generating a middle-layer navigation road network according to a certain selection and rejection principle;
the levels of the navigation road network are divided into three levels according to the importance of the routes and nodes contained in the navigation road network: a high-rise navigation road network, a middle-level navigation road network and a low-level navigation road network; the high-level navigation road network 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 common roads or branches;
the certain selection and elimination principle comprises the following steps:
principle 1: the roads with the function levels belonging to the high level and the middle level are all reserved;
principle 2: roads with functional levels belonging to low levels need to fully interpret the road network of the target area, wherein roads with higher levels are reserved;
principle 3: reserving a connection road between roads reserved in principle 1 and principle 2;
principle 4: judging the grade communication range of each level of network in the electronic map navigation road network, and reserving roads in the whole communication network in the target area;
principle 5: specific low-level auxiliary road deletion comprises a walking road, a cell road, a service area road and a parallel auxiliary road;
and 4, step 4: calculating optimal paths between all important cities, which are mutually pairwise taken as a starting point and a terminal point, by a single-layer bidirectional algorithm based on the middle-layer navigation road network in the step 3;
and 5: fusing all the optimal paths, and intercepting roads in a target area to generate a high-level navigation road network;
merging, removing and intercepting the intercepted roads; the merging is to form a set by all the optimal paths through the road ID and form a topology network; the elimination is to eliminate unnecessary middle-layer road network data near the representative point of the important city in the target area, and the unnecessary data is determined according to the function registration attribute or the road network registration attribute of the road network; and removing road networks outside the target area, and intercepting road networks inside the target area.
2. The method for generating a high-ranking navigation network based on inter-city optimal paths according to claim 1, characterized in that: in step 1, selecting an important city associated with the target area, wherein the judgment criteria of the important city comprise:
(1) the passenger capacity and the freight capacity reflect the mobility degree of the city, and the important city with high mobility is the city;
(2) total urban population and total economic; under the condition that the total number of people or the total economic quantity of the city is small, the city with higher highway traffic flow is an important city;
(3) administrative level of the city; if the social resources and the economic resources of the city are at the same level as the province or the state, the city is taken as an important city;
(4) cities with special conditions include border cities where economy and trade are rapidly developed, important goods collecting and distributing towns and important port cities in remote mountainous areas.
3. The method for generating a high-ranking navigation network based on inter-city optimal paths according to claim 1, characterized in that: and 2, selecting representative points of all important cities, including bus stops and entrances and exits of expressways in the cities.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710948528.5A CN107782323B (en) | 2017-10-12 | 2017-10-12 | High-grade navigation network generation method based on inter-city optimal path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710948528.5A CN107782323B (en) | 2017-10-12 | 2017-10-12 | High-grade navigation network generation method based on inter-city optimal path |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107782323A CN107782323A (en) | 2018-03-09 |
| CN107782323B true CN107782323B (en) | 2021-07-16 |
Family
ID=61434704
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710948528.5A Active CN107782323B (en) | 2017-10-12 | 2017-10-12 | High-grade navigation network generation method based on inter-city optimal path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107782323B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP7035210B2 (en) | 2018-03-13 | 2022-03-14 | ベイジン ディディ インフィニティ テクノロジー アンド ディベロップメント カンパニー リミティッド | Systems and methods for generating a roadmap |
| CN110968659B (en) * | 2019-12-05 | 2023-07-25 | 湖北工业大学 | High-level navigation road network redundancy removing method based on continuous road chain |
| CN110986983A (en) * | 2019-12-05 | 2020-04-10 | 湖北工业大学 | High-grade navigation network generation method based on optimal path comparison verification |
| CN113704853B (en) * | 2021-08-27 | 2024-04-05 | 西安交通大学 | Automatic multi-source road network data fusion method based on road element topology feature classification |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101982735B (en) * | 2010-09-25 | 2012-07-04 | 上海美慧软件有限公司 | Method for calculating real-time dynamic travel time of key path |
| CN102538801B (en) * | 2010-12-16 | 2016-03-30 | 上海博泰悦臻电子设备制造有限公司 | A kind of disposal route of road network data in navigation map and device |
| CN102081658B (en) * | 2011-01-13 | 2012-08-22 | 北京超图软件股份有限公司 | Hierarchical road network-based path search method and device |
| CN103047990B (en) * | 2012-12-24 | 2015-05-20 | 北京交通发展研究中心 | Multi-path selection method based on hierarchical backbone network |
| CN104075721B (en) * | 2013-03-28 | 2018-11-20 | 北京百度网讯科技有限公司 | Air navigation aid and navigation server |
| US9410816B2 (en) * | 2014-05-07 | 2016-08-09 | Yahoo! Inc. | System and method for recommending pleasant routes from the sentiment of geo-tagged photographs |
| CN105222793B (en) * | 2015-10-23 | 2019-01-04 | 华中科技大学 | A kind of city stratification region partitioning method based on map vector data model |
-
2017
- 2017-10-12 CN CN201710948528.5A patent/CN107782323B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN107782323A (en) | 2018-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107782323B (en) | High-grade navigation network generation method based on inter-city optimal path | |
| CN108665149B (en) | Method and system for measuring and calculating degree of mixing based on urban functions | |
| CN109949574B (en) | Data-driven urban road network traffic cell multistage division method | |
| CN103389101B (en) | A kind of path connected inspection method based on hierarchical structure | |
| CN104537830A (en) | Traffic index region division method for transportation hot spot road network impact assessment | |
| CN115409673A (en) | Urban green land ecological network construction method based on ecological safety pattern | |
| CN114880819B (en) | Space optimization method based on town node importance degree and traffic area bit line research | |
| Mahdi et al. | Evaluating Roads Network Connectivity for Two Municipalities in Baghdad-Iraq | |
| Hu et al. | Quantitative analysis of the urban factors limiting central district plane form expansion: twenty-one case studies of Asian megacities′ central districts | |
| Xiao et al. | Analysis of Green Infrastructure Network Pattern Change in Zhengzhou Central City Based on Morphological Spatial Pattern Analysis | |
| Zhang et al. | An integrated approach for optimizing the spatial planning of tourist POIs for traffic accessibility: Dalian City, China | |
| Farhan et al. | Digital Era Influence on Neighbourhood Planning | |
| Gupta et al. | Monitoring physical growth of Ranchi City by using geoinformatics techniques | |
| Syukri et al. | Determining variations in rail public transport access using GIS in Klang Valley City, Selangor, Malaysia | |
| CN118568526A (en) | Comprehensive transportation channel identification method based on cluster analysis | |
| James et al. | Changing urban structure and physical expansion trends of Kafanchan Metropolis, Kaduna State, Nigeria | |
| Sang et al. | Spatial Construction, Form and Effectiveness Analysis of Large-Scale Waterfront Park System in Island-type Cities——The Case of Xiamen, China | |
| Wang et al. | An approach to urban system spatial planning in Chengdu Chongqing economic circle using geospatial big data | |
| Min | A Study on the Spatial Distribution of Tourist Attractions above 3A Level in Hangzhou Based on POI Extraction | |
| Rahımı et al. | Monitoring the Long Term Urban Expansion of Zanjan City Using Remote Sensing and Geographic Information Systems | |
| Zhou et al. | A Coarse-to-Fine Approach for Urban Land Use Mapping Based on Multisource Geospatial Data | |
| Irawan et al. | Using physical parameters for tourism potential mapping: Study case of beach tourism destination in Gajahrejo, Malang | |
| Wang et al. | Urban functional area identification and spatial accessibility analysis based on big data | |
| Dai et al. | Research on regional accessibility and evolution of spatial structure: based on the demonstration of the core zone 30a of the Silk Road economic belt | |
| Falsetti | The" hidden" city: morphological developments and knotting phenomena in the commercial fabric from the passage to the mall |
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 |