CN101236095A - Navigation system - Google Patents
Navigation system Download PDFInfo
- Publication number
- CN101236095A CN101236095A CNA2008100825009A CN200810082500A CN101236095A CN 101236095 A CN101236095 A CN 101236095A CN A2008100825009 A CNA2008100825009 A CN A2008100825009A CN 200810082500 A CN200810082500 A CN 200810082500A CN 101236095 A CN101236095 A CN 101236095A
- Authority
- CN
- China
- Prior art keywords
- sight spot
- module
- time
- planning
- information
- 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
A navigation system is used to automatically plan tours, which is characterized in that the navigation system comprises a storage module and a processing module, wherein the storage module is provided with a built-in electronic map which comprises a plurality of scenic spot information, the processing module receives a starting point information, a terminal point information, a starting time information starting from the starting point and a scheduled arrival time information for arriving the terminal point. And a route from the starting point to the terminal point is determined in the storage module, then at least one of scenic information, whether which is existed within a certain range on the route or not, is searched in the storage module, and a stay time of the scenic spot information is obtained. Further, at least one programmed scenic spot information, whether which is fit for stay from the starting point to the terminal point, is determined according to the route length, the starting time, the scheduled arrival time and the stay time of each of the scenic spot information.
Description
Technical field
The invention relates to a kind of navigational system, be meant a kind of navigational system that can plan tour schedule automatically especially.
Background technology
16th century initial stage astronomer Copernius proposes " heliocentric theory ", thinks that Earth moves around the sun, but not the sun changes around the earth, and this theory has shaken traditional church, causes lashing out greatly of church, refers to be the heterodoxy theory.Before that, Mai Zhelun is set out by Iberia, crosses the Atlantic, launches earth-circling heroic undertaking, and he orders funeral at the Philippines unfortunately, fail to be on one's native soil again, yet the descendant mention around the earth, refer to that all Mai Zhelun is first.In that big Maritime Navigation Era of 16th century, the marine exploration evoked how many dreamers, adventurer's lofty sentiments and lofty ideal, has the successful also someone of people to fail, against the accumulation of blood and tear, and the navigation map in the human world of painting out gradually.
Even to this day, the navigation map makes burning in silicon wafer by being drawn on the paper, people's hand is taken a portable type navigation product (PortableNavigation Device, PND), just can roam in each corner of the earth, and these navigation products are located by Global Positioning System (GPS) (GPS) usually.
For example the U.S. the 5th, 802, No. 492 patents have promptly disclosed the system of a kind of computer-aided planning stroke and location, and this system uses Global Positioning System (GPS) and locatees, and the mode of its planning stroke is to select each sight spot of thinking by the user, again a stroke planning is made at these sight spots.No. 93108815 patent application case of TaiWan, China for another example, it discloses a kind of automatic return setting method of global satellite positioning system apparatus, be when the starting point of backhaul and destination are just in time opposite with the destination with previous starting point, can not need reset starting point and destination, and the previous course of foundation is planned the route of backhaul, to save user's time and to develop efficiency.
Yet, knownly all only done considering on the place for above-mentioned two, but ignored the factor of time, therefore, how when the planning stroke, to consider place and user's time restriction simultaneously, be to be worth the problem of promoting.
Summary of the invention
Therefore, a purpose of the present invention is promptly providing a kind of navigational system of considering the when and where factor simultaneously.
So a kind of navigational system of the present invention is in order to automatic planning tour schedule, it is characterized in that this navigational system comprises:
One stores module, a built-in electronic chart, and contain a plurality of sight spot informations; And
One handles module, receives the specified time of arrival information that departure time information and one that an origin information, an endpoint information, one set out by this starting point arrives this terminal point; Then store and determine in the module by the path of this starting point to this terminal point by this; And in this storage module, search on this path whether have at least one sight spot information in the certain limit, and obtain a respectively residence time of this sight spot information; Reach the respectively residence time of this sight spot information according to this path, this departure time, this specified time of arrival again, determine by this starting point at least one planning sight spot that whether can stop this terminal point.
Wherein, also comprise a positioning system module in order to the location, this processing module judges whether to leave this planning sight spot by this positioning system module, when leaving each planning sight spot, whether this time of handling module calculating this terminal point of arrival behind remaining stroke surpasses this specified time of arrival, if not, then continues to be left stroke, if then send an inquiry user and whether change the request at residue planning sight spot and be shown in this demonstration module.
Wherein, if this processing module receives that this user determines to change the information at residue planning sight spot, then reach the respectively residence time of this sight spot information according to the remaining length in this path, a present time, this specified time of arrival, by decision in this storage module by this present planning sight spot to the planning sight spot that can stop this terminal point, and each plans the residence time at sight spot.
Wherein, also comprise a positioning system module in order to the location, this processing module judges whether to leave the planning sight spot by this positioning system module, when leaving each planning sight spot, this is handled module and whether calculates the time of this terminal point of arrival behind remaining stroke above this specified time of arrival, if not, then continue remaining stroke, if, then according to the remaining length in this path, one present time, this specified time of arrival reaches the respectively residence time of this sight spot information, by decision in this storage module by this present planning sight spot to the planning sight spot that can stop this terminal point, and each plans the residence time at sight spot.
Wherein, also comprise a positioning system module in order to the location, after setting out by this starting point, this processing module is learnt present position by this positioning system module at set intervals, and according to this present position calculate behind remaining stroke, arrive this terminal point time whether above this specified time of arrival, if then send information warning.
Wherein, the principle at this processing module decision planning sight spot is to make the residence time at each planning sight spot add that the summation through this path required time deducts the value of this departure time less than this specified time of arrival.
Wherein, this handles module when the residence time at each planning sight spot finishes soon, sends information warning.
The invention provides a kind of navigational system, is in order to automatic planning tour schedule, it is characterized in that this navigational system comprises:
One stores module, a built-in electronic chart, and contain a plurality of sight spot informations; And
One handles module, receive an origin information, an endpoint information and a predetermined spended time information: then by determining in this storage module by the path of this starting point to this terminal point, and in this storage module, search at least one sight spot information in the certain limit on this path, and respectively this sight spot information comprises a residence time: reach the respectively residence time of this sight spot information according to this path, predetermined spended time information again, determine by this starting point at least one planning sight spot that can stop this terminal point.
Wherein, the principle at this processing module decision planning sight spot is to make the residence time at each planning sight spot add that the summation of this path required time of process is less than this predetermined spended time.
The invention provides a kind of navigational system, is in order to automatic planning tour schedule, it is characterized in that this navigational system comprises:
One stores module, a built-in electronic chart; And
One handles module, determines a path according to a starting point in the built-in electronic chart of this storage module, a terminal point; Then obtain the pairing residence time of at least one dwell point information in the certain limit on this path; Again according to one from this starting point the allowed time to this terminal point, the residence time through this path required time and this at least one dwell point information, decision by this starting point at least one planning dwell point that whether can stop this terminal point.
Wherein, this at least one dwell point information be stored in this storage module and certainly this module obtain.
Wherein, also comprise an input module, this at least one dwell point is specified by this input module by the user.
Wherein, this allowed time is from this a starting point departure time and a predetermined arrival acquisition that this terminal time calculates by one.
Wherein, this path required time of this process is by this path and an acquisition that pace is calculated.
Wherein, this pace is a preset value.
Wherein, this pace is to obtain according to actual pace.
Description of drawings
About aforementioned and other technology contents, characteristics and effect of the present invention, in the detailed description of following cooperation preferred embodiment with reference to the accompanying drawings, can clearly present, wherein:
Fig. 1 is a synoptic diagram, and the framework of the preferred embodiment of navigational system of the present invention is described;
Fig. 2 is a synoptic diagram, and a plurality of sight spots on the mulitpath are described;
Fig. 3 is a process flow diagram, illustrates that the present invention plans the step of the method preferred embodiment of tour schedule automatically;
Fig. 4 is a process flow diagram, the inferior step of this method preferred embodiment in the key diagram 3; And
Fig. 5 is a synoptic diagram, and a plurality of sight spots on the mulitpath are described.
The drawing reference numeral explanation
1 ... navigational system
11 ... store module
12 ... handle module
13 ... show module
14 ... the Global Positioning System (GPS) module
15 ... the input module
21 ... the path
22 ... the path
23 ... the path
24 ... tour schedule
30-39 ... step
341-344 ... step
A ... starting point
B-M ... the sight spot
Z ... terminal point
Embodiment
Consult Fig. 1, it is a preferred embodiment of navigational system of the present invention, the navigational system 1 of present embodiment is built and is put at an electronic installation, for example in PDA, mobile phone or the special vehicle navigation device or personal navigation apparatus, in order to help the user to plan tour schedule automatically, navigational system 1 mainly comprises one and stores module 11, a processing module 12, a demonstration module 13, a Global Positioning System (GPS) (GPS) module 14 and an input module 15.In other is used, navigational system also can disperse to be provided with, for example store module 11 and handle module 12 and be arranged at a remote server, Global Positioning System (GPS) module 14 and 15 of modules of input are located at a portable electronic devices, and both transmit information by a wireless network.
See also Fig. 2 again, at first, suppose that the user is predefined in the starting point A of a departure time from the regional area of electronic chart shown in Figure 2, and wish at the specified time of arrival Z that reaches home, as step 30, handle that module 12 can receive starting point A information, terminal point Z information, the departure time information of setting out by starting point A and the specified time of arrival information of the Z that reaches home.These four kinds of information can be by the user by the input of input module 15, and input module 15 can be keyboard or the touch screen on the electronic installation for example; Perhaps, starting point A information and departure time information also can itself be provided by navigational system 1 when the user sets out, that is starting point A information can be located by Global Positioning System (GPS) (GPS) module 14 and learnt, departure time information then is decided by the time of navigational system 1 internal clocking (for example RTC), terminal point Z information also can be obtained through computing by navigational system 1, for example the user imports one pre-conditionedly, and navigational system 1 obtains the destination and the positional information thereof that meet according to this conditional operation.
Starting point A information and terminal point Z information are all represented with the latitude and longitude coordinates of this two positions in this example, and is right non-as limit.
Come again,, handle module 12 and determine by the path of starting point A to terminal point Z according to the electronic chart that storage module 11 provides as step 31.For example handle that find in the electronic chart of module 12 by Fig. 2 can be by reach home three paths 21,22,23 of Z of starting point A, handle module 12 and can find out the path (normally looking for a shortest path) going to terminal point Z with a predetermined speed per hour (for example speed per hour is 100 kilometers) and can not surpass specified time of arrival from this three paths 21,22,23, for example the path 23.Certainly, handling module 12 also can transfer to the user and select with whole paths 21,22,23 by showing that module 13 shows.
Then carry out step 32, handle module 12 from the electronic map information that stores module 11 and provide on the search path 23 in the certain limit (for example having an area of 10 kilometers or 20 kilometers) whether have at least one sight spot information, and obtain a respectively residence time of this sight spot information.If do not find any sight spot, then carry out step 33, show one and inform information: available on this path without any the sight spot, will directly go to terminal point Z.
As shown in Figure 2, around supposing to search in the path 23 five sight spot H-L are arranged according to above-mentioned search area, then carry out step 34, handle module 12 and reach the respectively residence time of this sight spot H-L, determine by starting point A at least one planning sight spot that whether can stop the terminal point Z according to path 23 length, departure time, specified time of arrival.And the principle of handling module 12 decision planning sight spots be make the time that comes and goes each planning sight spot add the residence time of respectively planning the sight spot add in the middle of the summation of path required time of process deduct the value of ETD less than specified time of arrival.The detailed step 341-step 344 that the mode at decision planning sight spot can be as shown in Figure 4:
Step 341: at first by selecting an x planning sight spot among the H-L of these sight spots (for example according to the popular degree (weight) at these sight spots preferentially considering of sight spot alternatively, suppose that sight spot I is the most popular (weight is the highest) on this paths, then select sight spot I, above-mentioned weight also is stored in electronic chart together with the out of Memory at sight spot in advance), and judge and set out by starting point A, stopping corresponding residence time to this x planning sight spot (sight spot I) reaches home time of Z more whether early than this specified time of arrival, if, then carry out step 342, otherwise carry out step 344.And the mode of judgement time is: the path that calculates starting point A to the x planning sight spot (sight spot I) earlier, calculate x planning sight spot (sight spot I) path of Z to terminal again, the time of the required cost of entire path will be obtained again after two path additions divided by a default speed per hour value (as 60 kilometers/hour), the time that will add the required cost of entire path afterwards the departure time added in the residence time at x planning sight spot (sight spot I), judged whether early than this specified time of arrival.
Step 342: plan that by x+1 that selects among the J-L of these sight spots between x planning sight spot (sight spot I) and terminal point Z (for example the weight of sight spot K is the highest at the sight spot again, then select sight spot K), and judge by x planning sight spot (sight spot I) and set out, stopping the corresponding residence time to x+1 planning sight spot (sight spot K) reaches home time of Z more whether early than this specified time of arrival, if, carry out step 343, make x=x+1 and repeating step 342.Otherwise execution in step 344 shows by starting point A to the planning sight spot information the terminal point Z.
Via step 341-step 344 promptly determined one from starting point A through the reach home tour schedule 24 of Z of planning sight spot I, K, L, handle road that module 12 just passed through this tour schedule 24, starting point A, respectively this planning sight spot, terminal point Z residence time of reaching this planning sight spot correspondence respectively with patterned way mapping (Mapping) in electronic chart and be shown in demonstration module 13.Therefore, the user can see system's clear marking of tour schedule 24 quilts of planning automatically on electronic chart.Certainly, above-mentioned tour schedule 24 except can graphical representation, its can also the text description mode in regular turn bar list.
Therefore, when the tour schedule 24 that comes out when the final planning of system was as shown in Figure 2 A-I-K-L-Z paths, for the definite control time, execution in step 35 more in the present embodiment was in case the user causes having little time terminal point Z because of planning that at certain sight spot overstays.
Step 35: when the user leaves each planning during sight spot or do not leave this planning sight spot but above the residence time, handle module 12 and whether calculate the time of the Z that behind remaining stroke, reaches home above specified time of arrival, if not, then as described in the step 36, continue remaining stroke, if, send the request whether an inquiry user changes residue planning sight spot then as described in the step 37.If this processing module 12 receives that the user determines to change the information at residue planning sight spot, then carry out step 38: calculate path from a last planning sight spot (the planning sight spot of promptly leaving) to terminal point Z, and according to residence time at a present time (system provides), specified time of arrival and respectively this sight spot afterwards, last a planning sight spot, again determine at a last planning sight spot to the planning sight spot that can stop between the terminal point Z, and the residence time (described as step 34) at each planning sight spot, to obtain new stroke planning; For instance, suppose to handle module 12 and in the I of sight spot, carry out step 38 in the user, then handle module 12 and can between sight spot J, K, L, select the higher sight spot K of weight, and judge whether to meet time requirement, suppose that sight spot K meets time requirement, then select the sight spot L between sight spot K and terminal point Z again, judge whether to meet time requirement again, because the I-K-L-Z preceding decision that is but stroke that can overtime, so do not meet time requirement certainly when judging sight spot L, final stroke decision is I-K-Z.Another way, then be when remaining planning sight spot is plural number (for example Yuan Ben stroke also has surplus sight spot K, L), handle module 12 and can suitably delete several planning sight spot (for example deleting K or L), make through not deleted residue planning sight spot and the time of the Z that reaches home is no more than specified time of arrival.It would, of course, also be possible to is that present planning sight spot exists any planning sight spot to there is no between the terminal point Z, perhaps plans the sight spot in addition but does not meet time requirement, then shows the information of informing this moment, please the user directly go to terminal point Z.
Anti-, in step 37, receive that this user's decision do not change the information at residue planning sight spot if handle module 12, then, please the user directly go to terminal point as described in the step 39.
Yet, also can omited steps 37 and step 39, promptly do not inquire the user, and directly carry out step 38 and produce new planning stroke by handling module 12.
In addition, be to plan again in the step 38 according to the stroke of decision at the beginning, yet, also can rebulid a new stroke, but the mode refer step 31 of selection, its situation mat Fig. 5 illustrates.For example handling module 12 finds when the user leaves planning sight spot I, reach home behind remaining stroke time of Z can surpass specified time of arrival, then handling module 12 this moment can plan after planning sight spot I again to the stroke the terminal point Z, look for new planning sight spot again, for example find new planning sight spot M to satisfy in the reach home demand of Z of specified time of arrival.
What remark additionally is, be to judge whether to leave each planning sight spot by Global Positioning System (GPS) (GPS) module 14 in step 35 by handling module 12, after away from each planning sight spot one preset distance (for example one kilometer), handle module 12 and promptly judge and left this planning sight spot.In addition, handle module 12 when the residence time at each planning sight spot finishes soon, can send information warning (for example quarter-bell sound), to remind the user; What also have reminding effect in addition is, behind starting point A, processing module 12 (for example one hour) is at set intervals learnt present position by Global Positioning System (GPS) (GPS) module 14, and whether calculate the time of the Z that behind remaining stroke, reaches home above specified time of arrival according to present position, a speed of a motor vehicle default value (for example 60 kilometers/hour) or other condition, if then send information warning to remind the user.
What deserves to be mentioned is, in step 30, departure time information of handling module 12 and being reception starting point information, endpoint information, set out by starting point and the specified time of arrival information of reaching home, yet, also can change reception starting point information, endpoint information into, set out to the predetermined spended time information of reaching home, can finish the purpose of planning stroke equally by starting point.In addition, above-mentioned Global Positioning System (GPS) (GPS) module 14 only for illustrating, also can be obtained positional information from for example the Galileo positioning system (Galileo Positioning System) or the alternate manner in Europe in the practical application.
In addition, record one in all year can carry out automatic planning tour schedule as shown in Figure 3 method step software program embodied on computer readable programmed recording medium (for example hard disk, with oneself dish, CD-ROM, DVD etc.) or by the computer program that communication network transmits, all should belong to the scope that the present invention is contained.
Broad sense is sayed it, and the present invention discloses a kind of method of automatic planning tour schedule, is applied in the navigational system 1, and this method comprises following (a)-(c) three key steps:
(a) determine a path according to a starting point and a terminal point;
Wherein, this starting point can be imported appointment by the user, or is obtained by Global Positioning System (GPS) module 14 or other positioning system, and this terminal point is specified by the user usually, so also can be derived by 1 computing of navigational system;
(b) obtain the pairing residence time of at least one dwell point information in the certain limit on this path;
Wherein, in aforementioned preferred embodiment, each dwell point information on this path in the certain limit is a database search and obtaining in storing module 11, and each dwell point is tourist attractions, and it is interior and store each pairing residence time of dwell point information to store module 11; Right broad sense is sayed it, change in the example in other, each dwell point also can directly be imported appointment by the user, be that paling zoo terminal point is Yilan winter mountains and rivers motion this path, park for example at starting point, the user directly imports or chooses on a sight spot reference list, to specify Yilan brewery, motion park, sieve east and this three sight spot, Luo Dong night market.
(c) according to one from this starting point the allowed time to this terminal point, the residence time through this path required time and each dwell point information, decision by this starting point at least one planning dwell point that whether can stop this terminal point.
Wherein, this starting point can be scheduled to arrive acquisition that this terminal time calculates from this starting point departure time and one to the allowed time of this terminal point by one certainly, also can directly be imported (that is predetermined T.T. of this route) by the user; This path required time of process is then by this path and an acquisition that pace is calculated, in aforementioned preferred embodiment, this pace is a default mean value, 60km/hr for example, so also can obtain according to user or its actual pace of carrier of taking, for example obtain the motion track coordinate by Global Positioning System (GPS) module 14, cooperate institute's elapsed time under the diverse location and be scaled speed, in other words, when this pace is actual pace, may dynamically change via the planning dwell point that this step determined, that is when traffic congestion and speed of a motor vehicle when slow, the planning dwell point of acquisition may reduce.
In sum, the present invention can plan stroke from moving according to user's destination and time, planning finishing simultaneously in the process of stroke helps the user to control the time, when stroke is overdue, can also help the user to adjust stroke, allow the user can arrive the destination in the given time, so can reach purpose of the present invention really.
Only above-described, it only is preferred embodiment of the present invention, when can not limiting scope of the invention process with this, promptly every simple equivalent of being done according to the present patent application claim and invention description content changes and modifies, and all still belongs in the scope that claim of the present invention contains.
Claims (16)
1. a navigational system is in order to automatic planning tour schedule, it is characterized in that this navigational system comprises:
One stores module, a built-in electronic chart, and contain a plurality of sight spot informations; And
One handles module, receives the specified time of arrival information that departure time information and one that an origin information, an endpoint information, one set out by this starting point arrives this terminal point; Then store and determine in the module by the path of this starting point to this terminal point by this; And in this storage module, search on this path whether have at least one sight spot information in the certain limit, and obtain a respectively residence time of this sight spot information; Reach the respectively residence time of this sight spot information according to this path, this departure time, this specified time of arrival again, determine by this starting point at least one planning sight spot that whether can stop this terminal point.
2. according to the described navigational system of claim 1, it is characterized in that, wherein, also comprise a positioning system module in order to the location, this processing module judges whether to leave this planning sight spot by this positioning system module, when leaving each planning sight spot, this is handled module and whether calculates the time of this terminal point of arrival behind remaining stroke above this specified time of arrival, if not, then continue remaining stroke, if then send an inquiry user and whether change the request at residue planning sight spot and be shown in this demonstration module.
3. according to the described navigational system of claim 2, it is characterized in that, wherein, if this processing module receives that this user determines to change the information at residue planning sight spot, then reach the respectively residence time of this sight spot information according to the remaining length in this path, a present time, this specified time of arrival, by decision in this storage module by this present planning sight spot to the planning sight spot that can stop this terminal point, and each plans the residence time at sight spot.
4. according to the described navigational system of claim 1, it is characterized in that, wherein, also comprise a positioning system module in order to the location, this processing module judges whether to leave the planning sight spot by this positioning system module, when leaving each planning sight spot, this is handled module and whether calculates the time of this terminal point of arrival behind remaining stroke above this specified time of arrival, if not, then continue remaining stroke, if, then according to the remaining length in this path, one present time, this specified time of arrival reaches the respectively residence time of this sight spot information, by decision in this storage module by this present planning sight spot to the planning sight spot that can stop this terminal point, and each plans the residence time at sight spot.
5. according to the described navigational system of claim 1, it is characterized in that, wherein, also comprise a positioning system module in order to the location, after being set out by this starting point, this processing module is learnt present position by this positioning system module at set intervals, and according to this present position calculate behind remaining stroke, arrive this terminal point time whether above this specified time of arrival, if then send information warning.
6. according to the described navigational system of claim 1, it is characterized in that, wherein, the principle at this processing module decision planning sight spot is to make the residence time at each planning sight spot add that the summation through this path required time deducts the value of this departure time less than this specified time of arrival.
7. according to the described navigational system of claim 1, it is characterized in that wherein, this handles module when the residence time at each planning sight spot finishes soon, sends information warning.
8. a navigational system is in order to automatic planning tour schedule, it is characterized in that this navigational system comprises:
One stores module, a built-in electronic chart, and contain a plurality of sight spot informations; And
One handles module, receive an origin information, an endpoint information and a predetermined spended time information: then by determining in this storage module by the path of this starting point to this terminal point, and in this storage module, search at least one sight spot information in the certain limit on this path, and respectively this sight spot information comprises a residence time: reach the respectively residence time of this sight spot information according to this path, predetermined spended time information again, determine by this starting point at least one planning sight spot that can stop this terminal point.
9. according to the described navigational system of claim 8, it is characterized in that wherein, the principle at this processing module decision planning sight spot is to make the residence time at each planning sight spot add that the summation of this path required time of process is less than this predetermined spended time.
10. a navigational system is in order to automatic planning tour schedule, it is characterized in that this navigational system comprises:
One stores module, a built-in electronic chart; And
One handles module, determines a path according to a starting point in the built-in electronic chart of this storage module, a terminal point; Then obtain the pairing residence time of at least one dwell point information in the certain limit on this path; Again according to one from this starting point the allowed time to this terminal point, the residence time through this path required time and this at least one dwell point information, decision by this starting point at least one planning dwell point that whether can stop this terminal point.
11. according to the described navigational system of claim 10, it is characterized in that, wherein, this at least one dwell point information be stored in this storage module and certainly this module obtain.
12., it is characterized in that wherein, also comprise an input module, this at least one dwell point is specified by this input module by the user according to the described navigational system of claim 10.
13., it is characterized in that wherein, this allowed time is from this a starting point departure time and a predetermined arrival acquisition that this terminal time calculates by one according to the described navigational system of claim 10.
14., it is characterized in that wherein, this path required time of this process is by this path and an acquisition that pace is calculated according to the described navigational system of claim 10.
15., it is characterized in that wherein, this pace is a preset value according to the described navigational system of claim 14.
16., it is characterized in that wherein, this pace is to obtain according to actual pace according to the described navigational system of claim 14.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008100825009A CN101236095A (en) | 2008-03-06 | 2008-03-06 | Navigation system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNA2008100825009A CN101236095A (en) | 2008-03-06 | 2008-03-06 | Navigation system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101236095A true CN101236095A (en) | 2008-08-06 |
Family
ID=39919875
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2008100825009A Pending CN101236095A (en) | 2008-03-06 | 2008-03-06 | Navigation system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101236095A (en) |
Cited By (21)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102207390A (en) * | 2010-03-31 | 2011-10-05 | 神达电脑股份有限公司 | Method for storing and retrieving information of recently visited place, and related personal navigation device |
| CN101738188B (en) * | 2008-11-27 | 2012-04-18 | 财团法人资讯工业策进会 | Device and method for recommending scenery spot |
| CN103376116A (en) * | 2012-04-16 | 2013-10-30 | 北京四维图新科技股份有限公司 | Scenic route planning in vehicle navigation |
| CN103400324A (en) * | 2013-07-12 | 2013-11-20 | 苏州海客科技有限公司 | Method for reminding stay time in travel |
| CN103443588A (en) * | 2011-04-01 | 2013-12-11 | 大众汽车有限公司 | Method and apparatus for carrying out travel route planning for vehicle |
| CN105224625A (en) * | 2015-09-24 | 2016-01-06 | 武汉传神信息技术有限公司 | A kind of border tourism ground map generalization method |
| CN105260407A (en) * | 2015-09-24 | 2016-01-20 | 武汉传神信息技术有限公司 | Generation system of cross border tour map |
| CN105300397A (en) * | 2015-09-17 | 2016-02-03 | 成都千易信息技术有限公司 | Method for providing hiking time in scenic region via intelligent terminal |
| CN106323306A (en) * | 2015-07-02 | 2017-01-11 | 腾讯科技（深圳）有限公司 | Navigation information processing method and electronic equipment |
| CN106840182A (en) * | 2016-12-09 | 2017-06-13 | 斑马信息科技有限公司 | Navigation system and air navigation aid |
| CN107222635A (en) * | 2017-06-27 | 2017-09-29 | 上海传英信息技术有限公司 | A kind of alarm clock prompting method and system based on intelligent terminal |
| CN107369399A (en) * | 2017-08-15 | 2017-11-21 | 重庆悦享智慧旅游发展有限公司 | Intelligent guide method based on tourist attractions |
| CN107818378A (en) * | 2017-09-07 | 2018-03-20 | 北京安维讯信息技术有限公司 | A kind of stroke planning method and system based on Internet map and calendar |
| CN108171354A (en) * | 2016-12-07 | 2018-06-15 | 奇点无限有限公司 | Service uses the planing method of sequence |
| CN109374012A (en) * | 2018-12-28 | 2019-02-22 | 北京长城华冠汽车技术开发有限公司 | Sight spot route planning system and on the way sight spot route planning method on the way |
| CN110570681A (en) * | 2018-06-06 | 2019-12-13 | 奇点无限有限公司 | Automatic parking method based on parking space negotiation |
| CN111065051A (en) * | 2019-11-21 | 2020-04-24 | 浙江百应科技有限公司 | Method, terminal and server for judging working path record and key stay |
| CN111222667A (en) * | 2018-11-27 | 2020-06-02 | 中国移动通信集团辽宁有限公司 | Route planning method, device, equipment and storage medium |
| CN111707263A (en) * | 2020-05-22 | 2020-09-25 | 北京梧桐车联科技有限责任公司 | Path planning method and device, electronic equipment and storage medium |
| CN113340325A (en) * | 2021-06-01 | 2021-09-03 | 上海智能网联汽车技术中心有限公司 | System, method and medium for verifying vehicle-road cooperative roadside perception fusion precision |
| CN113701782A (en) * | 2021-10-28 | 2021-11-26 | 深圳市羽翼数码科技有限公司 | Navigation system for realizing multi-destination optimal path planning |
-
2008
- 2008-03-06 CN CNA2008100825009A patent/CN101236095A/en active Pending
Cited By (28)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101738188B (en) * | 2008-11-27 | 2012-04-18 | 财团法人资讯工业策进会 | Device and method for recommending scenery spot |
| CN102207390B (en) * | 2010-03-31 | 2013-03-27 | 神达电脑股份有限公司 | Method for storing and retrieving information of recently visited place, and related personal navigation device |
| CN102207390A (en) * | 2010-03-31 | 2011-10-05 | 神达电脑股份有限公司 | Method for storing and retrieving information of recently visited place, and related personal navigation device |
| CN103443588B (en) * | 2011-04-01 | 2017-02-15 | 大众汽车有限公司 | Method and apparatus for carrying out travel route planning for vehicle |
| CN103443588A (en) * | 2011-04-01 | 2013-12-11 | 大众汽车有限公司 | Method and apparatus for carrying out travel route planning for vehicle |
| US9810543B2 (en) | 2011-04-01 | 2017-11-07 | Volkswagen Aktiegesellschaft | Method and device for carrying out travel route planning for a vehicle |
| CN103376116A (en) * | 2012-04-16 | 2013-10-30 | 北京四维图新科技股份有限公司 | Scenic route planning in vehicle navigation |
| CN103400324A (en) * | 2013-07-12 | 2013-11-20 | 苏州海客科技有限公司 | Method for reminding stay time in travel |
| CN106323306B (en) * | 2015-07-02 | 2020-08-11 | 腾讯科技（深圳）有限公司 | Navigation information processing method and electronic equipment |
| CN106323306A (en) * | 2015-07-02 | 2017-01-11 | 腾讯科技（深圳）有限公司 | Navigation information processing method and electronic equipment |
| CN105300397A (en) * | 2015-09-17 | 2016-02-03 | 成都千易信息技术有限公司 | Method for providing hiking time in scenic region via intelligent terminal |
| CN105260407A (en) * | 2015-09-24 | 2016-01-20 | 武汉传神信息技术有限公司 | Generation system of cross border tour map |
| CN105224625A (en) * | 2015-09-24 | 2016-01-06 | 武汉传神信息技术有限公司 | A kind of border tourism ground map generalization method |
| CN105224625B (en) * | 2015-09-24 | 2018-08-10 | 语联网（武汉）信息技术有限公司 | A kind of generation method of border tourism map |
| CN108171354A (en) * | 2016-12-07 | 2018-06-15 | 奇点无限有限公司 | Service uses the planing method of sequence |
| CN106840182A (en) * | 2016-12-09 | 2017-06-13 | 斑马信息科技有限公司 | Navigation system and air navigation aid |
| CN106840182B (en) * | 2016-12-09 | 2022-07-22 | 斑马信息科技有限公司 | Navigation system and navigation method |
| CN107222635A (en) * | 2017-06-27 | 2017-09-29 | 上海传英信息技术有限公司 | A kind of alarm clock prompting method and system based on intelligent terminal |
| CN107369399A (en) * | 2017-08-15 | 2017-11-21 | 重庆悦享智慧旅游发展有限公司 | Intelligent guide method based on tourist attractions |
| CN107818378A (en) * | 2017-09-07 | 2018-03-20 | 北京安维讯信息技术有限公司 | A kind of stroke planning method and system based on Internet map and calendar |
| CN110570681A (en) * | 2018-06-06 | 2019-12-13 | 奇点无限有限公司 | Automatic parking method based on parking space negotiation |
| CN111222667A (en) * | 2018-11-27 | 2020-06-02 | 中国移动通信集团辽宁有限公司 | Route planning method, device, equipment and storage medium |
| CN111222667B (en) * | 2018-11-27 | 2023-09-19 | 中国移动通信集团辽宁有限公司 | Route planning method, device, equipment and storage medium |
| CN109374012A (en) * | 2018-12-28 | 2019-02-22 | 北京长城华冠汽车技术开发有限公司 | Sight spot route planning system and on the way sight spot route planning method on the way |
| CN111065051A (en) * | 2019-11-21 | 2020-04-24 | 浙江百应科技有限公司 | Method, terminal and server for judging working path record and key stay |
| CN111707263A (en) * | 2020-05-22 | 2020-09-25 | 北京梧桐车联科技有限责任公司 | Path planning method and device, electronic equipment and storage medium |
| CN113340325A (en) * | 2021-06-01 | 2021-09-03 | 上海智能网联汽车技术中心有限公司 | System, method and medium for verifying vehicle-road cooperative roadside perception fusion precision |
| CN113701782A (en) * | 2021-10-28 | 2021-11-26 | 深圳市羽翼数码科技有限公司 | Navigation system for realizing multi-destination optimal path planning |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101236095A (en) | Navigation system | |
| CN1282350C (en) | Navigational system with mobile terminal | |
| US10681498B2 (en) | Standardization of addresses and location information | |
| CN104380293A (en) | Providing information about relevant elements from maps history based on location | |
| CN101520331A (en) | GPS navigation system and method capable of automatically updating map | |
| JP2005031068A (en) | Location guide device | |
| CN101750077A (en) | Navigation system and method thereof based on scenery spot query | |
| CN1808072B (en) | Electronic device for navigation system and method for searching, setting and inputting navigation conditions | |
| CN110741225A (en) | System and method for determining target site | |
| JP2004286653A (en) | System for displaying reliability degree information | |
| JP2003122656A (en) | Position dependency information providing method | |
| JP5955493B2 (en) | Information processing system, map information display device, information processing method, and program | |
| CN101311678B (en) | Hand-held electronic device and its map data sharing method | |
| JP6365523B2 (en) | Destination information provision system | |
| CN102246004A (en) | Information providing system, information distribution server, and information providing method | |
| JP5349023B2 (en) | Navigation device | |
| CN101726314A (en) | Method for loading, locating and navigating special point data and equipment thereof | |
| GB2583470A (en) | Methods and apparatus for selectively communicating with mobile devices | |
| CN102645226A (en) | More accurate navigation method | |
| CN101929869A (en) | Method for determining rendezvous position | |
| JP2007292566A (en) | Weather forecast display system | |
| CN201063792Y (en) | Mobile phone system of implementing navigation using short message | |
| JP6646783B2 (en) | Moving object placement system | |
| CN113434777A (en) | Travel mode recommendation method and device, electronic equipment and storage medium | |
| JP2020077263A (en) | Route proposal device, route proposal method, and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Open date: 20080806 |