CN108109416A - A kind of recommendation method and device of programme path - Google Patents
A kind of recommendation method and device of programme path Download PDFInfo
- Publication number
- CN108109416A CN108109416A CN201611061505.4A CN201611061505A CN108109416A CN 108109416 A CN108109416 A CN 108109416A CN 201611061505 A CN201611061505 A CN 201611061505A CN 108109416 A CN108109416 A CN 108109416A
- Authority
- CN
- China
- Prior art keywords
- time
- crossing
- route
- road
- 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
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/09—Arrangements for giving variable traffic instructions
- G08G1/0962—Arrangements for giving variable traffic instructions having an indicator mounted inside the vehicle, e.g. giving voice messages
- G08G1/0968—Systems involving transmission of navigation instructions to the vehicle
- G08G1/096833—Systems involving transmission of navigation instructions to the vehicle where different aspects are considered when computing the route
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3407—Route searching; Route guidance specially adapted for specific applications
- G01C21/343—Calculating itineraries, i.e. routes leading from a starting point to a series of categorical destinations using a global route restraint, round trips, touristic trips
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Physics & Mathematics (AREA)
- Automation & Control Theory (AREA)
- General Physics & Mathematics (AREA)
- Mathematical Physics (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of recommendation method and devices of programme path, receive and calculate road instruction, determine original route region；The first time for reaching the crossing in the original route region is calculated, at least one raw recommendation route is determined with reference to the corresponding restriction rule in crossing；Obtain terminal current location, determine on raw recommendation route without crossing；Judge to reach on the raw recommendation route without crossing the second time and the first time uniformity, it is determined whether calculate at least one and replace recommended route.The above method and device make full use of road restricted driving information to carry out effective programme path calculating, have provided more accurately programme path to the user, efficiently avoid due to navigation guide mistake and bring traffic violation and the behaviors of grade that detour.
Description
Technical field
The present invention relates to a kind of recommendation method and devices of programme path.
Background technology
In existing vehicle mounted guidance, route planning function is for having the restricted driving of road and being that the factors such as traffic lights consider
More cure, the method generally used according to current time is that user does a time-bands when calculating road and starting to be, works as the time
Regulation is in this time-bands, and route will avoid this road section, but thus obtained time-bands are general, poor accuracies,
It drives to have gone to this road section at non-regulation time point so easilying lead to user, and this section of road is avoided during calculating road
Traveling, causes the travel route mistake of user or goes the long way round；And from vehicle walking process, due to there is many factors that can influence
To road speed, it is also possible to cause the time in the arrival somewhere from vehicle change or before regulation information failure, cause
User will walk the section of stretch or restricted driving from vehicle more；For example, a certain crossing is 17:No U turn after 00, to top
After method programme path, time-bands are not 17:After 00, route planning to this crossing is reversed end for end, and due to road conditions or midway delay etc.
Reason, by chance 17 when this crossing is arrived in user's driving:After 00, user carries out traveling u-turn by the prompting of initial planning route, so as to
Traffic ordinance is violated, may be punished accordingly.
The content of the invention
In view of technological deficiency in the prior art and technology drawback, offer of the embodiment of the present invention overcome the above problem or
A kind of recommendation method and device for programme path that person solves the above problems at least partly.
As the one side of the embodiment of the present invention, a kind of recommendation method of programme path is provided, the described method includes：
It receives and calculates road instruction, determine original route region；
The first time for reaching the crossing in the original route region is calculated, is determined at least with reference to the corresponding restriction rule in crossing
One raw recommendation route；
Obtain terminal current location, determine on raw recommendation route without crossing；
Judge to reach on the raw recommendation route without crossing the second time and the first time uniformity, really
It is fixed whether to calculate at least one replacement recommended route.
In one embodiment, original route region is determined, including：
The position of origin and destination is determined respectively, and the is set as reference value using the distance for originating position to destination locations
One closed area.
In one embodiment, it is described to calculate the first time for reaching the crossing in the original route region, including：
Obtain the road that continues of origin；
Read the calculation road information and Real-time Traffic Information of map datum storage；
The elapsed time of each road is calculated successively and reaches the first time at the crossing in the original route region.
In one embodiment, judge to reach on the raw recommendation route without crossing the second time with it is described
The uniformity of first time, it is determined whether it calculates at least one and replaces recommended route, including：
Obtain terminal current state information, Real-time Traffic Information and calculate road information, calculate reach on raw recommendation route without
Second time at crossing；
Judge whether second time for reaching same crossing changes with corresponding restricted information at the first time respectively；
When judging that second time at least one crossing is with corresponding restricted information change at the first time, it is determined that current
Route area；
Calculate second time at crossing in current route region, at least one replacement recommended route be provided, delete described at least one
Raw recommendation route.
In one embodiment, it is described calculate reach raw recommendation route on without in crossing and current route region from
The second time opened, including：
Preset congestion value corresponding with Real-time Traffic Information；
Obtain link length, congestion value, present speed, the elapsed time of the corresponding road of signal lamp stand-by period calculating；
It determines to reach current route region crossing corresponding second time successively with reference to the current calculating time.
As another aspect of the embodiment of the present invention, a kind of recommendation apparatus of programme path, described device bag are also provided
It includes：
Receiving module calculates road instruction for receiving；
Determining module：For determine on route area and raw recommendation route without crossing；
Computing module：For calculating the arrival time at crossing, the arrival time includes first time and the second time；
Read module：For reading the arrival time at crossing in route area with the presence or absence of restricted information；
Memory module：For storing map datum, the map datum includes the restricted information of road；
Calculate road module：For calculating recommended route, the recommended route includes raw recommendation route and replaces recommended route；
Judgment module：For judge reach raw recommendation route on without crossing corresponding second time with described first when
Between uniformity；
Notification module：Notice Ji Xiangsuan roads module for receiving judgment module, which is sent, calculates the notice for replacing recommended route.
In one embodiment, the determining module includes：
First determination subelement, for determining the position of origin and destination, to originate position to the distance of destination locations
The first closed area is set for reference value；
Second determination sub-module, for determine current location on raw recommendation route without crossing information；
3rd determination subelement, for determining terminal current location, using the distance of terminal current location to destination locations as ginseng
It examines value and sets the second closed area.
In one embodiment, the computing module includes：
First obtains subelement, for obtaining the road that continues of origin or current location；
Second obtains subelement, for obtaining terminal's status information；
Subelement is read, for reading the calculation road information and Real-time Traffic Information of map datum storage；
Computation subunit reaches the time for the elapsed time for calculating each road successively and to crossing.
In one embodiment, the judgment module includes：
Extraction unit, for extracting the crossing corresponding first time for including restricted information in current route region；
Judging unit, for judging to reach the second time and the first time on the raw recommendation route without crossing
Whether corresponding restricted information is consistent.
The embodiment of the present invention at least realizes following technique effect：
The present invention by reached in moving process time at each crossing with speculate during initial plan route reach each crossing when
Between compared, it is judging to calculate programme path whether to be changed with time correlation road restricted information, so as to really
It is fixed whether to need again to plan route, the timeliness of time regulation or road restricted driving is taken full advantage of, is carried for user
Phenomena such as having supplied more accurately programme path, having efficiently avoided the next traffic violation of navigation band and detour.
According to from truck position distance to destination targetedly, flexibly divide road area, that is, ensure that way
According to without missing, and dropped storage small and calculated space.
When reach the crossing time and calculate programme path, effectively using real-time traffic information, and combine
The stand-by period of traffic lights calculates the elapsed time of road, so as to improve the accuracy of initial plan route calculation, subtracts
The small possibility to programme path change provides a route that is smooth, stablizing and meet traffic specification to the user.
Other features and advantages of the present invention will be illustrated in the following description, also, partly becomes from specification
It obtains it is clear that being understood by implementing the present invention.The purpose of the present invention and other advantages can be by the explanations write
Recorded structure is realized and obtained in book, claims and attached drawing.
Below by drawings and examples, technical scheme is described in further detail.
Description of the drawings
Attached drawing is used for providing a further understanding of the present invention, and a part for constitution instruction, the reality with the present invention
Example is applied together for explaining the present invention, is not construed as limiting the invention.In the accompanying drawings：
Fig. 1 is the flow chart of one method of the embodiment of the present invention；
Fig. 2 is the flow chart of one S102 steps of the embodiment of the present invention；
Fig. 3 is the structure diagram of one device of inventive embodiments；
Fig. 4 is the flow chart of two method of the embodiment of the present invention；
Fig. 5 is the structure diagram of inventive embodiments two devices.
Specific embodiment
The exemplary embodiment of the disclosure is more fully described below with reference to accompanying drawings.Although the disclosure is shown in attached drawing
Exemplary embodiment, it being understood, however, that may be realized in various forms the disclosure without should be by embodiments set forth here
It is limited.On the contrary, these embodiments are provided to facilitate a more thoroughly understanding of the present invention, and can be by the scope of the present disclosure
Completely it is communicated to those skilled in the art.
Separately below to a kind of various tools of calculating/recommendation method and device of programme path provided in an embodiment of the present invention
Body embodiment is described in detail.
As traffic control is more and more stringenter, the limitation of each road and time correlation has been provided in map datum at present
Information（Time regulation）, including within some period, no U turn at A crossings, B no left turns or certain section of road forbid vehicle
It is current etc..
The restricted information of map datum is combined by the present invention with the calculating of programme path, is provided a kind of accurately utilize and is limited
The programme path computational methods of information processed, and the real-time detection dynamically whether changed to the utilization of restricted information is provided,
Provide optimal programme path to the user in time.
Embodiment 1
The present invention provides the computational methods and device of a kind of programme path, first, are obtained according to the position of departure place and destination
Take relative road, intersection information in a certain range；It is reached using the velocity information speculative computation for memory storage of navigating each
The time at crossing obtains corresponding restricted information by the corresponding time and carries out calculation road, provides an initial plan route；When with
After family is according to initial programme path traveling, then reacquire by current location and the related road in the scope that destination determines
Road, intersection information, and real time information with reference to the actual speed of travel and at that time, recalculate the time for reaching each crossing,
And the arrival time that first time is calculated to storage compares with currently calculating the arrival time obtained, judges whether to belong to identical
Whether time-bands, corresponding restricted information adjust, if belonging to identical time-bands, restricted information does not change, then according to
Initial plan route is prompted, if corresponding time-bands have differed, restricted information changes, then is needed according to real-time letter
Breath, recalculates a programme path, is supplied to user.
The present embodiment provides a kind of computational methods of programme path, such as Fig. 1 specifically includes following steps：
S101：When user sets destination, and road function is calculated in triggering, the corresponding original route area in departure place to destination delimited
Domain；
S102：Using the continuity of road using departure place as starting point, calculated respectively in original route region and reach each crossing
First time, storage reach crossing first time and corresponding restricted information；
S103：The first time for reaching each crossing is determined with the presence or absence of limitation, the of each crossing is reached with reference to described
One time and each crossing, corresponding restricted information carried out calculation road；
S104：Provide raw recommendation route to the user；
S105：After terminal moves, corresponding current route region delimited according to the distance of terminal current location to purpose；
S106：Using the continuity of road using current location as starting point, calculated respectively in current route region and reach each road
Mouthful the second time or reach each the second time without crossing of raw recommendation route, store and described reach the of crossing
Two times；
S107：Judge whether second time restricted information corresponding with the first time for reaching same crossing is consistent,
If so, go to S104；If it is not, then go to S108；
S108：The second time corresponding restricted information according to each crossing is reached is calculated road again, is provided replacement and is recommended road
Line.
Wherein, terminal of the present invention can be vehicle mounted guidance, or the mobile terminals such as mobile phone, tablet computer；This
It invents the storage and is preferably stored in memory, can also store and other memory spaces.
S101 steps are to delimit calculating circuit-switched data scope, by the delimitation in region, reduce the reading of unnecessary data
And calculate, arithmetic speed is accelerated on the premise of computing accuracy is ensured, effectively improves performance.
Preferably, the step of delimitation corresponding original route region in departure place to destination, includes S101 steps：
Using departure place and destination as focus, the position that sets out to the distance of destination locations for short axle, the preset multiple of short axle
For long axis, the first closed area is marked in map, first closed area is original route region；
The effect for the focus that wherein described focus is set when being with delimiting oval is consistent, and the closed area delimited in the present invention is preferred
Ground, which is that ellipse, class ellipse, rectangle etc. are similar, includes long axis, the regular shape of short axle or irregular shape.
By the form of major and minor axis, whole coverings of route are ensure that, and the area for reducing delimitation of maximum magnitude is long
Axis, the preset multiple of short axle can be 1.6,1.8 or 2.0.
In S105 steps, specific division methods and S101 are basically identical, are simply going out with terminal in S101 steps
Hair point is a wherein focus, and with the movement of terminal, the position of terminal is constantly changed, and is become in S105 steps according to terminal
Position after changing carries out determining for current route region for a focus, wherein, current route region is the second closed area.
Under normal circumstances, the area of the second closed area can be gradually reduced, and the area of the first closed area is maximum area,
It is also possible to there is a situation where that the area of the second closed area can become larger, when the area of the second closed area is more than the first enclosed area
It, then can be by judging two regions when the road being related in domain or the second closed area is not present in the first closed area
Interior existing corporate data is judged or is directly calculated road again by the data in the second closed area, will be recommended
Route is compared.
In S102 steps, using the continuity of road, using departure place as origin, destination is terminal, in the first closing
Relevant all road informations are obtained in region, wherein road information includes：Link length, road type and the regulation of road time
Information etc. can obtain the pre-set velocity information of storage, comprehensive initial time, link length and default speed by road type
Degree calculates the time for reaching each crossing, and stores relevant each crossing with restricted driving information and corresponding restricted driving successively
Information.
In S102 steps, it is preferable that such as Fig. 2, specifically comprise the following steps：
S201：Using the succession relation of road, the road that continues of lookup departure place in the first closed area；
S202：When obtaining road information, real time information, setting speed information and the signal lamp of corresponding intersection for the road that continues
It is long；
S203：Calculate the elapsed time of every section of road；
S204：Calculate the first time for reaching each crossing.
Wherein, in S202 steps, road information includes at least link length（L）And road grade；Real time information can lead to
Network acquisition is crossed, including the various ways such as hot spot, wireless, mobile, the main jam situation for including related roads；Pre-set velocity is believed
Cease the velocity information control value counted according to correlation experience and/or big data, such as table 1, and store in database,
In, the rule that 1 medium velocity of table defines is the higher road of category of roads, its passage rate is faster, and the section of more congestion then leads to
Scanning frequency degree is slower, specifically can refer to shown in table 2, but the concrete numerical value enumerated in unlimited and table 2, and value, which can also pass through to gather, to be used
Family feature carries out study optimization；In the durations such as the signal of intersection (Timesignal) storage and map data base.
1 initial road speed list of table
| Highway | Class I highway | Class II highway | Class III highway | Class IV highway | |
| It is unobstructed | V1 | V1.1 | V1.2 | … | … |
| Jogging | V2 | V2.1 | V2.2 | … | … |
| General congestion | V3 | V3.1 | V3.2 | … | … |
| Heavy congestion | V4 | V4.1 | V4.2 | … | … |
2 initial row car team table example unit km/h of table
| Highway | Class I highway | Class II highway | Class III highway | Class IV highway | |
| It is unobstructed | 90 | 60 | 50 | 45 | 40 |
| Jogging | 40 | 30 | 20 | 18 | 18 |
| General congestion | 10 | 10 | 10 | 8 | 8 |
| Heavy congestion | 5 | 5 | 4 | 3 | 3 |
In S203 steps, pass through the real-time of acquisition（TMC）Information determines the jam situation of road, is searched just in conjunction with road grade
The velocity amplitude (being set to V) for the corresponding road section in car team table of beginning.
The road time is calculated since obtaining navigation system, is set to TimeS.
The elapsed time of each section of road is set to TimePass, then TimePass=L/V+Timesignal.
The time for reaching each crossing can be calculated by the elapsed time on every section of road.
The above method combines real-time road information and determines real-time crossing, and according to default speed corresponding table, obtains
Comparatively with reality similar in velocity information, and the length using road and corresponding Signal on Highway Cross duration, accurately
Calculate the time up to each crossing.
Two methods can at least be included in S106 steps, a kind of is to calculate second to the crossing in current route region
Time；It is a kind of for calculate raw recommendation route on without crossing the second time, wherein, calculate reach crossing second when
Between in S105 steps calculate reach crossing first time method it is similar, something in common repeats no more, the difference is that,
In S106 steps be in the second closed area, according to current location obtain continue road and corresponding road information, in real time
The TMC information of acquisition, and a congestion resistance value reference table is defined according to correlation experience and big data and is stored in terminal, such as table 3, tool
Body numerical value can refer to shown in table 4, but the concrete numerical value enumerated in unlimited and table 4.
3 congestion resistance value reference table of table
| It is unobstructed | Jogging | General congestion | Heavy congestion | |
| Congestion resistance value | R1 | R2 | R3 | R4 |
4 congestion resistance value reference table of table
| It is unobstructed | Jogging | General congestion | Heavy congestion | |
| Congestion resistance value | 1 | 3 | 6 | 10 |
By taking the resistance value of heavy congestion as an example, it is defined as 10, be equivalent to user needs 10 times from this section of road of vehicle traveling
Normal through the time.
The resistance value of acquisition is set to R, the elapsed time of each section of road is set to TimePass, i.e.,
TimePass = L*R/V + Timesignal.
In addition, the velocity information obtained is for the current actual vehicle speed of vehicle or when actual vehicle speed is beyond the threshold value of setting
When, then calculating speed is extrapolated by actual vehicle speed and preset vehicle speed.
In S105, S106 step, it is further preferred that calculating arrival time and the arrival for reaching first segment crossing respectively
The arrival time at other crossings, when the arrival time at the first segment crossing passes through according to beginning planning time and first segment road
Between obtain, arrival time at other crossings obtains according to the arrival time and corresponding road elapsed time at the last period crossing.
It is passed through specifically, calculating the road time being just from the arrival time since truck position to first crossing plus first segment road
The time is spent, i.e.,
TimeR = TimeS + TimePass。
It calculates later for convenience, sets crossing the last period, TimePre arrival time, be then assigned to TimeR values
TimePre, and recorded with memory.
It is continued using road, obtains next section of road.
The arrival time at each section of crossing adds the elapsed time of this section of road for the arrival time at the last period crossing, i.e.,
TimeR = TimePre + TimePass。
So repeatedly to get to crossing arrival time all in oval scope and time regulation point and restricted driving point.
In S103, by the arrival time at each crossing in the original route region of above-mentioned steps acquisition, by map number
Compare in contrast according to the restricted information of middle storage, determine to reach the first time at each crossing with the presence or absence of corresponding limitation, knot
It closes first time and each crossing corresponding restricted information for reaching each crossing and carries out calculation road；
In S104, result of calculation in S103 provides a road for considering detailed road restricted information, for
Family provides raw recommendation route；
During user is according to raw recommendation route traveling, according to default frequency or time interval, every five seconds for example is such as travelled
Clock often travels 300 meters etc.；Or fixed mark, such as every time apart from 500 meters, starting step S105 of junction ahead, above
The realization method of S105, S106 step is described, details are not described herein.
In S107 steps, compared by the time to front and rear arrival crossing, the time for obtaining corresponding crossing restricts driving
The information whether information changes, according to just fixed raw recommendation route running if not changing, if corresponding change letter
Breath is different, this needs to perform S108 steps, and the data obtained according to the nearest time are calculated road again, replaces raw recommendation road
Line provides replacement recommended route.
Wherein S107 step methods can include：
Whether when obtaining crossing of the current location in current route region, can first obtain includes having limit in pre-determined distance
The crossing of information processed；
When there is the crossing with restricted information in the pre-determined distance, then having including described in pre-determined distance is judged
The first time at the crossing of restricted information, whether restricted information corresponding with the second time was consistent.
Wherein, pre-determined distance is also 400,500,600 meters etc., can be closely according to away from current distance by the above method
Nearest crossing is calculated and is compared, it is possible to determine the need for carrying out programme path again, without to the second envelope
Whole intersection informations is compared in closed region, effectively reduces calculation amount.
Can also only obtain current location without raw recommendation route crossing, calculate its second time, Ran Houjin
Row comparison, if there are at least one restricted informations（Time regulation）Road is then calculated at inconsistent crossing again, replaces original push away
Recommend route.
Uniformity described herein not only includes restricted information time corresponding with the second time upper phase at the first time
Unanimously, and it also may indicate that restricted information corresponding with the second time is to the shadow on calculation road at the first time in this calculation road period
Whether sound is consistent, such as：It is 7 when the limitation time of crossing a:00-8:00, it calculates and reaches the first time at a crossings as 6:50, by
It is delayed in something, when calculating again, the second time for reaching a crossings is 8:10, although then at the first time with the second time not
Belong to same time period, but for restricted information belong to prevailing state, that is, when judging that the first time at the crossing is with second
Between it is consistent, it is understood that be that the uniformity of the restricted information is according to its condition adjudgement that is current and forbidding, if at two
Between be in the illegal state of unconfined prevailing state or restricted driving, show consistent, judge if state changes inconsistent.
Based on same inventive concept, the embodiment of the present invention additionally provides a kind of computing device of programme path, due to the dress
It is similar to put the computational methods of the principle of solved problem and the programme path of previous embodiment, therefore the implementation of the device can be joined
See the implementation of the method for previous embodiment, overlaps will not be repeated.
The embodiment of the present invention additionally provides a kind of computing device of programme path, such as Fig. 3, and described device includes：
Receiving module 11 calculates road instruction for receiving；
Determining module 12：For determining route area；
Computing module 13：For calculating the arrival time at crossing, the arrival time includes first time and the second time；
Read module 15：For reading the arrival time at crossing in route area with the presence or absence of restricted information；
Memory module 14：For storing map datum, the map datum includes the restricted information of road；
Calculate road module 16：For calculating recommended route, the recommended route includes raw recommendation route and replaces recommended route；
Judgment module 17：For judging to reach crossing corresponding second time and the one of the first time in current route region
Cause property；
Notification module 18：Notice Ji Xiangsuan roads module for receiving judgment module, which is sent, calculates the notice for replacing recommended route.
Further, the determining module 12 includes：
First determination subelement, for determining the position of origin and destination, to originate position to the distance of destination locations
The first closed area is set for reference value；
Second determination subelement, for determining terminal current location, using the distance of terminal current location to destination locations as ginseng
It examines value and sets the second closed area.
Further, the computing module 13 includes：
First obtains subelement, for obtaining the road that continues of origin or current location；
Second obtains subelement, for obtaining terminal's status information；
Subelement is read, for reading the calculation road information and Real-time Traffic Information of map datum storage；
Computation subunit reaches the time for the elapsed time for calculating each road successively and to crossing.
Further, the judgment module 17 includes：
Extraction unit, for extracting the crossing corresponding first time for including restricted information in current route region；
Judging unit, for judging whether first time restricted information corresponding with the second time is consistent.
The present embodiment one additionally provides a kind of server, the device calculated including programme path as described above.
Embodiment two
A kind of recommendation method of programme path is present embodiments provided, the described method includes：
S301, which is received, calculates road instruction, determines original route region；
S302 calculates the first time for reaching the crossing in the original route region, is determined with reference to the corresponding restriction rule in crossing
At least one raw recommendation route；
S303 obtain terminal current location, determine on raw recommendation route without crossing；
S304 judge to reach on the raw recommendation route without crossing the second time it is consistent with the first time
Property, it is determined whether it calculates at least one and replaces recommended route.
Further, it is determined that original route region, including：
The position of origin and destination is determined respectively, and the is set as reference value using the distance for originating position to destination locations
One closed area.
Further, it is described to calculate the first time for reaching the crossing in the original route region, including：
Obtain the road that continues of origin；
Read the calculation road information and Real-time Traffic Information of map datum storage；
The elapsed time of each road is calculated successively and reaches the first time at the crossing in the original route region.
Further, judge to reach on the raw recommendation route without crossing the second time with described first when
Between uniformity, it is determined whether calculate at least one replace recommended route, including：
Obtain terminal current state information, Real-time Traffic Information and calculate road information, calculate reach on raw recommendation route without
Second time at crossing；
Judge whether second time for reaching same crossing changes with corresponding restricted information at the first time respectively；
When judging that second time at least one crossing is with corresponding restricted information change at the first time, it is determined that current
Route area；
Calculate second time at crossing in current route region, at least one replacement recommended route be provided, delete described at least one
Raw recommendation route.
Further, described calculate is reached on raw recommendation route without the left in crossing and current route region
Two times, including：
Preset congestion value corresponding with Real-time Traffic Information；
Obtain link length, congestion value, present speed, the elapsed time of the corresponding road of signal lamp stand-by period calculating；
It determines to reach current route region crossing corresponding second time successively with reference to the current calculating time.
Flow shown in above-mentioned steps S301 ~ S304, it is similar with embodiment one, the difference is that, embodiment second is that
After obtaining terminal current location, first determine on raw recommendation route without crossing；To the crossing on raw recommendation route
Second time was calculated, then second time at the crossing on raw recommendation route is compared with corresponding first time,
If currently the second time without crossing and corresponding restricted information at the first time wherein on raw recommendation route（Time advises
Then）Belong to same time period, then without calculating road again, continue to obtain location information, be guided according to raw recommendation route,
But if currently the second time without crossing and corresponding restricted information at the first time on raw recommendation route（Time advises
Then）Belong to inconsistent, belong to the time runed counter to, then need to redefine the current route region of current location, recalculate
Second time at all crossings in current route region, then calculation road is carried out, a replacement recommended route is provided；And embodiment one
It is after terminal current location is obtained, first determines current route region, then calculate second time at crossing on raw recommendation route
Or at least part, second time at even all of crossing in current region, then compared, if unanimously, this is continuing with original
Beginning recommended route guides, if inconsistent, this need not redefine regional extent, using current route region definite for the first time as
The region of route searching carries out calculation road.
Similar with the technical solution of embodiment one, technical solution provided by Embodiment 2 of the present invention fully takes into account traveling
The variation of time in the process compares after calculating the time with the estimated arrival crossing in traveling before travelling, and judges to calculate road
The restricted information utilized（Time regulation）Whether change, determine whether to need to carry out route calculation again, be carried for user
For a more accurately guiding route, efficiently avoid traffic violation that navigation guide error tape comes and detour etc. existing
As.
Based on same inventive concept, the embodiment of the present invention two additionally provides a kind of recommendation apparatus of programme path, such as Fig. 5,
Described device includes：
Receiving module 11 calculates road instruction for receiving；
Determining module 12, for determine on route area and raw recommendation route without crossing；
Computing module 13, for calculating the arrival time at crossing, the arrival time includes first time and the second time；
Read module 14, for reading the arrival time at crossing in route area with the presence or absence of restricted information；
Memory module 15, for storing map datum, the map datum includes the restricted information of road；
Road module 16 is calculated, for calculating recommended route, the recommended route includes raw recommendation route and replaces recommended route；
Judgment module 17, for judge reach raw recommendation route on without crossing corresponding second time and described first
The uniformity of time；
Notification module 18, the notice Ji Xiangsuan roads module for receiving judgment module, which is sent, calculates the notice for replacing recommended route.
The apparatus structure of the present embodiment is similar to embodiment one, but its internal information flow and differs, and is applying example two
In, determining module is sent to computing module first it is confirmed that crossing on raw recommendation route, then to after judgment module, if
Corresponding with the second time time regulation is consistent at the first time, then is determined without crossing in current route region, if differing
It causes, then judgment module sends to determining module notify again, receives the crossing for determining current route region after notifying again, counts respectively
Calculate the second time in crossing.Further, the determining module includes：
First determination subelement, for determining the position of origin and destination, to originate position to the distance of destination locations
The first closed area is set for reference value；
Second determination sub-module, for determine current location on raw recommendation route without crossing information；
3rd determination subelement, for determining terminal current location, using the distance of terminal current location to destination locations as ginseng
It examines value and sets the second closed area.
Further, the computing module includes：
First obtains subelement, for obtaining the road that continues of origin or current location；
Second obtains subelement, for obtaining terminal's status information；
Subelement is read, for reading the calculation road information and Real-time Traffic Information of map datum storage；
Computation subunit reaches the time for the elapsed time for calculating each road successively and to crossing.
Further, the judgment module includes：
Extraction unit, for extracting the crossing corresponding first time for including restricted information in current route region；
Judging unit, for judging to reach the second time and the first time on the raw recommendation route without crossing
Whether corresponding restricted information is consistent.
The present embodiment two additionally provides a kind of server, includes the recommendation apparatus of programme path as described above.
It should be understood by those skilled in the art that, the embodiment of the present invention can be provided as method, system or computer program
Product.Therefore, the reality in terms of complete hardware embodiment, complete software embodiment or combination software and hardware can be used in the present invention
Apply the form of example.Moreover, the computer for wherein including computer usable program code in one or more can be used in the present invention
Usable storage medium（Including but not limited to magnetic disk storage and optical memory etc.）The shape of the computer program product of upper implementation
Formula.
The present invention be with reference to according to the method for the embodiment of the present invention, equipment（System）And the flow of computer program product
Figure and/or block diagram describe.It should be understood that it can be realized by computer program instructions every first-class in flowchart and/or the block diagram
The combination of flow and/or box in journey and/or box and flowchart and/or the block diagram.These computer programs can be provided
The processor of all-purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices is instructed to produce
A raw machine so that the instruction performed by computer or the processor of other programmable data processing devices is generated for real
The device for the function of being specified in present one flow of flow chart or one box of multiple flows and/or block diagram or multiple boxes.
These computer program instructions, which may also be stored in, can guide computer or other programmable data processing devices with spy
Determine in the computer-readable memory that mode works so that the instruction generation being stored in the computer-readable memory includes referring to
Make the manufacture of device, the command device realize in one flow of flow chart or multiple flows and/or one box of block diagram or
The function of being specified in multiple boxes.
These computer program instructions can be also loaded into computer or other programmable data processing devices so that counted
Series of operation steps is performed on calculation machine or other programmable devices to generate computer implemented processing, so as in computer or
The instruction offer performed on other programmable devices is used to implement in one flow of flow chart or multiple flows and/or block diagram one
The step of function of being specified in a box or multiple boxes.
Obviously, various changes and modifications can be made to the invention without departing from essence of the invention by those skilled in the art
God and scope.In this way, if these modifications and changes of the present invention belongs to the scope of the claims in the present invention and its equivalent technologies
Within, then the present invention is also intended to comprising including these modification and variations.
Claims (10)
1. a kind of recommendation method of programme path, which is characterized in that the described method includes：
It receives and calculates road instruction, determine original route region；
The first time for reaching the crossing in the original route region is calculated, is determined at least with reference to the corresponding restriction rule in crossing
One raw recommendation route；
Obtain terminal current location, determine on raw recommendation route without crossing；
Judge to reach on the raw recommendation route without crossing the second time and the first time uniformity, really
It is fixed whether to calculate at least one replacement recommended route.
2. the method as described in claim 1, which is characterized in that determine original route region, including：
The position of origin and destination is determined respectively, and the is set as reference value using the distance for originating position to destination locations
One closed area.
3. the method as described in claim 1, which is characterized in that described calculate reaches the crossing in the original route region
At the first time, including：
Obtain the road that continues of origin；
Read the calculation road information and Real-time Traffic Information of map datum storage；
The elapsed time of each road is calculated successively and reaches the first time at the crossing in the original route region.
4. the method as described in claim 1-3 any one, which is characterized in that judge to reach on the raw recommendation route not
Second time at the crossing of process and the uniformity of the first time, it is determined whether it calculates at least one and replaces recommended route,
Including：
Obtain terminal current state information, Real-time Traffic Information and calculate road information, calculate reach on raw recommendation route without
Second time at crossing；
Judge whether second time for reaching same crossing changes with corresponding restricted information at the first time respectively；
When judging that second time at least one crossing is with corresponding restricted information change at the first time, it is determined that current
Route area；
Calculate second time at crossing in current route region, at least one replacement recommended route be provided, delete described at least one
Raw recommendation route.
5. method as claimed in claim 4, which is characterized in that it is described calculate reach on raw recommendation route without crossing and
The second time left in current route region, including：
Preset congestion value corresponding with Real-time Traffic Information；
Obtain link length, congestion value, present speed, the elapsed time of the corresponding road of signal lamp stand-by period calculating；
It determines to reach current route region crossing corresponding second time successively with reference to the current calculating time.
6. a kind of recommendation apparatus of programme path, which is characterized in that described device includes：
Receiving module calculates road instruction for receiving；
Determining module：For determine on route area and raw recommendation route without crossing；
Computing module：For calculating the arrival time at crossing, the arrival time includes first time and the second time；
Read module：For reading the arrival time at crossing in route area with the presence or absence of restricted information；
Memory module：For storing map datum, the map datum includes the restricted information of road；
Calculate road module：For calculating recommended route, the recommended route includes raw recommendation route and replaces recommended route；
Judgment module：For judge reach raw recommendation route on without crossing corresponding second time with described first when
Between uniformity；
Notification module：Notice Ji Xiangsuan roads module for receiving judgment module, which is sent, calculates the notice for replacing recommended route.
7. device as claimed in claim 6, which is characterized in that the determining module includes：
First determination subelement, for determining the position of origin and destination, to originate position to the distance of destination locations
The first closed area is set for reference value；
Second determination sub-module, for determine current location on raw recommendation route without crossing information；
3rd determination subelement, for determining terminal current location, using the distance of terminal current location to destination locations as ginseng
It examines value and sets the second closed area.
8. device as claimed in claim 7, which is characterized in that the computing module includes：
First obtains subelement, for obtaining the road that continues of origin or current location；
Second obtains subelement, for obtaining terminal's status information；
Subelement is read, for reading the calculation road information and Real-time Traffic Information of map datum storage；
Computation subunit reaches the time for the elapsed time for calculating each road successively and to crossing.
9. device as claimed in claim 6, which is characterized in that the judgment module includes：
Extraction unit, for extracting the crossing corresponding first time for including restricted information in current route region；
Judging unit, for judging to reach the second time and the first time on the raw recommendation route without crossing
Whether corresponding restricted information is consistent.
A kind of 10. server, which is characterized in that the recommendation dress including the programme path as described in claim 6-9 any one
It puts.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611061505.4A CN108109416A (en) | 2016-11-25 | 2016-11-25 | A kind of recommendation method and device of programme path |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201611061505.4A CN108109416A (en) | 2016-11-25 | 2016-11-25 | A kind of recommendation method and device of programme path |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108109416A true CN108109416A (en) | 2018-06-01 |
Family
ID=62205437
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201611061505.4A Pending CN108109416A (en) | 2016-11-25 | 2016-11-25 | A kind of recommendation method and device of programme path |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108109416A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108897317A (en) * | 2018-06-14 | 2018-11-27 | 上海大学 | A kind of path optimization method, relevant apparatus and the storage medium of automatic guided vehicle AGV |
| CN112950977A (en) * | 2021-02-02 | 2021-06-11 | 上海闵青市政工程有限公司 | Muck truck transportation management method, system, terminal and storage medium |
| CN113593240A (en) * | 2021-09-28 | 2021-11-02 | 湖南车路协同智能科技有限公司 | Vehicle path planning method and system for vehicle-road cooperation |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0697686A2 (en) * | 1994-08-18 | 1996-02-21 | Bayerische Motoren Werke Aktiengesellschaft, Patentabteilung AJ-3 | Navigation method for motor vehicles |
| CN1573837A (en) * | 2003-05-28 | 2005-02-02 | Lg电子有限公司 | System and method for estimating driving time using road traffic condition information |
| CN101893444A (en) * | 2009-05-18 | 2010-11-24 | 深圳富泰宏精密工业有限公司 | Vehicle navigation system and method |
| CN102679990A (en) * | 2011-03-16 | 2012-09-19 | 高德软件有限公司 | Navigation method and device |
| CN105023456A (en) * | 2014-04-24 | 2015-11-04 | 深圳市赛格导航科技股份有限公司 | Self-adaptive intelligent line planning method based on traffic signal lamp signal change |
-
2016
- 2016-11-25 CN CN201611061505.4A patent/CN108109416A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP0697686A2 (en) * | 1994-08-18 | 1996-02-21 | Bayerische Motoren Werke Aktiengesellschaft, Patentabteilung AJ-3 | Navigation method for motor vehicles |
| CN1573837A (en) * | 2003-05-28 | 2005-02-02 | Lg电子有限公司 | System and method for estimating driving time using road traffic condition information |
| CN101893444A (en) * | 2009-05-18 | 2010-11-24 | 深圳富泰宏精密工业有限公司 | Vehicle navigation system and method |
| CN102679990A (en) * | 2011-03-16 | 2012-09-19 | 高德软件有限公司 | Navigation method and device |
| CN105023456A (en) * | 2014-04-24 | 2015-11-04 | 深圳市赛格导航科技股份有限公司 | Self-adaptive intelligent line planning method based on traffic signal lamp signal change |
Non-Patent Citations (2)
| Title |
|---|
| 王学慧，等: "《交通信息技术基础》", 31 August 2015, 国防工业出版社 * |
| 隋亚刚等: "《城市道路***编码方法及其应用》", 31 December 2009, 中国铁道出版社 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108897317A (en) * | 2018-06-14 | 2018-11-27 | 上海大学 | A kind of path optimization method, relevant apparatus and the storage medium of automatic guided vehicle AGV |
| CN108897317B (en) * | 2018-06-14 | 2021-03-26 | 上海大学 | Automatic guided vehicle AGV path optimization method, related device and storage medium |
| CN112950977A (en) * | 2021-02-02 | 2021-06-11 | 上海闵青市政工程有限公司 | Muck truck transportation management method, system, terminal and storage medium |
| CN113593240A (en) * | 2021-09-28 | 2021-11-02 | 湖南车路协同智能科技有限公司 | Vehicle path planning method and system for vehicle-road cooperation |
| CN113593240B (en) * | 2021-09-28 | 2021-12-21 | 湖南车路协同智能科技有限公司 | Vehicle path planning method and system for vehicle-road cooperation |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11378404B2 (en) | Methods and systems for generating a horizon for use in an advanced driver assistance system (ADAS) | |
| CN102636177B (en) | A kind of navigation path planning method and device, navigational system | |
| JP6558239B2 (en) | Automatic driving support system, automatic driving support method, and computer program | |
| CN104949679B (en) | Navigation information determines method and device | |
| CN1841022B (en) | Navigation system and program for the same | |
| CN104422457B (en) | A kind of air navigation aid and device | |
| CN108106621A (en) | Calculation method and device for planned route | |
| JP6558238B2 (en) | Automatic driving support system, automatic driving support method, and computer program | |
| Wang et al. | A multi-agent based vehicles re-routing system for unexpected traffic congestion avoidance | |
| US20210010824A1 (en) | Methods and Systems for Generating Parking Routes | |
| CN109242206A (en) | A kind of paths planning method, system and storage medium | |
| US20190101404A1 (en) | Information processing method and electronic device | |
| CN104616520A (en) | Method and device for dynamically recording navigation trail | |
| CN110646004B (en) | Intelligent navigation method and device based on road condition prediction | |
| JP2018087764A (en) | Guide route setup device and guide route setup method | |
| CN108109416A (en) | A kind of recommendation method and device of programme path | |
| CN106023629A (en) | Path recommendation method and path recommendation device | |
| CN104236577A (en) | Information processing method and electronic equipment | |
| CN103236170A (en) | Novel dynamic-road-network-based traffic guidance method | |
| CN102967318B (en) | A kind of air navigation aid and positioning navigating device | |
| CN107025798A (en) | A kind of information processing method and device | |
| JP6633372B2 (en) | Route search device and route search method | |
| CN112748736B (en) | Vehicle driving assisting method and device | |
| CN113611107A (en) | Non-networked intersection traffic reminding method | |
| JP2012137833A (en) | Congestion information generation device, congestion information generation method, and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180601 |
|
| RJ01 | Rejection of invention patent application after publication |