CN101603837A - A kind of guidance path computing method, device and guider - Google Patents
A kind of guidance path computing method, device and guider Download PDFInfo
- Publication number
- CN101603837A CN101603837A CNA2009101073386A CN200910107338A CN101603837A CN 101603837 A CN101603837 A CN 101603837A CN A2009101073386 A CNA2009101073386 A CN A2009101073386A CN 200910107338 A CN200910107338 A CN 200910107338A CN 101603837 A CN101603837 A CN 101603837A
- Authority
- CN
- China
- Prior art keywords
- fastlink
- current location
- destination
- bee
- line
- 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
Landscapes
- Navigation (AREA)
Abstract
The present invention relates to airmanship, the calculated amount that exists when the current location of calculating the office different cities and the shortest path between the destination at existing guidance path numerical procedure causes the slower defective of navigational system reaction more greatly, and a kind of guidance path computing method, device and guider are provided.The guidance path computing method comprise, when between definite current location and destination, having at least one fastlink, for each fastlink, determine to go to the bee-line of destination via this fastlink, and export the pairing guidance path of minimum value among determined each bee-line from current location.The present invention also provides a kind of guidance path calculation element and guider.When current location and office, destination different cities, this programme only calculates shortest path based on the fastlink between current location and the destination, therefore can effectively reduce computation complexity and calculated amount, improve the reaction velocity of guider, improve user experience.
Description
Technical field
The present invention relates to airmanship, more particularly, relate to a kind of guidance path computing method, device and guider.
Background technology
The Vehicular navigation technology is GPS (Global Positioning System, GPS) important branch of technology.Principle of work based on the onboard navigation system of this technology is, vehicle mounted guidance terminal receives the position coordinates that at least 3 satellites transmitted in earth-circling 24 gps satellites, the position coordinates of putting down in writing in the electronic chart that itself and terminal self are stored mates, and determines the accurate position of navigation object in electronic chart of this terminal of lift-launch with this.
In daily life, often need determine shortest path between current location and the destination by Vehicular guidance system.When current location and office, destination different cities, the calculating of shortest path can be contained the transportation network in current location and city, place, destination and the transportation network between this two cities, so calculated amount can be very big.Simultaneously, because the hardware configuration of navigational system is limit by himself volume, its computing power is quite limited.In this case, when calculated amount was big, the reaction meeting of navigational system was very slow, so user experience is relatively poor.
Therefore, need a kind of guidance path numerical procedure, can effectively overcome the above-mentioned defective that exists in the prior art.
Summary of the invention
The technical problem to be solved in the present invention is, the calculated amount that exists when the current location of calculating the office different cities and the shortest path between the destination at existing guidance path numerical procedure causes the slower defective of navigational system reaction more greatly, and a kind of guidance path computing method, device and guider are provided.
The technical solution adopted for the present invention to solve the technical problems is:
A kind of guidance path computing method, comprise, when between definite current location and destination, having at least one fastlink, for each fastlink, determine to go to the bee-line of destination via this fastlink, and export the pairing guidance path of minimum value among determined each bee-line from current location.
In guidance path computing method provided by the invention, also comprise, when definite described current location and described destination are adhered to zones of different separately, determine to have at least one fastlink between current location and the destination, and determine length, starting point and the terminal point of each fastlink.
In guidance path computing method provided by the invention, describedly determine to go to the bee-line of destination further to comprise via this fastlink from current location, determine:
Bee-line between current location and this fastlink starting point;
Bee-line between destination and this fastlink terminal point;
Based on the definite bee-line of going to the destination via this fastlink of the length of the bee-line between the bee-line between current location and this fastlink starting point, destination and this fastlink terminal point and this fastlink from current location.
The present invention also provides a kind of guidance path calculation element, comprising:
Determination module when being used for having at least one fastlink between definite current location and destination, sending and calculates notice;
Computing module, communicate to connect with described determination module, be used for when receiving the calculating notice, determining to go to the bee-line of destination via this fastlink for each fastlink, and exporting the pairing guidance path of minimum value among determined each bee-line from current location.
In guidance path calculation element provided by the invention,
Described determination module is used for determining to exist between current location and the destination described at least one fastlink when definite described current location and described destination are adhered to zones of different separately, and determines length, starting point and the terminal point of each fastlink.
In guidance path calculation element provided by the invention,
For each fastlink, described computing module is used for calculating:
Bee-line between current location and this fastlink starting point;
Bee-line between destination and this fastlink terminal point;
Based on the definite bee-line of going to the destination via this fastlink of the length of the bee-line between the bee-line between current location and this fastlink starting point, destination and this fastlink terminal point and this fastlink from current location.
The present invention also provides a kind of guider, comprising:
Locating module is used for determining current location;
Input port is used to receive the destination of input;
The guidance path computing module, communicate to connect with locating module and input port respectively, when being used between definite current location and destination, having at least one fastlink, for each fastlink, determine to go to the bee-line of destination via this fastlink, and export the pairing guidance path of minimum value among determined each bee-line from current location.
In guider provided by the invention, described guidance path computing module comprises:
Determination module is used for determining to exist between current location and the destination described at least one fastlink when definite described current location and described destination are adhered to zones of different separately, and determines length, starting point and the terminal point of each fastlink.
In guider provided by the invention, described guidance path computing module comprises:
Computing module is used for for each fastlink, calculates:
Bee-line between current location and this fastlink starting point;
Bee-line between destination and this fastlink terminal point;
Based on the definite bee-line of going to the destination via this fastlink of the length of the bee-line between the bee-line between current location and this fastlink starting point, destination and this fastlink terminal point and this fastlink from current location.
In guider provided by the invention, described locating module is the gps satellite locating module.
Implement technical scheme of the present invention, has following beneficial effect: when current location and office, destination different cities, this programme only calculates shortest path based on the fastlink between current location and the destination, therefore can effectively reduce computation complexity and calculated amount, improve the reaction velocity of guider, improve user experience.
Description of drawings
The invention will be further described below in conjunction with drawings and Examples, in the accompanying drawing:
Fig. 1 a is the logical schematic of an existing freeway net;
Fig. 1 b is the topological diagram of freeway net shown in Fig. 1 a;
Fig. 2 a is the rough schematic view of freeway net shown in Fig. 1 a;
Fig. 2 b is the topological diagram of freeway net shown in Fig. 2 a;
Fig. 3 is the contrast synoptic diagram according to the freeway net before and after the simplification of a preferred embodiment of the present invention;
Fig. 4 is the packet structure synoptic diagram according to the topological road of a preferred embodiment of the present invention;
Fig. 5 is the process flow diagram according to the guidance path computing method of a preferred embodiment of the present invention;
Fig. 6 is the logical organization synoptic diagram according to the guider of a preferred embodiment of the present invention.
Embodiment
In order to make purpose of the present invention, technical scheme and advantage clearer,, the present invention is further elaborated below in conjunction with drawings and Examples.Should be appreciated that specific embodiment described herein only in order to explanation the present invention, and be not used in qualification the present invention.
The invention provides a kind of guidance path numerical procedure, when current location and office, destination different cities, only calculate shortest path based on the fastlink between current location and the destination, therefore can effectively reduce computation complexity and calculated amount, improve the reaction velocity of guider, improve user experience.Below just with specific embodiment technical scheme of the present invention is described in detail in conjunction with the accompanying drawings.
Fig. 1 a is the logical schematic of an existing freeway net.As shown in Figure 1a, both there had been high-speed dry roads such as AD, EH, AE, DH in this freeway net, also had low speed branch roads such as BF, CG.Fig. 1 b is the topological diagram of freeway net shown in Fig. 1 a.Obviously, when calculating shortest path, should only consider the high speed arterial highway, abandon the low speed branch road.Thus, just can simplify freeway net shown in Figure 1, the freeway net after the simplification wherein only comprises the high speed arterial highway shown in Fig. 2 a.Fig. 2 b is the topological diagram of the freeway net after simplifying shown in Fig. 2 a.
For ease of understanding, Fig. 3 shows the contrast synoptic diagram of the freeway net before and after simplifying.As shown in Figure 3, the freeway net after simplifying between 2 of A, the B has only kept original high speed arterial highway, therefore is understood that, the quantity of information of map datum will reduce greatly after simplifying.
In this case, can simplify, only keep high speed arterial highway relevant information, delete the information relevant with the low speed branch road to the map datum of each freeway net.
Fig. 4 is the packet structure synoptic diagram according to the topological road of a preferred embodiment of the present invention.As shown in Figure 4, in topological road data pack arrangement, store three partial data.First part is packet header, describes the memory location of other two parts data.Second portion is the topological node concordance list, and third part is the concrete data of topological network.
First part is to comprise " skew of topological node index table stores ", " skew of topological node data storage " in the packet header.Indicated the memory location of second portion topological node concordance list in " skew of topological node index table stores ", " skew of topological node data storage " indicated the memory location of the concrete data of third part topological network.
Second portion is the topological node concordance list, and it has described this map sheet topological network nodal point number earlier, then is continuously the map sheet topological network node index of storage, and topological network node index number is with this map sheet topological network nodal point number.Each topological network node index all comprises " start node sign ", " skew of node data storage " two codomains.Wherein, " start node sign " identifies with the node of road data in the map sheet that is used for showing, both have and can concern one to one; " skew of node data storage " pointed to the topological limit from this point is drawn of the 3rd part and tabulated.
Third part is the concrete data of topological network.Certain node in the second portion data can be drawn a plurality of limits (being mulitpath), and these relevant limits are stored in the third part data, are called the limit group.The third part data are actually by a plurality of limits group to be formed, each group front, limit is " purpose node number " data item, point out to draw node and can draw what limits, each draws the sign of the destination node on limit, and the attribute on this limit, band but be not limited to distance, road grade weights, current direction etc. for example.
As indicated above, after simplifying, the big young pathbreaker of the topologically corresponding topological road data bag of freeway net reduces greatly.
Below just describe guidance path quick calculation method provided by the invention in detail in conjunction with concrete process flow diagram.
Fig. 5 is the process flow diagram according to the guidance path computing method 500 of a preferred embodiment of the present invention.As shown in Figure 5, method 500 starts from 502.
Subsequently,, determine current location, and receive the destination of input at next step 504.In the specific implementation process, can be by determining current location such as but not limited to the GPS GPS.
Subsequently, at next step 506, judge whether there is fastlink between current location and the destination, if then forward step 508 to; Otherwise forward step 510 to.In the specific implementation process, if current location and destination are adhered to zones of different separately, such as but not limited to different cities, then there is fastlink in decidable between the two.Whether the label in city is identical under label that can be by judging city under the current location and the destination judges whether there is fastlink between current location and the destination.
In addition, this fastlink is interpreted as the high speed path highway for example between current location affiliated area and the destination affiliated area.In the specific implementation process, this highway can use according to the packet that passes through the topological road of simplifying mentioned above and calculate such as but not limited to methods such as Open Shortest Path First.
It should be noted that in actual life often not only one of fastlink.
As indicated above, if having fastlink between judgement current location and the destination, then forward step 508 to, for each fastlink, determine the bee-line of going to the destination via this fastlink from current location.This step specifically comprises length, starting point and the terminal point of at first determining each fastlink; Determine the bee-line between the bee-line between current location and this fastlink starting point, destination and this fastlink terminal point subsequently; At last, determine the bee-line of going to the destination via this fastlink based on the length of the bee-line between the bee-line between current location and this fastlink starting point, destination and this fastlink terminal point and this fastlink, promptly go to the bee-line of destination to equal the bee-line between bee-line, destination and this fastlink terminal point between current location and this fastlink starting point and the length sum of this fastlink via this fastlink from current location from current location.
In the specific implementation process, the bee-line between bee-line between current location and this fastlink starting point and destination and this fastlink terminal point can be used such as but not limited to methods such as Open Shortest Path First and calculate.
Subsequently, at next step 512, the pairing guidance path of minimum value among each bee-line of determining in the output step 510, i.e. shortest path.
As indicated above, if do not have fastlink between judgement current location and the destination, then forward step 510 to, adopt the definite shortest path from the current location to the destination of conventional method.If judge between current location and the destination and do not have fastlink, illustrate that then current location and destination are in areal such as but not limited to same city, therefore, can adopt existing any path calculation method to calculate guidance path between current location and the destination.
At last, method 500 ends at step 514.
The present invention also provides a kind of guider of using above-mentioned guidance path computing method, below just it is described in detail in conjunction with Fig. 6.
Fig. 6 is the logical organization synoptic diagram according to the guider 600 of a preferred embodiment of the present invention.As shown in Figure 6, guider 600 comprises locating module 602, input port 604 and guidance path computing module 606.
Locating module 602 is used for determining current location.In the specific implementation process, locating module 602 can be such as but not limited to the gps satellite locating module.
Guidance path computing module 606 communicates to connect with locating module 602 and input port 604 respectively, and it further comprises determination module 6062 and computing module 6064.
When determination module 6062 is used for having at least one fastlink between definite current location and destination, sends and calculate notice.In the specific implementation process, if current location and destination are adhered to zones of different separately, such as but not limited to different cities, then there is fastlink in decidable between the two.Whether the label in city is identical under label that can be by judging city under the current location and the destination judges whether there is fastlink between current location and the destination.
In addition, this fastlink is interpreted as the high speed path highway for example between current location affiliated area and the destination affiliated area.In the specific implementation process, this highway can use according to the packet that passes through the topological road of simplifying mentioned above and calculate such as but not limited to methods such as Open Shortest Path First.
Determination module 6062 also is used for determining length, starting point and the terminal point of each fastlink.
It should be noted that in actual life often not only one of fastlink.
In the specific implementation process, for each fastlink, computing module 6064 is used to calculate the bee-line between current location and this fastlink starting point, bee-line between destination and this fastlink terminal point, and based on the bee-line between current location and this fastlink starting point, bee-line between destination and this fastlink terminal point and the length of this fastlink are determined the bee-line of going to the destination via this fastlink from current location, promptly go to the bee-line of destination to equal bee-line between current location and this fastlink starting point from current location via this fastlink, the bee-line between destination and this fastlink terminal point and the length sum of this fastlink.
The above only is preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of being done within the spirit and principles in the present invention, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1, a kind of guidance path computing method, it is characterized in that, comprise, when between definite current location and destination, having at least one fastlink, for each fastlink, determine to go to the bee-line of destination via this fastlink, and export the pairing guidance path of minimum value among determined each bee-line from current location.
2, guidance path computing method according to claim 1, it is characterized in that, also comprise, when definite described current location and described destination are adhered to zones of different separately, determine to have at least one fastlink between current location and the destination, and determine length, starting point and the terminal point of each fastlink.
3, guidance path computing method according to claim 1 and 2 is characterized in that, describedly determine to go to the bee-line of destination further to comprise from current location via this fastlink, determine:
Bee-line between current location and this fastlink starting point;
Bee-line between destination and this fastlink terminal point;
Based on the definite bee-line of going to the destination via this fastlink of the length of the bee-line between the bee-line between current location and this fastlink starting point, destination and this fastlink terminal point and this fastlink from current location.
4, a kind of guidance path calculation element is characterized in that, comprising:
Determination module when being used for having at least one fastlink between definite current location and destination, sending and calculates notice;
Computing module, communicate to connect with described determination module, be used for when receiving the calculating notice, determining to go to the bee-line of destination via this fastlink for each fastlink, and exporting the pairing guidance path of minimum value among determined each bee-line from current location.
5, guidance path calculation element according to claim 4 is characterized in that,
Described determination module is used for determining to exist between current location and the destination described at least one fastlink when definite described current location and described destination are adhered to zones of different separately, and determines length, starting point and the terminal point of each fastlink.
6, guidance path calculation element according to claim 5 is characterized in that,
For each fastlink, described computing module is used for calculating:
Bee-line between current location and this fastlink starting point;
Bee-line between destination and this fastlink terminal point;
Based on the definite bee-line of going to the destination via this fastlink of the length of the bee-line between the bee-line between current location and this fastlink starting point, destination and this fastlink terminal point and this fastlink from current location.
7, a kind of guider is characterized in that, comprising:
Locating module is used for determining current location;
Input port is used to receive the destination of input;
The guidance path computing module, communicate to connect with locating module and input port respectively, when being used between definite current location and destination, having at least one fastlink, for each fastlink, determine to go to the bee-line of destination via this fastlink, and export the pairing guidance path of minimum value among determined each bee-line from current location.
8, guider according to claim 7 is characterized in that, described guidance path computing module comprises:
Determination module is used for determining to exist between current location and the destination described at least one fastlink when definite described current location and described destination are adhered to zones of different separately, and determines length, starting point and the terminal point of each fastlink.
9, guider according to claim 8 is characterized in that, described guidance path computing module comprises:
Computing module is used for for each fastlink, calculates:
Bee-line between current location and this fastlink starting point;
Bee-line between destination and this fastlink terminal point;
Based on the definite bee-line of going to the destination via this fastlink of the length of the bee-line between the bee-line between current location and this fastlink starting point, destination and this fastlink terminal point and this fastlink from current location.
According to each described guider in the claim 7 to 9, it is characterized in that 10, described locating module is the gps satellite locating module.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009101073386A CN101603837A (en) | 2009-05-14 | 2009-05-14 | A kind of guidance path computing method, device and guider |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2009101073386A CN101603837A (en) | 2009-05-14 | 2009-05-14 | A kind of guidance path computing method, device and guider |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101603837A true CN101603837A (en) | 2009-12-16 |
Family
ID=41469662
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2009101073386A Pending CN101603837A (en) | 2009-05-14 | 2009-05-14 | A kind of guidance path computing method, device and guider |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101603837A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103900596A (en) * | 2012-12-28 | 2014-07-02 | 环达电脑(上海)有限公司 | Method and device for planning navigation path based on road sections |
| CN104956181A (en) * | 2013-03-22 | 2015-09-30 | 爱信艾达株式会社 | Navigation system, method, and program |
| CN106248094A (en) * | 2016-08-30 | 2016-12-21 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus determining optimal route based on navigation map |
| CN109540165A (en) * | 2018-11-26 | 2019-03-29 | 交通运输部路网监测与应急处置中心 | A kind of highway network constraint pathfinding algorithm of heuristic search |
-
2009
- 2009-05-14 CN CNA2009101073386A patent/CN101603837A/en active Pending
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103900596A (en) * | 2012-12-28 | 2014-07-02 | 环达电脑(上海)有限公司 | Method and device for planning navigation path based on road sections |
| CN104956181A (en) * | 2013-03-22 | 2015-09-30 | 爱信艾达株式会社 | Navigation system, method, and program |
| CN104956181B (en) * | 2013-03-22 | 2017-05-17 | 爱信艾达株式会社 | Navigation system and method |
| CN106248094A (en) * | 2016-08-30 | 2016-12-21 | 北京京东尚科信息技术有限公司 | A kind of method and apparatus determining optimal route based on navigation map |
| CN109540165A (en) * | 2018-11-26 | 2019-03-29 | 交通运输部路网监测与应急处置中心 | A kind of highway network constraint pathfinding algorithm of heuristic search |
| CN109540165B (en) * | 2018-11-26 | 2022-07-01 | 交通运输部路网监测与应急处置中心 | Heuristic search expressway network constraint routing algorithm |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101493330B (en) | Map vector data rarefying method in network navigation of mobile phone | |
| WO2020029601A1 (en) | Method and system for constructing transverse topological relationship of lanes in map, and memory | |
| US9689702B2 (en) | Navigation system with map mechanism and method of operation thereof | |
| US7526492B2 (en) | Data structure of map data, map data storage medium, map data updating method and map data processing apparatus | |
| CN101183006B (en) | Method for confirming remaining time of navigation system, device and navigation system | |
| CN102735239B (en) | Navigation device, method and system | |
| CN101256083A (en) | Method for selecting urban traffic network path based on dynamic information | |
| CN101694749A (en) | Method and device for speculating routes | |
| CN103542858A (en) | Method of estimating an ability of a vehicle to reach a target road segment, method of generating a database, and navigation system | |
| CN101720481A (en) | Method for displaying intersection enlargement in navigation device | |
| CN101874196A (en) | Navigation device | |
| CN104471352A (en) | Route generation device | |
| JP3386816B2 (en) | A system that combines elements into complex junctions and links in a road network representation for vehicles. | |
| CN101571403A (en) | Method and system for electronic map construction | |
| US20150100237A1 (en) | Navigation system with mode based mechanism and method of operation thereof | |
| CN102243811A (en) | Vehicle navigation system and recommended path searching method | |
| CN101603834A (en) | Method for information display and information display system based on walking navigation | |
| WO2021135147A1 (en) | Electronic horizon creation method and system | |
| CN111982111A (en) | Path data of navigation system | |
| CN110345964A (en) | Route matching method, apparatus, system and storage medium | |
| CN101603837A (en) | A kind of guidance path computing method, device and guider | |
| CN101581585A (en) | Walk-based navigation device and navigation method | |
| TW201825870A (en) | Method and device for acquiring traffic information and non-transitory computer-readable storage medium | |
| CN101246014A (en) | Voice navigation device | |
| CN102768353A (en) | Method and system for location and searching of vehicles by NFC (near field communication) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20091216 |