CN103376116A - Scenic route planning in vehicle navigation - Google Patents
Scenic route planning in vehicle navigation Download PDFInfo
- Publication number
- CN103376116A CN103376116A CN2012101113192A CN201210111319A CN103376116A CN 103376116 A CN103376116 A CN 103376116A CN 2012101113192 A CN2012101113192 A CN 2012101113192A CN 201210111319 A CN201210111319 A CN 201210111319A CN 103376116 A CN103376116 A CN 103376116A
- Authority
- CN
- China
- Prior art keywords
- route
- buffer zone
- scenic
- link
- vehicle
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Navigation (AREA)
Abstract
The invention relates to scenic route planning in vehicle navigation. A method for planning a route comprises the following steps of: generating a route buffering region, judging whether a link is in the route buffering region, and if the link is in the route buffering region, automatically indicating a user that the route can be planned.
Description
Technical field
The present invention relates to navigation field, and relate in particular to the scenic route planning in the automobile navigation.
Background technology
Path planning is exactly according to specifically digit track road network information and Real-time Traffic Information are that vehicle is cooked up the optimal path that arrives impact point.So-called optimum can be the best on the shortest, temporal the fastest, the economizing most economically on the distance, the minimum number of turning round or other meanings.Following several priority mode is arranged at present usually:
● time priority (or preferential at a high speed)
Be the path that vehicle to run road shortest time is calculated.
● distance priority
For making the shortest path of calculating of vehicle to run road distance.
● minimum charge
For make the vehicle to run road avoid toll road as far as possible, so that user's Trip Costs is minimum.
● do not walk at a high speed
For make the vehicle to run road avoid super expressway as far as possible, like this such as when the greasy weather seals at a high speed greatly, the user can try one's best and not walk high speed road arrival destination.
Above-mentioned planning strategy can satisfy most of users' demand.But along with the rise of the self-service trip of driving in recent years, the user wishes can appreciate on the way landscape on the way when arriving the destination, bring enjoyment and life for very long journey life.Based on this, we have introduced a kind of brand-new planning strategy for user selection, i.e. the planning of " scenic route " in the automobile navigation.As its name suggests, " scenic route " planning is and makes try one's best the away Planning Model of landscape route road of vehicle to run road.
Above-mentioned scenic route planning is different from tourism route planning.Tourism route planning refers to that tourist service department is visitor's design organization travelling tour.Programme path to the visitor should be most economical, the most convenient, save time most, inner capacities is rich and varied, tour distribute rationally, density interphase, do not walk the round road of retrogression, make whole route be full of temperament and interest, rich timing etc.Tourism route planning is the design to sight spot route in the tourism route, its objective is as guaranteeing the convenient abundant of tourist activity route.Carry out this planning, its main input data information is each tourist attractions.Scenic route planning stresses also to arrive the destination optimal route providing for the user, when making things convenient for the user to go on a journey, takes into account scenic route road on the way.Carry out scenic route planning, require to identify in the data in navigation electronic map road of scenic route attribute.As seen, it is different from the emphasis of scenic route planning that tourism route is planned, the former is basic input take tourist attractions, and the latter inputs as basic take the scenic route road in the map of navigation electronic.Fig. 1 shows the comparison between the two.
The scenic route of all not describing in the automobile navigation in the existing document of publishing is at present planned as a kind of new application scenarios.Existing Vehicular navigation system generally only provides time priority, distance priority, minimum charge, do not walk the high speed isotactic plans slightly for user selection, can't carry out scenic route planning, so path planning can not satisfy the demand of " the landscape route road of trying one's best away ".
In addition, if a kind of preference strategy of middle increase is set for user selection at programme path, also can realize scenic route planning.As shown in Figure 2.But this implementation mainly contains following shortcoming:
● whenever increase a kind of new strategy in the navigation map memory model newly, have a large amount of precompile contents based on this strategy, cause data volume sharply to increase, the newly-increased data volume of common a kind of strategy can reach hundreds of MB.
● when " All Policies " simultaneously during calculated route, newly-increased a kind of strategy just means wants calculate simultaneously a route more, and the amount of ram increase is used in planning, and planning time is elongated.
● with " scenic route " as a kind of tactful optional time, then the user can carry out scenic route planning any time, be " scenic route " road and in fact only have the small part road in the map datum, still carry out by force scenic route planning in the far place of distance " scenic route " road, programme path is because detour too far away, rationality is not good enough, and the landscape plan route practical significance of this moment is little.As shown in Figure 3.
Summary of the invention
According to an aspect of the present invention, a kind of method for programme path comprises: generate the route buffer zone; Judge that link is whether in described route buffer zone; And if described link then can be planned described route to user's automatic-prompting in described route buffer zone.
According to an aspect of the present invention, wherein, described route is scenic route, and described route buffer zone is the scenic route buffer zone, and described link is the link at the current place of vehicle.
According to an aspect of the present invention, wherein, described prompting comprises and show to be used for planning that the selectable project of described route and/or voice suggestion can plan described route.
According to an aspect of the present invention, wherein, when described vehicle enters described route buffer zone, only once carry out described voice suggestion.
According to an aspect of the present invention, wherein, when after described vehicle leaves described route buffer zone, entering another route buffer zone, only once carry out described voice suggestion.
According to an aspect of the present invention, also comprise: the position of described vehicle when recording the time when carrying out described voice suggestion and/or carrying out described voice suggestion, and when after described vehicle leaves described route buffer zone, entering again described route buffer zone, time when carrying out described voice suggestion and the comparison of current time and/or the comparison of the current location of the position of described vehicle and described vehicle when carrying out described voice suggestion judge whether to carry out again described voice suggestion.
According to an aspect of the present invention, wherein, by the expansion of the both sides along described route to described route preset distance, generate described route buffer zone.
According to an aspect of the present invention, also comprise: if described user selects to carry out the planning of described route based on described prompting, then the described vehicle of constraint based must via the virtual route of link node via point, plan described route.
According to an aspect of the present invention, wherein, in the attribute data of described link, identify described link with 2 data bit and whether be in described scenic route and the described scenic route buffer zone.
According to another aspect of the present invention, a kind of device for programme path comprises: generation module is used for generating the route buffer zone; Judge module is used for judging that whether link is at described route buffer zone; And reminding module, if be used for described link at described route buffer zone, then automatic-prompting can be planned described route.
Description of drawings
Fig. 1 shows the comparison between scenic route planning and the tourism route planning;
Fig. 2 shows the diagram that middle increase scenic route planning strategy is set at traditional programme path;
Fig. 3 shows the diagram of still carrying out by force scenic route planning in the far place of distance " scenic route " road;
Fig. 4 shows the diagram that does not increase the scenic route planning strategy in programme path arranges based on " but the prompting of scenic route time spent " application scenarios according to the embodiment of the invention;
Fig. 5 shows the process flow diagram based on the route planning of " but scenic route time spent prompting " application scenarios according to the embodiment of the invention;
Fig. 6 shows the Technical Architecture figure according to the scenic route planning that comprises data compilation stage and navigation application stage of the embodiment of the invention;
Fig. 7 shows the synoptic diagram according to the scenic route buffer zone of the embodiment of the invention;
Fig. 8 shows the synoptic diagram that generates the scenic route buffer zone according to the expansion along the scenic route road to both sides of the embodiment of the invention;
Fig. 9 shows the synoptic diagram according to the comparison of the Link of the embodiment of the invention and SrchLink;
Figure 10 shows three kinds of synoptic diagram of expanding the state conversion of shape NEW, OPEN, CLOSE according to the Srchlink in the road expansion process of the embodiment of the invention;
Figure 11 shows and initial extension Link tabulation is joined synoptic diagram in the OPEN formation according to the embodiment of the invention;
Figure 12 shows and road expansion is limited in synoptic diagram in the buffer zone scope according to the embodiment of the invention;
Figure 13 shows the process flow diagram according to the generation of the scenic route buffer zone of the embodiment of the invention;
Figure 14 shows the cost synoptic diagram relatively according to the scenic route of the embodiment of the invention and non-scenic route;
Figure 15 shows according to the automatic establishment scenic route of the embodiment of the invention synoptic diagram via point;
Figure 16 shows according to the vehicle of the embodiment of the invention to the synoptic diagram of virtual landscape route via the route of point;
Figure 17 shows according to the virtual landscape route of the embodiment of the invention via the synoptic diagram of point to the destination route;
Figure 18 shows the synoptic diagram according to the merging scenic route of the embodiment of the invention;
Figure 19 show according to the embodiment of the invention to be segmented into the overall construction drawing of cellular organization's route programming result;
Figure 20 shows the synoptic diagram according to the scenic route indication of the embodiment of the invention;
Figure 21 shows the synoptic diagram according to the indication between two landscape buffer zones of the embodiment of the invention; And
Figure 22 shows the process flow diagram according to the scenic route indication of the embodiment of the invention.
Embodiment
Based on above discussion, newly-increased " scenic route " tactful mode is not a kind of desirable application model.In fact, all launchable when scenic route planning is not any, only when (such as 10KM) had " scenic route " road near the certain limit driving vehicle, it was just fair and sensible to carry out scenic route planning this moment.Therefore the present invention has introduced a kind of new application scenarios, i.e. " but the prompting of scenic route time spent ".Compare with direct newly-increased " scenic route " tactful mode, difference is: do not add " scenic route " strategy in the planning option, namely the user can not carry out scenic route planning during initial plan, as shown in Figure 4.
In this case, vehicle is route running routinely still, in the time of near vehicle arrives scenic route, navigational system route guidance module automatically prompting user " can carry out scenic route planning " this moment, recomputates route by " scenic route " pattern of trying one's best away after confirming.This application scenarios as shown in Figure 5.
Above application scenarios has following advantage: not newly-increased strategy during initial plan need not to increase the compiling data; When many strategies are planned simultaneously, can not affect path planning speed and EMS memory occupation amount because of newly-increased strategy; But the scenic route time spent points out: usually the user and do not know near whether scenic route is arranged, being automatically identified by navigational system has near the vehicle scenic route and prompting user to carry out scenic route planning, can avoid like this user carrying out blindly scenic route planning without " scenic route " area, even if or near when " landscape " route is arranged, do not know in time to enable scenic route planning yet; And scenic route planning rationally: by scenic route buffer zone scope (such as 10KM), guaranteed only when " scenic route " arranged near the vehicle, just can enable scenic route planning, programme path is relatively reasonable, can be too not far away around getting because of walking landscape route road.
Fig. 6 shows the Technical Architecture figure of the scenic route planning that comprises data compilation stage and navigation application stage.PSF among Fig. 6 (physical storage format) refers to consider based on efficient and internal memory, is used for fast access storage data in the navigational system and predefined Method of Data Organization, and the typical physical storage format has KIWI.Data compilation refers to data in navigation electronic map is converted to the process of physical storage format (PSF), and the data that data compilation generates are in the navigation engine.Road (segmental arc, Link (link)) has unique numbering, it is a section of the real roads cut apart by node, can be with road type (super expressway, ring road, ordinary road etc.), category of roads is (according to the road importance rate of road type and road width setting, higher grade, importance is higher), link length, road name, the road driving direction, (first node is starting point to the numbering of two link nodes, second node is terminal point, and the direction of origin-to-destination is exactly the road driving direction), the information recording /s such as connection point of interest numbered list are in attribute data.Node (Node) has unique numbering, the intersection point of two or more pieces road, and can be with information recording /s such as node type (super expressway entrance, super expressway outlet, super expressway difference, ordinary road point of crossing etc.), traffic regulation, the road number tabulations that continues in attribute data.Satnav and road coupling refers to receive satellite-signal, and calculate the longitude and latitude when vehicle in front by vehicle GPS (GPS) receiver, and according to longitude and latitude and the road network data of vehicle, vehicle is matched on the road.As can be seen from Figure 6, the core content of scenic route planning relates generally to three broad aspect, i.e. the generation of (I) scenic route buffer zone; (II) scenic route planning algorithm; (III) scenic route indication.Below emphatically these three aspects are described.
(I) generation of scenic route buffer zone
When " road attribute " field value is scenic route in data in navigation electronic map, identify this road and be the scenic route road in the data acquisition, the scenic route road is some continuous roads usually.The scenic route buffer zone refers to all roads of in " scenic route " road periphery certain distance scope (such as 10KM).As shown in Figure 7.
1) scenic route buffer stores structure
Item types in the table 1 " B " expression storage unit is " position ", represents with two that in road attribute the 2nd, the 3rd is respectively scenic road buffer flag and scenic road sign.When road is scenic road, it also is simultaneously scenic road buffering internal road.
Table 1
2) effect of scenic route buffer zone
The scenic route buffer zone is the work of finishing in the Route Planning Data compilation phase, is used for navigational system and finds near the vehicle scenic route road is arranged.After Vehicle Driving Cycle enters the scenic route buffer zone, mean that from the scenic route road also just within sight the navigation guide module just needs prompting user can carry out scenic route planning.
3) scenic route Buffer Generating Algorithm
Scenic route buffer zone generative process is actually a road expansion process.Can be envisioned as visually: along all scenic route roads simultaneously to the both sides expansion, when extended range exceeds 10KM, expand and stop, as shown in Figure 8.
The road expansion algorithm can point-to-point transmission shortest path Di Jiesitela (Dijkstra) algorithm be the basis.The statement that the Di Jiesitela algorithm is general has dual mode usually: the permanent and interim label mode of a kind of usefulness, and a kind of with OPEN, CLOSE table mode.Rear a kind of mode more is applicable to map of navigation electronic and uses, and roughly process is as follows for it:
Create two table: OPEN tables, CLOSE table.Preserve all in the OPEN table and generated and the node do not investigated the node that record had been investigated in the CLOSE table.
(1) in the access road network apart from starting point recently and the point that is not inspected, this point is put into OPEN shows medium examine.
(2) from the OPEN table, take out apart from the nearest point of starting point, find out all child nodes of this point, this point is put in the CLOSE table.
(3) traversal is investigated the child node of this point.Obtain these child nodes apart from the distance value of starting point, child node is put into the OPEN table.
(4) repeat (2), (3) two steps, until the OPEN table is sky, or find impact point.
But because the Di Jiesitela algorithm is used for asking the shortest path of point-to-point transmission, for adapting to the scenic route Buffer Generating Algorithm, in the present embodiment this algorithm is adjusted, is mainly contained following content:
(1) expansion Link (SrchLink) organization definition
We represent road in the real world with Link, relative Link, SrchLink then is used for expressing the road of Path extension process, the information such as the state of record SrchLink, direction, cost, the corresponding SrchLink of one-way trip road, when being the opposing traffic road, a Link is to there being two SrchLink.The synoptic diagram of Link and SrchLink has been shown among Fig. 9.
Recorded the information such as state, direction, cost of SrchLink in the following table 2.
Table 2
Can find out that from upper table 2 Srchlink has three kinds of extended mode: NEW, OPEN, CLOSE, in table 3, these three kinds of extended modes are illustrated:
Table 3
Figure 10 shows the three kinds of synoptic diagram of expanding the state conversion of shape NEW, OPEN, CLOSE of the Srchlink in the road expansion process.
(2) initial extension Link tabulation determines
Because will expand to both sides from all scenic route roads, so all scenic route roads can be set its initial cost (distance) value and be 0 as the initial Link of expansion, all join in the OPEN formation.Storage of array is adopted in the OPEN formation, as shown in figure 11.
(3) restriction of road expansion algorithm and spreading range
Taking out the heap top element (minimum cost is arranged) of OPEN formation, is the CLOSE state with this SrchLink status modifier.Expand all roads that continue of this road, calculate the continue cost Cumulative Distance of the road that continues (namely to) of road of each bar, and carry out different processing according to the current extended mode of the road that continues:
NEW: if do not exceed scenic route buffer zone scope, then add the OPEN formation, change to the OPEN state.After adding new element, the OPEN formation re-starts heapsort, to guarantee heap top element Least-cost.
OPEN: represent to have expanded arrival before this SrchLink, if current SrchLink cost is less than original cost, it is more excellent that expression arrives this SrchLink from current path, meets SrchLink before then revising it, and cost is updated to new cost, otherwise its cost is constant.If the change of SrchLink cost, the OPEN formation needs rearrangement.
CLOSE: represent that this SrchLink closes, need not to process.
For guaranteeing not exceed in the road expansion process distance limit (such as 10KM) of landscape buffer zone, if to the Cumulative Distance of this road greater than 10KM, then this road does not join the OPEN formation, as shown in figure 12.
(4) expansion end condition
When all elements in the OPEN formation is expanded when complete, the OPEN formation is empty, and expansion finishes.
(5) having expanded the road tabulation obtains
In the road expansion process, the Link that adds the OPEN formation is saved in expands in the road tabulation, all have been expanded road and have been road in the landscape buffer zone scope.Travel through all and expanded road, be set to the scenic route buffer flag.
Figure 13 shows the process flow diagram of the generation of above-mentioned scenic route buffer zone.
(II) scenic route planning algorithm
1) priority of raising " scenic route " road in the path computing
Carry out " scenic route " when planning, for making the vehicle to run road landscape route road of trying one's best away, by in path computing, improving the priority of " scenic route " road, can be so that programme path be tried one's best away " scenic route " road.When calculating the road cost, allow " scenic route " road that less cost is arranged, can improve its priority.
When calculating scenic route and current road when satisfying the demand simultaneously and being the condition of scenic route road, can calculate scenic route road cost by following formula:
" scenic route " road cost=original cost/100.
2) the virtual landscape route is via point
In the present embodiment, introduce the virtual landscape route via having put.This be because, even improve the priority of " scenic route " road in path computing, because " scenic route " road cost is less, its value can not be negative, minimum value can be 0.If will walk its cost of " scenic route " road this moment still greater than the cost of other route, then programme path just can not walked " scenic route " road.For example, as shown in Figure 14, when not walking the landscape route, its cost summation is 8+6+10=24, and when walking the landscape route, its cost summation is: 15+9+0+0+16+13=53.As seen, even scenic route road priority is improved, its cost is set to minimum value 0, but because detour, total its cost (53) is still greater than the total cost of non-scenic route (24).Generate programme path according to total Least-cost principle, then still can not walk landscape route road among the programme path result.
Therefore, for guaranteeing programme path by way of " scenic route " road, pass through to increase the virtual landscape route in the present embodiment via point mode, so that via putting on the scenic route road.Because be that of arranging in the programme path must reach intermediate point via point, it has limited programme path must be via the scenic route road.With the user arrange corresponding via point, the scenic route that is automatically created by program is referred to as the virtual landscape route via point via point.
The virtual landscape route,, joins this road in the OPEN formation from current vehicle location for for example via the establishment mode of putting, and adopts the expansion algorithm in the similar scenic route Buffer Generating Algorithm, when the arrival road has the scenic route attribute, stops expansion.A leaf that takes out the scenic route road as scenic route via point.Automatic establishment scenic route has been shown via the synoptic diagram of point among Figure 15.
3) the planning vehicle is to the route of virtual landscape route via point
After establishment virtual landscape route was finished via point, the taking-up vehicle got final product to the route of scenic route road.Vehicle has been shown to the synoptic diagram of virtual landscape route via the route of point among Figure 16.
4) planning virtual landscape route arrives the destination route via point
Planning virtual landscape route comprises to the destination route via point: take the virtual landscape route via point as the departure place, original programme path destination remains unchanged; Set the current scenic route planning that is planned to, to improve the priority of scenic route road; And call path planning algorithm and recomputate route.Inter-two-point path is calculated as the navigational system basic function, and in this not go into detail.The virtual landscape route has been shown via the synoptic diagram of point to the destination route among Figure 17.
5) merge two sections programme paths
By two sections programme paths (starting point->the virtual landscape route is via point, represent with RoutPart1; The virtual landscape route via point->terminal point, represent with RoutPart2) be merged into complete scenic route planning algorithm, as shown in Figure 18.
Route programming result is take segmentation (segment) as cellular organization, and a segmentation represents to have on the programme path the continuous highway section of same link title.General structure as shown in Figure 19.
According to following formula the scenic route overall information is merged:
Overall dimension=RoutPart1 overall dimension+RoutPart2 overall dimension;
Estimate that operating range=RoutPart1 estimates that operating range+RoutPart2 estimates operating range;
Estimate that running time=RoutPart1 estimates that running time+RoutPart2 estimates running time;
Segmentation number=RoutPart1 segmentation number+RoutPart2 segmentation number; And
Choose Link information=RoutPart1 starting point to choose Link information+RoutPart2 terminal point to choose Link information.
Based on following steps scenic route segmentation list information is merged: the traversal starting point joins in the scenic route after the merging to scenic route all segmentations via a programme path; The traversal scenic route, joins in the scenic route after the merging to all segmentations of terminal point programme path via point; And for the fragment sequence number in the scenic route after merging again from 0 open numbering.
(III) scenic route indication
Vehicle travels at programme path, when place Link is positioned at landscape buffer zone scope, automatically reports near voice suggestion " scenic route is arranged, can carry out scenic route planning "; Show " scenic route planning " button in man-machine interface (HMI) simultaneously, the user can click this button and carry out scenic route planning.The signal process of scenic route indication as shown in Figure 20.
In one embodiment, show that for " scenic route planning " button each circulation of Route guiding all judges whether to show " scenic route planning " button.At first read when the GPS of vehicle in front point and road and mate, the Link that matches is exactly when vehicle in front place road.When if vehicle place LINK has landscape buffer zone sign, send particular message and show " scenic route planning " button to HMI; When if place Link identifies without the landscape buffer zone, send another particular message to HMI cancellation " scenic route planning " button.
In one embodiment, for scenic route voice broadcast frequency control, the separation standard of scenic route voice broadcast prompting is: follow-up prompts not in same landscape buffer zone; In next landscape buffer zone, re-start prompting.Figure 21 shows the synoptic diagram of two indications between the landscape buffer zone.
In one embodiment, each scenic route buffer zone has unique ID (from 0 open numbering), records scenic route buffer zone ID (ScenicAreaID) at road.When road place ScenicAreaID changes, restart the prompting of scenic route voice broadcast.For avoiding Vehicle Driving Cycle when the scenic route buffer zone border, frequently point out during turnover scenic route buffer zone, also need satisfy the regular hour (or distance) interval, do not point out every interior during this time.When the interval type was the time, the time of record prompting last time after each prompting, each Route guiding circulation time was judged.If current in the landscape buffer zone, then will point out last time the interval time of this Route guiding circulation and standard value to compare, then do not point out less than standard value, otherwise prompting.When the interval type be apart from the time, the position of record prompting last time point after each prompting, each Route guiding circulation time is judged.If current in the landscape buffer zone, then will point out last time the distance that a little arrives current point to compare with standard value, then do not point out less than standard value, otherwise prompting.
Following table 4 shows relevant data structure.
Table 4
Figure 22 illustrates the process flow diagram according to the scenic route indication of the embodiment of the invention.
Technical scheme according to the embodiment of the invention has realized following technique effect: by introduce the scenic route planning function in navigational system, the user is when arriving the destination, also can appreciate on the way landscape on the way, greatly enrich user's experience, expand the navigation application field; Adopt the application scenarios of " but the prompting of scenic route time spent ", have superiority at planning rationality, planning efficiency, compiling data file size everyway; Data compilation is quick.When " scenic route " buffer zone generated, because only need to expand the interior road (such as 10KM) of scenic route periphery certain limit, the hunting zone was little, and compilation speed is very fast; The extra scenic route data that increase, data volume is little; Only need to increase by two (bit) in every Link attribute and identify scenic route road and scenic route buffer zone road, and the scenic route planning efficiency is high.Carry in the navigational system and can be applied to front entrucking based on the scenic route planning that the present invention realizes, enriched widely user's journey life.
Presented for the purpose of illustration and description above content, but above content is not limit or exemplary.Many modifications and changes all are apparent for persons skilled in the art.Selecting and describing above content is in order to explain purport of the present invention and practical application, and can carry out various modifications to above content of the present invention so that persons skilled in the art can be understood, the concrete application of being conceived to be suitable for.
Claims (18)
1. method that is used for programme path comprises:
Generate the route buffer zone;
Judge that link is whether in described route buffer zone; And
If described link then can be planned described route to user's automatic-prompting in described route buffer zone.
2. the method for claim 1, wherein:
Described route is scenic route, and described route buffer zone is the scenic route buffer zone, and described link is the link at the current place of vehicle.
3. method as claimed in claim 2, wherein:
Described prompting comprises and show to be used for planning that the selectable project of described route and/or voice suggestion can plan described route.
4. method as claimed in claim 3, wherein:
When described vehicle enters described route buffer zone, only once carry out described voice suggestion.
5. method as claimed in claim 3, wherein:
When after described vehicle leaves described route buffer zone, entering another route buffer zone, only once carry out described voice suggestion.
6. method as claimed in claim 4 also comprises:
The position of described vehicle when recording the time when carrying out described voice suggestion and/or carrying out described voice suggestion, and when after described vehicle leaves described route buffer zone, entering again described route buffer zone, time when carrying out described voice suggestion and the comparison of current time and/or the comparison of the current location of the position of described vehicle and described vehicle when carrying out described voice suggestion judge whether to carry out again described voice suggestion.
7. such as any one the described method in the claim 1 to 6, wherein:
By the expansion of the both sides along described route to described route preset distance, generate described route buffer zone.
8. such as any one the described method in the claim 2 to 6, also comprise:
If described user selects to carry out the planning of described route based on described prompting, then the described vehicle of constraint based must via the virtual route of link node via point, plan described route.
9. such as any one the described method in the claim 2 to 6, wherein, in the attribute data of described link, identify described link with 2 data bit and whether be in described scenic route and the described scenic route buffer zone.
10. device that is used for programme path comprises:
Generation module is used for generating the route buffer zone;
Judge module is used for judging that whether link is at described route buffer zone; And
Reminding module, if be used for described link at described route buffer zone, then automatic-prompting can be planned described route.
11. device as claimed in claim 10, wherein:
Described route is scenic route, and described route buffer zone is the scenic route buffer zone, and described link is the link at the current place of vehicle.
12. device as claimed in claim 11, wherein:
Described prompting comprises and show to be used for planning that the selectable project of described route and/or voice suggestion can plan described route.
13. device as claimed in claim 12, wherein:
When described reminding module enters described route buffer zone at described vehicle, only once carry out described voice suggestion.
14. device as claimed in claim 12, wherein:
When described reminding module enters another route buffer zone after described vehicle leaves described route buffer zone, only once carry out described voice suggestion.
15. device as claimed in claim 13 also comprises:
Record and comparison module, the position of described vehicle when being used for the time when carrying out described voice suggestion of recording and/or carrying out described voice suggestion, and when after described vehicle leaves described route buffer zone, entering again described route buffer zone, time when carrying out described voice suggestion and the comparison of current time and/or the comparison of the current location of the position of described vehicle and described vehicle when carrying out described voice suggestion judge whether to carry out again described voice suggestion.
16. such as any one the described device in the claim 10 to 15, wherein:
Described generation module generates described route buffer zone by the expansion of the both sides along described route to described route preset distance.
17. any one the described device as in the claim 11 to 15 also comprises:
Planning module selects to carry out the planning of described route if be used for described user based on described prompting, then the described vehicle of constraint based must via the virtual route of link node via point, plan described route.
18. such as any one the described device in the claim 11 to 15, wherein, in the attribute data of described link, identify described link with 2 data bit and whether be in described scenic route and the described scenic route buffer zone.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210111319.2A CN103376116B (en) | 2012-04-16 | 2012-04-16 | Scenic route planning in automobile navigation |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201210111319.2A CN103376116B (en) | 2012-04-16 | 2012-04-16 | Scenic route planning in automobile navigation |
Publications (2)
Publication Number | Publication Date |
---|---|
CN103376116A true CN103376116A (en) | 2013-10-30 |
CN103376116B CN103376116B (en) | 2016-10-05 |
Family
ID=49461583
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201210111319.2A Active CN103376116B (en) | 2012-04-16 | 2012-04-16 | Scenic route planning in automobile navigation |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103376116B (en) |
Cited By (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104596527A (en) * | 2013-10-31 | 2015-05-06 | 北京四维图新科技股份有限公司 | A method of dividing guiding roads at different levels and detailed streets |
CN105184422A (en) * | 2015-09-28 | 2015-12-23 | 华南理工大学 | Intelligent tour route planning auxiliary method based on internet word frequency |
CN105205559A (en) * | 2015-09-25 | 2015-12-30 | 重庆大学 | Scenery itinerary route planning system based on multi-source heterogeneous crowd-sourced data |
CN106056701A (en) * | 2016-06-30 | 2016-10-26 | 北京小米移动软件有限公司 | Prompting method and promoting apparatus |
CN107545316A (en) * | 2016-06-27 | 2018-01-05 | 高德信息技术有限公司 | A kind of route inquiry method and device |
CN108663060A (en) * | 2017-04-01 | 2018-10-16 | 北京搜狗科技发展有限公司 | It is a kind of navigation processing method and device, a kind of for the device handled that navigate |
CN110019576A (en) * | 2017-08-08 | 2019-07-16 | 北京亿阳信通科技有限公司 | Navigation area modeling method and device |
CN111024101A (en) * | 2018-10-10 | 2020-04-17 | 上海擎感智能科技有限公司 | Navigation path landscape evaluation method and system, storage medium and vehicle-mounted terminal |
CN117575118A (en) * | 2023-10-30 | 2024-02-20 | 江苏科学梦创展科技有限公司 | Method for planning visit route of science and technology museum |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060089788A1 (en) * | 2004-10-22 | 2006-04-27 | Tom Laverty | Method and apparatus for navigation system for searching easily accessible POI along route |
JP2007040721A (en) * | 2005-07-29 | 2007-02-15 | Navitime Japan Co Ltd | Navigation system, poi searching method, information delivery server, and portable terminal |
CN101236095A (en) * | 2008-03-06 | 2008-08-06 | 倚天资讯股份有限公司 | Navigation system |
CN101270998A (en) * | 2007-03-20 | 2008-09-24 | 联发科技(合肥)有限公司 | Electronic device and method for reminding interest point according to road section |
CN101881618A (en) * | 2009-05-06 | 2010-11-10 | 神达电脑股份有限公司 | Method for implementing highlight indication of implementing personal navigation device |
-
2012
- 2012-04-16 CN CN201210111319.2A patent/CN103376116B/en active Active
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060089788A1 (en) * | 2004-10-22 | 2006-04-27 | Tom Laverty | Method and apparatus for navigation system for searching easily accessible POI along route |
JP2007040721A (en) * | 2005-07-29 | 2007-02-15 | Navitime Japan Co Ltd | Navigation system, poi searching method, information delivery server, and portable terminal |
CN101270998A (en) * | 2007-03-20 | 2008-09-24 | 联发科技(合肥)有限公司 | Electronic device and method for reminding interest point according to road section |
CN101236095A (en) * | 2008-03-06 | 2008-08-06 | 倚天资讯股份有限公司 | Navigation system |
CN101881618A (en) * | 2009-05-06 | 2010-11-10 | 神达电脑股份有限公司 | Method for implementing highlight indication of implementing personal navigation device |
Cited By (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104596527A (en) * | 2013-10-31 | 2015-05-06 | 北京四维图新科技股份有限公司 | A method of dividing guiding roads at different levels and detailed streets |
CN104596527B (en) * | 2013-10-31 | 2017-08-11 | 北京四维图新科技股份有限公司 | A kind of method for dividing guiding roads at different levels and Xi Jie roads |
CN105205559A (en) * | 2015-09-25 | 2015-12-30 | 重庆大学 | Scenery itinerary route planning system based on multi-source heterogeneous crowd-sourced data |
CN105184422A (en) * | 2015-09-28 | 2015-12-23 | 华南理工大学 | Intelligent tour route planning auxiliary method based on internet word frequency |
CN107545316A (en) * | 2016-06-27 | 2018-01-05 | 高德信息技术有限公司 | A kind of route inquiry method and device |
CN106056701A (en) * | 2016-06-30 | 2016-10-26 | 北京小米移动软件有限公司 | Prompting method and promoting apparatus |
CN108663060A (en) * | 2017-04-01 | 2018-10-16 | 北京搜狗科技发展有限公司 | It is a kind of navigation processing method and device, a kind of for the device handled that navigate |
CN110019576A (en) * | 2017-08-08 | 2019-07-16 | 北京亿阳信通科技有限公司 | Navigation area modeling method and device |
CN111024101A (en) * | 2018-10-10 | 2020-04-17 | 上海擎感智能科技有限公司 | Navigation path landscape evaluation method and system, storage medium and vehicle-mounted terminal |
CN117575118A (en) * | 2023-10-30 | 2024-02-20 | 江苏科学梦创展科技有限公司 | Method for planning visit route of science and technology museum |
CN117575118B (en) * | 2023-10-30 | 2024-05-28 | 江苏科学梦创展科技有限公司 | Method for planning visit route of science and technology museum |
Also Published As
Publication number | Publication date |
---|---|
CN103376116B (en) | 2016-10-05 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103376116A (en) | Scenic route planning in vehicle navigation | |
JP5810621B2 (en) | Road gradient data creation device, storage medium, and vehicle energy consumption prediction device | |
CN104677374B (en) | Multi-mode route planning | |
CN102538806B (en) | A kind of paths planning method and relevant device | |
JP5725810B2 (en) | Vehicle road guidance system and road guidance service method | |
CN103542858A (en) | Method of estimating an ability of a vehicle to reach a target road segment, method of generating a database, and navigation system | |
CN102435200B (en) | Rapid path planning method | |
JP5510233B2 (en) | Car navigation system | |
CN112964268A (en) | Method and system for obtaining multi-modal route | |
WO2012148556A2 (en) | Navigation to dynamic endpoint | |
CN104969034B (en) | Route search system, method for searching path and route searching program | |
CN111879329B (en) | Customized public transport passable shortest path calculation method based on A-x algorithm | |
CN105928535A (en) | Vehicle routing planning method capable of avoiding road restrictions | |
CN104508429A (en) | Route search system, route search apparatus, route search method, and computer program | |
JP6268751B2 (en) | Destination information providing system and method, and computer program | |
CN110440819A (en) | Air navigation aid, device and system | |
JPWO2010109762A1 (en) | NAVIGATION SYSTEM, NAVIGATION METHOD, COMPUTER PROGRAM FOR EXECUTING NAVIGATION METHOD, AND RECORDING MEDIUM CONTAINING THE COMPUTER PROGRAM | |
CN105160429A (en) | Multi-mode public transportation transfer method with virtual transfer micro-hubs | |
JP5966797B2 (en) | Route notification device and navigation device | |
CN110753917A (en) | Data processing method for realizing multi-hop car pooling | |
JP2938530B2 (en) | Route search method for navigation device | |
JP2002230680A (en) | System and method for traffic flow analysis and method and device for route retrieval | |
JP4367227B2 (en) | Car navigation system | |
JP6375859B2 (en) | Route search system, route search method and computer program | |
Kim et al. | Finding realistic shortest path in road networks with lane changing and turn restriction |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant |