CN107869995A - A kind of generation method, system and the mobile terminal of path duration - Google Patents

A kind of generation method, system and the mobile terminal of path duration Download PDF

Info

Publication number
CN107869995A
CN107869995A CN201610858342.6A CN201610858342A CN107869995A CN 107869995 A CN107869995 A CN 107869995A CN 201610858342 A CN201610858342 A CN 201610858342A CN 107869995 A CN107869995 A CN 107869995A
Authority
CN
China
Prior art keywords
destination
path
duration
candidate
path candidate
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
Application number
CN201610858342.6A
Other languages
Chinese (zh)
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.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding Ltd
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 Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Priority to CN201610858342.6A priority Critical patent/CN107869995A/en
Publication of CN107869995A publication Critical patent/CN107869995A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01CMEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/26Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
    • G01C21/34Route searching; Route guidance
    • G01C21/3453Special cost functions, i.e. other than distance or default speed limit of road segments
    • G01C21/3492Special 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)
  • Automation & Control Theory (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Navigation (AREA)

Abstract

This programme embodiment provides a kind of generation method, mobile terminal and the system of path duration, and methods described includes:According to M destination, N number of path candidate is determined;For each path candidate, the stay time of each destination in the path candidate is obtained;And according to the stay time of each destination in the path candidate and the path candidate by duration, generate the path duration of the path candidate.The path duration generated in this programme embodiment more conforms to the duration consumed when actually accomplishing path candidate, therefore the path duration of each path candidate generated is more accurate.

Description

A kind of generation method, system and the mobile terminal of path duration
Technical field
The present invention relates to technical field of intelligent traffic, more particularly to a kind of generation method, system and the movement of path duration Terminal.
Background technology
If user will go at least two destinations, then user is led to when using the mobile terminal including navigation Often at least two destinations are disposably set in navigation, navigates and path candidate, and root is determined according at least two destination The path duration of each path candidate is generated according to current traffic information.In the prior art, the path duration of generation only includes this Path duration between at least two destinations, specifically as shown in figure 1, destination includes destination A, destination B and destination C Three, one of path candidate is:Departure place → destination A → destination B → destination C, the path duration bag in the path Include between departure place and destination A by duration T1, pass through duration T2, and destination between destination A and destination B Between B and destination C by duration T3, it is a length of during the path in the path:T1+T2+T3.
During the present invention is realized, inventor has found prior art, and at least there are the following problems:
For user during at least two destinations are gone to, path duration is actually comprised in the stay time of each destination Path duration between each destination, therefore the path duration accuracy generated in the prior art is relatively low.
The content of the invention
This programme embodiment provides a kind of generation method, mobile terminal and the system of path duration, to improve generation The accuracy of path duration.
In a first aspect, this programme embodiment provides a kind of generation method of path duration, methods described includes:
According to M destination, N number of path candidate is determined, wherein, M is the integer more than 1, and N is positive integer, each described The M destination is included in path candidate;
For each path candidate, the stay time of each destination in the path candidate is obtained;And according to this In path candidate the stay time of each destination and the path candidate by duration, when generating the path of the path candidate It is long.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, it is described for every The individual path candidate, the stay time of each destination in the path candidate is obtained, including:
For each path candidate, the history stay time of each destination in the path candidate is obtained;And root According to the history stay time of each destination in the path candidate, the stay time of each destination in the path candidate is determined.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the acquisition should The history stay time of each destination in path candidate, including:
For each destination in the path candidate, according to the moment of setting out, the due in of the destination is obtained;
Obtain in the due in, history stay time corresponding to the destination.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, it is described for this Each destination in path candidate, according to the moment of setting out, the due in of the destination is obtained, including:
For each destination in the path candidate, according to the 1st destination in the moment of setting out, the path candidate extremely In the destination between the adjacent destination of each two by between duration, departure place and the 1st destination by duration with And in the path candidate the 1st destination each destination into the destination stay time, obtain the arrival of the destination Moment.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, according to it is described go out The hair moment, in the path candidate the 1st destination into the destination between the adjacent destination of each two by duration, set out Pass through the 1st destination each purpose into the destination in duration and the path candidate between ground and the 1st destination The stay time on ground, before the due in for obtaining the destination, methods described also includes:
Set out the moment according to described, obtain the 1st destination adjacent mesh of each two into the destination in the path candidate Ground between pass through duration;Or
According to the due in of a upper destination for the destination in the path candidate, obtain the 1st in the path candidate Individual destination passes through duration into the destination between the adjacent destination of each two.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the basis should The history stay time of each destination in path candidate, the stay time of each destination in the path candidate is determined, including:
For each destination in the path candidate, existed according to the default history stay time of the destination, the destination The average stay time of history and the average stay time of history of the destination in second time period in first time period, it is determined that The stay time of each destination in the path candidate.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the basis should In path candidate the stay time of each destination and the path candidate by duration, when generating the path of the path candidate It is long, including:
It is somebody's turn to do according to the stay time of each destination in the path candidate with the path candidate by duration sum The path duration of path candidate.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, in the generation After the path duration of the path candidate, methods described also includes:
When N is more than 1, according to the path duration of each path candidate in each path candidate, from each path candidate K destination path is selected, K is more than or equal to 1, and is less than or equal to N.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, methods described is also Including:
Export the K destination path and/or each self-corresponding path duration of the K destination path.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, in the generation After the path duration of the path candidate, methods described also includes:
Export each path candidate and/or each self-corresponding path duration of each path candidate.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, methods described is also Including:
The destination path selected according to user, is navigated;And/or
The destination path selected according to user, under the destination path selected described in display between the adjacent destination of each two Pass through duration and the stay time of each destination;And/or
The destination path selected according to user, generate electronic map;And/or
The destination path selected according to user, show road information;And/or
The destination path selected according to user, the display information point POI related to destination, and show that the POI's is attached Add information on services;And/or
Show the geographical location information of each destination;And/or
The destination path selected according to user, the traffic accident section occurred frequently in the destination path selected described in display;With/ Or,
The destination path that user is selected is shared.
In this programme embodiment, according to the logical of the stay time of each destination in the path candidate and the path candidate Duration is crossed, generates the path duration of the path candidate.With being only somebody's turn to do in the prior art according to the path candidate by duration generation The path duration of path candidate is compared, and in this programme embodiment, during the path duration of the path candidate is generated, is examined Consider the stay time of each destination in the path candidate, include the time in the path duration of the path candidate of generation The stay time of each destination in routing footpath, and the path candidate by duration, therefore, should with generation in the prior art The method of the path duration of path candidate is compared, and the path duration of the path candidate generated in this programme embodiment more conforms to The duration consumed when actually accomplishing the path candidate, further, this programme embodiment improve the candidate road of generation The accuracy of the path duration in footpath.
Second aspect, this programme embodiment additionally provide a kind of mobile terminal, and the mobile terminal includes:
Path-calculating element, for according to M destination, determining N number of path candidate, wherein, M is the integer more than 1, N For positive integer, each the M destination is included in the path candidate;
Duration calculation unit, for for each path candidate, obtaining stopping for each destination in the path candidate Stay duration;And should by duration, generation according to the stay time of each destination in the path candidate and the path candidate The path duration of path candidate.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the duration meter Unit is calculated, is specifically used for:
For each path candidate, the history stay time of each destination in the path candidate is obtained;
According to the history stay time of each destination in the path candidate, each destination in the path candidate is determined Stay time.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the duration meter Unit is calculated, is specifically used for:
It is somebody's turn to do according to the stay time of each destination in the path candidate with the path candidate by duration sum The path duration of path candidate.
In this programme embodiment, the second duration calculation unit is according to the stay time of each destination in the path candidate With the path candidate by duration, the path duration of the path candidate is generated.With in the prior art only according to the path candidate The path duration that the path candidate is generated by duration compare, in this programme embodiment, generate the path candidate road During the duration of footpath, it is contemplated that the stay time of each destination in the path candidate, the road of the path candidate of generation Include the stay time of each destination in the path candidate in the duration of footpath, and the path candidate by duration, therefore, Compared with the method for path duration for generating the path candidate in the prior art, the path candidate that is generated in this programme embodiment Path duration more conform to the duration consumed when actually accomplishing the path candidate, further, this programme embodiment carries The high accuracy of the path duration of the path candidate of generation.
The third aspect, this programme embodiment additionally provide a kind of generation system of path duration, and the system includes:Service Device and mobile terminal;
The mobile terminal, for receiving M destination of user's input;And sent to the server described M Destination;Wherein, M is the integer more than 1;
The server, the M destination sent for receiving the mobile terminal;And according to the M mesh Ground, determine N number of path candidate, N is positive integer, and the M destination is included in each path candidate;And for Every path candidate, obtain the stay time of each destination in the path candidate;And according to each mesh in the path candidate Ground stay time and the path candidate by duration, generate the path duration of the path candidate.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, It is specifically used for:
For each path candidate, the history stay time of each destination in the path candidate is obtained;
According to the history stay time of each destination in the path candidate, each destination in the path candidate is determined Stay time.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, Also particularly useful for:
For each destination in the path candidate, according to the moment of setting out, the due in of the destination is obtained;
Obtain in the due in, history stay time corresponding to the destination.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, Also particularly useful for:
For each destination in the path candidate, according to the 1st destination in the moment of setting out, the path candidate extremely In the destination between the adjacent destination of each two by between duration, departure place and the 1st destination by duration with And in the path candidate the 1st destination each destination into the destination stay time, obtain the arrival of the destination Moment.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, It is additionally operable to:
Set out the moment according to described, obtain the 1st destination adjacent mesh of each two into the destination in the path candidate Ground between pass through duration;Or
According to the due in of a upper destination for the destination in the path candidate, obtain the 1st in the path candidate Individual destination passes through duration into the destination between the adjacent destination of each two.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, Also particularly useful for:
For each destination in the path candidate, existed according to the default history stay time of the destination, the destination The average stay time of history and the average stay time of history of the destination in second time period in first time period, it is determined that The stay time of each destination in the path candidate.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, Also particularly useful for:
It is somebody's turn to do according to the stay time of each destination in the path candidate with the path candidate by duration sum The path duration of path candidate.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, It is additionally operable to:
When N is more than 1, according to the path duration of each path candidate in each path candidate, from each path candidate K destination path is selected, K is more than or equal to 1, and is less than or equal to N.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, Be additionally operable to the mobile terminal send the K destination path and/or each self-corresponding path of the K destination path when It is long;
The mobile terminal, it is additionally operable to receive the K destination path and/or the K mesh that the server is sent Mark each self-corresponding path duration in path.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, it is described mobile whole End, is additionally operable to export the K destination path and/or each self-corresponding path duration of the K destination path.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, the server, It is additionally operable to send each path candidate and/or each self-corresponding path duration of each path candidate to the mobile terminal;
The mobile terminal, it is additionally operable to receive each path candidate and/or each candidate that the server is sent Each self-corresponding path duration in path.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, it is described mobile whole End, is additionally operable to export each path candidate and/or each self-corresponding path duration of each path candidate.
Aspect as described above and any possible implementation, it is further provided a kind of implementation, it is described mobile whole End, is additionally operable to the destination path selected according to user, is navigated;And/or the destination path selected according to user, show institute State under the destination path selected between the adjacent destination of each two by duration and the stay time of each destination;And/or The destination path selected according to user, generate electronic map;And/or the destination path selected according to user, display road letter Breath;And/or the destination path selected according to user, the display information point POI related to destination, and show that the POI's is attached Add information on services;And/or show the geographical location information of each destination;And/or the destination path selected according to user, display Traffic accident section occurred frequently in the destination path selected;And/or the destination path for selecting user is shared.
In this programme embodiment, server is according to the stay time of each destination in the path candidate and the candidate road Footpath by duration, generate the path duration of the path candidate.With only passing through duration according to the path candidate in the prior art The path duration for generating the path candidate is compared, in this programme embodiment, in the mistake for the path duration for generating the path candidate Cheng Zhong, it is contemplated that the stay time of each destination in the path candidate, wrap in the path duration of the path candidate of generation Included the stay time of each destination in the path candidate, and the path candidate by duration, therefore, with prior art The method of the middle path duration for generating the path candidate is compared, the path duration of the path candidate generated in this programme embodiment The duration consumed when actually accomplishing the path candidate is more conformed to, further, this programme embodiment improves generation The accuracy of the path duration of the path candidate.
Brief description of the drawings
, below will be to embodiment or existing in order to illustrate more clearly of this programme embodiment or technical scheme of the prior art There is the required accompanying drawing used in technology description to be briefly described, it should be apparent that, drawings in the following description are this hairs Some bright embodiments, for those of ordinary skill in the art, without having to pay creative labor, can be with Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is a kind of path duration schematic diagram in the prior art;
Fig. 2 is a kind of generation method schematic flow sheet of the path duration proposed in this programme embodiment one;
Fig. 3 is a kind of schematic diagram of the path candidate of the generation proposed in this programme embodiment one;
Fig. 4 is a kind of method flow schematic diagram for step 202 proposed in this programme embodiment two;
Fig. 5 is a kind of method flow schematic diagram for step 401 proposed in this programme embodiment three;
Fig. 6 is a kind of path duration schematic diagram proposed in this programme embodiment three;
Fig. 7 be proposed in this programme embodiment three a kind of engrave each subpath in path candidate in T pass through duration Schematic diagram;
Fig. 8 is the signal of the due in of each destination in a kind of path candidate proposed in this programme embodiment three Figure;
Fig. 9 is the signal of the due in of each destination in another path candidate proposed in this programme embodiment three Figure;
Figure 10 is a kind of generation method schematic flow sheet of the path duration proposed in this programme embodiment five;
Figure 11 is a kind of structural representation of the mobile terminal proposed in this programme embodiment six;
Figure 12 is a kind of simplified block diagram of the mobile terminal 100 proposed in this programme embodiment seven;
Figure 13 is a kind of structural representation of the generation system of the path duration proposed in this programme embodiment eight;
Figure 14 is a kind of simplified block diagram of the server 200 proposed in this programme embodiment nine.
Embodiment
To make the purpose, technical scheme and advantage of this programme embodiment clearer, below in conjunction with this programme embodiment In accompanying drawing, the technical scheme in this programme embodiment is clearly and completely described, it is clear that described embodiment is Part of the embodiment of the present invention, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
Embodiment one
This programme embodiment proposes a kind of generation method of path duration, performs in the terminal, specifically such as Fig. 2 institutes Show, methods described may comprise steps of:
201st, according to M destination, N number of path candidate is determined, wherein, M is the integer more than 1, and N is positive integer, each The M destination is included in the path candidate.
Specifically, the number for working as the destination set is the integer more than 1, and the institute of setting is included in each path candidate When purposefully, then at least two paths can be generated, wherein, at least once, i.e., each destination occurs in a path One destination can need to repeat in a path according to path, only can also occur once.Also, in life Into after at least two paths, the sequencing of destination also determines that in each path, can be at least two path According to preset path condition, a path candidate is determined, at least two path candidates can also be determined, can also be life Into all paths be defined as path candidate.
For example, the destination set includes three:Destination A, destination B and destination C, the path of generation is at least It is specific as shown in figure 3, the path of generation includes including two:First paths are that solid line is formed corresponding to numeral 1 in Fig. 3 Path, the second paths are the path that sparse dotted line corresponding to numeral 2 is formed in Fig. 3, and third path is 3 pairs of numeral in Fig. 3 Path that the close dotted line answered is formed etc., wherein, the first paths and the second paths are during each destination only occurs once Two kinds of situations, destination A occurs twice in third path, and in third path destination A occur be twice One of situation that a certain destination is repeated, carried out according to the path requirement of user generating above-mentioned three roads when generating path A certain bar in footpath or a few.If preset path condition is that first destination in path is destination A, it is determined that is gone out Path candidate be the first paths and third path, if it is mesh that preset path condition, which is first destination in path, Ground B, it is determined that the path candidate gone out is the second paths, wherein, preset path condition is set according to the actual requirements, example Such as, when preset path condition is according to a certain order of arrival to determine path candidate, then path candidate is determined according to the order; Or in another example, when providing first destination for specific destination to determine path candidate, then according to the specific destination , determine all path candidates for meeting condition.
Mobile terminal in this programme embodiment can include:Smart mobile phone, tablet personal computer, in-vehicle navigation apparatus or can Wearable device etc..
202nd, for each path candidate, the stay time of each destination in the path candidate is obtained.
Specifically, after path candidate is determined, in a wherein path candidate, due to the stop of different destinations Duration is different, it is therefore desirable to obtains the stay time of each destination in the path candidate, each destination in the path candidate Stay time refer to that each destination of the user in the path candidate needs the duration consumed.Obtain every in the path candidate The stay time of individual destination can be calculated according to people's flow data of each destination and obtained, or, can also be according to each destination History stay time obtain, when the purpose of this programme embodiment is to obtain the stop of each destination in each path candidate It is long, therefore all modes for obtaining the stay time of each destination in the path candidate belong to the protection of this programme embodiment Scope.
203rd, should by duration, generation according to the stay time of each destination in the path candidate and the path candidate The path duration of path candidate.
For example, the stay time of each destination and the path candidate pass through duration in the path candidate is obtained Afterwards, the candidate is obtained by duration sum according to the stay time of each destination in the path candidate and the path candidate The path duration in path.
In this programme embodiment, according to the logical of the stay time of each destination in the path candidate and the path candidate Duration is crossed, generates the path duration of the path candidate.With being only somebody's turn to do in the prior art according to the path candidate by duration generation The path duration of path candidate is compared, and in this programme embodiment, during the path duration of the path candidate is generated, is examined Consider the stay time of each destination in the path candidate, include the time in the path duration of the path candidate of generation The stay time of each destination in routing footpath, and the path candidate by duration, therefore, should with generation in the prior art The method of the path duration of path candidate is compared, and the path duration of the path candidate generated in this programme embodiment more conforms to The duration consumed when actually accomplishing the path candidate, further, this programme embodiment improve the candidate road of generation The accuracy of the path duration in footpath.
Embodiment two
Further, in this programme embodiment, for, for each path candidate, being somebody's turn to do described in step 202 The realization of the stay time of each destination provides method flow as shown in Figure 4 in path candidate, methods described include with Lower step:
401st, for each path candidate, the history stay time of each destination in the path candidate is obtained.
Specifically, each destination has respective history to stop record, the history stops in record and comprises at least mesh Ground mark, history stay time and the corresponding relation of both, wherein, the history stay time of some destination can basis Each user determines that the history stay time of certain destination can be reflected at this in the average of the history stay time of the destination The duration stopped is probably needed on destination, wherein, the history stay time of each destination can in the path candidate of acquisition Think the history stay time in some specific dimension, such as:The history stay time of each destination in the different time sections of one day, Either or in the path candidate each destination current time history stay time or, can also be the time History stay time of each destination in certain time at current time threshold value in routing footpath, obtained of course for guarantee The accuracy of the history stay time of each destination in the path candidate, the history that can also be obtained simultaneously in multiple dimensions are stopped Stay duration.
402nd, according to the history stay time of each destination in the path candidate, each purpose in the path candidate is determined The stay time on ground.
Specifically, the history stay time of each destination can reflect that each destination probably needs in the path candidate The duration to be stopped, therefore according to the history stay time of each destination in the path candidate, the path candidate determined The stay time of middle each destination is a relatively accurate value.
It is determined that during the stay time of each destination in the path candidate, can be stopped according to the history in a dimension Duration determines, can also be determined according to the history stay time in multiple dimensions.
For example, for each destination in the path candidate, according to the default history stay time of the destination, it is somebody's turn to do The average stay time of history of the destination in first time period and history of the destination in second time period averagely stop Duration, determine the stay time of each destination in the path candidate.
Specifically, determine stopping for each destination in the path candidate in the history stay time according to the plurality of dimension When staying duration, the stay time that can be averaged according to default history stay time+history of the destination in first time period-should The calculation of the average stay time of history of the destination in second time period determines each destination in the path candidate Stay time, or each purpose in the respectively path candidate is determined according to the average of the history stay time on various dimensions The stay time on ground, specific determination mode determine according to the actual requirements.
Embodiment three
Further, in this programme embodiment, for obtaining each destination in the path candidate described in step 401 The realization of history stay time provides method flow as shown in Figure 5, the described method comprises the following steps:
501st, for each destination in the path candidate, according to the moment of setting out, the due in of the destination is obtained.
For example, for each destination in the path candidate, according to the 1st in the moment of setting out, the path candidate Individual destination into the destination between the adjacent destination of each two by between duration, departure place and the 1st destination By the stay time of the 1st destination each destination into the destination in duration and the path candidate, the mesh is obtained Ground due in.
Specifically, for each destination in a path candidate, when obtain the path candidate moment of setting out, should The 1st destination passes through duration, departure place and the 1st into the destination between the adjacent destination of each two in path candidate Between destination by the 1st destination in duration and the path candidate into the destination during stop of each destination After length, the due in of each destination in the path candidate can be obtained according to above-mentioned data.Such as:The destination bag of acquisition Include:Destination A, destination B, destination C, the one of path candidate determined according to above three destination are:Set out Ground → destination A → destination B → destination C, and acquired data include:From departure place moment T, destination A stay time t1, destination B stay time t2, destination C stay time t3, departure place are to destination A when passing through Long T1, destination A to destination B by duration T2 and destination B to destination C by duration T3, as shown in fig. 6, root The due in that destination A can be obtained according to above-mentioned data is:T+T1, reaching for destination B are constantly:T+T1+t1+T2, mesh Reaching for ground C be constantly:T+T1+t1+T2+t2+T3.
Wherein, it is logical between the adjacent destination of each two into the destination to obtain the 1st destination in the path candidate The mode of duration is crossed including at least following two:
Mode one:Set out the moment according to described, obtain the 1st destination each two into the destination in the path candidate Pass through duration between adjacent destination.
Specifically, the 1st destination passing through between the adjacent destination of each two into the destination in the path candidate Duration is obtained according to traffic information, corresponding to different routing informations by duration is different on same path, and Routing information is relevant with the time, it is upper at different moments corresponding to routing information be different, therefore, the in the path candidate is obtained 1 destination into the destination between the adjacent destination of each two when passing through duration, it is necessary to first obtain time information, then According to information at the time of acquisition determine in the path candidate the 1st destination into the destination the adjacent destination of each two it Between by duration, for the complexity for reducing amount of calculation and calculating, in mode one, the 1st in the path candidate of acquisition Destination being obtained constantly by duration according to setting out between the adjacent destination of each two into the destination, further , according to the 1st of the moment of setting out the destination, into the destination, traffic information obtains the time between the adjacent destination of each two In routing footpath the 1st destination into the destination between the adjacent destination of each two by duration, as shown in fig. 7, the time Setting out for routing footpath is constantly T, obtains traffic information, T moment destination A and mesh between T moment departure places and destination A Ground B between traffic information, then the and traffic information between T moment destination B and destination C sets out according to the T moment Traffic information between ground and destination A, the traffic information between T moment destination A and destination B, and T moment destinations Traffic information between B and destination C, obtain respectively engraved in T from departure place arrive at A by duration, in T Engrave from destination A arrive at B by duration, and engraved in T from destination B and arrive at when passing through of C It is long.1st destination can certainly be obtained in the path candidate into the destination according to the traffic information at other moment Between the adjacent destination of each two by duration, such as:At the time of according to some destination in the path candidate is reached, Obtain the 1st destination in the path candidate into the destination between the adjacent destination of each two by duration, specific feelings Condition determines according to actual conditions.
Further, in the 1st destination adjacent destination of each two into the destination in determining the path candidate Between by duration after, it is possible to according to the 1st destination adjacent purpose of each two into the destination in the path candidate Between ground by duration and setting out the moment, the due in of each destination in the path candidate is determined successively, such as Fig. 8 institutes Show, destination A due in is T+T1, and the history stay time then engraved according to destination A in T+T1 determines purpose Ground A stay time t1, mesh is reached according to destination A due in, the stay time in destination A, and from destination A Ground B by duration, destination B due in T+T1+t1+T2 can be obtained, then can be obtained in T+T1+t1+T2 Destination B stay time is engraved, by that analogy, can be obtained at the time of C is arrived at the destination (T+T1+t1+T2+t2+T3) On stay time.
Mode two:According to the due in of a upper destination for the destination in the path candidate, the candidate road is obtained The 1st destination passes through duration into the destination between the adjacent destination of each two in footpath.
Specifically, in order that obtain the path candidate in the 1st destination adjacent purpose of each two into the destination It is more accurate by duration between ground, after the due in of each destination in getting the path candidate, according to the mesh Ground a upper destination due in, obtain the 1st destination each two phase into the destination in the path candidate Between adjacent destination by duration, wherein, the 1st destination each two phase into the destination in the path candidate is obtained Between adjacent destination when passing through duration, be according to the sequencing by each destination in the path candidate, obtain successively 1st destination passes through duration into the destination between the adjacent destination of each two.Set out as shown in figure 9, having obtained After the moment T that sets out on ground, according to the traffic information at T moment obtain when arriving at the destination A from departure place by duration T1, then T+T1 at the time of arriving at A is obtained according to T moment and T1 sums, and can further obtain destination A in T+T1 The stay time t1 engraved, and the moment T+T1+t1 that sets out in destination A;Further according to the moment T+T1 that sets out in destination A + t1 traffic information obtain from destination A arrive at B when by duration T2, and then can obtain and arrive at the destination B's The stay time t2 that due in T+T1+t1+T2, destination B engrave in T+T1+t1+T2, and can obtain in destination The B moment T+T1+t1+T2+t2 that sets out, by that analogy, it can obtain and be engraved in T+T1+t1+T2+t2 from destination B arrival Destination C by duration, and destination C due in T+T1+t1+T2+t2+T3 and in T+T1+t1+T2+t2+T3 Engrave destination C stay time.
502nd, obtain in the due in, history stay time corresponding to the destination.
Specifically, get the destination reach the moment after, in order that obtain the destination history stop when Length is more accurate, and acquisition engraves corresponding history stay time when being and reaching the destination.
Example IV
Further, based on this programme embodiment one, in this programme embodiment, it is proposed that the output of two kinds of path candidates Mode:
Mode one:Step 1, when N is more than 1, according to the path duration of each path candidate in each path candidate, from K destination path is selected in each path candidate, K is more than or equal to 1, and is less than or equal to N.
Specifically, the path candidate determined be more than 1 in the case of, the number for the path duration determined also greater than 1, At selection target path, can be determined according to actual conditions, such as:When the most short destination path of regulation selection outbound path duration When, then a most short path candidate of path duration is selected according to the path duration of each path candidate, the path candidate is made For destination path.When regulation selects all path candidates as destination path, then directly all path candidates are made For destination path.When the destination path selected of regulation for path candidate in the range of a preset path duration when, can be with Satisfactory path candidate is selected according to the path duration of each path candidate, to be used as destination path.Wherein, the mesh selected It is that can carry out selection according to the setting of user to mark path, can so be selected in multiple path candidates and meet user's need The destination path asked, further reduce the workload when needing user to select destination path.
Step 2, export the K destination path and/or each self-corresponding path duration of the K destination path.
Specifically, after destination path is selected, the K destination path and/or the K destination path are exported each Corresponding path duration, such user can be according to each self-corresponding path durations of obtained destination path and/or destination path Selection meets the path of self-demand.
Mode two:Export each path candidate and/or each self-corresponding path duration of each path candidate.
Specifically, due to output being each path candidate and/or each self-corresponding path duration of each path candidate, so may be used To be supplied to user more optional space so that user, can be with when being selected according to the demand of itself in multiple path candidates Select the path for more conforming to self-demand.
When going to each destination according to the destination path of output, after some destination is reached, user is in the mesh for collection Ground stay time, and according to default noise removal method to the stay time carry out denoising, such as:This is preset and made an uproar Sound minimizing technology when then carrying out denoising to the stay time, judges the stay time to remove the data that stay time is approximately 0 Whether it is approximately 0, if the stay time is approximately 0, denoising is carried out to the stay time, if the stay time is not It is approximately 0, then stops record using the stay time as the history of the destination, so that other users uses.
Path candidate and/or each self-corresponding path duration of path candidate are being provided the user according to above two mode Afterwards, this method also includes:
The destination path selected according to user, is navigated;And/or
The destination path selected according to user, under the destination path selected described in display between the adjacent destination of each two Pass through duration and the stay time of each destination;And/or
The destination path selected according to user, generate electronic map;And/or
The destination path selected according to user, show road information;And/or
The destination path selected according to user, the display information point POI related to destination, and show that the POI's is attached Add information on services;And/or
Show the geographical location information of each destination;And/or
The destination path selected according to user, the traffic accident section occurred frequently in the destination path selected described in display;With/ Or,
The destination path that user is selected is shared.
For example, after user selects destination path, mobile terminal can be navigated according to the destination path, its In, navigation includes:Actual navigation or analogue navigation, further, actual navigation include:Actual navigation Service is provided the user, Analogue navigation includes:Simulated driving service is provided the user, it is up in the destination path in order to which user can intuitively obtain Concrete condition when sailing, can be that user demonstrates specific travel situations when carrying out analogue navigation, such as:Simulated driving mistake There are traffic lights at how many meters of front in journey, how to be turned at crossing, how many meters of straight trip is kept in some section, in straight trip process In travelled by the left side traveling of road or the right, and road name that will enter etc., user can be according to analogue navigations Raising is in the push to destination path, rests in the points for attention at complicated highway section or crossing, and reduce the feelings violating the regulations of user Condition etc..
After user selects destination path, mobile terminal can also show phase in the destination path according to the destination path Between adjacent destination by duration and the stay time of each destination, in order to which user plans according to the duration of above-mentioned offer Its travel, such as:The departure date of user, user's sets out the moment, if user needs to take after destination path is completed The vehicles such as train, aircraft, user can also determine to take the time of the vehicles, in order to which user buys ticket etc..
After user selects destination path, mobile terminal can also generate electronically map according to the destination path, its In, the electronic map includes the mark to the destination path, user can be allowed intuitively to obtain destination path by the mark Correlation circumstance, such as:Operating range of the path length of destination path, the road conditions in each section and each section etc..
After user selects destination path, mobile terminal can also show road information according to the destination path, wherein, The road information includes:The road type to be passed through is (such as:Overpass, high speed, highway, road in cell etc.), to be passed through Environmental information of the width information of road and the road to be passed through etc., user can be determined whether according to the road information of display by Travelled according to the destination path.
After user selects destination path, mobile terminal can also be shown related to destination according to the destination path POI (Point of Information, information point), and the additional service information of the POI, in order to which user is according to itself need Selection POI is sought, wherein, the POI related to destination includes:Between POI and two destination in the specified range of destination POI on road, the POI can specifically include:Restaurant, parking lot, market, convenience store and recreation ground etc., and what is provided is somebody's turn to do POI additional service information includes:The consumption information of the POI is (such as:Average consumption information, the consumption information of unit interval), should Whether POI has preferential movable, the POI address information etc..
After user selects destination path, mobile terminal can also show the geographical location information of each destination, in order to User is quickly found out the destination, saves the time of user.
After user selects destination path, mobile terminal can also be shown in the destination path according to the destination path Traffic accident section occurred frequently, to remind user to ensure the safety of user by that should be driven with caution during the section.
After user selects destination path, mobile terminal can also be shared destination path, in order to other users The travel route of the user is obtained, adds the interaction mode between user, and when destination path is carried out into shared, may be used also So that the current geographic position information of the user to be shared, in order to which other users grasp the travel situations of the user, and In order to which other users plan the stroke of itself.
Embodiment five
In order to which the technological thought of this programme embodiment is expanded on further, in conjunction with specific application scenarios, to the application's Technical scheme illustrates, and its this method performs in the terminal, wherein, the destination number of acquisition is 3, and is respectively Destination A, destination B and destination C, comprise the following steps:
Step 1, according to above destination, determine N bar path candidates, N is positive integer.
Specifically, it is determined that can be determined according to the path requirement and/or preset path rule of user during path candidate Path candidate.Illustrate the generation method of the path duration of path candidate by taking first path candidate as an example below, also, according to It is required that path duration the degree of accuracy difference, the optional step that performs be step 2 or step 5, wherein, execution step 2, and Its follow-up step (including step 3, step 4, step 7 and step 8, or can subtract during including step 3, step 4 and step 9) Few amount of calculation and the complexity calculated, it is specific as shown in Figure 10;Execution step 5, and its follow-up step (including step 6, step 7 and step 8, or the degree of accuracy of the path duration of generation can be improved including step 6 and step 9).
Step 2, obtain and pass through duration on each subpath of first path candidate on moment T setting out.
Specifically, as shown in fig. 7, each subpath of first path candidate is respectively:Between departure place and destination A Path (the second subpath) between path (the first subpath), destination A and destination B, and destination B and destination C Between path (the 3rd subpath).According to the moment T that sets out in departure place, the road conditions engraved in T of each subpath are obtained Information, then according to the traffic information engraved in T of each subpath, determine each subpath passes through duration.
Step 3, according to moment T and each subpath by duration, obtain the stop for reaching and being engraved during each destination successively Duration.
Specifically, as shown in figure 8, comprise the following steps that:
1st, obtain T moment each subpath passes through duration.
Specifically, the traffic information engraved according to each subpath in T, determine the first subpath respectively passes through duration T1, the second subpath by duration T2 and the 3rd subpath pass through duration T3.
2nd, obtain destination A reaches the moment.
Specifically, according to set out moment T and the first subpath by duration T2 sums, when obtaining destination A arrival Carve.
3rd, stay time at the time of A is arrived at the destination is obtained.
Specifically, at the time of according to A is arrived at, destination A history stay time is engraved when obtaining this, wherein, History stay time includes:Destination A exists in first time period section in the history at the moment averagely stay time, destination A Averagely stopped in the average stay time of history at the moment, and history of the destination A at current time in second time period section Duration, stay times of the destination A in due in is then obtained according to the average of the average stay time of above-mentioned three kinds of history, or Person, the sum of the average stay time of two of which history is obtained, then obtains this and the difference with the average stay time of the 3rd history, And using the difference as destination A due in stay time.
4th, destination B due in is obtained.
Specifically, according to the moment T that sets out, the first subpath by duration T1, in destination A stay time t1 and Two subpaths pass through duration T2 sums, acquisition destination B due in.
5th, stay time at the time of B is arrived at is obtained.
Specifically, obtain the mode of stay time at the time of B is arrived at obtain arrive at A when The mode of the stay time at quarter is identical, and this is no longer going to repeat them.
6th, destination C due in is obtained.
Specifically, according to the moment T that sets out, the first subpath by duration T1, destination A stay time t1, Two subpaths by duration T2, destination B stay time t2 and the 3rd subpath pass through duration T3 sums, obtain mesh Ground C due in.
7th, stay time at the time of C is arrived at is obtained.
Specifically, obtain the mode of stay time at the time of C is arrived at obtain arrive at A when The mode of the stay time at quarter is identical, and this is no longer going to repeat them.
Step 4, the stay time sum engraved according to T moment each subpath by duration and when reaching the destination, First path candidate of acquisition passes through duration.
Specifically, get each subpath by the stay time of duration and each destination after, it is possible to obtain First path candidate passes through duration.
Step 5, according to setting out moment T, obtain passing through of being engraved when each subpath of the first path candidate sets out successively The stay time engraved when duration and each destination of arrival.
Specifically, as shown in figure 9, specifically include following steps:
1st, obtain and pass through duration in the first subpath on moment T that sets out.
Specifically, according to traffic information of first subpath at the T moment, obtain in the first subpath on moment T that sets out Pass through duration.
2nd, obtain and reach the moment in destination A.
Specifically, acquisition methods are identical with the method for above-mentioned acquisition destination A due in, no longer go to live in the household of one's in-laws on getting married one by one herein State.
3rd, stay time at the time of A is arrived at the destination is obtained.
Specifically, the method for stay time of the acquisition methods with above-mentioned acquisition at the time of A is arrived at the destination is identical, herein No longer repeat one by one.
4th, obtain the second subpath destination A engraved when setting out pass through duration.
Specifically, destination A due in is being known and after destination A stay time, according to arriving for destination A Stay time sum up to the moment and in destination A, the destination A moment T+T1+t1 that sets out is obtained, according to going out for destination A Moment T+T1+t1 is sent out, obtains the traffic information that the second subpath engraves at this, and according to the traffic information, obtain the second son Path destination A engraved when setting out by duration T2.
5th, destination B due in is obtained.
Specifically, acquisition methods are identical with the method for above-mentioned acquisition destination B due in, no longer go to live in the household of one's in-laws on getting married one by one herein State.
6th, stay time at the time of B is arrived at the destination is obtained.
Specifically, the method for stay time of the acquisition methods with above-mentioned acquisition at the time of B is arrived at the destination is identical, herein No longer repeat one by one.
7th, obtain the 3rd subpath destination B engraved when setting out pass through duration.
Specifically, destination B due in is being known and after destination B stay time, according to arriving for destination B Stay time sum up to the moment and in destination B, the destination B moment T+T1+t1+T2+t2 that sets out is obtained, according to destination The B moment T+T1+t1+T2+t2 that sets out, obtains the traffic information that is engraved at this of the 3rd subpath, and according to the traffic information, Obtain the 3rd subpath destination B engraved when setting out by duration T3.
8th, destination C due in is obtained.
Specifically, acquisition methods are identical with the method for above-mentioned acquisition destination C due in, no longer go to live in the household of one's in-laws on getting married one by one herein State.
9th, stay time at the time of C is arrived at the destination is obtained.
Specifically, the method for stay time of the acquisition methods with above-mentioned acquisition at the time of C is arrived at the destination is identical, herein No longer repeat one by one.
Step 6, the stay time engraved by duration and when reaching each destination engraved when being set out according to each subpath Sum, obtain the first path candidate passes through duration.
Obtained according to the above method each path candidate by duration after, this programme embodiment additionally provides two kinds of outputs Method, method includes in first:Step 7 and step 8, method includes step 9 in second.
Step 7, the path duration according to each path candidate in each path candidate, the target road from each path candidate Footpath.
Step 8, export the destination path and/or each self-corresponding path duration of the destination path.
Step 9, export each path candidate and/or each self-corresponding path duration of each path candidate.
After path candidate and/or each self-corresponding path duration of path candidate is exported for mobile terminal, the mobile terminal The destination path that can be selected according to user, is navigated;And/or the destination path selected according to user, select described in display Destination path under pass through duration and the stay time of each destination between the adjacent destination of each two;And/or according to The destination path that family is selected, generate electronic map;And/or the destination path selected according to user, show road information;With/ Or, the destination path selected according to user, the display information point POI related to destination, and show the Additional Services of the POI Information;And/or show the geographical location information of each destination;And/or the destination path selected according to user, show the choosing Traffic accident section occurred frequently in the destination path haveing;And/or the destination path for selecting user is shared.
Specific implementation is referring to example IV, and this is no longer going to repeat them.
Embodiment six
This programme embodiment additionally provides a kind of mobile terminal, as shown in figure 11, when the mobile terminal is used to generate path Long, the mobile terminal can be used for realizing aforementioned approaches method flow, and the mobile terminal includes:
Path-calculating element 1101, for according to M destination, determining N number of path candidate, wherein, M is whole more than 1 Number, N is positive integer, and the M destination is included in each path candidate;
Duration calculation unit 1102, for for each path candidate, obtaining each destination in the path candidate Stay time;And according to the stay time of each destination in the path candidate and the duration that passes through of the path candidate, it is raw Into the path duration of the path candidate.
The duration calculation unit 1102, is specifically used for:
For each path candidate, the history stay time of each destination in the path candidate is obtained;
According to the history stay time of each destination in the path candidate, each destination in the path candidate is determined Stay time.
The duration calculation unit 1102, is specifically used for:
It is somebody's turn to do according to the stay time of each destination in the path candidate with the path candidate by duration sum The path duration of path candidate.
In this programme embodiment, the second duration calculation unit is according to the stay time of each destination in the path candidate With the path candidate by duration, the path duration of the path candidate is generated.With in the prior art only according to the path candidate The path duration that the path candidate is generated by duration compare, in this programme embodiment, generate the path candidate road During the duration of footpath, it is contemplated that the stay time of each destination in the path candidate, the road of the path candidate of generation Include the stay time of each destination in the path candidate in the duration of footpath, and the path candidate by duration, therefore, Compared with the method for path duration for generating the path candidate in the prior art, the path candidate that is generated in this programme embodiment Path duration more conform to the duration consumed when actually accomplishing the path candidate, further, this programme embodiment carries The high accuracy of the path duration of the path candidate of generation.
Embodiment seven
Figure 12 is the simplified block diagram of mobile terminal 100.The mobile terminal 100 can include and one or more data storages The processor 101 of instrument connection, the data storage facility can include storage medium 106 and internal storage location 104.Mobile terminal 100 can also include input interface 105 and output interface 107, for being communicated with another device or system.By processor The program code that 101 CPU is performed is storable in internal storage location 104 or storage medium 106.
Processor 101 in mobile terminal 100, which calls, is stored in internal storage location 104 or the program code of storage medium 106, To perform following each step:
According to M destination, N number of path candidate is determined, wherein, M is the integer more than 1, and N is positive integer, each described The M destination is included in path candidate;
For each path candidate, the stay time of each destination in the path candidate is obtained;And according to this In path candidate the stay time of each destination and the path candidate by duration, when generating the path of the path candidate It is long.
In a concrete implementation scheme, the processor 101 is additionally operable to for each path candidate, and obtaining should The history stay time of each destination in path candidate;And stopped according to the history of each destination in the path candidate Duration, determine the stay time of each destination in the path candidate.
In a concrete implementation scheme, the processor 101 is additionally operable to according to each destination in the path candidate Stay time and the path candidate by duration sum, obtain the path duration of the path candidate.
Embodiment eight
This programme embodiment additionally provides a kind of generation system of path duration, and as shown in figure 13, the system includes:Clothes Business device and mobile terminal.
The mobile terminal, for receiving M destination of user's input;And sent to the server described M Destination;Wherein, M is the integer more than 1;
The server, the M destination sent for receiving the mobile terminal;And according to the M mesh Ground, determine N number of path candidate, N is positive integer, and the M destination is included in each path candidate;And for Every path candidate, obtain the stay time of each destination in the path candidate;And according to each mesh in the path candidate Ground stay time and the path candidate by duration, generate the path duration of the path candidate.
Wherein, the specific implementation reference implementation example one of the path duration of the path candidate and the realization side of embodiment five Formula, this is no longer going to repeat them.
In a concrete implementation scheme, the server, it is specifically used for:
For each path candidate, the history stay time of each destination in the path candidate is obtained;
According to the history stay time of each destination in the path candidate, each destination in the path candidate is determined Stay time.
The implementation of concrete implementation mode reference implementation example two and embodiment five, this is no longer going to repeat them.
In a concrete implementation scheme, the server, also particularly useful for:
For each destination in the path candidate, according to the moment of setting out, the due in of the destination is obtained;
Obtain in the due in, history stay time corresponding to the destination.
The implementation of concrete implementation mode reference implementation example three and embodiment five, this is no longer going to repeat them.
In a concrete implementation scheme, the server, also particularly useful for:
For each destination in the path candidate, according to the 1st destination in the moment of setting out, the path candidate extremely In the destination between the adjacent destination of each two by between duration, departure place and the 1st destination by duration with And in the path candidate the 1st destination each destination into the destination stay time, obtain the arrival of the destination Moment.
The implementation of concrete implementation mode reference implementation example three and embodiment five, this is no longer going to repeat them.
In a concrete implementation scheme, the server, it is additionally operable to:
Set out the moment according to described, obtain the 1st destination adjacent mesh of each two into the destination in the path candidate Ground between pass through duration;Or
According to the due in of a upper destination for the destination in the path candidate, obtain the 1st in the path candidate Individual destination passes through duration into the destination between the adjacent destination of each two.
The implementation of concrete implementation mode reference implementation example three and embodiment five, this is no longer going to repeat them.
In a concrete implementation scheme, the server, also particularly useful for:
For each destination in the path candidate, existed according to the default history stay time of the destination, the destination The average stay time of history and the average stay time of history of the destination in second time period in first time period, it is determined that The stay time of each destination in the path candidate.
The implementation of concrete implementation mode reference implementation example two and embodiment five, this is no longer going to repeat them.
In a concrete implementation scheme, the server, also particularly useful for:
It is somebody's turn to do according to the stay time of each destination in the path candidate with the path candidate by duration sum The path duration of path candidate.
The implementation of concrete implementation mode reference implementation example one and embodiment five, this is no longer going to repeat them.
In a concrete implementation scheme, the server, it is additionally operable to:
When N is more than 1, according to the path duration of each path candidate in each path candidate, from each path candidate K destination path is selected, K is more than or equal to 1, and is less than or equal to N.
The server, it is additionally operable to send the K destination path and/or the K target road to the mobile terminal Each self-corresponding path duration in footpath;
The mobile terminal, it is additionally operable to receive the K destination path and/or the K mesh that the server is sent Mark each self-corresponding path duration in path.
The mobile terminal, it is additionally operable to export the K destination path and/or the K destination path is each self-corresponding Path duration.
The implementation of concrete implementation mode reference implementation example four and embodiment five, this is no longer going to repeat them.
In a concrete implementation scheme, the server, it is additionally operable to send each path candidate to the mobile terminal And/or each each self-corresponding path duration of path candidate;
The mobile terminal, it is additionally operable to receive each path candidate and/or each candidate that the server is sent Each self-corresponding path duration in path.
The mobile terminal, it is additionally operable to export each path candidate and/or each self-corresponding road of each path candidate Footpath duration.
The implementation of concrete implementation mode reference implementation example four and embodiment five, this is no longer going to repeat them.
After mobile terminal exports path candidate and/or each self-corresponding path duration of path candidate, the mobile terminal, The destination path selected according to user is additionally operable to, is navigated;And/or the destination path selected according to user, show the choosing Pass through duration and the stay time of each destination between the adjacent destination of each two under the destination path gone out;And/or according to The destination path that user selects, generate electronic map;And/or the destination path selected according to user, show road information;With/ Or, the destination path selected according to user, the display information point POI related to destination, and show the Additional Services of the POI Information;And/or show the geographical location information of each destination;And/or the destination path selected according to user, show the choosing Traffic accident section occurred frequently in the destination path haveing;And/or the destination path for selecting user is shared.
Concrete implementation mode reference implementation example four, this is no longer going to repeat them.
In this programme embodiment, server is according to the stay time of each destination in the path candidate and the candidate road Footpath by duration, generate the path duration of the path candidate.With only passing through duration according to the path candidate in the prior art The path duration for generating the path candidate is compared, in this programme embodiment, in the mistake for the path duration for generating the path candidate Cheng Zhong, it is contemplated that the stay time of each destination in the path candidate, wrap in the path duration of the path candidate of generation Included the stay time of each destination in the path candidate, and the path candidate by duration, therefore, with prior art The method of the middle path duration for generating the path candidate is compared, the path duration of the path candidate generated in this programme embodiment The duration consumed when actually accomplishing the path candidate is more conformed to, further, this programme embodiment improves generation The accuracy of the path duration of the path candidate.
Embodiment nine
Figure 14 is the simplified block diagram of server 200.The server 200 can include and one or more data storage facilities The processor 201 of connection, the data storage facility can include storage medium 206 and internal storage location 204.Server 200 may be used also With including input interface 205 and output interface 207, for being communicated with another device or system.By the CPU of processor 201 The program code of execution is storable in internal storage location 204 or storage medium 206.
Processor 201 in server 200, which calls, is stored in internal storage location 204 or the program code of storage medium 206, with Perform following each step:
The M destination of the mobile terminal transmission is received by the input interface 205;And according to the M Individual destination, N number of path candidate is determined, N is positive integer, and the M destination is included in each path candidate;And For every path candidate, the stay time of each destination in the path candidate is obtained;And according to every in the path candidate The stay time of individual destination and the path candidate by duration, generate the path duration of the path candidate.
In an optional implementation, the processor 201 is additionally operable to for each path candidate, and obtaining should The history stay time of each destination in path candidate;According to the history stay time of each destination in the path candidate, Determine the stay time of each destination in the path candidate.
In an optional implementation, the processor 201 is additionally operable to for each destination in the path candidate, According to the moment of setting out, the due in of the destination is obtained;Obtain and stopped in the due in, history corresponding to the destination Duration.
In an optional implementation, the processor 201 is additionally operable to for each destination in the path candidate, According to the 1st destination in the moment of setting out, the path candidate into the destination it is logical between the adjacent destination of each two Cross between duration, departure place and the 1st destination by the 1st destination to the destination in duration and the path candidate The stay time of middle each destination, obtain the due in of the destination.
In an optional implementation, the processor 201 is additionally operable to set out the moment according to, obtains the candidate The 1st destination passes through duration into the destination between the adjacent destination of each two in path;Or according to the candidate road The due in of a upper destination for the destination in footpath, the 1st destination is obtained in the path candidate into the destination Pass through duration between the adjacent destination of each two.
In an optional implementation, the processor 201 is additionally operable to for each destination in the path candidate, According to the default history stay time of the destination, the average stay time of history of the destination in first time period and the mesh The average stay time of history of the ground in second time period, determine the stay time of each destination in the path candidate.
In an optional implementation, the processor 201 is additionally operable to according to each destination in the path candidate Stay time and the path candidate by duration sum, obtain the path duration of the path candidate.
In an optional implementation, the processor 201 is additionally operable to when N is more than 1, according in each path candidate The path duration of each path candidate, K destination path is selected from each path candidate, K is more than or equal to 1, and small In or equal to N.
In an optional implementation, the K mesh is sent to the mobile terminal by the output interface 207 Mark path and/or each self-corresponding path duration of the K destination path.
In an optional implementation, each candidate road is sent to the mobile terminal by the output interface 207 Footpath and/or each self-corresponding path duration of each path candidate.
In above-described embodiment seven and embodiment nine, storage medium can be read-only storage (Read-Only Memory, ROM), it is or read-write, such as hard disk, flash memory.Internal storage location can be random access memory (Random Access Memory, RAM).Internal storage location can be with processor physical integration or integrated in memory or being configured to single unit.
Processor is the control centre of the said equipment (equipment is above-mentioned server or above-mentioned mobile terminal), and provides Processing unit, for execute instruction, carry out interrupt operation, there is provided clocking capability and various other functions.Alternatively, processor Including one or more CPU (CPU), such as the CPU 0 and CPU 1 shown in Figure 14.The said equipment includes one Individual or multiple processor.Processor can be monokaryon (single CPU) processor or multinuclear (multi -CPU) processor.Unless otherwise sound Bright, being described as the part of such as processor or memory for performing task can realize that for universal component, it is temporarily used for Preset time performs task, or is embodied as being manufactured specifically for the particular elements for performing the task.Terminology used herein " processing Device " refers to one or more devices, circuit and/or process cores, for processing data, such as computer program instructions.
It is storable in by the CPU of the processor program codes performed in internal storage location or storage medium.Alternatively, it is stored in Program code in storage medium can be copied into internal storage location and be performed so as to the CPU of processor.Processor is executable at least One kernel (such as LINUXTM、UNIXTM、WINDOWSTM、ANDROIDTM、IOSTM), it is well known that the kernel is used to pass through control Execution, control and the communication of peripheral unit and the use of control computer device resource of other programs or process are made to control The operation of the said equipment.
Said elements in the said equipment can be connected to each other by bus, bus such as data/address bus, address bus, control One of bus, expansion bus and local bus or its any combination.
In several embodiments that this programme is provided, it should be understood that disclosed system, apparatus and method can be with Realize by another way.For example, device embodiment described above is only schematical, for example, the unit Division, only a kind of division of logic function, can there is other dividing mode, for example, multiple units or group when actually realizing Part can combine or be desirably integrated into another system, or some features can be ignored, or not perform.It is another, it is shown Or the mutual coupling discussed or direct-coupling or communication connection can be by some interfaces, device or unit it is indirect Coupling or communication connection, can be electrical, mechanical or other forms.
The unit illustrated as separating component can be or may not be physically separate, show as unit The part shown can be or may not be physical location, you can with positioned at a place, or can also be distributed to multiple On NE.Some or all of unit therein can be selected to realize the mesh of this embodiment scheme according to the actual needs 's.
In addition, each functional unit in each embodiment of this programme can be integrated in a processing unit, can also That unit is individually physically present, can also two or more units it is integrated in a unit.Above-mentioned integrated list Member can both be realized in the form of hardware, can also be realized in the form of hardware adds SFU software functional unit.
The preferred embodiment of this programme is the foregoing is only, not limiting this programme, all essences in this programme God any modification, equivalent substitution and improvements done etc., should be included within the scope of this programme protection with principle.

Claims (27)

1. a kind of generation method of path duration, it is characterised in that perform in the terminal, methods described includes:
According to M destination, N number of path candidate is determined, wherein, M is the integer more than 1, and N is positive integer, each candidate The M destination is included in path;
For each path candidate, the stay time of each destination in the path candidate is obtained;And according to the candidate In path the stay time of each destination and the path candidate by duration, generate the path duration of the path candidate.
2. the method as described in claim 1, it is characterised in that it is described for each path candidate, obtain the candidate road The stay time of each destination in footpath, including:
For each path candidate, the history stay time of each destination in the path candidate is obtained;And according to this The history stay time of each destination in path candidate, determine the stay time of each destination in the path candidate.
3. method as claimed in claim 2, it is characterised in that the history for obtaining each destination in the path candidate is stopped Duration is stayed, including:
For each destination in the path candidate, according to the moment of setting out, the due in of the destination is obtained;
Obtain in the due in, history stay time corresponding to the destination.
4. method as claimed in claim 3, it is characterised in that it is described for each destination in the path candidate, according to going out The moment is sent out, obtains the due in of the destination, including:
For each destination in the path candidate, according to the 1st destination in the moment of setting out, the path candidate to the mesh Ground between the adjacent destination of each two by between duration, departure place and the 1st destination by duration and should The stay time of 1st destination each destination into the destination in path candidate, obtain the due in of the destination.
5. method as claimed in claim 4, it is characterised in that according to the 1st purpose in the moment of setting out, the path candidate Ground into the destination between the adjacent destination of each two by between duration, departure place and the 1st destination when passing through The stay time of the 1st destination each destination into the destination, obtains the destination in the long and path candidate Before due in, methods described also includes:
Set out the moment according to described, obtain the 1st destination adjacent destination of each two into the destination in the path candidate Between pass through duration;Or
According to the due in of a upper destination for the destination in the path candidate, the 1st mesh in the path candidate is obtained Ground pass through duration between the adjacent destination of each two into the destination.
6. method as claimed in claim 2, it is characterised in that the history according to each destination in the path candidate is stopped Duration is stayed, determines the stay time of each destination in the path candidate, including:
For each destination in the path candidate, according to the default history stay time of the destination, the destination first The average stay time of history and the average stay time of history of the destination in second time period in period, determine the time The stay time of each destination in routing footpath.
7. the method as described in claim 1, it is characterised in that described according in the path candidate during stop of each destination It is long and the path candidate that the path duration of the path candidate is generated by duration, including:
The candidate is obtained by duration sum with the path candidate according to the stay time of each destination in the path candidate The path duration in path.
8. the method as described in claim 1, it is characterised in that after the path duration of the generation path candidate, institute Stating method also includes:
When N is more than 1, according to the path duration of each path candidate in each path candidate, K is selected from each path candidate Individual destination path, K is more than or equal to 1, and is less than or equal to N.
9. method as claimed in claim 8, it is characterised in that methods described also includes:
Export the K destination path and/or each self-corresponding path duration of the K destination path.
10. the method as described in claim 1, it is characterised in that after the path duration of the generation path candidate, institute Stating method also includes:
Export each path candidate and/or each self-corresponding path duration of each path candidate.
11. the method as described in claim 9 or 10, it is characterised in that methods described also includes:
The destination path selected according to user, is navigated;And/or
The destination path selected according to user, passing through between the adjacent destination of each two under the destination path selected described in display Duration and the stay time of each destination;And/or
The destination path selected according to user, generate electronic map;And/or
The destination path selected according to user, show road information;And/or
The destination path selected according to user, the display information point POI related to destination, and show the additional clothes of the POI Business information;And/or
Show the geographical location information of each destination;And/or
The destination path selected according to user, the traffic accident section occurred frequently in the destination path selected described in display;And/or
The destination path that user is selected is shared.
12. a kind of mobile terminal, it is characterised in that the mobile terminal includes:
Path-calculating element, for according to M destination, determining N number of path candidate, wherein, M is the integer more than 1, and N is just Integer, each include the M destination in the path candidate;
Duration calculation unit, for for each path candidate, when obtaining the stop of each destination in the path candidate It is long;And the candidate is generated by duration according to the stay time of each destination in the path candidate and the path candidate The path duration in path.
13. mobile terminal as claimed in claim 12, it is characterised in that the duration calculation unit, be specifically used for:
For each path candidate, the history stay time of each destination in the path candidate is obtained;
According to the history stay time of each destination in the path candidate, the stop of each destination in the path candidate is determined Duration.
14. mobile terminal as claimed in claim 13, it is characterised in that the duration calculation unit, be specifically used for:
The candidate is obtained by duration sum with the path candidate according to the stay time of each destination in the path candidate The path duration in path.
15. a kind of generation system of path duration, it is characterised in that the system includes:Server and mobile terminal;
The mobile terminal, for receiving M destination of user's input;And send the M purpose to the server Ground;Wherein, M is the integer more than 1;
The server, the M destination sent for receiving the mobile terminal;And according to the M purpose Ground, N number of path candidate is determined, N is positive integer, and the M destination is included in each path candidate;And for every Bar path candidate, obtain the stay time of each destination in the path candidate;And according to each purpose in the path candidate The stay time on ground and the path candidate by duration, generate the path duration of the path candidate.
16. system as claimed in claim 15, it is characterised in that the server, be specifically used for:
For each path candidate, the history stay time of each destination in the path candidate is obtained;
According to the history stay time of each destination in the path candidate, the stop of each destination in the path candidate is determined Duration.
17. system as claimed in claim 16, it is characterised in that the server, also particularly useful for:
For each destination in the path candidate, according to the moment of setting out, the due in of the destination is obtained;
Obtain in the due in, history stay time corresponding to the destination.
18. system as claimed in claim 17, it is characterised in that the server, also particularly useful for:
For each destination in the path candidate, according to the 1st destination in the moment of setting out, the path candidate to the mesh Ground between the adjacent destination of each two by between duration, departure place and the 1st destination by duration and should The stay time of 1st destination each destination into the destination in path candidate, obtain the due in of the destination.
19. system as claimed in claim 18, it is characterised in that the server, be additionally operable to:
Set out the moment according to described, obtain the 1st destination adjacent destination of each two into the destination in the path candidate Between pass through duration;Or
According to the due in of a upper destination for the destination in the path candidate, the 1st mesh in the path candidate is obtained Ground pass through duration between the adjacent destination of each two into the destination.
20. system as claimed in claim 16, it is characterised in that the server, also particularly useful for:
For each destination in the path candidate, according to the default history stay time of the destination, the destination first The average stay time of history and the average stay time of history of the destination in second time period in period, determine the time The stay time of each destination in routing footpath.
21. system as claimed in claim 15, it is characterised in that the server, also particularly useful for:
The candidate is obtained by duration sum with the path candidate according to the stay time of each destination in the path candidate The path duration in path.
22. system as claimed in claim 15, it is characterised in that the server, be additionally operable to:
When N is more than 1, according to the path duration of each path candidate in each path candidate, K is selected from each path candidate Individual destination path, K is more than or equal to 1, and is less than or equal to N.
23. the system as claimed in claim 22, it is characterised in that the server, be additionally operable to send to the mobile terminal The K destination path and/or each self-corresponding path duration of the K destination path;
The mobile terminal, it is additionally operable to receive the K destination path and/or the K target road that the server is sent Each self-corresponding path duration in footpath.
24. system as claimed in claim 23, it is characterised in that the mobile terminal, be additionally operable to export the K target road Footpath and/or each self-corresponding path duration of the K destination path.
25. system as claimed in claim 15, it is characterised in that the server, be additionally operable to send to the mobile terminal Each path candidate and/or each self-corresponding path duration of each path candidate;
The mobile terminal, it is additionally operable to receive each path candidate and/or each path candidate that the server is sent Each self-corresponding path duration.
26. system as claimed in claim 25, it is characterised in that the mobile terminal, be additionally operable to export each candidate road Footpath and/or each self-corresponding path duration of each path candidate.
27. the system as described in claim 24 or 26, it is characterised in that the mobile terminal, be additionally operable to be selected according to user Destination path, navigated;And/or the destination path selected according to user, every two under the destination path selected described in display Pass through duration and the stay time of each destination between individual adjacent destination;And/or the target road selected according to user Footpath, generate electronic map;And/or the destination path selected according to user, show road information;And/or selected according to user Destination path, the display information point POI related to destination, and show the additional service information of the POI;And/or display The geographical location information of each destination;And/or the destination path selected according to user, in the destination path selected described in display Traffic accident section occurred frequently;And/or the destination path for selecting user is shared.
CN201610858342.6A 2016-09-28 2016-09-28 A kind of generation method, system and the mobile terminal of path duration Pending CN107869995A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610858342.6A CN107869995A (en) 2016-09-28 2016-09-28 A kind of generation method, system and the mobile terminal of path duration

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610858342.6A CN107869995A (en) 2016-09-28 2016-09-28 A kind of generation method, system and the mobile terminal of path duration

Publications (1)

Publication Number Publication Date
CN107869995A true CN107869995A (en) 2018-04-03

Family

ID=61761924

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610858342.6A Pending CN107869995A (en) 2016-09-28 2016-09-28 A kind of generation method, system and the mobile terminal of path duration

Country Status (1)

Country Link
CN (1) CN107869995A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111858786A (en) * 2019-06-06 2020-10-30 北京嘀嘀无限科技发展有限公司 System and method for providing transit time confidence in path planning
CN112529297A (en) * 2020-12-10 2021-03-19 广州市昊链信息科技股份有限公司 Method, device and equipment for determining target path and storage medium
CN112559876A (en) * 2020-12-22 2021-03-26 北京百度网讯科技有限公司 Method, device and equipment for displaying map search result and storage medium
CN114323053A (en) * 2022-01-10 2022-04-12 腾讯科技(深圳)有限公司 Route display method, related device, storage medium, and program product
CN112559876B (en) * 2020-12-22 2024-05-28 北京百度网讯科技有限公司 Method, device, equipment and storage medium for showing map search results

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001221647A (en) * 2000-02-07 2001-08-17 Sony Corp Navigation method and apparatus for searching route and displaying map and car
CN1871499A (en) * 2003-09-30 2006-11-29 株式会社建伍 Guide route search device and guide route search method
CN1969169A (en) * 2004-02-17 2007-05-23 株式会社建伍 Guide route search device, guide route search method, and computer program thereof
CN101958043A (en) * 2009-07-13 2011-01-26 株式会社电装 Highway section calculation element hourage and method thereof
CN105144262A (en) * 2013-04-11 2015-12-09 Lg电子株式会社 Method for delivering optimum path including plurality of passage places and apparatus therefor

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2001221647A (en) * 2000-02-07 2001-08-17 Sony Corp Navigation method and apparatus for searching route and displaying map and car
CN1871499A (en) * 2003-09-30 2006-11-29 株式会社建伍 Guide route search device and guide route search method
CN1969169A (en) * 2004-02-17 2007-05-23 株式会社建伍 Guide route search device, guide route search method, and computer program thereof
CN101958043A (en) * 2009-07-13 2011-01-26 株式会社电装 Highway section calculation element hourage and method thereof
CN105144262A (en) * 2013-04-11 2015-12-09 Lg电子株式会社 Method for delivering optimum path including plurality of passage places and apparatus therefor

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111858786A (en) * 2019-06-06 2020-10-30 北京嘀嘀无限科技发展有限公司 System and method for providing transit time confidence in path planning
CN111858786B (en) * 2019-06-06 2023-12-22 北京嘀嘀无限科技发展有限公司 System and method for providing time-of-flight confidence in path planning
CN112529297A (en) * 2020-12-10 2021-03-19 广州市昊链信息科技股份有限公司 Method, device and equipment for determining target path and storage medium
CN112559876A (en) * 2020-12-22 2021-03-26 北京百度网讯科技有限公司 Method, device and equipment for displaying map search result and storage medium
CN112559876B (en) * 2020-12-22 2024-05-28 北京百度网讯科技有限公司 Method, device, equipment and storage medium for showing map search results
CN114323053A (en) * 2022-01-10 2022-04-12 腾讯科技(深圳)有限公司 Route display method, related device, storage medium, and program product

Similar Documents

Publication Publication Date Title
Lin et al. Transit signal priority control at signalized intersections: a comprehensive review
JP5013211B2 (en) Driving evaluation system and driving evaluation program
US20190120638A1 (en) System and Method of Navigation
CN108931927A (en) The creation method and device of unmanned simulating scenes
CN104916154B (en) A kind of compatible Big Dipper CORS public transport precise positioning systems and its method of work
CN109902899A (en) Information generating method and device
CN104680829B (en) Bus arrival time prediction system and method based on multi-user cooperation
CN107869995A (en) A kind of generation method, system and the mobile terminal of path duration
CN104599002A (en) Order value predicting method and equipment
CN112805762B (en) System and method for improving traffic condition visualization
CN111366166B (en) Navigation path planning method and device
JP2019511719A (en) Navigation method based on map, device, storage medium and device
CN108573604A (en) Public transport OD data capture methods based on mobile terminal location and storage medium
CN109886529A (en) A kind of resource allocation methods and device, electric terminal and storage medium
CN108304951A (en) Acquisition methods, device and the non-transient computer readable storage medium of traffic information
CN101807348B (en) Dynamic network navigation system and method
CN108627165A (en) The method for realizing optimal navigation
CN109191831A (en) Control method, device and the server of vehicle pass-through
JP7172157B2 (en) Information processing method and information processing device
CN114036411A (en) Route planning method, device, equipment and medium
CN107798865A (en) A kind of public bus network running time predictor method and device
CN109685492A (en) A kind of public transport mode of payment and device
CN106710265A (en) Vehicle driving data processing method and vehicle driving data processing device
CN108871360A (en) The method for generating the route based on navigation for vehicle
CN106781470B (en) Method and device for processing running speed of urban road

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20180403