WO2017054332A1 - 路径查询方法、装置、设备及非易失性计算机存储介质 - Google Patents
路径查询方法、装置、设备及非易失性计算机存储介质 Download PDFInfo
- Publication number
- WO2017054332A1 WO2017054332A1 PCT/CN2015/098278 CN2015098278W WO2017054332A1 WO 2017054332 A1 WO2017054332 A1 WO 2017054332A1 CN 2015098278 W CN2015098278 W CN 2015098278W WO 2017054332 A1 WO2017054332 A1 WO 2017054332A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- road segment
- road
- destination point
- obtaining
- sequence
- Prior art date
Links
Images
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3484—Personalized, e.g. from learned user behaviour or user-defined profiles
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/3453—Special cost functions, i.e. other than distance or default speed limit of road segments
- G01C21/3492—Special cost functions, i.e. other than distance or default speed limit of road segments employing speed data or traffic data, e.g. real-time or historical
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/20—Instruments for performing navigational calculations
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3605—Destination input or retrieval
- G01C21/3617—Destination input or retrieval using user history, behaviour, conditions or preferences, e.g. predicted or inferred from previous use or current movement
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/26—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00 specially adapted for navigation in a road network
- G01C21/34—Route searching; Route guidance
- G01C21/36—Input/output arrangements for on-board computers
- G01C21/3667—Display of a road map
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Definitions
- the present invention relates to query technology, and in particular, to a path query method, apparatus, device, and non-volatile computer storage medium.
- the terminal integrates more and more functions, so that the system function list of the terminal contains more and more corresponding applications (Application, APP).
- Some applications involve some path query services, such as Baidu maps. These applications first display the path query query interface to the user for input, and then, according to the information input by the user, set the information of the endpoints such as the departure point and the destination point, and then request the query engine to provide the path data.
- the query engine may perform a path query operation based on the urban road network and the road weights of the roads in the urban road network.
- certain factors affecting the change of road weight may change at any time, such as road width, road quality, etc., and the road weight of some roads may not be updated in time, so that the path query operation is performed depending on the road weight.
- the obtained query result may be unreasonable.
- the query result is not the optimal query result, and may even be a poor query result, which leads to a decrease in the reliability of the path query operation.
- aspects of the present invention provide a path query method, apparatus, device, and non-volatile computer storage medium for improving the reliability of a path query operation.
- An aspect of the present invention provides a path query method, including:
- Obtaining query data the query data including a departure point and a destination point;
- each of the M road segment sequences includes at least one road segment;
- M is an integer greater than or equal to 2;
- N is an integer greater than or equal to 1 and less than or equal to M;
- the path query result is output.
- each of the at least one road segment included in each of the road segment sequences is reachable to an adjacent road segment of the road segment.
- the transition probability of the destination point, before selecting a sequence of N segments from the M segment sequence, as a result of the path query further includes:
- the obtaining, according to the destination point, the at least one user history trajectory that reaches the destination point includes:
- the method further includes:
- the urban road network is divided by a specified separation distance to generate a plurality of urban road network areas in the urban road network.
- each of the at least one road segment included in the sequence of each road segment is turned
- the adjacent road segment of the road segment can reach the transition probability of the destination point, and select N road segment sequences from the M road segment sequences as the path query result, including:
- N road segment sequences are selected from the M road segment sequences as a path query result.
- N route sequence is selected from the M link sequence according to the joint probability of each link sequence, as a path query result.
- a link sequence having a joint probability greater than or equal to a preset probability threshold is used as a sequence of one of the N road segments.
- Another aspect of the present invention provides a path query device, including:
- An obtaining unit configured to obtain query data, where the query data includes a departure location and a destination point;
- a matching unit configured to obtain, according to the query data, a sequence of M segments, where each segment sequence of the M segments includes at least one segment; M is an integer greater than or equal to 2;
- a selecting unit configured to: according to the transition probability that each of the at least one road segment included in each of the road segment sequences is turned to the adjacent road segment of the road segment, the transition probability of the destination point is reachable from the M N segments are selected in the sequence of segments as a path query result; N is an integer greater than or equal to 1 and less than or equal to M;
- An output unit configured to output the path query result.
- the device further comprising a processing unit
- the apparatus further comprising a dividing unit, configured to
- the urban road network is divided by a specified separation distance to generate a plurality of urban road network areas in the urban road network.
- N road segment sequences are selected from the M road segment sequences as a path query result.
- a link sequence having a joint probability greater than or equal to a preset probability threshold is used as a sequence of one of the N road segments.
- an apparatus comprising:
- One or more processors are One or more processors;
- One or more programs the one or more programs being stored in the memory, when executed by the one or more processors:
- Obtaining query data the query data including a departure point and a destination point;
- each of the M road segment sequences includes at least one road segment;
- M is an integer greater than or equal to 2;
- N is an integer greater than or equal to 1 and less than or equal to M;
- the path query result is output.
- a nonvolatile computer storage medium storing one or more programs when the one or more programs are executed by a device causes The device:
- Obtaining query data the query data including a departure point and a destination point;
- each of the M road segment sequences includes at least one road segment;
- M is an integer greater than or equal to 2;
- N is an integer greater than or equal to 1 and less than or equal to M;
- the path query result is output.
- the embodiment of the present invention obtains query data, where the query data includes a departure point and a destination point, and further obtains M road segment sequences according to the query data, so that at least according to each road segment sequence Each road segment in a road segment turns to the adjacent road segment of the road segment to reach the transition probability of the destination point, and selects N road segment sequences from the M road segment sequences as the path query result, since the path query is no longer dependent on the road weight Therefore, the problem that the query result is unreasonable due to the inability of the road weight of some roads to be updated in time can be avoided in the prior art, thereby improving the reliability of the path query operation.
- the trajectory big data execution path query operation of the user history trajectory is adopted, the user's experience route can be found, and a more reasonable query result can be provided, for example, discovering a new road and avoiding Congested roads, etc., can greatly enhance the user experience.
- FIG. 1 is a schematic flowchart of a path query method according to an embodiment of the present invention
- FIG. 2 is a schematic structural diagram of a path query apparatus according to another embodiment of the present invention.
- FIG. 3 is a schematic structural diagram of a path query apparatus according to another embodiment of the present invention.
- FIG. 4 is a schematic structural diagram of a path query apparatus according to another embodiment of the present invention.
- the terminals involved in the embodiments of the present invention may include, but are not limited to, a mobile phone, a personal digital assistant (PDA), a wireless handheld device, a tablet computer, and a personal computer (Personal Computer, PC). ), MP3 player, MP4 player, wearable device (for example, smart glasses, smart watches, smart bracelets, etc.).
- PDA personal digital assistant
- PC Personal Computer
- FIG. 1 is a schematic flowchart of a path query method according to an embodiment of the present invention, as shown in FIG. 1 .
- the so-called road segment in the traffic field, refers to the relationship between two adjacent nodes on the urban road network.
- Traffic The so-called urban road network refers to a network structure consisting of different functions, grades, and location roads in a city with a certain density and appropriate form.
- road segment sequence refers to a sequence of road segments formed by an orderly arrangement of a series of connected road segments, which may also be called a path.
- N is an integer greater than or equal to 1 and less than or equal to M.
- the so-called “reachable destination point” may mean passing or passing the destination point and continuing to move to other places, or may also stop moving to other places with the destination point as the end point, this embodiment is This is not particularly limited.
- execution entities of 101 to 103 may be applications located in the local terminal, or may be plug-ins or software development kits (SDKs) installed in applications located in the local terminal.
- the functional unit may also be a query engine located in the network side server, or may be a distributed system located on the network side, which is not specifically limited in this embodiment.
- the application may be a local application (nativeApp) installed on the terminal, or may be a web application (webApp) of the browser on the terminal, which is not limited in this embodiment.
- the query data includes a departure point and a destination point, and further, according to the query data, obtaining M road segment sequences, so that each road segment sequence can be obtained.
- Each of the at least one road segment included in the column turns to the transition probability of the adjacent segment of the road segment to reach the destination point, and selects N road segment sequences from the M road segment sequences as a path query result, since no longer depends
- the road weight performs the path query operation. Therefore, the problem that the query result is unreasonable due to the inability of the road weight of some roads to be updated in time can be avoided in the prior art, thereby improving the reliability of the path query operation.
- Some applications involve some path query services, such as Baidu maps. These applications first display the path query query interface to the user for input, and then, according to the information input by the user, set the information of the endpoints such as the departure point and the destination point, and then request the query engine to provide the path data. .
- the query keyword provided by the user may also be collected, which may also be referred to as query data.
- the query command can be triggered in the following two ways:
- the query keyword input or selected by the user on the page presented by the current application may include a departure location and a destination point. Then, by clicking the query button on the page, a query command is triggered, and the query keyword includes the query keyword. In this way, after receiving the query command, the query keywords included therein can be parsed.
- asynchronous loading technology for example, Ajax asynchronous loading or Jsonp asynchronous loading, etc.
- real-time acquisition of the input content input by the user on the page displayed by the current application in order to distinguish from the query keyword, the input content at this time may be referred to as input. Key words.
- An input character to trigger a query command the query command including the query keyword.
- the query keywords included therein can be parsed.
- an interface such as an Ajax interface or a Jsonp interface may be provided.
- the interfaces may be written in a language such as Java or a Hypertext Preprocessor (PHP) language, and the specific call may be in a language such as Jquery or native JavaScript. Write it.
- PGP Hypertext Preprocessor
- the purpose of the user query may be arbitrarily or non-specific, which may cause the departure and destination points included in the query data provided by the user to have certain uncertainties.
- Appropriate expansion processing is included for the departure and destination points included in the query data, and the query starting point and the query end point of the query are expanded to make the query starting point no longer limited to the starting point, and the query end point is no longer limited to the purpose. location. In this way, the query results can be made more in line with the user's true travel intention.
- the departure point can be extended by using the urban road network area to which the departure point is included in the query data
- the destination point is extended by using the urban road network area to which the destination point included in the query data belongs, and execution is performed. Path query operation.
- the so-called urban road network refers to a network structure consisting of different functions, grades, and location roads in a city with a certain density and appropriate form.
- the so-called urban road network area refers to a designated area in the urban road network.
- the designated areas may be a plurality of areas in the urban road network randomly divided based on the urban road network, or may be divided into urban road networks by a specified separation distance, and the generated urban road network is A plurality of urban road network areas are not particularly limited in this embodiment.
- the urban road network area to which the departure location belongs may be obtained according to the departure location included in the query data, and according to the query.
- the destination point included in the data obtains the urban road network area to which the destination point belongs.
- a link matching process is performed in the urban road network to obtain a matched M road segment sequence.
- the road segments included in each of the road segment sequences are the first connected road segments from the urban road network region to which the departure point belongs to the urban road network region to which the destination point belongs.
- the starting point of the query and the query end point of the query are expanded, the starting point of the query is no longer limited to the starting point included in the query data, and the query end point is no longer limited to the purpose of the query data.
- the location therefore, can obtain more matching segments of the road segment, thus enriching the data processing source on which the path query operation is based.
- At least one user history track that reaches the destination point may be obtained according to the destination point, and the at least one may be obtained.
- the number of first tracks of each road segment included in the sequence of the historical road segments is obtained, and each phase of the road segment is passed through the road segment.
- a transition probability that each of the road segments included in the historical road segment sequence can be transferred to the destination point for each adjacent road segment of the road segment can be obtained.
- the ratio of the number of second paths to the number of first paths is The second path number/first path number, as each of the road segments included in the historical road segment sequence turns to each of the adjacent road segments of the road segment to reach the transition probability of the destination point.
- the transition probability of each road segment corresponding to the user history track in the urban road network to the destination point of each adjacent road segment of the road segment can be obtained, and each of the other road segments in the urban road network is directed to the road segment.
- the transition probability that an adjacent road segment can reach the destination point can be recorded as 0.
- the so-called user history track is a collection of several track points of the user.
- the user history trajectory can be matched to the road segment in the urban road network, and the subsequent path query operation can be performed.
- a matching algorithm in the prior art for example, a hidden Markov model, etc., may be used.
- details refer to related content in the prior art, and details are not described herein again.
- the location expansion method described above may also be used to extend the destination point.
- the urban road network area to which the destination point belongs may be obtained according to the destination point, and further, the urban road network to which the destination point belongs may be obtained according to the urban road network area to which the destination point belongs.
- At least one user history trajectory of the region as at least one user history trajectory to the destination point.
- the so-called "at least one user history track reaching the urban road network area to which the destination point belongs” may refer to a user history track that passes through or passes through the urban road network area to which the destination point belongs, and continues to move to other places. Or may be a user history track that does not continue to move to other locations with the urban road network area to which the destination point belongs as the end point.
- This embodiment is not particularly limited in this embodiment.
- the road segments corresponding to the historical tracks of the users reaching each urban road network area may be formed into a single independent road network, and each user history track can reach the independent road network.
- Urban road network area If the user history track passes through or passes through a certain urban road network area and continues to move to other urban road network areas, then in the independent road network, part of the path after the certain urban road network area may be deleted, The end point of each user history track in the independent road network is made to be the certain city road network area.
- the independent road network may be used to index the road segments corresponding to the historical tracks of the users. In this way, when querying at least one user history track of the urban road network area according to a certain urban road network area, the query can be directly performed according to the index, which can effectively improve the efficiency of the path query operation.
- each of the at least one road segment included in each of the road segment sequences may be redirected to an adjacent road segment of the road segment.
- the transition probability of the destination point obtains a joint probability of the sequence of each road segment.
- N route segments are selected from the M link sequence as a path query result.
- a road segment sequence includes n road segments, that is, from the departure point (ie, the urban road network area to which the departure point belongs) to the destination point (ie, the urban road network area to which the destination point belongs), which are link1, link2, ...
- Linkn-1, linkn, n is an integer greater than or equal to 2.
- the transition probability of linkn-1 to linkn is denoted as P linkn
- the N road segments with the largest joint probability can be specified. Column as the result of the path query. For example, the sequence of all the road segments may be sorted according to the order of joint probability, and the sequence of N road segments arranged in front is selected as the query result of the path query operation.
- a link sequence whose joint probability is greater than or equal to a preset probability threshold may be specifically used as a sequence of one of the N road segments.
- the query data includes a departure point and a destination point, and further, according to the query data, obtaining M road segment sequences, so that each of the at least one road segment included in each road segment sequence can be obtained.
- the road segment turns to the adjacent road segment of the road segment to reach the transition probability of the destination point, and selects N road segment sequences from the M road segment sequences as the path query result, since the path query operation is no longer relied on the road weight, The problem that the query result is unreasonable due to the inability of the road weight of some roads to be updated in time is avoided in the prior art, thereby improving the reliability of the path query operation.
- the trajectory big data execution path query operation of the user history trajectory is adopted, the user's experience route can be found, and a more reasonable query result can be provided, for example, discovering a new road and avoiding Congested roads, etc., can greatly enhance the user experience.
- FIG. 2 is a schematic structural diagram of a path query apparatus according to another embodiment of the present invention, as shown in FIG. 2 .
- the path querying apparatus of this embodiment may include an obtaining unit 21, a matching unit 22, a selecting unit 23, and an output unit 24.
- the obtaining unit 21 is configured to acquire query data, where the query data includes a departure point and a destination point
- the matching unit 22 is configured to obtain M road segment sequences according to the query data, and each of the M road segment sequences
- the sequence of the road segment includes at least one road segment; M is an integer greater than or equal to 2;
- the selecting unit 23 is configured to reach, according to each of the at least one road segment included in the sequence of each road segment, the adjacent road segment of the road segment a transition probability of the destination point, selecting N route segments from the M road segment sequences as a path query result; N being an integer greater than or equal to 1 and less than or equal to M; and an output unit 24 for outputting the path search result.
- part or all of the path query device provided in this embodiment may be an application located in a local terminal, or may be a plug-in or a software development kit (Software Development Kit) installed in an application located in the local terminal.
- the functional unit, such as the SDK may also be a query engine located in the network side server, or may be a distributed system located on the network side, which is not specifically limited in this embodiment.
- the application may be a local application (nativeApp) installed on the terminal, or may be a web application (webApp) of the browser on the terminal, which is not limited in this embodiment.
- the path querying apparatus may further include a processing unit 31, configured to obtain a destination according to the destination point. Determining at least one user history track of the destination point; obtaining a historical link sequence corresponding to each user history track in the at least one user history track; Obtaining, according to the historical link sequence corresponding to each user history track, the number of first tracks of each road segment included by the historical road segment sequence, and passing each adjacent road segment of the road segment after passing the road segment a second number of paths; and obtaining, according to the number of the first trajectories and the number of the second trajectories, each of the road segments included in the sequence of historical road segments to each adjacent road segment of the road segment to reach the destination point Probability.
- the processing unit 31 may obtain, according to the destination point, a city road network area to which the destination point belongs, and obtain a city to which the destination point belongs according to the urban road network area to which the destination point belongs. At least one user history track of the road network area as the at least one user history track reaching the destination point.
- the path querying apparatus provided in this embodiment may further include a dividing unit 41, configured to use the specified separation distance to the urban road network. Dividing is performed to generate a plurality of urban road network regions in the urban road network.
- the selecting unit 23 may be specifically configured to: according to each of the at least one road segment included in each sequence of segments, turn to a phase of the road segment The neighboring segment can reach the transition probability of the destination point, obtain the joint probability of each of the link segments, and select N segments from the M segment sequence according to the joint probability of each segment sequence as the path search result.
- the selecting unit 23 may be specifically configured to use the N route sequence with the largest joint probability as the path query result.
- the selecting unit 23 may be specifically configured to use a link sequence with a joint probability greater than or equal to a preset probability threshold as one of the N link sequences.
- the query data is obtained by the obtaining unit, where the query data includes a departure point and a destination point, and then the matching unit obtains M road segment sequences according to the query data, so that the selection unit can be included according to each road segment sequence.
- Each of the at least one road segment turns to an adjacent road segment of the road segment to reach a transition probability of the destination point, and selects N road segment sequences from the M road segment sequences as a path query result, since the road weight is no longer relied on
- the path query operation can avoid the problem that the query result is unreasonable due to the inability of the road weight of some roads to be updated in time in the prior art, thereby improving the reliability of the path query operation.
- the trajectory big data execution path query operation of the user history trajectory is adopted, the user's experience route can be found, and a more reasonable query result can be provided, for example, discovering a new road and avoiding Congested roads, etc., can greatly enhance the user experience.
- the disclosed system, apparatus, and method may be implemented in other manners.
- the device embodiments described above are merely illustrative.
- the division of the unit is only a logical function division.
- there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
- the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be electrical, mechanical or otherwise.
- the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
- each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
- the above integrated unit can be implemented in the form of hardware or in the form of hardware plus software functional units.
- the above-described integrated unit implemented in the form of a software functional unit can be stored in a computer readable storage medium.
- the above software functional unit is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor to perform the methods of the various embodiments of the present invention. Part of the steps.
- the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. .
Landscapes
- Engineering & Computer Science (AREA)
- Remote Sensing (AREA)
- Radar, Positioning & Navigation (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Automation & Control Theory (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- Social Psychology (AREA)
- Navigation (AREA)
Abstract
Description
Claims (14)
- 一种路径查询方法,其特征在于,包括:获取查询数据,所述查询数据包括出发地点和目的地点;根据所述查询数据,获得M个路段序列,所述M个路段序列中每个路段序列包括至少一个路段;M为大于或等于2的整数;根据所述每个路段序列所包括的所述至少一个路段中每个路段转向该路段的相邻路段可达所述目的地点的转移概率,从M个路段序列中选择N个路段序列,以作为路径查询结果;N为大于或等于1且小于或等于M的整数;输出所述路径查询结果。
- 根据权利要求1所述的方法,其特征在于,所述根据所述每个路段序列所包括的所述至少一个路段中每个路段转向该路段的相邻路段可达所述目的地点的转移概率,从M个路段序列中选择N个路段序列,以作为路径查询结果之前,还包括:根据所述目的地点,获得到达所述目的地点的至少一个用户历史轨迹;获得所述至少一个用户历史轨迹中每个用户历史轨迹所对应的历史路段序列;根据所述每个用户历史轨迹所对应的历史路段序列,获得通过所述历史路段序列所包括的每个路段的第一轨迹数量,以及通过该路段之后再通过该路段的每个相邻路段的第二路径数量;根据所述第一轨迹数量和所述第二轨迹数量,获得所述历史路段序列所包括的每个路段转向该路段的每个相邻路段可达所述目的地点的转 移概率。
- 根据权利要求2所述的方法,其特征在于,所述根据所述目的地点,获得到达所述目的地点的至少一个用户历史轨迹,包括:根据所述目的地点,获得所述目的地点所属的城市道路网区域;根据所述目的地点所属的城市道路网区域,获得到达所述目的地点所属的城市道路网区域的至少一个用户历史轨迹,以作为所述到达所述目的地点的至少一个用户历史轨迹。
- 根据权利要求3所述的方法,其特征在于,所述根据所述目的地点,获得所述目的地点所属的城市道路网区域之前,还包括:以指定间隔距离,对城市道路网进行划分,生成所述城市道路网中的若干个城市道路网区域。
- 根据权利要求1~4任一权利要求所述的方法,其特征在于,所述根据所述每个路段序列所包括的所述至少一个路段中每个路段转向该路段的相邻路段可达所述目的地点的转移概率,从M个路段序列中选择N个路段序列,以作为路径查询结果,包括:根据所述每个路段序列所包括的所述至少一个路段中每个路段转向该路段的相邻路段可达所述目的地点的转移概率,获得所述每个路段序列的联合概率;根据所述每个路段序列的联合概率,从M个路段序列中选择N个路段序列,以作为路径查询结果。
- 根据权利要求5所述的方法,其特征在于,所述根据所述每个路段序列的联合概率,从M个路段序列中选择N个路段序列,以作为路径查询结果,包括:将联合概率最大的N个路段序列,作为所述路径查询结果;或者将联合概率大于或等于预先设置的概率阈值的路段序列,作为所述N个路段序列中的一个路段序列。
- 一种路径查询装置,其特征在于,包括:获取单元,用于获取查询数据,所述查询数据包括出发地点和目的地点;匹配单元,用于根据所述查询数据,获得M个路段序列,所述M个路段序列中每个路段序列包括至少一个路段;M为大于或等于2的整数;选择单元,用于根据所述每个路段序列所包括的所述至少一个路段中每个路段转向该路段的相邻路段可达所述目的地点的转移概率,从M个路段序列中选择N个路段序列,以作为路径查询结果;N为大于或等于1且小于或等于M的整数;输出单元,用于输出所述路径查询结果。
- 根据权利要求7所述的装置,其特征在于,所述装置还包括处理单元,用于根据所述目的地点,获得到达所述目的地点的至少一个用户历史轨迹;获得所述至少一个用户历史轨迹中每个用户历史轨迹所对应的历史路段序列;根据所述每个用户历史轨迹所对应的历史路段序列,获得通过所述历史路段序列所包括的每个路段的第一轨迹数量,以及通过该路段之后再通过该路段的每个相邻路段的第二路径数量;以及根据所述第一轨迹数量和所述第二轨迹数量,获得所述历史路段序 列所包括的每个路段转向该路段的每个相邻路段可达所述目的地点的转移概率。
- 根据权利要求8所述的装置,其特征在于,所述处理单元,具体用于根据所述目的地点,获得所述目的地点所属的城市道路网区域;以及根据所述目的地点所属的城市道路网区域,获得到达所述目的地点所属的城市道路网区域的至少一个用户历史轨迹,以作为所述到达所述目的地点的至少一个用户历史轨迹。
- 根据权利要求9所述的装置,其特征在于,所述装置还包括划分单元,用于以指定间隔距离,对城市道路网进行划分,生成所述城市道路网中的若干个城市道路网区域。
- 根据权利要求7~10任一权利要求所述的装置,其特征在于,所述选择单元,具体用于根据所述每个路段序列所包括的所述至少一个路段中每个路段转向该路段的相邻路段可达所述目的地点的转移概率,获得所述每个路段序列的联合概率;以及根据所述每个路段序列的联合概率,从M个路段序列中选择N个路段序列,以作为路径查询结果。
- 根据权利要求11所述的装置,其特征在于,所述选择单元,具体用于将联合概率最大的N个路段序列,作为所述路径查询结果;或者将联合概率大于或等于预先设置的概率阈值的路段序列,作为所述N个路段序列中的一个路段序列。
- 一种设备,包括:一个或者多个处理器;存储器;一个或者多个程序,所述一个或者多个程序存储在所述存储器中,当被所述一个或者多个处理器执行时:获取查询数据,所述查询数据包括出发地点和目的地点;根据所述查询数据,获得M个路段序列,所述M个路段序列中每个路段序列包括至少一个路段;M为大于或等于2的整数;根据所述每个路段序列所包括的所述至少一个路段中每个路段转向该路段的相邻路段可达所述目的地点的转移概率,从M个路段序列中选择N个路段序列,以作为路径查询结果;N为大于或等于1且小于或等于M的整数;输出所述路径查询结果。
- 一种非易失性计算机存储介质,所述非易失性计算机存储介质存储有一个或者多个程序,当所述一个或者多个程序被一个设备执行时,使得所述设备:获取查询数据,所述查询数据包括出发地点和目的地点;根据所述查询数据,获得M个路段序列,所述M个路段序列中每个路段序列包括至少一个路段;M为大于或等于2的整数;根据所述每个路段序列所包括的所述至少一个路段中每个路段转向该路段的相邻路段可达所述目的地点的转移概率,从M个路段序列中选 择N个路段序列,以作为路径查询结果;N为大于或等于1且小于或等于M的整数;输出所述路径查询结果。
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2018516192A JP6613475B2 (ja) | 2015-09-30 | 2015-12-22 | 経路照会方法、装置、デバイス及び不揮発性コンピューター記憶媒体 |
US15/765,204 US20190056235A1 (en) | 2015-09-30 | 2015-12-22 | Path querying method and device, an apparatus and non-volatile computer storage medium |
KR1020187009021A KR102015235B1 (ko) | 2015-09-30 | 2015-12-22 | 경로조회 방법, 장치, 디바이스 및 비휘발성 컴퓨터 기억 매체 |
EP15905242.2A EP3358474B1 (en) | 2015-09-30 | 2015-12-22 | Route search method, device and apparatus, and non-volatile computer storage medium |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201510639503.8 | 2015-09-30 | ||
CN201510639503.8A CN105354221A (zh) | 2015-09-30 | 2015-09-30 | 路径查询方法及装置 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2017054332A1 true WO2017054332A1 (zh) | 2017-04-06 |
Family
ID=55330194
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2015/098278 WO2017054332A1 (zh) | 2015-09-30 | 2015-12-22 | 路径查询方法、装置、设备及非易失性计算机存储介质 |
Country Status (6)
Country | Link |
---|---|
US (1) | US20190056235A1 (zh) |
EP (1) | EP3358474B1 (zh) |
JP (1) | JP6613475B2 (zh) |
KR (1) | KR102015235B1 (zh) |
CN (1) | CN105354221A (zh) |
WO (1) | WO2017054332A1 (zh) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111078810A (zh) * | 2019-11-29 | 2020-04-28 | 北京三快在线科技有限公司 | 经验路线生成方法和装置、存储介质和电子设备 |
CN111222059A (zh) * | 2020-01-17 | 2020-06-02 | 西安交通大学 | 一种城市可达区域搜索系统及方法 |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108304235B (zh) * | 2017-02-20 | 2020-09-29 | 腾讯科技(深圳)有限公司 | 页面显示方法和装置 |
CN109493592B (zh) * | 2017-09-11 | 2021-03-26 | 腾讯科技(深圳)有限公司 | 路径推荐方法及装置 |
CN107643085B (zh) * | 2017-09-18 | 2021-02-12 | 苏州大学 | 一种路径推荐方法与装置 |
CN112394380B (zh) * | 2019-08-16 | 2024-04-02 | 阿里巴巴集团控股有限公司 | 一种数据处理方法、装置及系统 |
CN110542428B (zh) * | 2019-08-27 | 2021-06-15 | 腾讯科技(深圳)有限公司 | 驾驶路线质量评估方法及装置 |
CN114065992A (zh) * | 2020-08-05 | 2022-02-18 | 北京三快在线科技有限公司 | 路线规划和订单推荐的方法、装置、电子设备及存储介质 |
CN114419357B (zh) * | 2022-03-10 | 2022-06-21 | 腾讯科技(深圳)有限公司 | 数据处理方法、装置、计算机及可读存储介质 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103512581A (zh) * | 2012-06-28 | 2014-01-15 | 北京搜狗科技发展有限公司 | 一种路径规划方法和装置 |
CN104165625A (zh) * | 2013-05-17 | 2014-11-26 | 北京百度网讯科技有限公司 | 路径规划方法和设备 |
CN104536986A (zh) * | 2014-12-08 | 2015-04-22 | 安一恒通(北京)科技有限公司 | 路径查询方法及装置 |
Family Cites Families (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP3527505B2 (ja) * | 2001-08-06 | 2004-05-17 | 松下電器産業株式会社 | 情報提供方法 |
JP3882554B2 (ja) * | 2001-09-17 | 2007-02-21 | 日産自動車株式会社 | ナビゲーション装置 |
GB0518617D0 (en) * | 2005-09-13 | 2005-10-19 | Hopkins Mark | Network message and alert selection apparatus and method |
US7893849B2 (en) * | 2005-10-20 | 2011-02-22 | Poltorak Alexander I | Apparatus and method for providing travel information |
US7610151B2 (en) * | 2006-06-27 | 2009-10-27 | Microsoft Corporation | Collaborative route planning for generating personalized and context-sensitive routing recommendations |
US7783417B2 (en) * | 2007-03-09 | 2010-08-24 | Mitac International Corporation | Methods and apparatus for determining a route having an estimated minimum fuel usage for a vehicle |
CN101349566A (zh) * | 2007-07-19 | 2009-01-21 | 康佳集团股份有限公司 | 一种车辆实时导航方法及系统 |
CN101493329B (zh) * | 2008-01-23 | 2011-04-27 | 华东师范大学 | 一种多目标点路径规划方法和装置 |
WO2010048146A1 (en) * | 2008-10-20 | 2010-04-29 | Carnegie Mellon University | System, method and device for predicting navigational decision-making behavior |
WO2010147730A1 (en) * | 2009-06-16 | 2010-12-23 | Tele Atlas North America Inc. | Methods and systems for creating digital street network database |
JP5495014B2 (ja) * | 2009-09-09 | 2014-05-21 | ソニー株式会社 | データ処理装置、データ処理方法、およびプログラム |
JP2011252844A (ja) * | 2010-06-03 | 2011-12-15 | Sony Corp | データ処理装置、データ処理方法、およびプログラム |
US8645061B2 (en) * | 2010-06-16 | 2014-02-04 | Microsoft Corporation | Probabilistic map matching from a plurality of observational and contextual factors |
JP5182336B2 (ja) * | 2010-08-02 | 2013-04-17 | 株式会社デンソー | 運転特性特定装置および経路探索装置 |
US9285235B2 (en) * | 2011-03-25 | 2016-03-15 | Sony Corporation | Information processing device, information processing method, and program |
CN102288193B (zh) * | 2011-07-06 | 2013-06-26 | 东南大学 | 一种基于历史数据的机动车出行路径的确定方法 |
US20130054050A1 (en) * | 2011-08-24 | 2013-02-28 | Dimitar Petrov Filev | Methods and apparatus for a vehicle to cloud to vehicle control system |
DE102011083375A1 (de) * | 2011-09-26 | 2013-03-28 | Robert Bosch Gmbh | Verfahren zur Übermittlung von Routendaten für die Verkehrstelematik |
CN103487057B (zh) * | 2013-10-08 | 2016-10-12 | 百度在线网络技术(北京)有限公司 | 基于端点扩展的路径规划方法及装置 |
US9091561B1 (en) * | 2013-10-28 | 2015-07-28 | Toyota Jidosha Kabushiki Kaisha | Navigation system for estimating routes for users |
CN104537836B (zh) * | 2014-12-30 | 2016-11-30 | 北京通博科技有限公司 | 路段行驶时间分布预测方法 |
-
2015
- 2015-09-30 CN CN201510639503.8A patent/CN105354221A/zh active Pending
- 2015-12-22 US US15/765,204 patent/US20190056235A1/en not_active Abandoned
- 2015-12-22 WO PCT/CN2015/098278 patent/WO2017054332A1/zh active Application Filing
- 2015-12-22 EP EP15905242.2A patent/EP3358474B1/en active Active
- 2015-12-22 KR KR1020187009021A patent/KR102015235B1/ko active IP Right Grant
- 2015-12-22 JP JP2018516192A patent/JP6613475B2/ja active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103512581A (zh) * | 2012-06-28 | 2014-01-15 | 北京搜狗科技发展有限公司 | 一种路径规划方法和装置 |
CN104165625A (zh) * | 2013-05-17 | 2014-11-26 | 北京百度网讯科技有限公司 | 路径规划方法和设备 |
CN104536986A (zh) * | 2014-12-08 | 2015-04-22 | 安一恒通(北京)科技有限公司 | 路径查询方法及装置 |
Non-Patent Citations (1)
Title |
---|
See also references of EP3358474A4 * |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111078810A (zh) * | 2019-11-29 | 2020-04-28 | 北京三快在线科技有限公司 | 经验路线生成方法和装置、存储介质和电子设备 |
CN111222059A (zh) * | 2020-01-17 | 2020-06-02 | 西安交通大学 | 一种城市可达区域搜索系统及方法 |
CN111222059B (zh) * | 2020-01-17 | 2023-03-28 | 西安交通大学 | 一种城市可达区域搜索系统及方法 |
Also Published As
Publication number | Publication date |
---|---|
KR20180048893A (ko) | 2018-05-10 |
US20190056235A1 (en) | 2019-02-21 |
JP2018531379A (ja) | 2018-10-25 |
EP3358474B1 (en) | 2021-09-08 |
CN105354221A (zh) | 2016-02-24 |
EP3358474A1 (en) | 2018-08-08 |
KR102015235B1 (ko) | 2019-10-21 |
EP3358474A4 (en) | 2018-12-05 |
JP6613475B2 (ja) | 2019-12-04 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2017054332A1 (zh) | 路径查询方法、装置、设备及非易失性计算机存储介质 | |
CN107609101B (zh) | 智能交互方法、设备及存储介质 | |
CN107797984B (zh) | 智能交互方法、设备及存储介质 | |
US10783171B2 (en) | Address search method and device | |
US9690806B2 (en) | Method and apparatus of recommending candidate terms based on geographical location | |
US8965974B2 (en) | Systems and methods for determining user attribute values by mining user network data and information | |
JP2018531379A6 (ja) | 経路照会方法、装置、デバイス及び不揮発性コンピューター記憶媒体 | |
CN109213844B (zh) | 一种文本处理方法、装置以及相关设备 | |
US10783885B2 (en) | Image display device, method for driving the same, and computer readable recording medium | |
CN108563753A (zh) | 消息推送文案的生成方法、装置及计算机可读存储介质 | |
CN109564571A (zh) | 利用搜索上下文的查询推荐方法及系统 | |
TW201604698A (zh) | 一種軌跡資訊的推送方法及裝置 | |
CN109416695A (zh) | 在自动聊天中提供本地服务信息 | |
WO2016045567A1 (zh) | 网页数据分析方法及装置 | |
KR102601545B1 (ko) | 지리 위치점 정렬 방법, 정렬 모델 트레이닝 방법 및 대응하는 장치 | |
JP6728178B2 (ja) | 検索データを処理するための方法及び装置 | |
TW201837749A (zh) | 基於社交網路的群組查找方法和裝置 | |
US11893073B2 (en) | Method and apparatus for displaying map points of interest, and electronic device | |
WO2017028395A1 (zh) | 一种提供搜索结果的方法与装置 | |
CN108319628A (zh) | 一种用户兴趣确定方法及装置 | |
WO2017173783A1 (zh) | 兴趣点数据显示方法及终端 | |
CN106919703A (zh) | 电影信息搜索方法及装置 | |
CN103955480A (zh) | 一种用于确定用户所对应的目标对象信息的方法与设备 | |
JP2011501849A (ja) | 情報マップ管理システムおよび情報マップ管理方法 | |
CN106844553A (zh) | 基于样本数据的数据探测和扩充方法及装置 |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15905242 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2018516192 Country of ref document: JP |
|
ENP | Entry into the national phase |
Ref document number: 20187009021 Country of ref document: KR Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2015905242 Country of ref document: EP |