Movatterモバイル変換


[0]ホーム

URL:


CN100498231C - Path planning system and method - Google Patents

Path planning system and method
Download PDF

Info

Publication number
CN100498231C
CN100498231CCNB2004101039541ACN200410103954ACN100498231CCN 100498231 CCN100498231 CCN 100498231CCN B2004101039541 ACNB2004101039541 ACN B2004101039541ACN 200410103954 ACN200410103954 ACN 200410103954ACN 100498231 CCN100498231 CCN 100498231C
Authority
CN
China
Prior art keywords
time
driving
route
road section
estimated
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.)
Expired - Fee Related
Application number
CNB2004101039541A
Other languages
Chinese (zh)
Other versions
CN1800783A (en
Inventor
简焕文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Giga Byte Technology Co Ltd
Giga Byte Communications Inc
Original Assignee
Giga Byte Technology Co Ltd
Giga Byte Communications Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Giga Byte Technology Co Ltd, Giga Byte Communications IncfiledCriticalGiga Byte Technology Co Ltd
Priority to CNB2004101039541ApriorityCriticalpatent/CN100498231C/en
Publication of CN1800783ApublicationCriticalpatent/CN1800783A/en
Application grantedgrantedCritical
Publication of CN100498231CpublicationCriticalpatent/CN100498231C/en
Anticipated expirationlegal-statusCritical
Expired - Fee Relatedlegal-statusCriticalCurrent

Links

Images

Landscapes

Abstract

The invention discloses a path planning system and a method, which are used for planning an optimal path of a first vehicle moving from a starting point to a destination. The invention plans a plurality of road sections between the starting point and the destination, judges the traffic conditions of the road sections by detecting the moving time or the moving speed of the wireless communication device moving on the road sections along with a second vehicle and provides the driving information to the first vehicle, and can plan an optimal path which takes the shortest time after the traffic conditions of the road sections are obtained. The method of the invention comprises the following steps: obtaining average moving time of a plurality of road sections, (b) determining the optimal path according to the average moving time of the plurality of road sections and (c) informing the first vehicle of the optimal path. The system and the method can obtain the shortest optimal path in one time, thereby being convenient for users.

Description

Path planning system and method
Technical field
The present invention relates to a kind of method and system of planning optimal path, particularly a kind of route method and system that plans that the time spent is the shortest.
Background technology
Present gps system only can be used to show the position, and other system that is used in combination with gps system, as satellite navigation system etc., though can plan a driving path the shortest according to user's starting point and destination.But, provide the path of short traveling time and a traveling time of estimating to the user is more helpful.Present system all can't provide such service.
At United States Patent (USP) 6,611, disclose when the automobile with wireless device enters the appointed area in No. 687, the message of appointed area is passed to automobile with wireless device.It only is sent to this automobile with the message of appointed area (may be certain station or the cities and towns in the way), rather than the message of entire path.
In addition, U.S. Pat 6,804,524 openly utilize a plurality of platforms to obtain the traffic message of vehicle with wireless mode, and then learn present traffic behavior, but still can't give path that traveling time is the shortest of user and estimate the information on services of traveling time.
Summary of the invention
The object of the present invention is to provide a kind of path planning system and method, the user can obtain the shortest path of a traveling time and estimate the information on services of traveling time according to this method and system.
To achieve these goals, the invention provides a kind of method and system of planning one optimal path, use for one first vehicle, this first vehicle moves to a second place (being the destination) by primary importance (being starting point).The present invention cooks up a plurality of highway sections between this starting point and destination, be displaced into the traveling time of the wireless communication apparatus on these a plurality of highway sections or the traffic that speed is judged these a plurality of highway sections by detection, after obtaining the traffic in these a plurality of highway sections, just can cook up a shortest time-consuming optimal path.
The present invention can be according to all can get the traffic and the running information in highway section (highway section) between starting point and the destination, cook up one and inform a user after taking the shortest driving path (optimal path) and estimating required time.By method and system of the present invention, congested highway section is avoided in the highway section that the user can select more not congested (time-consuming less), has not only shortened traveling time, and therefore whole traffic behavior also will obtain significantly to improve.Anyone wants to understand the traffic behavior in any highway section, also can see through system and method for the present invention and obtain running information.Utilize the resulting running information of the present invention to comprise traveling time, translational speed and the mobile required time in each highway section.In addition, it should be noted that because the present invention utilizes wireless station to detect the wireless communication apparatus that moves along with vehicle, so also can detect the driving number that in certain period, passes through this wireless station.This driving number also can provide as running information provided by the present invention.
The present invention is described in detail below in conjunction with drawings and Examples.
Description of drawings
Fig. 1 is the synoptic diagram of path planning of the present invention;
Fig. 2 is a synoptic diagram of explanation system of the present invention; And
Fig. 3 is a process flow diagram of explanation the inventive method.
Embodiment
The present invention discloses a kind of method and system of planning one optimal path, uses for one first vehicle, and this first vehicle moves to a second place (being the destination) by primary importance (being starting point).The present invention cooks up a plurality of highway sections between this starting point and destination, be displaced into the traveling time of the wireless communication apparatus on these a plurality of highway sections or the traffic that speed is judged these a plurality of highway sections by detection, just can cook up the shortest optimal path of a time spent after obtaining the traffic in these a plurality of highway sections.
As shown in Figure 1, path planning system of the present invention, be used to plan that onefirst vehicle 50 is moved to an optimal path of asecond place 20 by aprimary importance 10, have a plurality of highway sections between thisprimary importance 10 and thissecond place 20, for example highway sections such as 11,12,13,14,15,16,17 and 18.These a plurality of highway sections can be obtained by a Geographic Information System (GIS).
As shown in Figure 2, system of the present invention comprises a plurality ofwireless communication apparatus 30, at least one firstwireless station 10A, at least one secondwireless station 20A and a computer installation 60.Wherein these a plurality of wireless communication apparatus are along with a plurality of vehicles (convenient for expression, as only to represent with one second vehicle 70) are displaced on each highwaysection highway section 11 for example shown in Figure 1.This firstwireless station 10A is arranged at first end in each highway section and second end that this secondwireless station 20A is arranged at each highway section.Thiswireless communication apparatus 30 has an identifying information, can be by the firstwireless station 10A and secondwireless station 20A identification by thiswireless communication apparatus 30 of this identifying information.Thiscomputer installation 60 can be connected with the firstwireless station 10A and the secondwireless station 20A obtaining the traveling time (by this first end move to this second end required time) of eachwireless communication apparatus 30 on each highway section, and the traveling time of allwireless communication apparatus 30 in each highway section is obtained an average traveling time as the foundation of planning optimal path after average.The present invention obtains the average traveling time ofwireless communication apparatus 30 on these a plurality of highway sections respectively and plans this optimal path.In case after obtaining the average traveling time in each highway section, the present invention just can determine an optimal path according to the average traveling time in these highway sections.This optimal path is meant thatwireless communication apparatus 30 moves to the shortest path of thesecond place 20 required times byprimary importance 10.
This optimal path is made up of selected part or all of institute in these a plurality of highway sections, and for example the path that moves to thesecond place 20 byprimary importance 10 compriseshighway section group 11,12,13 and 18 orhighway section group 11,12,16 and 18 orhighway section group 14,15,16 and 18 orhighway section group 17 and 18 etc.Because it is known that wireless communication apparatus is covered the required traveling time in each highway section, so can calculate the required traveling time of all highway section groups, wherein the highway section group of short traveling time is optimal path, so the present invention just can estimate out the optimal path offirst vehicle 50, and notifies first vehicle, 50 these traveling times or this optimal path.
As shown in Figure 2, the utilization of the present invention secondwireless station 20A that is arranged at one firstwireless station 10A of each highway section first end and is arranged at second end obtains the average traveling time T in each highway section.Move to second wireless station, 20 required time T (abbreviating traveling time as) according to awireless communication apparatus 30 that is displaced into eachvehicle 70 on these highway sections by firstwireless station 10, and vehicle number can be tried to achieve average traveling time T.As for speed,, just can try to achieve speed V=D/T as long as in the distance D of knowing between this first wireless station and this second wireless station.Firstwireless station 10 moves to second wireless station, 20 required time T=T2-T1, and wherein first moment T1 is the time point that this first wireless station is obtained this identifying information, and second moment T2 obtains the time point of this identifying information for this first wireless station.Or T1 is the moment ofwireless communication apparatus 30 through firstwireless station 10, and T2 is the moment ofwireless communication apparatus 30 through second wireless station 20.Or be, first constantly T1 may be defined as the firstwireless station 10A and detect thiswireless communication apparatus 30 and have the time of strong signal, second constantly T2 may be defined as the secondwireless station 20A and detect thiswireless communication apparatus 30 and have the time of strong signal.This process that obtains first moment T1 and second moment T2 can be described as a sampling process in the present invention.
It should be noted that, for getting rid of the factor that some may influence the degree of accuracy of above-mentioned traveling time T calculating mean value, proper is in sampling process or after finishing, if above-mentioned traveling time T when being lower than one first default value or being higher than one second default value with disallowable.For example the firstwireless station 10A and the secondwireless station 20A may be in the information of a certain section time detecting to hundreds ofwireless communication apparatus 30, the possibility of the traveling time in the same highway section of possibility from 10 seconds (mistake is surveyed) to 1 hour (parking area director's feelings on the way) all has, by removing some irrational traveling time, for example after the ascending arrangement of all traveling times, remove preceding 2% or 10%, remaining traveling time is averaged, can obtain the average traveling time in this highway section in this section period, try to achieve after average translational speed also can be divided by with distance D again.
This wireless station can be any electronic installation that detectswireless communication apparatus 30, and only needing to be fixed on needs the point of fixity in sampling highway section to get final product.It for example is the mobile telephone base station that interior device with wireless communication module of any household or telecommunications service provider are set up.For example, be that as the advantage of wireless station of the present invention mobile telephone base station is provided with at large,, also need not spend in addition this wireless station is set so its covering scope comparatively extensively and not can only be confined to some zone with mobile telephone base station.
The firstwireless station 10A and the secondwireless station 20A can discern thiswireless communication apparatus 30 by the identifying information of wireless communication apparatus 30.Thewireless communication apparatus 30 of obtaining the source as the traveling time data can be a GPS device, a mobile phone or a PDA.This identifying information comprises identification code (ID code), SIM card card number, IMEI sign indicating number and the ESN sign indicating number of wireless identification label (RFID tag).As, when thiswireless communication apparatus 30 was a GSM mobile handset, it had one and is called international mobile Equipment Identification Code (International Mobile Equipment Identity; IMEI) fuselage number, in be built in the chip of mobile phone.When thiswireless communication apparatus 30 was a GSM mobile handset, this identification code can be the SIM card card number of a GSM mobile handset.Or be, when thiswireless communication apparatus 30 was a CDMA mobile phone, it had a fuselage number that is called the ENS sign indicating number, in be built in the chip of this CDMA mobile phone.Because according to existing GSM standard, GSM mobile handset (or CDMA mobile phone) can be uploaded to telecommunications service provider with its SIM card card number and IMEI sign indicating number and ESN sign indicating number when connecting to network, so can obtain this identification code (ID code) by this.This identification code (ID code) also can be provided by the RFID tag (RFID tag) of a radio-frequency recognition system (RFID).When thiswireless communication apparatus 30 was a RFID tag, this RFID tag can be arranged at many places, on a vehicle, or on the part of this vehicle, or even drive on the clothes of going into to be worn.And this firstwireless station 10A and the secondwireless station 20A have the identification code (ID code) of reading device reader to read this RFID tag of a radio frequency recognition volume label.
With the average traveling time in each above-mentioned highway section and in fact first vehicle when time traveling time be stored in the database to revise next time and use for above-mentioned first vehicle.If the traveling time of the reality of first vehicle different with average traveling time (each car owner drive habit difference), as being averaging time 5 minutes, but the actual traveling time of first vehicle is 10 minutes, and then this variance data will be recorded amongwireless communication apparatus 30,wireless station 10A or 20A or the server and form a database.When the car owner carries out path planning next time, just can be according to the required traveling time in each highway section of database data correction, and as the reference of estimating required time.Moreover server or wireless station will write down the average traveling time in this highway section and the related data of driving quantity, to set up a conversion table.When the driving of certain period of estimating out this highway section is counted, can calculate according to this transfer function to draw the traveling time of estimating of this period.
The resulting running information in front comprises traveling time, translational speed and the mobile required time in each highway section.In addition, it should be noted that because the present invention utilizes wireless station to detect the wireless communication apparatus that moves along with vehicle, so also can detect the driving number that in certain period, passes through this wireless station.This driving number also can provide as running information.
Wherein Fig. 3 is moved to the method flow diagram of the optimal path of a second place by a primary importance for planning one first vehicle.As shown in Figure 1, have a plurality of highway sections (for example highway section 11-18) betweenprimary importance 10 and this second place 20.As shown in Figure 2, there is one second vehicle to move thereon on each highway section, for example has onesecond vehicle 70 to move thereon on the highway section 11.Onewireless communication apparatus 30 is arranged in addition along with thissecond vehicle 70 moves.This wireless communication apparatus has an identifying information.In addition, second end that first end in each highway section shown in first figure is provided with one first wireless station and each highway section shown in Figure 1 is provided with one second wireless station, and for example first end inhighway section 11 second end that is provided with one firstwireless station 10A andhighway section 11 is provided with one second wireless station 10B.This firstwireless station 10A and the second wireless station 10B can discern the identifying information of this wireless communication apparatus.
As shown in Figure 3,step 310 obtains one first moment T1, and this first moment, T1 was the time point that the firstwireless station 10A shown in Figure 2 obtains this identifying information.Perhaps first constantly T1 bewireless communication apparatus 30 shown in Figure 2 time point through the first wireless station 10A.It should be noted that the moment that alsowireless communication apparatus 30 can be entered the covering scope of the firstwireless station 10A is considered as T1.Or the firstwireless station 10A is detectedwireless communication apparatus 30 has that the moment of strong signal is considered as T1.
Then, shown instep 320,step 320 obtains one second moment T2, and this second moment, T2 was the time point that the second wireless station 10B shown in Figure 2 obtains this identifying information.Or wireless communication apparatus shown in Figure 2 30 is through the time point of the second wireless station 20A.It should be noted that the moment that alsowireless communication apparatus 30 can be entered the covering scope of the secondwireless station 20A is considered as T2.Or each wireless station is detectedwireless communication apparatus 30 has that the moment of strong signal is considered as T2.
Then, shown instep 330, because the present invention utilizes a plurality of mean values that are displaced into institute's time-consuming (being called " traveling time ") ofwireless communication apparatus 30 between the firstwireless station 10A and the secondwireless station 20A to decide the average traveling time in this highway section 40, sostep 310 andstep 320 must be repeated several till this sampling process end.The multiplicity of thisstep 310 andstep 320 was decided on the time of the number ofwireless communication apparatus 30 or the data desiring to obtain, and average traveling time or the average translational speed estimated of multiplicity the present invention more at most of thisstep 310 andstep 320 will be accurate more certainly.Perhaps, sampling process is a process that does not stop, so that the information in real-time each highway section is provided.
Then, shown instep 340, the firstwireless station 10A and the secondwireless station 20A can with first constantly T1 and second constantly T2 pass to as shown in Figure 2 acomputer installation 60.
Then, shown instep 350, thiscomputer installation 60 according to received first constantly T1 and second constantly T2 calculate thiswireless communication apparatus 30 by the firstwireless station 10A to the required time T of the second wireless station 20A.It should be noted that thiscomputer installation 60 part ofwireless communication apparatus 30 for this reason, or this computer installation can be a server that is independent of outside the wireless communication apparatus 30.Even secondwireless station 20A also can be used as thiscomputer installation 60, or thiscomputer installation 60 can be positioned among the second wireless station 20A.If this computer installation is for this reason during the secondwireless station 20A, this secondwireless station 20A only need first T1 and itself constantly detected second transmitted according to the firstwireless station 10A constantly T2 can calculate thiswireless communication apparatus 30 by the firstwireless station 10A to the required time T (T=T2-T1) of the secondwireless station 20A, it is called traveling time.As described above, when a plurality ofwireless communication apparatus 30, the mean value of the traveling time of these a plurality ofwireless communication apparatus 30 is called average traveling time.
Then, shown instep 370, be understandable that this highway section of the short more expression of average traveling time is not congested more.So the present invention can plan a time-consuming minimum optimal path according to the average translational speed ofwireless communication apparatus 30 on each highway section.For example this optimal path system is made up of the highway section shown in first figure 11,12,13 and 18.Even other path is shorter, if traffic is not good, still do not elected as the composition highway section of optimal path in the present invention by meeting, forexample highway section 14,15,16 and 18 paths of being formed are shorter, but are not still elected as the composition highway section of optimal path in the present invention by meeting.
Then, shown instep 380, the present invention can notify an end user this optimal path by appropriate device, for example by being equipped on the wireless communication apparatus on first vehicle, and for example a mobile phone, a PDA, a GPS device or connect the computing machine etc. of network.
One path planning system user can by native system estimate present or following any moment from first to optimal path that moves to the second place (traveling time is the shortest) and required traveling time thereof.It estimates mode two kinds:
By different each highway section in the past each holiday, the data of the average traveling time of the day part of each day estimate weekly;
Earlier according to different each highway section in the past in each holiday, the data of the average traveling time of the day part of each day estimate average traveling time weekly, again according to the user who has used path planning system plan optimal path the highway section of process, revise may vehicle flowrate increase, and revise the average traveling time that this highway section should the period again.
Estimate mode for first kind and mainly consider the different periods, the congestion situation in each highway section also can be different, period for example on and off duty and non-period on and off duty and night, perhaps Monday to Sunday each highway section each period, the continuous leave of special holiday or different length all can be different, and our correction that these factors are caused is defined as the time modified value in a word.
Utilize above-mentioned mode except can calculating average traveling time, only to write down analysis, the classification that time point can carry out the various periods that obtain of each data again, and become the required database data of first method, with as estimating each optimal path from the primary importance to the second place constantly.
What specify is, when the user for example as Fig. 1 at 8 in input XX morning January 1 move to thesecond place 20 byprimary importance 10, the present invention estimates that (starting point isprimary importance 10 inhighway section 11,14,17, start time is 8 points) traveling time, the present invention is according to 8 running time of New Year's Day over the years, and the traveling time that fate estimates thathighway section 11,14,17 is required is stopped by the company on XX New Year's Day.When estimatinghighway section 12,15,18, then need respectively to estimate for benchmark by the running time (reach at 8 and add the required traveling time inhighway section 11,14,17) that makes in each highway section.So each highway section all be with estimate can pass through time be that benchmark is estimated, estimate traveling time accurately and try to achieve, and then the path of the optimum of therefrom getting.And following second kind estimated mode and also estimate optimal path in the same way, is not repeated in the following explanation.
Estimate mode for second kind and consider that mainly the average traveling time in each highway section in fact is relevant with vehicle flowrate.Identical vehicle flowrate just has close average traveling time, situation is different with record in the past to cause the different of vehicle flowrate as long as can estimate according to a mode correction according in the past record (i.e. first kind of data that mode is used) again, just can try to achieve average traveling time according to the vehicle flowrate in each highway section and the conversion table of time.The mode of this correction vehicle flowrate is described below:
Vehicle flowrate when correction is planned earlier and the comparison of the vehicle flowrate in former years.At first, need record wireless station in this highway section, the correction of the vehicle flowrate that records of this period and actual vehicle flowrate, for example when this highway section be 100 but wireless station only measures 60 in this period in certain period actual uplink car quantity, as: the part vehicle does not carry wireless communication apparatus, then 100/60 is defined as actual measurement ratio.So certain highway section vehicle flowrate of 8 in hypothesis XX morning January 1 is 160,7 is 80.But when estimating for 7, the vehicle flowrate that measures is 60, being converted into actual vehicle flowrate is 100, promptly vehicle flowrate was many more in the past in this highway section as can be known, with equal proportion, etc. quantity or other correcting mode, the vehicle flowrate in the time of can revising at 8 is 200 (=160*100/80) platform, 180 (=160+100-80) platform etc.
In addition, can utilize the data of each optimal path planned that uses this path planning system, in the time of can learning certain period the accumulation in certain highway section estimate possible extra vehicle flowrate, next user adds these factors and revises and obtain further to revise when estimating optimal path.We are example again with Fig. 1, when first estimate at 8 in XX morning January 1 byprimary importance 10 to thesecond place 20, obtainhighway section 11,12,16 and 18 optimal paths, and suppose that original path planning system had carried out a considerable amount of path planning demands, and to add up known these path planning demands and try to achieve the quantity that at 8 in the inherent XX of optimal path morning January 1 will the section of driving 11 be 100, after certain person estimated to finish, the quantity that at 8 in XX morning January 1 will the section of driving 11 was modified to 101.Certain second is carried out optimal path when planning subsequently, and it is that carry out on the basis that the quantity that at 8 in XX morning January 1 will the section of driving 11 is measured with 101.Certainly, be not carry out path planning quantity what, infact highway section 11 at that time section will increase the vehicle flowrate of these quantity.Suppose that the optimal path that on average increases each hundred people when the same period of a highway section is estimated by this highway section through actual measurement, then this highway section is actual will increase by 25 people, is defined as 25/100 and additionally estimates modified value.Therefore,, reach with above-mentioned time modified value, actual measurement ratio again and additionally estimate modified value, can obtain more accurate average traveling time and estimate as long as according to first kind of vehicle flowrate over the years of estimating used each highway section of various time points of mode.And because average traveling time predictor method of the present invention can be according to the former the estimated data correction latter's data, avoid congested highway section and reach the highway section that allows the user select more not congested (time-consuming less), not only shortened traveling time, and therefore whole traffic behavior also will obtain significantly to improve.
In addition, need carry out huge path planning for fear of server end, this path planning can be brought in the user and carry out.Just server need not calculate the shortest time path, and as long as give user's end (even comprise time modified value, actual measurement ratio and additionally estimate modified value) with each highway section at the average traveling time of each period, user's processor carries out path planning according to the average traveling time that server provides.Certainly, this path planning be except that can and additionally estimating the modified value according to time modified value, actual measurement ratio, can hold the difference of the custom of driving to revise again according to the user after, offer estimating of user's optimal path, and this information repaid to server.And server also can provide up-to-date information to the user at any time, carries out real-time correction.Certainly, as long as under the situation that server can operate, the computing of this path planning planning also can be carried out on server.
In addition, the user removes when carrying out path planning again, can provide outside the temporal information of primary importance, the second place and departure time, also can temporal information also can be the time of arrival (when for example going the second place with friend about a certain location point) of a certain location point that must process in time of arrival of the second place or the road.
Certainly; the present invention also can have other various embodiments; under the situation that does not deviate from spirit of the present invention and essence thereof; those of ordinary skill in the art work as can make various corresponding changes and distortion according to the present invention, but these corresponding changes and distortion all should belong to the protection domain of the appended claim of the present invention.

Claims (20)

Translated fromChinese
1.一种取得一路段的行车信息的方法,包括:1. A method for obtaining driving information of a road section, comprising:在该路段的起迄点各建立一第一无线站台及一第二无线站台,用于接收行经该路段的每一台车辆上的一无线通讯装置所发射的一识别信息;A first wireless station and a second wireless station are respectively established at the starting and ending points of the road section for receiving an identification information transmitted by a wireless communication device on each vehicle passing through the road section;记录该第一无线站台接收每一识别信息的时间为一第一时刻;及record the time at which the first wireless station receives each identification message as a first moment; and记录该第二无线站台接收每一识别信息的时间为一第二时刻;Recording the time when the second wireless station receives each identification information as a second moment;其中,所述行车信息包括该路段及起迄点、每一该第一时刻及每一该第二时刻。Wherein, the driving information includes the road section, the starting and ending points, each of the first moments and each of the second moments.2.根据权利要求1所述的取得一路段的行车信息的方法,其特征在于,还包括:2. The method for obtaining the driving information of a road section according to claim 1, further comprising:计算对应同一笔识别信息的第一时刻与第二时刻的差值,并记录为一行车时间;Calculate the difference between the first moment and the second moment corresponding to the same piece of identification information, and record it as the driving time;其中,所述行车信息还包括每一该行车时间。Wherein, the driving information also includes each driving time.3.根据权利要求2所述的取得一路段的行车信息的方法,其特征在于,还包括:3. The method for obtaining the driving information of a road section according to claim 2, further comprising:针对一时段筛选出符合一筛选条件的每一笔行车时间;及Filter out each driving time that meets a filtering condition for a time period; and依据筛选结果计算出一平均行车时间,并记录为对应该时段的平均行车时间;Calculate an average driving time based on the screening results, and record it as the average driving time corresponding to the time period;其中,该行车信息还包括该时段的平均行车时间。Wherein, the driving information also includes the average driving time of the time period.4.根据权利要求3所述的取得一路段的行车信息的方法,其特征在于,该筛选条件用于找出介于一低行车时间值与一高行车时间值之间的每一笔行车时间。4. The method for obtaining the driving information of a road section according to claim 3, wherein the filtering condition is used to find out each driving time between a low driving time value and a high driving time value .5.根据权利要求3所述的取得一路段的行车信息的方法,其特征在于,所述针对一时段筛选出符合一筛选条件的每一笔行车时间进一步为,将记录的行车时间按从小到大的顺序排成队列,除去所述队列中前第一预设百分比的行车时间和/或后第二预设百分比的行车时间。5. The method for obtaining the driving information of a road section according to claim 3, wherein the step of filtering out each driving time that meets a screening condition for a period of time is further to record the driving time in order from small to The larger ones are arranged in a queue, and the driving time of the first preset percentage and/or the driving time of the second preset percentage in the queue are removed.6.根据权利要求1所述的取得一路段的行车信息的方法,其特征在于,还包括:6. The method for obtaining the driving information of a road section according to claim 1, further comprising:取得针对一时段计算该些第一时刻的笔数及该些第二时刻的笔数,并分别记录为第一定点行车数及第二定点行车数;Obtain the numbers of the first time points and the second time points calculated for a period of time, and record them as the first fixed-point driving number and the second fixed-point driving number;其中,该行车信息还包括对应该时段的第一定点行车数及第二定点行车数。Wherein, the driving information also includes the first fixed-point driving number and the second fixed-point driving number corresponding to the time period.7.根据权利要求1所述的取得一路段的行车信息的方法,其特征在于,还包括:7. The method for obtaining the driving information of a road section according to claim 1, further comprising:针对一时段计算对应同一识别信息的第一时刻及第二时刻的笔数,并记录为路段行车数;For a period of time, calculate the number of the first moment and the second moment corresponding to the same identification information, and record it as the number of road trips;其中,该行车信息还包括对应该时段的路段行车数。Wherein, the driving information also includes the number of driving on the road section corresponding to the time period.8.根据权利要求3所述的取得一路段的行车信息的方法,其特征在于,还包括:8. The method for obtaining the driving information of a road section according to claim 3, further comprising:根据该路段的起迄点的距离及该平均行车时间,计算出一平均行车速度;calculate an average traveling speed based on the distance from the start-to-end point of the road section and the average traveling time;其中,该行车信息还包括该时段的平均行车速度。Wherein, the driving information also includes the average driving speed during this period.9.一种行车信息服务系统,包括:9. A driving information service system, comprising:一第一无线站台,设置于一路段的起点,用于接收行经该起点的每一台车辆上的一无线通讯装置所发射的一识别信息;A first wireless station, set at the starting point of a road section, for receiving an identification information transmitted by a wireless communication device on each vehicle passing the starting point;一第二无线站台,设置于该路段的终点,用于接收行经该终点的每一台车辆上的一无线通讯装置所发射的一识别信息;及A second wireless station, set at the end point of the road section, for receiving an identification information transmitted by a wireless communication device on each vehicle passing the end point; and一计算机系统,负责接收该第一无线站台及该第二无线站台所收到的每一识别信息及接收时间,并将之处理成行车信息。A computer system is responsible for receiving each identification information and receiving time received by the first wireless station and the second wireless station, and processing it into driving information.10.一种最优行车路径规划方法,包括:10. A method for optimal driving path planning, comprising:根据一电子地图规划出多条连接一出发地及一目的地的建议路径,每一条建议路径由多段路段组成;According to an electronic map, a plurality of suggested routes connecting a starting point and a destination are planned, and each suggested route is composed of a plurality of road sections;根据权利要求3所述的方法取得每一路段的平均行车时间;Obtain the average driving time of each section according to the method described in claim 3;累加对应同一条建议路径中所有路段的平均行车时间,并将之记录为该建议路径的总平均行车时间;及Accumulate the average travel time of all road segments corresponding to the same suggested route, and record it as the total average travel time of the proposed route; and找出总平均行车时间最少的建议路径,并将之记录为该最优行车路径。Find the suggested route with the least total average driving time, and record it as the optimal driving route.11.一种预估从一出发地到达一目的地所需行车时间的方法,包括:11. A method of estimating the travel time required to reach a destination from a point of departure, comprising:根据申请专利范围第10项所述的方法取得一最优行车路径;Obtain an optimal driving route according to the method described in item 10 of the patent application;预估该最优路径的每一路段的行车数;及Estimate the number of vehicles traveling on each road segment of the optimal route; and根据预估结果推算该每一路段的行车时间并累计形成一预估行车时间。The driving time of each section is calculated according to the estimated result and accumulated to form an estimated driving time.12.一种路径预估行车时间方法,用于通过一具有一数据库的路径预估行车时间系统规划在一预定时间由一第一位置移动至一第二位置的至少一路径的预估行车时间,该第一位置与该第二位置之间的每一该至少一路径由至少一路段所组成,该至少一路段上有至少一具有一无线通讯装置的车辆移动于其上,该数据库包括每一路段的行车数与对应行车的信息、时间,该方法包括下列步骤:12. A method for estimated travel time of a route, used for planning the estimated travel time of at least one route moving from a first position to a second position at a predetermined time by a route estimated travel time system having a database , each of the at least one path between the first location and the second location is composed of at least one road section on which at least one vehicle with a wireless communication device moves, and the database includes each The number of vehicles on a road section and the information and time of the corresponding vehicles, the method includes the following steps:接收至少一路径规划要求讯息,每一该路径规划要求讯息包括一出发点、一终点及出发时间或到达时间的其中一个;receiving at least one route planning request message, each of which route planning request message includes a departure point, a destination point and one of departure time or arrival time;根据每一该路径规划要求讯息,计算出每一该路径规划要求讯息的最短行车时间的最优路径;According to each of the route planning request messages, calculate the optimal route with the shortest travel time for each of the route planning request messages;分析每一该路径规划要求讯息的该最优路径行经每一该路段的时间,并统计出每一该路段于各时间点对应每一该路径规划要求讯息的该最优路径通过的次数,以得每一该路段于各时间点的预估行车数;及Analyzing the time for the optimal route of each route planning request message to travel through each road segment, and counting the number of times each road segment passes through the optimal route corresponding to each route planning request message at each time point, so as to Obtain the estimated number of vehicles traveling on each road segment at each time point; and依据每一该路段在各时间点的预估行车数,由该数据库取得每一该路段在各时间点对应该预估行车数的预估行车时间。According to the estimated driving number of each road section at each time point, the estimated driving time of each road section corresponding to the estimated driving number at each time point is obtained from the database.13.根据权利要求12所述的路径预估行车时间方法,其特征在于,还包括:13. The route estimation travel time method according to claim 12, is characterized in that, also comprises:依据该时间信息,计算每一该路径的该至少一路段通过时间及该时间的该路段的预估行车时间,每一该至少一路径的该至少一路段的预估行车时间相加,得到每一该至少一路径的路径预估行车时间。According to the time information, calculate the passage time of the at least one road section of each path and the estimated driving time of the road section at this time, add the estimated driving time of the at least one road section of each at least one path, and obtain each An estimated travel time of the at least one route.14.根据权利要求12所述的路径预估行车时间方法,其特征在于,该数据库还包括额外预估修正值、实际测量比值、及每一该路段在各假日、每周各日的各时间点的时间修正值或其组合,该预估行车数依据该最优路径通过的次数、该额外预估修正值、该实际测量比值及该时间修正值求得。14. The method for estimating travel time according to claim 12, wherein the database also includes additional estimated correction values, actual measurement ratios, and the time of each road section on each holiday, each day of the week The time correction value of the point or its combination, the estimated number of trips is obtained based on the number of passing times of the optimal route, the additional estimated correction value, the actual measurement ratio and the time correction value.15.根据权利要求12所述的路径预估行车时间方法,其特征在于,还包括:15. The route estimation travel time method according to claim 12, is characterized in that, also comprises:接收该第一位置及该第二位置的路径行车时间的要求;及receive requests for route travel times for the first location and the second location; and响应该要求,将组成每一该路径的该至少一路段的预估行车时间或依据预估行车时间所得的每一该路径的预估行车时间传出。In response to the request, the estimated driving time of the at least road section forming each of the routes or the estimated driving time of each of the routes obtained according to the estimated driving time is transmitted.16.一种路径规划装置,包括:16. A path planning device, comprising:一数据库,用于储存一地图数据;a database for storing a map data;一输入装置,用于输入一规划信息,该规划信息至少包括一第一位置及一第二位置;An input device for inputting planning information, the planning information includes at least a first location and a second location;一处理装置,依据该第一位置、该第二位置及该地图数据,以规划由该第一位置至该第二位置的至少一路径,每一至少一路径由至少一路段所组成;A processing device, according to the first location, the second location and the map data, to plan at least one path from the first location to the second location, each at least one path is composed of at least one road segment;一无线通讯模块,将该至少一路径信息传到一路径规划系统,并由该路径规划系统接收每一该至少一路径的平均行车时间;及A wireless communication module transmits the at least one route information to a route planning system, and receives the average travel time of each of the at least one route from the route planning system; and一显示装置,该处理装置处理该行车时间,显示该至少一路径及预估行车时间在该显示装置。A display device, the processing device processes the driving time, and displays the at least one route and estimated driving time on the display device.17.根据权利要求16所述的路径规划装置,其特征在于,该数据库还包括预估平均行车时间修正值、每一该路段在各假日、每周各日的各时间点的时间修正值或其组合。17. The route planning device according to claim 16, characterized in that the database also includes an estimated average travel time correction value, a time correction value of each road section at each time point on each holiday, each day of the week, or its combination.18.根据权利要求17所述的路径规划装置,其特征在于,该规划信息还包括一出发时间或一到达时间,该处理装置依据该预估平均行车时间修正值、每一该路段在各假日、每周各日的各时间点的时间修正值,以及该出发时间或该到达时间而计算出符合该出发时间或该到达时间的每一该路径的行车时间。18. The route planning device according to claim 17, characterized in that, the planning information also includes a departure time or an arrival time, and the processing device is based on the estimated average travel time correction value, each road section on each holiday , the time correction value of each time point of each day of the week, and the departure time or the arrival time to calculate the travel time of each route that meets the departure time or the arrival time.19.根据权利要求16所述的路径规划装置,其特征在于,该至少一路径信息是每一该路径的至少一路段。19. The route planning device according to claim 16, wherein the at least one route information is at least one section of each route.20.根据权利要求16所述的路径规划装置,其特征在于,该处理装置依每一该路径的行车距离或行车时间排序并显示到该显示装置。20. The route planning device according to claim 16, wherein the processing device sorts and displays the driving distance or driving time of each route on the display device.
CNB2004101039541A2004-12-312004-12-31Path planning system and methodExpired - Fee RelatedCN100498231C (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CNB2004101039541ACN100498231C (en)2004-12-312004-12-31Path planning system and method

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CNB2004101039541ACN100498231C (en)2004-12-312004-12-31Path planning system and method

Publications (2)

Publication NumberPublication Date
CN1800783A CN1800783A (en)2006-07-12
CN100498231Ctrue CN100498231C (en)2009-06-10

Family

ID=36810918

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CNB2004101039541AExpired - Fee RelatedCN100498231C (en)2004-12-312004-12-31Path planning system and method

Country Status (1)

CountryLink
CN (1)CN100498231C (en)

Families Citing this family (22)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN1975801B (en)*2006-12-292014-05-07冯鲁民City traffic information service system
JP5271637B2 (en)2008-08-282013-08-21アイシン・エィ・ダブリュ株式会社 Travel route evaluation system and travel route evaluation program
CN101750078B (en)*2008-12-182012-06-20鸿富锦精密工业(深圳)有限公司Network navigation system and network navigation method thereof
DE112010003789T5 (en)2009-09-242012-11-29Mitsubishi Electric Corporation DRIVING PATTERN GENERATION DEVICE
CN102128630B (en)*2010-01-142014-07-30歌乐株式会社Navigation method and navigator
CN105741594A (en)*2012-05-072016-07-06联想(北京)有限公司Method, system and electronic device for determining vehicle driving time
CN102768807B (en)*2012-06-142014-09-24龚Vehicle routing method for simulating missile guidance
US9671233B2 (en)2012-11-082017-06-06Uber Technologies, Inc.Dynamically providing position information of a transit object to a computing device
CN103134511B (en)*2012-12-252015-10-07上海博泰悦臻电子设备制造有限公司The reminding method of mobile unit and guidance path
TWI471530B (en)*2013-02-222015-02-01Quanta Comp IncNavigation system and method
US20140278838A1 (en)2013-03-142014-09-18Uber Technologies, Inc.Determining an amount for a toll based on location data points provided by a computing device
DE102013207895A1 (en)2013-04-302014-10-30Kuka Laboratories Gmbh Driverless transport vehicle, system with a computer and a driverless transport vehicle, method for operating a driverless transport vehicle
GB201316386D0 (en)2013-09-152013-10-30Tomtom Dev Germany GmbhGenerating routes to optimise traffic flow
CN104217585A (en)*2014-02-232014-12-17广州市沃希信息科技有限公司Taxi pooling method, system and server
US10424036B2 (en)2014-06-022019-09-24Uber Technologies, Inc.Maintaining data for use with a transport service during connectivity loss between systems
CN105989730B (en)*2015-02-032019-03-12中国移动通信集团辽宁有限公司 A trajectory data processing method, server and system
CN105486321B (en)*2015-11-302018-07-10北京奇虎科技有限公司A kind of processing method of travelling data, server and a kind of vehicle intelligent device
CN106886831A (en)*2015-12-152017-06-23英业达集团(北京)电子技术有限公司Suitable for the path planning system and its method of ambulance vehicles
CN106382939A (en)*2015-12-202017-02-08杭州后博科技有限公司System and method for predicating driving time on navigation path based on historical data
CN109101022A (en)*2018-08-092018-12-28北京智行者科技有限公司A kind of working path update method
CN109767638B (en)*2018-12-172021-08-10北京百度网讯科技有限公司Vehicle control method, device, equipment and computer readable storage medium
CN113222282B (en)*2021-05-312024-06-18北京京东乾石科技有限公司 Method and device for determining transport path, readable storage medium, and electronic device

Citations (7)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
EP0681278A2 (en)*1994-04-281995-11-08Pioneer Electronic CorporationNavigation apparatus and navigation method
WO2001063456A2 (en)*2000-02-222001-08-30Pointserve, Inc.Data formats and usage for massive point to point route calculation
CN1344909A (en)*2000-09-202002-04-17日本先锋公司Navigation system and computer readable message record medium recording navigation control program
CN1345413A (en)*1999-03-012002-04-17环球研究系统公司Base station system and method for monitoring travel of mobile vehicles and communication notification messages
US20030109986A1 (en)*2001-12-122003-06-12Eric TsengRoad navigation method and system
US20030191579A1 (en)*2002-04-032003-10-09Kiyomi SakamotoTravel route searching apparatus
WO2004057273A1 (en)*2002-12-202004-07-08Jicoux Datasystems, Inc.Route search apparatus, route search system, program, and route search method

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
EP0681278A2 (en)*1994-04-281995-11-08Pioneer Electronic CorporationNavigation apparatus and navigation method
CN1345413A (en)*1999-03-012002-04-17环球研究系统公司Base station system and method for monitoring travel of mobile vehicles and communication notification messages
WO2001063456A2 (en)*2000-02-222001-08-30Pointserve, Inc.Data formats and usage for massive point to point route calculation
CN1344909A (en)*2000-09-202002-04-17日本先锋公司Navigation system and computer readable message record medium recording navigation control program
US20030109986A1 (en)*2001-12-122003-06-12Eric TsengRoad navigation method and system
US20030191579A1 (en)*2002-04-032003-10-09Kiyomi SakamotoTravel route searching apparatus
WO2004057273A1 (en)*2002-12-202004-07-08Jicoux Datasystems, Inc.Route search apparatus, route search system, program, and route search method

Also Published As

Publication numberPublication date
CN1800783A (en)2006-07-12

Similar Documents

PublicationPublication DateTitle
CN100498231C (en)Path planning system and method
EP2332021B1 (en)System and method for parking time estimations
CN107040894B (en)A kind of resident trip OD acquisition methods based on mobile phone signaling data
CN111712862B (en)Method and system for generating traffic volume or traffic density data
US8280617B2 (en)Monitoring a mobile device
CN109389416B (en) Digital signage control device, digital signage control method, and recording medium
CN100487750C (en)Method for obtaining traffic information using billing information of mobile terminal
US20170316690A1 (en)Systems and method for estimating and communicating parking lot utilization
US20130317742A1 (en)System and method for estimating origins and destinations from identified end-point time-location stamps
CN109937344A (en) Method and system for generating distribution curve data for segments of an electronic map
CN110118567A (en)Trip mode recommended method and device
CN102157075A (en)Method for predicting bus arrivals
US20060149464A1 (en)Method and system for determining the shortest elapsed time route
CN103177562A (en)Method and device for obtaining information of traffic condition prediction
WO2019087595A1 (en)Mobile body distribution situation forecast device and mobile body distribution situation forecast method
JPH11272983A (en) Route planning device, arrival time prediction device, travel record storage device, route planning / arrival time prediction system
US20230349717A1 (en)Electronic map correction method, navigation information setting method, navigation method, and apparatus
US20210125196A1 (en)Information analysis device and information analysis method
JP3775394B2 (en) Travel link determination system and link travel time measurement system
KR101730398B1 (en)System for managing vehicle information and method thereof
CN113901109A (en)Method for calculating total number of people and time distribution of passenger and truck travel modes on intercity highway
WO2025092853A1 (en)Parking space guidance method and apparatus for parking lot, and electronic device
JP5545780B2 (en) In-vehicle device, vehicle and roadside machine
JP3656604B2 (en) Link travel time estimation apparatus and method
WO2003098556A1 (en)A system for evaluating a vehicles usage within zones

Legal Events

DateCodeTitleDescription
C06Publication
PB01Publication
C10Entry into substantive examination
SE01Entry into force of request for substantive examination
C14Grant of patent or utility model
GR01Patent grant
C17Cessation of patent right
CF01Termination of patent right due to non-payment of annual fee

Granted publication date:20090610

Termination date:20100201


[8]ページ先頭

©2009-2025 Movatter.jp