CN103674049A - Method for obtaining shortest paths of compulsory nodes in navigation system - Google Patents
Method for obtaining shortest paths of compulsory nodes in navigation system Download PDFInfo
- Publication number
- CN103674049A CN103674049A CN201310631719.0A CN201310631719A CN103674049A CN 103674049 A CN103674049 A CN 103674049A CN 201310631719 A CN201310631719 A CN 201310631719A CN 103674049 A CN103674049 A CN 103674049A
- Authority
- CN
- China
- Prior art keywords
- shortest path
- point
- subgraph
- path
- shortest
- 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.)
- Pending
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/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
-
- 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/34—Route searching; Route guidance
- G01C21/3446—Details of route searching algorithms, e.g. Dijkstra, A*, arc-flags, using precalculated routes
Abstract
The invention discloses a method for obtaining shortest paths of compulsory nodes in a navigation system. The method comprises the following steps: obtaining N shortest paths passing K compulsory nodes, calculating the N shortest paths passing the K compulsory nodes by cutting the subgraphs of the shortest paths passing the K compulsory nodes found each time again, comparing with shortest paths passing the K compulsory nodes in existing subgrahs one by one to find out the shortest paths, continuously and repeatedly performing the process, and removing the repeated paths in the performing process until the number of paths meets the requirement or no paths are existent. According to the method, the plurality of shortest paths passing the K compulsory nodes can be obtained and conveniently selected by users according to the need.
Description
Technical field
The invention belongs to turn-by-turn navigation technical field, relate to a kind of navigational system, relating in particular to must be through the acquisition methods of a shortest path in a kind of navigational system.
Background technology
Shortest route problem is all widely used in various fields such as computer science, traffic engineering, communication engineering, control theories, is one of subproblem solving other many complex network optimization problems.
Along with the development of the extensively universal and transportation network of vehicle, the effect of intelligent traffic guidance systems will seem more for giving prominence to.System for traffic guiding can reach induction travel behaviour for it provides best travel route according to driver's wish, reduce vehicle residence time on the way; Meanwhile, it can also be avoided because blindly travelling or travel by rule of thumb and cause traffic jam.
As user, except optimal route, suboptimum, the again excellent route no less important that also seems; Can make like this user have larger selection space, simultaneously for more humane service is further provided, inducible system also should arrange a plurality of needs that must go on a journey in way to meet user through point, such as wanting approach supermarket, refuelling station etc.; Also have in the transportation of army personnel and goods and materials, want must consideration must be through point, this must may be some important cities, bridge, refuelling station, ammunition depot, terminal etc. through point; Therefore must will be also the development trend of following intelligent traffic guidance systems through the consideration of point.The arbitrarily popularization of smart mobile phone, increasing people, adopts mobile phone to navigate.
In view of this, nowadays must be through the method for the N bar shortest path of point in the urgent need to designing a kind of K of obtaining.
Summary of the invention
Technical matters to be solved by this invention is: providing must be through the acquisition methods of a shortest path in a kind of navigational system, and can obtain K of some mistake must, through the shortest path of point, facilitate user to select as required.
For solving the problems of the technologies described above, the present invention adopts following technical scheme:
Must be through an acquisition methods for a shortest path in navigational system, described method was obtained K must be through the N bar shortest path of point, and wherein, K, N are more than or equal to 1 integer; Described method comprises:
Calculating article one K must be through the shortest path of point;
To individual must again the cutting apart through the subgraph of a shortest path of K excessively of finding at every turn, and and existing subgraph exist cross K and must compare one by one through the carrying out of the shortest path of point, find out shortest path, so constantly repeat, and the path of remove repeating in the process of implementation, until path number reaches and meets or without path.
As a preferred embodiment of the present invention, described method specifically comprises the steps:
Step S1, the 1st of calculating are crossed K must be through the shortest path of point; According to dijkstra's algorithm, to starting point, must ask in order respectively the shortest path between every two nodes through point and all possible paths of terminal, then superpose successively, must be through the shortest path of point thereby calculated article one K;
Step S2, with the first array class arrWebShortestPaths, article one is crossed to K and must add through the shortest path of point; This cross K must the subgraph corresponding through the shortest path of point in, article 1, the subgraph that shortest path is corresponding is former figure, keep all nodes constant, according to this paths, carry out segmentation disconnection, thereby form several corresponding subgraphs, calculate each subgraph corresponding cross K must be through the shortest path of point, and the length of shortest path corresponding to each subgraph with form section between certain two node that this subgraph disconnects from former figure and preserve with the second array class arrFormSubnetInfo;
Step S3, deletion the second array class arrFormSubnetInfo form supergraph record of new subgraph this time, the length that compares the corresponding shortest path of each element of the second array class arrFormSubnetInfo, ask minimum length, find out this element, and form after which section section subgraph corresponding to known its shortest path disconnects by former figure from record; Therefore again find out this, cross K and must compare with all shortest paths of having stored in the first array class arrWebShortestPaths through a shortest path, if exist identically, do not add, otherwise, add;
Step S4, judge in the first array class arrWebShortestPaths whether existing shortest path has to exist and repeat section, what do not repeat section, by integer variable, make a mark, return to execution step S2, until this mark value and required shortest path number N equate or without shortest path.
Beneficial effect of the present invention is: must be through the acquisition methods of a shortest path in the navigational system that the present invention proposes, and can obtain K of some mistake must, through the shortest path of point, facilitate user to select as required.
Accompanying drawing explanation
Fig. 1 is the schematic diagram of 26 node diagrams.
Fig. 2 is the process flow diagram of shortest path acquisition methods of the present invention.
Embodiment
Below in conjunction with accompanying drawing, describe the preferred embodiments of the present invention in detail.
Embodiment mono-
The present invention is on mobile phone (can certainly be other electronic equipments) basis with navigation, and on the basis of classical way dijkstra's algorithm that solves shortest route problem, proposing must be through the acquisition methods of a shortest path in a kind of navigational system.
If G=is (V, E) be the oriented or non-directed graph of cum rights, Fig. 1 for example, this figure is comprised of with the camber line being connected node, different connected modes between two nodes have formed all paths of point-to-point transmission, every paths is all relevant to the subgraph at its place, and subgraph can be that former figure disconnects the connection between some node or removes several nodes and connect to form relevant to these nodes.In a subgraph, asked K must can solve behind the path of each arrangement by segmentation through the shortest path of point, footpath, outlet minimum value is determined final shortest path.
For a subgraph that there is no isolated node, between every two nodes, there is shortest path; Suppose in figure, without isolated node, from start node, to object node, to have some paths so; For each paths, this path has how many sections (connections between different node) just can form how many subgraphs by disconnecting each section, set of paths from start node to object node in these subgraphs mutually and again and the formed set of this paths being disconnected in former figure, just equals start node in former figure and arrives the set of paths between object node.Known according to above principle, as long as in subgraph, between start node and object node, having path is to have shortest path; Therefore keep all nodes of subgraph consistent with former figure, it is the difference of break path, at former figure, find after the shortest path between 2, disconnect the many subgraphs that form after this first shortest path and all have respectively the shortest path between start node and object node, if also exist and connect between two nodes; For former figure, to be that these form in the shortest path of subgraphs the shortest for the second shortest path, if while there is not the path of this point-to-point transmission in all subgraphs, show to only have the first shortest path this.
Therefore, asked K must be exactly individual must again the cutting apart through the subgraph of a shortest path of K excessively to find at every turn through the N of node bar shortest path, and and existing subgraph exist cross K and must compare one by one through the carrying out of the shortest path of point, find out the shortest, so constantly repeat, and the path of remove repeating in the process of implementation until path number reach and meet or without path.
Must be through the N bar shortest path first of point for crossing K, must first try to achieve article one K must be through the shortest path of point, and then ask the second shortest path by disconnecting set of minimal paths corresponding to the formed sub collective drawing of the first shortest path, so N bar shortest path is consequently tried to achieve in circulation.
Refer to Fig. 2, in navigational system of the present invention, must specifically comprise the steps: through the acquisition methods of a shortest path
[step S1] obtains K of the 1st mistake must be through the shortest path of point.According to dijkstra's algorithm, to starting point, must ask in order respectively the shortest path between every two nodes through point and all possible paths of terminal, then superpose successively, must be through the shortest path of point thereby calculated article one K.
[step S2] crosses K with the first array class arrWebShortestPaths to article one and must add through the shortest path of point; This cross K must the subgraph corresponding through the shortest path of point in (the 1st corresponding subgraph is former figure), keep all nodes constant, according to this paths, carry out segmentation disconnection, thereby form several corresponding subgraphs, calculate each subgraph corresponding cross K must be through the shortest path of point, and the length of shortest path corresponding to each subgraph with form section between certain two node that this subgraph disconnects from former figure and preserve with the second array class arrFormSubnetInfo.
[step S3] deletes the second array class arrFormSubnetInfo and this time, forms the supergraph record of new subgraph, the length that compares the corresponding shortest path of each element of the second array class arrFormSubnetInfo, ask minimum length, find out this element, and form after which section section subgraph corresponding to known its shortest path disconnects by former figure from record.Therefore again find out this, cross K and must compare with all shortest paths of having stored in the first array class arrWebShortestPaths through a shortest path, if exist identically, do not add, otherwise, add.
[step S4] judges in the first array class arrWebShortestPaths, whether existing shortest path has the repetition of existence section, what do not repeat section, by integer variable, make a mark, return to execution step S2, until this mark value and required shortest path number N equate or without shortest path.
In sum, must be through the acquisition methods of a shortest path in the navigational system that the present invention proposes, can obtain K of some mistake must, through the shortest path of point, facilitate user to select as required.
Here description of the invention and application is illustrative, not wants by scope restriction of the present invention in the above-described embodiments.Here the distortion of disclosed embodiment and change is possible, and for those those of ordinary skill in the art, the various parts of the replacement of embodiment and equivalence are known.Those skilled in the art are noted that in the situation that not departing from spirit of the present invention or essential characteristic, and the present invention can be with other form, structure, layout, ratio, and realizes with other assembly, material and parts.In the situation that not departing from the scope of the invention and spirit, can carry out other distortion and change to disclosed embodiment here.
Claims (2)
1. in navigational system, must it is characterized in that through an acquisition methods for a shortest path, described method was obtained K must be through the N bar shortest path of point, and wherein, K, N are more than or equal to 1 integer; Described method comprises:
Calculating article one K must be through the shortest path of point;
To individual must again the cutting apart through the subgraph of a shortest path of K excessively of finding at every turn, and and existing subgraph exist cross K and must compare one by one through the carrying out of the shortest path of point, find out shortest path, so constantly repeat, and the path of remove repeating in the process of implementation, until path number reaches and meets or without path.
2. in navigational system according to claim 1, must, through the acquisition methods of a shortest path, it is characterized in that:
Described method specifically comprises the steps:
Step S1, the 1st of calculating are crossed K must be through the shortest path of point; According to dijkstra's algorithm, to starting point, must ask in order respectively the shortest path between every two nodes through point and all possible paths of terminal, then superpose successively, must be through the shortest path of point thereby calculated article one K;
Step S2, by the first array class, article one is crossed to K and must add through the shortest path of point; This cross K must the subgraph corresponding through the shortest path of point in, article 1, the subgraph that shortest path is corresponding is former figure, keep all nodes constant, according to this paths, carry out segmentation disconnection, thereby form several corresponding subgraphs, calculate each subgraph corresponding cross K must be through the shortest path of point, and the length of shortest path corresponding to each subgraph with form section between certain two node that this subgraph disconnects from former figure and preserve by the second array class;
Step S3, deletion the second array class form supergraph record of new subgraph this time, the length that compares the corresponding shortest path of each element of the second array class, ask minimum length, find out this element, and form after which section section subgraph corresponding to known its shortest path disconnects by former figure from record; Therefore again find out this, cross K and must compare with all shortest paths of having stored in the first array class through a shortest path, if exist identically, do not add, otherwise, add;
Step S4, judge in the first array class whether existing shortest path has to exist and repeat section, what do not repeat section, by integer variable, make a mark, return to execution step S2, until this mark value and required shortest path number N equate or without shortest path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310631719.0A CN103674049A (en) | 2013-11-29 | 2013-11-29 | Method for obtaining shortest paths of compulsory nodes in navigation system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310631719.0A CN103674049A (en) | 2013-11-29 | 2013-11-29 | Method for obtaining shortest paths of compulsory nodes in navigation system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103674049A true CN103674049A (en) | 2014-03-26 |
Family
ID=50312317
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310631719.0A Pending CN103674049A (en) | 2013-11-29 | 2013-11-29 | Method for obtaining shortest paths of compulsory nodes in navigation system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103674049A (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104142151A (en) * | 2014-07-31 | 2014-11-12 | 上海闻泰电子科技有限公司 | Navigation method |
| CN104933248A (en) * | 2015-06-16 | 2015-09-23 | 中国科学技术大学 | Road network approximate shortest path calculation method on multi-core platform |
| CN108809834A (en) * | 2018-07-20 | 2018-11-13 | 台州学院 | It is a kind of that short path set computational methods are disperseed based on the network topology of Path extension and eliminative mechanism |
| CN110274604A (en) * | 2018-11-06 | 2019-09-24 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating routing information |
| CN111157000A (en) * | 2018-11-06 | 2020-05-15 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating path information |
| CN112213113A (en) * | 2020-09-02 | 2021-01-12 | 中国第一汽车股份有限公司 | Method for selecting and planning real road test scene of intelligent driving mobile device |
| CN112965500A (en) * | 2021-03-27 | 2021-06-15 | 同济大学 | Path planning method and device with must-pass point set and additional hard constraints |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5272638A (en) * | 1991-05-31 | 1993-12-21 | Texas Instruments Incorporated | Systems and methods for planning the scheduling travel routes |
| DE19519107C1 (en) * | 1995-05-24 | 1996-04-04 | Daimler Benz Ag | Travel route guidance device for electric vehicle |
-
2013
- 2013-11-29 CN CN201310631719.0A patent/CN103674049A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5272638A (en) * | 1991-05-31 | 1993-12-21 | Texas Instruments Incorporated | Systems and methods for planning the scheduling travel routes |
| DE19519107C1 (en) * | 1995-05-24 | 1996-04-04 | Daimler Benz Ag | Travel route guidance device for electric vehicle |
Non-Patent Citations (2)
| Title |
|---|
| 柴登峰等: "前N条最短路径问题的算法及应用", 《浙江大学学报（工学版）》, vol. 36, no. 5, 30 September 2002 (2002-09-30) * |
| 王峰等: "Dijkstra及基于Dijkstra的前N条最短路径算法在智能交通系统中的应用", 《计算机应用研究》, vol. 23, no. 9, 30 September 2006 (2006-09-30) * |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104142151A (en) * | 2014-07-31 | 2014-11-12 | 上海闻泰电子科技有限公司 | Navigation method |
| CN104933248A (en) * | 2015-06-16 | 2015-09-23 | 中国科学技术大学 | Road network approximate shortest path calculation method on multi-core platform |
| CN104933248B (en) * | 2015-06-16 | 2018-07-03 | 中国科学技术大学 | Road network approximate shortest path computational methods on multi-core platform |
| CN108809834A (en) * | 2018-07-20 | 2018-11-13 | 台州学院 | It is a kind of that short path set computational methods are disperseed based on the network topology of Path extension and eliminative mechanism |
| CN108809834B (en) * | 2018-07-20 | 2020-08-28 | 台州学院 | Network topology dispersed short path set calculation method based on path expansion and elimination mechanism |
| CN110274604A (en) * | 2018-11-06 | 2019-09-24 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating routing information |
| CN111157000A (en) * | 2018-11-06 | 2020-05-15 | 北京京东尚科信息技术有限公司 | Method and apparatus for generating path information |
| CN112213113A (en) * | 2020-09-02 | 2021-01-12 | 中国第一汽车股份有限公司 | Method for selecting and planning real road test scene of intelligent driving mobile device |
| CN112213113B (en) * | 2020-09-02 | 2022-07-15 | 中国第一汽车股份有限公司 | Method for selecting and planning actual road test scene of intelligent driving mobile device |
| CN112965500A (en) * | 2021-03-27 | 2021-06-15 | 同济大学 | Path planning method and device with must-pass point set and additional hard constraints |
| CN112965500B (en) * | 2021-03-27 | 2022-07-05 | 同济大学 | Path planning method and device with must-pass point set and additional hard constraints |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103674049A (en) | Method for obtaining shortest paths of compulsory nodes in navigation system | |
| CN105701560B (en) | Method and device for determining commuting route information | |
| CN103863365A (en) | Method for generating track traffic route topological graph by directed graph method | |
| CN102506849B (en) | Method for optimizing shortest path with restraint | |
| CN105575168A (en) | Parking space reservation method of parking lot | |
| CN105630979A (en) | Flight query method, device and system | |
| CN106017490A (en) | Map display method, navigation server and navigation system | |
| CN101587650A (en) | GPS bus transfering navigation method and system thereof | |
| CN111028511B (en) | Traffic jam early warning method and device | |
| CN104949682A (en) | Method and system for planning paths in road networks | |
| CN107743092A (en) | Path selecting method and device | |
| KR102026913B1 (en) | Method and system for selecting a stop for traffic demand service | |
| CN103968854A (en) | Route cluster planning method | |
| Shang et al. | Dynamic shortest path monitoring in spatial networks | |
| CN104990559A (en) | Route recommending method based on taxi empirical data, system and client | |
| CN110619426A (en) | Road network model construction method, device, equipment and storage medium | |
| CN103900596A (en) | Method and device for planning navigation path based on road sections | |
| CN112325889B (en) | Navigation prompt information determination method and device, storage medium and electronic equipment | |
| CN105698796A (en) | Route search method of multi-robot scheduling system | |
| JP5132694B2 (en) | DATA GENERATION DEVICE, DATA GENERATION METHOD, AND ROUTE SEARCH DEVICE | |
| Burgstahler et al. | Horizon. KOM: A First Step Towards an Open Vehicular Horizon Provider. | |
| KR20090112869A (en) | System and method for searching station information based on road information | |
| CN105374003A (en) | Bus route transfer method | |
| CN101308028A (en) | Navigational route database generalization method suitable for road information loading | |
| CN114199227B (en) | Navigation path planning method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20170721 |