CN102506886A - Method for realizing path planning in navigation equipment - Google Patents
Method for realizing path planning in navigation equipment Download PDFInfo
- Publication number
- CN102506886A CN102506886A CN2011103604404A CN201110360440A CN102506886A CN 102506886 A CN102506886 A CN 102506886A CN 2011103604404 A CN2011103604404 A CN 2011103604404A CN 201110360440 A CN201110360440 A CN 201110360440A CN 102506886 A CN102506886 A CN 102506886A
- Authority
- CN
- China
- Prior art keywords
- point
- path
- path planning
- planning
- origin
- 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
- 238000000034 method Methods 0.000 title claims abstract description 18
- 230000004888 barrier function Effects 0.000 description 1
- 230000002950 deficient Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
Images
Abstract
The invention provides a method for realizing path planning in navigation equipment, and relates to path planning in the traffic field, in particular to a path planning algorithm. The method is realized by relying on a processor in the navigation equipment, wherein a path planning graph and traffic rules of each intersection in the graph are stored in a memory matched with the processor. The method is characterized in that after a start point and an end point are determined, path planning comprises the steps as follows: according to a Dijkstra path planning principle, the path planning graph and the traffic rules of each intersection in the graph, paths from the start point to the end point is planned, and then paths from the end point to the start point are planned; and afterwards, successful paths in the two steps are selected as a planning result. By adopting the method, the technological degree of navigation data production can be reduced and the navigation performance can be improved.
Description
Technical field
The present invention relates to the algorithm of the path planning in the field of traffic, particularly path planning.
Background technology
Di Jiesitela algorithm (Dijkstra) ends now by Dutch computer scientist, and Hull Di Jiesitela (Edsger Wybe Dijkstra) invents.What algorithm solved is the shortest route problem that single source point arrives other summits in the digraph.If the vertex representation city among the figure, and the weight on the limit is represented intercity distance, this algorithm can be used for finding two shortest paths between the city.
The input of this algorithm has comprised a digraph G that weight is arranged, and we represent the set on all summits among the G with V.Limit among the figure is that two summits are formed has order elements to (Vi, Vj), Vi has the path to link to each other to Vj from the summit in expression.We represent the set on all limits with E, and then by weighting function w:E → [0, ∞] definition, weight can be represented distance to the weight on limit.Therefore, (Vi Vj) is exactly from the summit Vi distance of Vj to the limit to w.The distance of appointing inter-two-point path among the figure, be exactly on this path all limits apart from summation.V has summit V0 among the known figure, and the Di Jiesitela algorithm can find V0 to arrive the shortest path on every other summit.
When calculating V0 arrives the shortest path on other summits, carry out by following step:
1. at first, two vertex set S and T are set, S={V0}, all the other summits of T={ }, among the T the corresponding distance value in summit be d (V0, Vi), if having the limit to be connected between V0 and the Vi, then d (V0, Vi)=w (V0, Vj), otherwise, d (V0 Vi) is ∞,
2. from T, choose summit W, condition is that the distance value of W and V0 is minimum, and W is moved into S set from set T,
3. the distance value on summit among the T is made amendment: if adding W makes intermediate vertex, the distance value from V0 to Vi is shorter than the path that does not add W, then revises this distance value.
Repeat above-mentioned steps 2,3, in S, comprise all summits, promptly till the S=T.
This algorithm is adopted by a large amount of in navigation software because of the efficient of its algorithm.
The map that is used for path planning in the navigation software comes from the Traffic Net of reality; Therefore this figure is typical digraph; And use the Di Jiesitela algorithm to do in the process of path planning according to this figure, also must consider the traffic rules that comprise on each summit among the figure (being the crossing in the reality).Known navigation software path planning, the general planning principles of dispersing to terminal point that adopts from the starting point of path planning.Simultaneously in order to shorten the time of path planning; Improve the efficient of path planning; Often adopt from starting point and diffuse to the principle that terminal point promptly comes to an end, and in fact, such planning principles shortens the efficient of the time raising path planning of path planning often with the rationality of sacrificing path planning.
Because road network is a digraph; Usually there are traffic rules in crossing on road network simultaneously; Consider the characteristic of Di Jiesitela path planning algorithm: the summit of having confirmed shortest path can not be opened once more, so usually can cause the path planning failure from origin-to-destination, and its reason is: if two location points all are communicated to a common point; Then from the path planning process that common point is come, the road between these 2 can not found by algorithm.In Fig. 1, location point B and C are communicated to common point D through S4 and S5, then from D to the path planning process of B, C direction, the road S3 between B and the C can not found.
As shown in Figure 1, Start is a starting point, and End is a terminal point; Traffic rules regulation: can not arrive road S2 through the B point from road S4; We are according to Di Jiesitela path planning principle, from the Start point, when the G point, when the D point is opened successively; Start, G and D point are the set that the summit of shortest path is arranged
S={Start，G，D},
And End, A, B, C are the vertex set of confirming shortest path as yet,
T={End、A、B、C}。
The topological relation of ordering according to D is outwards dispersed once more from the D point and can be opened C point and B point, when C point and B point are opened,
S={Start，G，D，C，B}，
T={End、A}。
Suppose the distance that distance that the C point is ordered to Start is ordered to Start less than the B point; Therefore should disperse the C point earlier, but the summit that B point that our discovery links to each other with the C point and D point are shortest path is dispersed from the C point; Not had the summit can be opened once more, finishes to the C point via C point ground path planning; After getting rid of the C point; We can find that another summit that shortest path is arranged is B; The topological relation of ordering according to B; Outwards disperse the point that can open once more from the B point and have only the A point; But analyze B point ground traffic programme; Can not arrive S2 from S4 through the B point; Can confirm that so arriving path, B point ground from S4 can not open the A point; And the point that the B point does not exist other to open yet; Therefore can confirm; Arriving B point ground path planning via S4 finishes at the B point; Since then, the path planning that carries out in conjunction with the actual traffic rule according to Di Jiesitela path planning principle is all over, but the node that diffuses to from the Start point has only B; C; G; The D point; And A point and End point are not all diffused to, and that is to say from the Start point not have shortest path to the End point.And in fact we observe figure and can find: exist during from the Start point to path that End is ordered, both:
How to address the above problem, be ubiquitous technical barrier in the navigation software path planning algorithm.
Summary of the invention
For addressing the above problem; The present invention proposes following technical scheme: the method for realizing route planning in the navigator; The processor that depends in the navigator is realized; With the traffic rules that store each crossing among map and the figure in the supporting storage medium of processor, behind definite starting point and terminal point, path planning comprises following steps:
A, storage area SA is set,, reaches traffic rules according to the map and calculate path, and the result is dumped among the SA from origin-to-destination according to the Di Jiesitela principle,
B, storage area SB is set, according to the Di Jiesitela principle, reaches traffic rules according to the map, with the terminal point set to start with, the starting point of setting is as end, calculating path, and the result dumped among the SB,
Result among C, comparison SA and the SB if the path from origin-to-destination is arranged, gets wherein apart from the result of short path as this path planning; If have only a path, with the result of winner as this path planning from origin-to-destination; When all not from the path of origin-to-destination, the path planning failure.
More specifically, in step B, adopt traffic rules from the origin-to-destination direction.
Use this method; Carry out path planning from positive and negative both direction, can overcome the defective of " summit of having confirmed shortest path can not be opened once more " in the algorithm, principle is if certain bar road can not find from forward; From oppositely finding; So just can avoid having improved the navigation performance and the user experience of navigation software, reduce the technological degree that navigation data is produced simultaneously because of there being the failure problem of the caused path planning of similar Fig. 1 in the navigation data.
Description of drawings
Fig. 1 is a path planning figure.
Wherein: Start is a starting point, and End is a terminal point, and A, B, C, D, G are intermediate point; S1 is the road between End point and A point, and S2 is the road between A point and B point, and S3 is the road between B point and C point; S4 is the road between B point and D point; S5 is the road between C point and D point, and S6 is the road between D point and G point, and S7 is the road between G point and Start point.
Embodiment
The method of realizing route planning in the navigator, the processor that depends in the navigator realize, with the traffic rules that store each crossing among map and the figure in the supporting storage medium of processor, behind definite starting point and terminal point, path planning comprises following steps:
A, storage area SA is set,, reaches traffic rules according to the map and calculate path, and the result is dumped among the SA from origin-to-destination according to the Di Jiesitela principle,
B, storage area SB is set, according to the Di Jiesitela principle, reaches traffic rules according to the map, with the terminal point set to start with, the starting point of setting is as end, calculating path, and the result dumped among the SB,
Result among C, comparison SA and the SB if the path from origin-to-destination is arranged, gets wherein apart from the result of short path as this path planning; If have only a path, with the result of winner as this path planning from origin-to-destination; When all not from the path of origin-to-destination, the path planning failure.
In step B, adopt traffic rules from the origin-to-destination direction.
Below in conjunction with accompanying drawing the present invention is elaborated.
Example 1:, do not have special traffic rules in this example referring to Fig. 1.
Execution in step A at first: according to the traffic rules at each crossing among Di Jiesitela path planning principle, path planning figure and the figure, planning is from the path of origin-to-destination, and process is following:
Conclusion: use forward path planning, obtain Start and be to the route programming result of End:
Total distance is: S7+S6+S4+S2+S1
The above results is dumped among the SA of memory block.
Execution in step B1-B3 then: according to the traffic rules at each crossing among Di Jiesitela path planning principle, path planning figure and the figure, the path of planning from the terminal point to the starting point, process is following:
Conclusion: use reverse path planning, obtain S and be to the route programming result of E:
Total distance is: S7+S6+S4+S2+S1
The above results is dumped among the SB of memory block.
In step C, among SA and the SB, the path planning of origin-to-destination is consistent, adopts any one result all to can be used as programme path.
Example 2: referring to Fig. 1, at the B point traffic rules are arranged in this example: can not arrive S2 through the B point from S4.
Execution in step A at first: according to the traffic rules at each crossing among Di Jiesitela path planning principle, path planning figure and the figure, planning is from the path of origin-to-destination, and process is following:
Conclusion: the path that does not arrive E from S.
The above results is dumped among the SA of memory block.
Execution in step B then: according to the traffic rules at each crossing among Di Jiesitela path planning principle, path planning figure and the figure, the path of planning from the terminal point to the starting point, process is following:
Conclusion: use reverse path planning, obtain Start and be to the route programming result of End:
Total distance is: S7+S6+S5+S3+S2+S1
The above results is dumped among the SB of memory block.
In step C, adopt among the SB path from origin-to-destination as programme path.
In this example; As shown in Figure 1: in reverse path planning; End is a known point; According to End point ground road topological relation; The End point can open the A point; According to A point ground road topological relation, the A point can open the B point again, again according to B point ground road topological relation; The B point can open C point, D point; But because of there is the road rule that can not arrive S2 through S4 in the B point, so the B point can only open the C point, the C point can open the D point; The D point can open the G point; The G point can open the Start point, and when the Start point was opened, path planning finished.
Claims (2)
1. the method that realizing route is planned in the navigator; The processor that depends in the navigator is realized; With the traffic rules that store each crossing among map and the figure in the supporting storage medium of processor, it is characterized in that: behind definite starting point and terminal point, path planning comprises following steps:
A, storage area SA is set,, reaches traffic rules according to the map and calculate path, and the result is dumped among the SA from origin-to-destination according to the Di Jiesitela principle,
B, storage area SB is set, according to the Di Jiesitela principle, reaches traffic rules according to the map, with the terminal point set to start with, the starting point of setting is as end, calculating path, and the result dumped among the SB,
Result among C, comparison SA and the SB if the path from origin-to-destination is arranged, gets wherein apart from the result of short path as this path planning; If have only a path, with the result of winner as this path planning from origin-to-destination; When all not from the path of origin-to-destination, the path planning failure.
2. the method for realizing route planning in the navigator according to claim 1 is characterized in that: in step B, adopt the traffic rules from the origin-to-destination direction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110360440.4A CN102506886B (en) | 2011-11-15 | 2011-11-15 | Method for realizing path planning in navigation equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110360440.4A CN102506886B (en) | 2011-11-15 | 2011-11-15 | Method for realizing path planning in navigation equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102506886A true CN102506886A (en) | 2012-06-20 |
| CN102506886B CN102506886B (en) | 2014-03-05 |
Family
ID=46218993
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110360440.4A Expired - Fee Related CN102506886B (en) | 2011-11-15 | 2011-11-15 | Method for realizing path planning in navigation equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102506886B (en) |
Cited By (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104567854A (en) * | 2013-10-24 | 2015-04-29 | 中国科学院沈阳自动化研究所 | Planning method for crown block route facing transportation system of semiconductor production line |
| CN105496740A (en) * | 2016-01-08 | 2016-04-20 | 中国石油大学(华东) | Intelligent blind guiding device and blind guiding crutch provided with same |
| CN105628041A (en) * | 2015-12-18 | 2016-06-01 | 河南思维自动化设备股份有限公司 | Method for searching interlaced roads based on paths |
| CN106970415A (en) * | 2017-02-27 | 2017-07-21 | 中国石油天然气集团公司 | It is determined that method, device and the electronic equipment of the track of navigation focus |
| CN108303105A (en) * | 2017-11-22 | 2018-07-20 | 东莞产权交易中心 | Increase the method for path realizing route planning in navigation equipment |
| CN108303106A (en) * | 2017-11-22 | 2018-07-20 | 东莞产权交易中心 | The method that realizing route is planned in navigation equipment |
| CN108627166A (en) * | 2017-03-23 | 2018-10-09 | 高德信息技术有限公司 | A kind of navigation routine determines method and device |
| CN112201072A (en) * | 2020-09-30 | 2021-01-08 | 姜锡忠 | Urban traffic path planning method and system |
| CN115655281A (en) * | 2022-12-06 | 2023-01-31 | 亿海蓝（北京）数据技术股份公司 | Method and device for planning marine route and readable storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0679867A1 (en) * | 1994-04-28 | 1995-11-02 | Pioneer Electronic Corporation | Route searching method for vehicle navigation system |
| US5752217A (en) * | 1995-05-30 | 1998-05-12 | Nippondenso Co., Ltd. | Navigation system having optimal destination route setting capability |
| CN1920483A (en) * | 2005-08-25 | 2007-02-28 | 厦门雅迅网络股份有限公司 | Device for displaying road navigation track |
| CN1948909A (en) * | 2005-10-14 | 2007-04-18 | 沈阳东软软件股份有限公司 | Automobile guiding apparatus of compatible with left and right sides passing through and roadway exploring method thereof |
| CN101571995A (en) * | 2009-06-11 | 2009-11-04 | 东南大学 | Shortest path labeling algorithm considering intersection turning |
| CN101701830A (en) * | 2009-11-30 | 2010-05-05 | 四川虹微技术有限公司 | Navigation method of navigation terminal |
| CN101799301A (en) * | 2010-03-29 | 2010-08-11 | 东软集团股份有限公司 | Method and device for planning route by using route track point information |
-
2011
- 2011-11-15 CN CN201110360440.4A patent/CN102506886B/en not_active Expired - Fee Related
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0679867A1 (en) * | 1994-04-28 | 1995-11-02 | Pioneer Electronic Corporation | Route searching method for vehicle navigation system |
| US5752217A (en) * | 1995-05-30 | 1998-05-12 | Nippondenso Co., Ltd. | Navigation system having optimal destination route setting capability |
| CN1920483A (en) * | 2005-08-25 | 2007-02-28 | 厦门雅迅网络股份有限公司 | Device for displaying road navigation track |
| CN1948909A (en) * | 2005-10-14 | 2007-04-18 | 沈阳东软软件股份有限公司 | Automobile guiding apparatus of compatible with left and right sides passing through and roadway exploring method thereof |
| CN101571995A (en) * | 2009-06-11 | 2009-11-04 | 东南大学 | Shortest path labeling algorithm considering intersection turning |
| CN101701830A (en) * | 2009-11-30 | 2010-05-05 | 四川虹微技术有限公司 | Navigation method of navigation terminal |
| CN101799301A (en) * | 2010-03-29 | 2010-08-11 | 东软集团股份有限公司 | Method and device for planning route by using route track point information |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104567854A (en) * | 2013-10-24 | 2015-04-29 | 中国科学院沈阳自动化研究所 | Planning method for crown block route facing transportation system of semiconductor production line |
| CN105628041A (en) * | 2015-12-18 | 2016-06-01 | 河南思维自动化设备股份有限公司 | Method for searching interlaced roads based on paths |
| CN105628041B (en) * | 2015-12-18 | 2018-09-07 | 河南思维自动化设备股份有限公司 | The method for hooking cross-channel based on route searching |
| CN105496740A (en) * | 2016-01-08 | 2016-04-20 | 中国石油大学(华东) | Intelligent blind guiding device and blind guiding crutch provided with same |
| CN106970415A (en) * | 2017-02-27 | 2017-07-21 | 中国石油天然气集团公司 | It is determined that method, device and the electronic equipment of the track of navigation focus |
| CN108627166A (en) * | 2017-03-23 | 2018-10-09 | 高德信息技术有限公司 | A kind of navigation routine determines method and device |
| CN108303105A (en) * | 2017-11-22 | 2018-07-20 | 东莞产权交易中心 | Increase the method for path realizing route planning in navigation equipment |
| CN108303106A (en) * | 2017-11-22 | 2018-07-20 | 东莞产权交易中心 | The method that realizing route is planned in navigation equipment |
| CN112201072A (en) * | 2020-09-30 | 2021-01-08 | 姜锡忠 | Urban traffic path planning method and system |
| CN115655281A (en) * | 2022-12-06 | 2023-01-31 | 亿海蓝（北京）数据技术股份公司 | Method and device for planning marine route and readable storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102506886B (en) | 2014-03-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102506886B (en) | Method for realizing path planning in navigation equipment | |
| CN111770019B (en) | Q-learning optical network-on-chip self-adaptive route planning method based on Dijkstra algorithm | |
| CN107196858B (en) | K shortest path solving method considering multi-type constraints | |
| US20170346691A1 (en) | Network topology optimization | |
| WO2016083841A1 (en) | Optimizing the topology of a network with variable traffic demands | |
| CN112104558B (en) | Method, system, terminal and medium for implementing block chain distribution network | |
| Van Woensel et al. | Buffer and server allocation in general multi‐server queueing networks | |
| CN104219145A (en) | Network system and routing method | |
| CN113485429B (en) | Route optimization method and device for air-ground cooperative traffic inspection | |
| CN113570112B (en) | Optimization algorithm for solving vehicle path problem with time window considering cooperation | |
| CN107101645A (en) | A kind of paths planning method and path planning apparatus | |
| Smith et al. | Target assignment for robotic networks: Asymptotic performance under limited communication | |
| Du et al. | GAQ-EBkSP: a DRL-based urban traffic dynamic rerouting framework using fog-cloud architecture | |
| CN112308315A (en) | Multi-point intelligent path planning method and system | |
| CN110095134A (en) | It is a kind of using the preference of user as the method and system of the path planning of core and navigation | |
| CN102075582B (en) | Storage method for data storage model of credible cloud storage system | |
| CN108270672A (en) | A kind of method and device for calculating circuit routing | |
| CN105224501B (en) | The method and apparatus improved annulus torus network and its determine data packet transmission path | |
| CN112884254B (en) | Optimization method for automobile distribution path planning | |
| CN116127661A (en) | Path determination method, device, equipment and storage medium for terminal to access transformer substation | |
| CN104579963B (en) | A kind of optimization method and device being route between node | |
| Thyagarajan et al. | Planning dissimilar paths for military units | |
| JP5595342B2 (en) | Multiple path search method and apparatus | |
| Munoz et al. | Design of an Unstructured and Free Geo-Coordinates Information Brokerage System for Sensor Networks using Directional Random Walks. | |
| CN112957734B (en) | Map route searching method and device based on secondary search |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C53 | Correction of patent of invention or patent application | ||
| CB02 | Change of applicant information |
Address after: 3, 01-10 building, 518000 / F, Changhong technology building, 18 South twelve Road, Nanshan District, Guangdong, Shenzhen Applicant after: SHENZHEN ROADROVER TECHNOLOGY Co.,Ltd. Address before: Nineteen, 518000 building, Shuguang building, twelve South Road, Nanshan District hi tech Zone, Shenzhen, Guangdong Applicant before: Shenzhen RoadRover Technology Co.,Ltd. |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: APPLICANT; FROM: SHENZHEN ROADROVER TECHNOLOGY CO., LTD. TO: SHENZHEN ROADROVER TECHNOLOGY CO., LTD. |
|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140305 |