WO2011072605A1 - 兴趣点的检索方法及终端 - Google Patents

兴趣点的检索方法及终端 Download PDF

Info

Publication number
WO2011072605A1
WO2011072605A1 PCT/CN2010/079810 CN2010079810W WO2011072605A1 WO 2011072605 A1 WO2011072605 A1 WO 2011072605A1 CN 2010079810 W CN2010079810 W CN 2010079810W WO 2011072605 A1 WO2011072605 A1 WO 2011072605A1
Authority
WO
WIPO (PCT)
Prior art keywords
point
interest
candidate
target
points
Prior art date
Application number
PCT/CN2010/079810
Other languages
English (en)
French (fr)
Inventor
陆卫红
Original Assignee
华为终端有限公司
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 华为终端有限公司 filed Critical 华为终端有限公司
Publication of WO2011072605A1 publication Critical patent/WO2011072605A1/zh

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
    • 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 the field of location services, and in particular, to a method and terminal for retrieving points of interest. Background of the invention
  • a mobile location service is a location-related service provided to a user under the support of an electronic map platform, and may also be referred to as a location-based service or a location service.
  • the point of interest service provides information related to the location of the user. For example, when a driver passes an unfamiliar area and needs to find a nearby gas station, the information he needs is displayed on the phone and the selected nearest location is marked.
  • Some services also provide addresses, phone numbers, email addresses, location descriptions (ie gas stations, bicycle retail stores, restaurants, etc.) and route planning navigation to selected locations.
  • the mobile location service technology only searches for the location of a point of interest based on a location, such as: Searching for a hotel within 2 kilometers of a location based on a location. With the close interaction between people, it is imperative to identify points of interest for multiple locations. For example: Several people choose a location in different locations, so that everyone is closer to the chosen location; or if you are going to a few destinations on a business trip, choosing a hotel makes the journey from the hotel to multiple destinations not too long. However, the prior art cannot perform a search based on a plurality of locations to determine a point of interest. Summary of the invention
  • Embodiments of the present invention provide a method and a terminal for retrieving a point of interest, which can implement a search for a point of interest according to a plurality of different locations.
  • a method of searching for points of interest including: Obtaining a set of candidate points of interest;
  • a target interest point is found from the set of candidate points of interest, and the positional relationship between the target interest point and the at least two known positions respectively satisfies a predetermined rule one.
  • a retrieval terminal of a point of interest comprising:
  • An obtaining unit configured to acquire a candidate point of interest set
  • a searching unit configured to find a target interest point from the candidate point of interest set, where the positional relationship between the target interest point and the at least two known positions respectively satisfies a predetermined rule one.
  • the method for searching for the above-mentioned points of interest may also adopt the second implementation manner.
  • the steps are as follows: Find a target location point, and the location relationship between the target location point and at least two known locations respectively satisfies a predetermined rule;
  • the target interest point is searched within a predetermined distance range of the target location point.
  • the technical solution provides a second point of interest for the retrieval terminal, including:
  • a searching unit configured to find a target location point, where the location relationship between the target location point and the at least two known locations respectively satisfies a predetermined rule
  • a searching unit configured to search for a target interest point within a predetermined distance range of the target location point.
  • the method for searching for two points of interest and the terminal provided by the embodiment of the present invention, the first method is to obtain a set of candidate points of interest, where the set of candidate points of interest includes a target point of interest required by the user. Then, the target interest points are searched from the set of candidate interest points according to a preset rule, and the positional relationship between the target interest points and the at least two known positions respectively satisfies a predetermined rule one, that is, the target interest points. Determined by at least two known locations.
  • the second method satisfies a predetermined rule by finding a target position point, the positional relationship between the target position point and at least two known positions, respectively.
  • the target position is determined by at least two known positions and serves as a reference position for determining a target point of interest by at least two known positions.
  • the target interest point is searched within a predetermined distance range of the target position point.
  • the target interest points obtained by the above two methods are all determined according to at least two known positions and the same preset rule, thereby realizing Set a search to determine the point of interest.
  • FIG. 1 is a flowchart of a method for searching for a first point of interest according to an embodiment of the present invention
  • FIG. 2 is a structural block diagram of a retrieval terminal of a first point of interest according to an embodiment of the present invention
  • FIG. 3 is a flowchart of a method for searching for a second point of interest according to an embodiment of the present invention
  • FIG. 4 is a structural block diagram of a retrieval terminal of a second point of interest according to an embodiment of the present invention.
  • FIG. 5 is a flowchart of a method for searching for a point of interest according to Embodiment 1 of the present invention.
  • FIG. 6 is a structural block diagram of a retrieval terminal of a point of interest according to Embodiment 1 of the present invention.
  • FIG. 7 is a flowchart of a method for searching for a point of interest according to Embodiment 2 of the present invention.
  • FIG. 8 is a structural block diagram of a retrieval terminal of a point of interest according to Embodiment 2 of the present invention. Mode for carrying out the invention
  • a method and a terminal for searching for a point of interest are provided.
  • the target point of interest may be searched according to a plurality of different known locations, where the target point of interest satisfies the requirements of each of the different known locations.
  • An embodiment of the present invention provides a method for searching for a point of interest. As shown in FIG. 1, the method includes the following steps:
  • 101. Obtain a candidate point of interest set. A plurality of candidate points of interest satisfying different location requirements are included in the candidate point of interest set. 102. Search for a target interest point from the candidate point of interest set, where the positional relationship between the target interest point and the at least two known positions respectively satisfies a predetermined rule one.
  • an embodiment of the present invention further provides a retrieval terminal of a point of interest.
  • the terminal includes: an acquisition unit 21 and a search unit 22.
  • the obtaining unit 21 is configured to acquire a candidate point of interest set.
  • a candidate interest point set for providing a reference for determining a target interest point, the candidate interest point set is filtered to remove a point of interest that does not meet the known location requirement and includes the target interest point, and the range of the target point of interest can be narrowed down, which is convenient and faster. Find the target point of interest.
  • the searching unit 22 is configured to find a target interest point from the candidate point of interest set, and the positional relationship between the target interest point and the at least two known positions respectively satisfies a predetermined rule one.
  • the target points of interest found by the lookup unit 22 satisfy the needs of each known location. It also achieves the determination of points of interest based on a number of different locations.
  • the method may also adopt a second implementation manner. As shown in FIG. 3, the method includes the following steps:
  • a target location point is found according to at least two known locations, and the location relationship between the target location point and the at least two known locations respectively satisfies a predetermined rule.
  • the target location point is a reference location for performing a search target point of interest.
  • the predetermined rule and the predetermined rule described in step 102 are the same.
  • Target interest point within a predetermined distance range of the target location point. Since the target location point satisfies the requirements of each known location, such as: the distance requirement with the target point of interest or the time requirement to reach the target point of interest, etc., the target interest is searched within the predetermined distance range of the target location point. Points also meet the requirements of each known location.
  • the embodiment of the present invention also provides a search terminal of the second interest point.
  • the terminal includes: a search unit 41 and a search unit 42.
  • the searching unit 41 is configured to find a target location point, and the location relationship between the target location point and the at least two known locations respectively satisfies a predetermined rule. Then, the search unit 42 is used to The target location point searches for a target interest point within a predetermined distance range.
  • the terminal implements the purpose of determining a target point of interest based on at least two known locations.
  • the first method determines a candidate point of interest set, and then searches for the target point of interest from the candidate point of interest set according to the preset rule, where the target point of interest is at least two The positional relationship between the known positions satisfies the predetermined rule one.
  • the second method is implemented, first, a target position point for reference is determined according to the preset rule, and then the target interest point is searched around the target position point.
  • the target interest points determined in the above two methods are determined according to at least two known positions and the same preset rules, thereby solving the problem that the prior art cannot determine the points of interest according to the plurality of positions.
  • the embodiment of the present invention assumes that there are three different known locations in the application scenario, and it is necessary to determine a hotel such that the distance or time of different friends from the three different known locations to the hotel is substantially the same. At this point the target point of interest is the hotel.
  • the implementation process of the first interest point search method is described in detail below, and the method includes the following steps:
  • the candidate point of interest set includes a plurality of candidate hotels that satisfy three known location requirements. This step can be achieved in the following ways:
  • the first way candidate candidate points of interest within a predetermined distance range of each known location are formed into a candidate point of interest set.
  • a known location is surrounded by its corresponding hotel, and the candidate hotels corresponding to each known location are formed into a candidate hotel collection, thereby selecting other hotels that do not satisfy the requirements of the known location.
  • the second method the candidate interest points searched in the specified area, the area excluding the designated area, the designated road segment, or the area excluding the designated road segment constitute a candidate interest point set.
  • the designated area is first excluded by the specified area. Searching for a candidate hotel within the area, on the designated road segment, or in the area where the designated road segment is excluded, the hotel that does not satisfy the user's needs can be deleted, such as outside the designated area, thereby narrowing the search range of the target hotel.
  • the third way firstly, according to a predetermined rule, the target position point is searched according to a predetermined rule, and the positional relationship between the target position point and the three known positions respectively satisfies a predetermined rule 2, and the predetermined rule 2
  • the predetermined rule one is a different predetermined rule.
  • the searched candidate points of interest within a predetermined distance of the target position point are then composed into a set of candidate points of interest.
  • the predetermined rule one and the predetermined rule two are respectively any one of the following rules, and the predetermined rule one and the predetermined rule two are different rules:
  • Rule A The difference between any two linear distances between the target hotel and the at least two known positions is within a predetermined range.
  • a linear distance between each candidate hotel and three known locations in the candidate hotel collection is calculated, and the corresponding candidate hotel is determined as the target hotel when the difference between the linear distances is within a predetermined range.
  • Rule B The difference between any two actual distances in the actual distance between the target hotel and the at least two known locations is within a predetermined range.
  • the actual distance between each candidate hotel and the three known locations in the candidate hotel collection is calculated, and the corresponding candidate hotel is determined as the target hotel when the difference between the actual distances is within the predetermined range.
  • Rule C The difference between any two navigation times in the navigation time between the target hotel and the at least two known locations is within a predetermined range.
  • the time required for each candidate hotel in the candidate hotel collection to three known locations is calculated, and the corresponding candidate hotel is determined as the target hotel when the difference of the above time is within the predetermined range.
  • the smaller the predetermined range the closer or equal the time required for each of the known locations to travel to the target hotel.
  • the travel mode may be walking, driving or taking public transportation tools.
  • a reference time can be calculated based on the actual distance and the pace of the normal person.
  • the reference time provides the user with a time that is approximately required.
  • the user adopts public transportation, such as a subway the user can be provided with a reference time that is roughly required according to the schedule of the public transportation.
  • a reference time can be calculated based on the speed and actual distance.
  • Rule D The sum of the linear distances between the target hotel and at least two known locations is the smallest. The total distance between each candidate hotel and the three known locations in the candidate hotel collection is calculated, and the candidate hotel corresponding to the minimum of the above sum is determined as the target hotel.
  • Rule E The sum of the actual distances between the target hotel and at least two known locations is the smallest.
  • the sum of the actual distances between each candidate hotel and the three known locations in the candidate hotel collection is calculated, and the corresponding candidate hotel is determined as the target hotel when the sum of the actual distances is the smallest.
  • Rule F The sum of the navigation times between the target hotel and at least two known locations is the smallest. The sum of time required for each candidate hotel in the candidate hotel collection to reach three known locations is calculated, and the corresponding candidate hotel is determined as the target hotel when the sum of the above times is the smallest.
  • the finding the target location point is a predetermined rule 1 adopted, which is different from the predetermined rule 2 adopted in this step.
  • the predetermined rule 1 adopted For example: when searching for a target location point, adopting a rule that the target hotel is approximately similar to the navigation time between the three known locations, and then according to the found target bit The point is searched to obtain a set of candidate points of interest. Further reusing the rules of the target hotel and the actual distance between the three known locations, respectively, from the candidate points of interest to select the final target hotel.
  • the target hotel is determined according to a preset rule and each known location, and the above-mentioned target hotel thus obtained satisfies the demand condition of the hotel for each known location. Thereby, it is achieved that the points of interest are determined according to a plurality of different positions. Thereby, it is achieved that the points of interest are determined according to a plurality of different locations.
  • the embodiment of the present invention further provides a search terminal of a point of interest.
  • the terminal includes: an obtaining unit 61 and a searching unit 62.
  • the obtaining unit 61 includes: a first searching module 61A, configured to search for candidate points of interest within a predetermined distance range of each known location, and form the candidate points of interest into a set of candidate points of interest.
  • the obtaining unit 61 may further include: a first searching module 61B, configured to search for candidate interests in the specified area, in the area excluding the designated area, on the designated road segment, or in the area excluding the designated road segment. Pointing, and forming the candidate points of interest into a set of candidate points of interest.
  • a first searching module 61B configured to search for candidate interests in the specified area, in the area excluding the designated area, on the designated road segment, or in the area excluding the designated road segment. Pointing, and forming the candidate points of interest into a set of candidate points of interest.
  • the obtaining unit 61 may further include: a searching module 61C and a first searching module 61D,
  • the searching module 61C is configured to find a target location point, where a location relationship between the target location point and at least two known locations meets a predetermined rule 2, and the predetermined rule 2 and the predetermined rule are Different predetermined rules;
  • the third search module 61D is configured to search for candidate interest points within a predetermined distance range of the target location point found by the searching module 61C, and group the searched candidate interest points into a candidate interest point set.
  • the candidate hotel within the predetermined distance range of each known location that is searched may be formed into a candidate hotel set by the first search module 61A, or may be within the designated area by the first search module 61B. Excluding the candidate hotel composition candidate hotel collections found in the area of the designated area, on the designated road section, or in the area excluding the designated road section, Alternatively, the target location point is first searched by the search module 61C, and the candidate interest points within the predetermined distance range of the target location point searched by the search module 61C are used by the first search module 61D to form a candidate interest point set.
  • the candidate hotel collection obtained by any one of the above three methods provides a reference for determining the target hotel, and the candidate hotel collection removes the hotel that does not meet the known location demand by screening, and includes the target hotel and other candidate hotels. You can narrow down to find the target hotel, and it is convenient to find the target hotel faster.
  • the searching unit 62 is configured to find a target hotel from the set of candidate hotels, and the positional relationship between the target hotel and the three known locations respectively satisfies a predetermined rule one.
  • the target hotel found by the search unit 22 satisfies the needs of each known location. It is thus also possible to determine points of interest based on a plurality of different locations.
  • the first embodiment describes the search method and terminal of the first point of interest, and the application scenario is the same as that of the embodiment 1.
  • the implementation process of the second point of interest search method is described in detail below. As shown in FIG. 7, the method includes the following steps:
  • a candidate location point that is searched in the designated area, the area where the designated area is excluded, the designated road section, or the area where the specified road section is excluded is formed into a candidate location point set.
  • the target location point is a reference location for searching for a target point of interest.
  • the preset rules include but are not limited to:
  • Rule A The difference between any two straight line distances between the target position points and at least two known positions is within a predetermined range.
  • the corresponding candidate position point is determined as the target position point when the difference of the above linear distance is within the predetermined range.
  • Rule B the actual distance between the target location points and at least two known locations The difference between any two actual distances is within a predetermined range.
  • the corresponding candidate position point is determined as the target position point when the difference of the actual distance is within the predetermined range. The smaller the predetermined range, the closer or equal the actual distance of each known position to the target position point.
  • Rule C The difference between any two navigation times in the navigation time between the target position point and the at least two known positions is within a predetermined range.
  • the corresponding candidate position point is determined as the target position point when the difference of the above time is within the predetermined range.
  • the travel mode may be walking, driving or taking public transportation.
  • a reference time can be calculated based on the actual route and the pace of the normal person.
  • the reference time provides the user with a time that is approximately required.
  • the user adopts public transportation, such as a subway the user can be provided with a reference time that is roughly required according to the schedule of the public transportation.
  • a reference time can be calculated based on the speed of the vehicle and the actual distance.
  • Rule D The sum of the linear distances between the target position points and at least two known positions is the smallest. A sum of straight line distances between each of the candidate position points and the three known positions in the set of candidate position points is calculated, and the corresponding candidate position points when the sum is minimized are determined as the target position points.
  • Rule E The sum of the actual distances between the target position points and at least two known positions is the smallest. A sum of actual distances between each candidate location point and three known locations in the set of candidate location points is calculated, and the corresponding candidate location points are determined as the target location points when the sum of the actual distances is minimized.
  • Rule F The sum of the navigation times between the target location points and the at least two known locations is the smallest. A total time required to reach each of the three known positions in the candidate location point set is calculated, and the corresponding candidate location point is determined as the target location point when the time sum is the smallest.
  • the preset rule applied in this embodiment is the same as the preset rule in Embodiment 1.
  • the embodiment of the present invention further provides a search terminal of a point of interest.
  • the terminal includes: a searching unit 81 and a searching unit 82.
  • the searching unit 81 includes: an obtaining module 81A and a searching module 81B.
  • the obtaining module 81A is configured to search for candidate location points in the designated area, the area in which the designated area is excluded, the designated road section, or the area in which the designated road section is excluded, and the candidate location points are formed into the candidate location point set.
  • the searching module 81B is configured to find a target location point from the set of candidate location points acquired by the obtaining module 81A, and the location relationship between the target location point and the at least two known locations respectively satisfies a predetermined rule. The positional relationship between the target position points and at least two known positions respectively satisfies a predetermined rule.
  • the searching unit 82 is configured to search for the target interest point within a predetermined distance range of the target position point.
  • the terminal achieves the purpose of determining a target point of interest based on at least two known locations.
  • the user can search for a target interest point according to a plurality of different locations. For example, when a user and a few friends agree to have a meal together, then the user needs to find a hotel that can be easily reached by other friends in about the same time, so that each person does not have to wait because the time of arrival at the hotel is different. Too long. Users can search for a target hotel on a GPS-enabled mobile phone. Before the user searches for the target hotel, other friends can tell the user their location in different ways. For example, other friends can obtain their current location information through the GPS mobile phone and then send it to the user, and also tell the respective travel modes. The user.
  • the location information can be input into the mobile phone using the POI search method provided by the embodiment of the present invention, or in the car GPS, and then the hotel can be found according to different rules, for example, the current location of the user can be searched for and Other hotels whose relative distances are relatively close to each other, or according to the way each person travels, search for the hotel that is about the same as the current location of the user and the location of other friends, and so on. Users can be provided with target points of interest that are closer to actual needs.
  • the embodiments of the present invention are mainly applied to the field of location services.
  • the target interest points in the embodiments of the present invention are exemplified by a hotel, and the target interest points may also be hotels, shopping malls, hospitals, etc., according to different needs of users.
  • the target points of interest are also different.
  • the embodiment of the invention can realize the determination of the location of the point of interest for a plurality of locations, and can also plan an appropriate route for a plurality of destinations. For example, when traveling, you can determine a suitable hotel according to the places to go, so that you can get close to the hotel.
  • the search methods of the two points of interest provided by the embodiments of the present invention can be applied not only to mobile phones, in-vehicle GPS devices, but also to any other device having mobile location services.
  • the present invention can be implemented by means of software plus necessary general hardware, and of course, by hardware, but in many cases, the former is a better implementation. .
  • the technical solution of the present invention which is essential or contributes to the prior art, may be embodied in the form of a software product stored in a readable storage medium, such as a floppy disk of a computer.
  • a hard disk or optical disk or the like includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the methods described in various embodiments of the present invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Remote Sensing (AREA)
  • Navigation (AREA)

Description

兴趣点的检索方法及终端
本申请要求于 2009 年 12 月 17 日提交中国专利局、 申请号为 200910252506.0、发明名称为 "兴趣点的检测方法及终端 "的中国专利申请的 优先权， 其全部内容通过引用结合在本申请中。 技术领域
本发明涉及位置服务领域， 尤其涉及一种兴趣点的检索方法及终端。 发明背景
移动位置服务是在电子地图平台支持下为用户提供的与其位置相关的 服务， 也可称为基于位置的服务或位置服务。 兴趣点服务提供与用户位置 相关的信息。 例如， 当驾驶者经过一片不熟悉区域并需要查找附近的加油 站时， 他所需要的信息就会显示在手机上， 并标记出可选择的最近位置。 有些服务还提供地址、 电话号码、 电子邮件地址、 地点描述 (即加油站、 自 行车零售店、 饭店等)以及到所选地点的路线规划导航。
现有技术中移动位置服务技术只根据一个位置搜索兴趣点的位置， 如： 根据一个位置查找周边 2公里内的酒店。 随着人与人之间交往的密切， 迫 切需要针对多个位置来确定兴趣点。 如： 几个人在不同位置选择一个地点， 使得大家距离所选的地点都比较近； 或者出差在外要去几个目的地， 选择 一个酒店使得从酒店到多个目的地的路程都不太长。 然而现有技术不能根 据多个位置进行搜索来确定兴趣点。 发明内容
本发明的实施例提供一种兴趣点的检索方法及终端， 可以根据多个不 同的位置实现搜索兴趣点。
为达到上述目的， 本发明的实施例采用如下技术方案：
一种兴趣点的检索方法， 包括： 获取候选兴趣点集合；
从所述候选兴趣点集合中查找出目标兴趣点， 所述目标兴趣点分别与 至少两个已知位置之间的位置关系满足预定规则一。
一种兴趣点的检索终端， 包括：
获取单元， 用于获取候选兴趣点集合；
查找单元， 用于从所述候选兴趣点集合中查找出目标兴趣点， 所述目 标兴趣点分别与至少两个已知位置之间的位置关系满足预定规则一。
上述兴趣点的检索方法也可以采用第二种实现方式， 步骤如下： 查找出目标位置点， 所述目标位置点分别与至少两个已知位置之间的 位置关系满足预定规则；
在所述目标位置点预定距离范围内搜索出目标兴趣点。
为了实现第二种兴趣点的检索方法， 本技术方案提供第二种兴趣点的 检索终端， 包括：
查找单元， 用于查找出目标位置点， 所述目标位置点分别与至少两个 已知位置之间的位置关系满足预定规则；
搜索单元， 用于在所述目标位置点预定距离范围内搜索出目标兴趣点。 本发明实施例提供的两种兴趣点的检索方法及终端， 第一种方法通过 获取候选兴趣点集合， 所述候选兴趣点集合包括用户需求的目标兴趣点。 然后依据预设规则从所述候选兴趣点集合中查找出目标兴趣点， 所述目标 兴趣点分别与至少两个已知位置之间的位置关系满足预定规则一， 也即是 所述目标兴趣点为由至少两个已知位置确定。 第二种方法通过查找出目标 位置点， 所述目标位置点分别与至少两个已知位置之间的位置关系满足预 定规则。 所述目标位置由至少两个已知位置确定， 并作为由至少两个已知 位置来确定目标兴趣点的参考位置。 然后在所述目标位置点预定距离范围 内搜索出目标兴趣点。 通过上述两种方法所得到的所述目标兴趣点都是根 据至少两个已知位置和相同的预设规则而确定的， 从而实现了根据多个位 置进行搜索来确定兴趣点。 附图简要说明
此处所说明的附图用来提供对本发明的进一步理解， 构成本申请的一 部分， 并不构成对本发明的限定。 在附图中：
图 1为本发明实施例第一种兴趣点的检索方法的流程图；
图 2为本发明实施例第一种兴趣点的检索终端的结构框图；
图 3为本发明实施例第二种兴趣点的检索方法的流程图；
图 4为本发明实施例第二种兴趣点的检索终端的结构框图；
图 5为本发明实施例 1兴趣点的检索方法的流程图；
图 6为本发明实施例 1兴趣点的检索终端的结构框图；
图 7为本发明实施例 2兴趣点的检索方法的流程图；
图 8为本发明实施例 2兴趣点的检索终端的结构框图。 实施本发明的方式
为使本发明的目的、 技术方案和优点更加清楚明白， 下面结合实施方 式和附图， 对本发明做进一步详细说明。 在此， 本发明的示意性实施方式 及其说明用于解释本发明， 但并不作为对本发明的限定。
现有技术中在进行兴趣点搜索时， 只能根据一个位置搜索周边的兴趣 点。 本发明实施例中提供一种兴趣点的搜索方法及终端， 可以根据多个不 同的已知位置搜索目标兴趣点， 所述目标兴趣点满足各个不同的已知位置 的需求。
本发明实施例提供一种兴趣点的搜索方法， 如图 1 所示， 该方法包括 以下步骤：
101、 获取候选兴趣点集合。 所述候选兴趣点集合中包括了满足不同位 置需求的多个候选兴趣点。 102、 从所述候选兴趣点集合中查找出目标兴趣点， 所述目标兴趣点分 别与至少两个已知位置之间的位置关系满足预定规则一。
为了实现上述方法， 本发明实施例还提供一种兴趣点的检索终端， 如 图 2所示， 该终端包括： 获取单元 21和查找单元 22。
其中， 获取单元 21用于获取候选兴趣点集合。 为确定目标兴趣点提供 参考的候选兴趣点集合， 该候选兴趣点集合通过筛选去除了不符合已知位 置需求的兴趣点并包括了目标兴趣点， 可以缩小查找目标兴趣点的范围， 方便更快的查找到目标兴趣点。
然后， 查找单元 22用于从所述候选兴趣点集合中查找出目标兴趣点， 所述目标兴趣点分别与至少两个已知位置之间的位置关系满足预定规则 一。 通过查找单元 22查找出的目标兴趣点满足了每个已知位置的需求。 从 而也实现了根据多个不同位置确定兴趣点。
在本发明实施例提供的上述兴趣点的搜索方法， 该方法也可以采用第 二种实现方式， 如图 3所示， 包括以下步骤：
301、 首先， 才艮据至少两个已知位置查找出目标位置点， 所述目标位置 点分别与至少两个已知位置之间的位置关系满足预定规则。 所述目标位置 点是进行搜索目标兴趣点的参考位置。 所述预定规则和步骤 102 中描述的 预定规则是相同的。
302、 在所述目标位置点预定距离范围内搜索出目标兴趣点。 由于目标 位置点满足每个已知位置的要求， 如： 与目标兴趣点之间的距离要求或到 达目标兴趣点的时间要求等， 因而在该目标位置点预定距离范围内搜索得 出的目标兴趣点也满足每个已知位置的要求。
为了实现第二种兴趣点的搜索方法， 本发明实施例也提供了第二种兴 趣点的搜索终端， 如图 4所示， 该终端包括： 查找单 41元和搜索单元 42。
其中， 查找单元 41用于查找出目标位置点， 所述目标位置点分别与至 少两个已知位置之间的位置关系满足预定规则。 然后， 搜索单元 42用于在 所述目标位置点预定距离范围内搜索出目标兴趣点。 该终端实现了根据至 少两个已知位置来确定目标兴趣点的目的。
上述两种方法在实现本发明目的时都通过相同的预设规则来最终确定 目标兴趣点。 其中， 第一种方法在具体实现时， 先确定一个候选兴趣点集 合， 然后根据上述预设规则从所述候选兴趣点集合中查找出目标兴趣点， 所述目标兴趣点分别与至少两个已知位置之间的位置关系满足预定规则 一。 而第二种方法在实行时， 首先根据上述预设规则确定一个可供参考的 目标位置点， 然后在所述目标位置点周边搜索目标兴趣点。 上述两种方法 中所确定的目标兴趣点都是根据至少两个已知位置和相同的预设规则来确 定的， 从而也解决了现有技术中无法根据多个位置确定兴趣点的问题。
下面将结合本发明实施例中的附图， 对本发明实施例中的技术方案进 行清楚、 完整地描述， 显然， 所描述的实施例仅仅是本发明一部分实施例， 而不是全部的实施例。 基于本发明中的实施例， 本领域普通技术人员在没 有作出创造性劳动前提下所获得的所有其他实施例， 都属于本发明保护的 范围。
实施例 1 :
本发明实施例假设应用场景为存在三个不同的已知位置， 需要确定一 个酒店使得不同的朋友从上述三个不同的已知位置到酒店的距离或时间大 概相同。 此时目标兴趣点为酒店。 如图 5所示， 下面详细介绍第一种兴趣 点的搜索方法的实现过程， 该方法包括以下步骤：
501、 获取候选兴趣点集合。 所述候选兴趣点集合中包括了满足三个已 知位置需求的多个候选酒店。 本步骤可以通过以下方式实现：
第一种方式： 将搜索到的每个已知位置预定距离范围内的候选兴趣点 组成候选兴趣点集合。 一个已知位置周边有其对应的酒店， 将搜索到的每 个已知位置周边对应的候选酒店组成候选酒店集合， 从而 选掉其他不满 足已知位置的要求的酒店。 第二种方式： 将指定区域内、 排除了指定区域的区域内、 指定路段上 或排除了指定路段的区域内搜索到的候选兴趣点组成候选兴趣点集合。 当 用户希望目标酒店在指定区域内、 排除了指定区域的区域内、 指定路段上 或排除了指定路段（排除经常堵车的路段） 的区域内时， 首先通过在将指 定区域内、 排除了指定区域的区域内、 指定路段上或排除了指定路段的区 域内进行搜索候选酒店， 可以将不满足用户需求的酒店删除， 如指定区域 外的， 从而缩小了目标酒店的查找范围。
第三种方式： 首先根据三个已知位置按照预定规则一查找出目标位置 点， 所述目标位置点分别与三个已知位置之间的位置关系满足预定规则二， 所述预定规则二与所述预定规则一为不同的预定规则。
然后将搜索到的在所述目标位置点预定距离范围内的候选兴趣点组成 候选兴趣点集合。
502、 从所述候选兴趣点集合中查找出目标兴趣点， 所述目标兴趣点分 别与三个已知位置之间的位置关系满足预定规则一。 所述预定规则一和预 定规则二分别为下述规则中的任意一种， 并且所述预定规则一和预定规则 二为不同的规则：
规则 A: 所述目标酒店分别与至少两个已知位置之间的直线距离中任 意两个直线距离的差值在预定范围内。
计算候选酒店集合中每个候选酒店和三个已知位置之间的直线距离， 将上述直线距离的差值在预定范围内时对应的候选酒店确定为目标酒店。 所述预定范围越小， 所述每个已知位置到上述目标酒店的直线距离就会越 相近或者相等。
规则 B: 所述目标酒店分别与至少两个已知位置之间的实际距离中任 意两个实际距离的差值在预定范围内。
计算候选酒店集合中每个候选酒店和三个已知位置之间的实际距离， 将上述实际距离的差值在预定范围内时对应的候选酒店确定为目标酒店。 所述预定范围越小， 所述每个已知位置到上述目标酒店的实际距萬就会越 相近或者相等。
规则 C: 所述目标酒店分别与至少两个已知位置之间的导航时间中任 意两个导航时间的差值在预定范围内。
计算候选酒店集合中每个候选酒店到三个已知位置所需的时间， 将上 述时间的差值在预定范围内时对应的候选酒店确定为目标酒店。 所述预定 范围越小， 所述每个已知位置采用不同出行方式到上述目标酒店的所需时 间就越相近或者相等。 所述出行方式可以为步行， 开车或乘坐公共交通工 具等。 当用户采用步行去上述酒店时， 可以根据实际路程和正常人的步速 计算得出一个参考时间。 所述参考时间为用户提供一个大概所需用的时间。 当用户采用公共交通工具时， 如地铁， 可以根据公共交通工具的时间表为 用户提供一个大概所需用的参考时间。 当用户开车去酒店时， 可以根据车 速和实际路程计算得出一个参考时间。
规则 D: 所述目标酒店分别与至少两个已知位置之间的直线距离的总 和最小。 计算候选酒店集合中每个候选酒店和三个已知位置之间的直线距 离总和， 将上述总和为最小时对应的候选酒店确定为目标酒店。
规则 E:所述目标酒店分别与至少两个已知位置之间的实际距离的总和 最小。 计算候选酒店集合中每个候选酒店和三个已知位置之间的实际距离 总和， 将上述实际距离总和为最小时对应的候选酒店确定为目标酒店。
规则 F:所述目标酒店分别与至少两个已知位置之间的导航时间的总和 最小。 计算候选酒店集合中每个候选酒店到达三个已知位置的所需时间总 和， 将上述时间总和为最小时对应的候选酒店确定为目标酒店。
当所述候选兴趣点集合采用步骤 501 中的第三种方式实现时， 所述查 找出目标位置点是采用的预定规则一， 与本步骤中采用的预定规则二为不 相同的规则。 比如： 在查找目标位置点时， 采用所述目标酒店分别与三个 已知位置之间的导航时间大概相近的规则， 然后根据所述查找到的目标位 置点进行搜索得到候选兴趣点集合。 进一步地再利用所述目标酒店分别与 三个已知位置之间的实际距萬大概相近的规则从上述候选兴趣点集合中进 行筛选得出最终的目标酒店。
所述目标酒店是根据预设规则和每个已知位置而定， 由此得出的上述 目标酒店同时满足每个已知位置对酒店的需求条件。 从而实现了根据多个 不同的位置确定兴趣点。 从而实现了根据多个不同的位置确定兴趣点。
本发明实施例还提供一种兴趣点的搜索终端， 如图 6所示， 该终端包 括： 获取单元 61和查找单元 62。
其中， 所述获取单元 61包括： 第一搜索模块 61A， 用于搜索在的每个 已知位置的预定距离范围内的候选兴趣点， 并将所述候选兴趣点组成候选 兴趣点集合。
或者， 可选的， 所述获取单元 61也可以包括： 第一搜索模块 61B， 用 于搜索指定区域内、 排除了指定区域的区域内、 指定路段上或排除了指定 路段的区域内的候选兴趣点， 并将所述候选兴趣点组成候选兴趣点集合。
或者， 可选的， 所述获取单元 61也可以包括： 查找模块 61C和第一搜 索模块 61D，
其中所述查找模块 61C， 用于查找出目标位置点， 所述目标位置点分 别与至少两个已知位置之间的位置关系满足预定规则二， 所述预定规则二 与所述预定规则一为不同的预定规则；
第三搜索模块 61D， 用于搜索在所述查找模块 61C查找到的所述目标 位置点的预定距离范围内的候选兴趣点， 并将搜索到的所述候选兴趣点组 成候选兴趣点集合。
所述获取单元 61获取候选酒店集合时，可以通过第一搜索模块 61A将 搜索到的每个已知位置预定距离范围内的候选酒店组成候选酒店集合， 或 者通过第一搜索模块 61B将指定区域内、 排除了指定区域的区域内、 指定 路段上或排除了指定路段的区域内搜索到的候选酒店组成候选酒店集合， 或者先通过查找模块 61C查找到目标位置点， 再利用第一搜索模块 61D将 查找模块 61C查找到的在所述目标位置点预定距离范围内的候选兴趣点组 成候选兴趣点集合。 通过上述三种方式中的任一种方式获取到的候选酒店 集合为确定目标酒店提供参考， 该候选酒店集合通过筛选去除了不符合已 知位置需求的酒店并包括了目标酒店及其他候选酒店， 可以缩小查找目标 酒店的范围， 方便更快的查找到目标酒店。
然后， 查找单元 62用于从所述候选酒店集合中查找出目标酒店， 所述 目标酒店分别与三个已知位置之间的位置关系满足预定规则一。 通过查找 单元 22查找出的目标酒店满足了每个已知位置的需求。 从而也实现了根据 多个不同位置确定兴趣点。
实施例 2:
实施例 1描述了第一种兴趣点的搜索方法和终端，应用场景与实施例 1 相同。 下面详细介绍第二种兴趣点的搜索方法的实现过程， 如图 7所示， 该方法包括以下步骤：
701、 首先， 将指定区域内、 排除了指定区域的区域内、 指定路段上或 排除了指定路段的区域内搜索到的候选位置点组成候选位置点集合。
702、 从所述候选位置点集合中查找出目标位置点， 所述目标位置点分 别与三个已知位置之间的位置关系满足预定规则。 所述目标位置点是进行 搜索目标兴趣点的参考位置。 所述预设规则包括但不仅限于：
规则 A: 所述目标位置点分别与至少两个已知位置之间的直线距离中 任意两个直线距离的差值在预定范围内。
通过计算候选位置点集合中每个候选位置点和三个已知位置之间的直 线距离， 将上述直线距离的差值在预定范围内时对应的候选位置点确定为 目标位置点。 所述预定范围越小， 所述每个已知位置到上述目标位置点的 直线距萬就越相近或者相等。
规则 B: 所述目标位置点分别与至少两个已知位置之间的实际距离中 任意两个实际距离的差值在预定范围内。
通过计算候选位置点集合中每个候选位置点和三个已知位置之间的实 际距离， 将上述实际距离的差值在预定范围内时对应的候选位置点确定为 目标位置点。 所述预定范围越小， 所述每个已知位置到上述目标位置点的 实际距离就越相近或者相等。
规则 C: 所述目标位置点分别与至少两个已知位置之间的导航时间中 任意两个导航时间的差值在预定范围内。
通过计算候选位置点集合中每个候选位置点到三个已知位置所需的时 间， 将上述时间的差值在预定范围内时对应的候选位置点确定为目标位置 点。 所述预定范围越小， 所述每个已知位置采用不同出行方式到上述目标 位置点的所需时间就会越相近或者相等。 所述出行方式可以为步行， 开车 或乘坐公共交通工具等。 当用户采用步行去上述酒店时， 可以根据实际路 程和正常人的步速计算得出一个参考时间。 所述参考时间为用户提供一个 大概所需用的时间。 当用户采用公共交通工具时， 如地铁， 可以根据公共 交通工具的时间表为用户提供一个大概所需用的参考时间。 当用户开车去 酒店时， 可以根据车速和实际路程计算得出一个参考时间。
规则 D: 所述目标位置点分别与至少两个已知位置之间的直线距离的 总和最小。 计算候选位置点集合中每个候选位置点和三个已知位置之间的 直线距离总和， 将上述总和为最小时对应的候选位置点确定为目标位置点。
规则 E:所述目标位置点分别与至少两个已知位置之间的实际距离的总 和最小。 计算候选位置点集合中每个候选位置点和三个已知位置之间的实 际距离总和， 将上述实际距离总和为最小时对应的候选位置点确定为目标 位置点。
规则 F:所述目标位置点分别与至少两个已知位置之间的导航时间的总 和最小。 计算候选位置点集合中每个候选位置点到达三个已知位置的所需 时间总和， 将上述时间总和为最小时对应的候选位置点确定为目标位置点。 本实施例中应用的预设规则和实施例 1中的预设规则是相同的。
703、 在所述目标位置点预定距离范围内搜索出目标酒店。 由于目标位 置点满足每个已知位置的要求， 如： 与目标酒店之间的距离要求或到达目 标酒店的时间要求等， 因而在该目标位置点预定距离范围内搜索得出的目 标酒店也满足每个已知位置的要求。 由于所述目标兴趣点根据多个位置而 确定， 从而也解决了现有技术中不能根据多个位置确定兴趣点的问题。
为了实现上述方法本发明实施例还提供一种兴趣点的搜索终端，如图 8 所示， 该终端包括： 查找单元 81和搜索单元 82。 其中， 查找单元 81包括： 获取模块 81A和查找模块 81B。
其中获取模块 81A用于在指定区域内、 排除了指定区域的区域内、 指 定路段上或排除了指定路段的区域内搜索候选位置点， 将所述候选位置点 组成候选位置点集合。 查找模块 81B用于从获取模块 81A获取到的候选位 置点集合中查找出目标位置点， 所述目标位置点分别与至少两个已知位置 之间的位置关系满足预定规则。 所述目标位置点分别与至少两个已知位置 之间的位置关系满足预定规则。 然后， 搜索单元 82用于在所述目标位置点 预定距离范围内搜索出目标兴趣点。 该终端实现了根据至少两个已知位置 来确定目标兴趣点的目的。
实施例 3:
本发明实施例在应用过程中， 用户可以根据多个不同的位置来搜索目 标兴趣点。 例如， 当用户和几个朋友约定一起聚餐， 这时用户就需要找到 一家酒店可以方便自己和其他朋友在大致相同的时间内都能达到， 这样每 个人就不用因为大家到达酒店的时间不同而等待太久。 用户可以在具有 GPS 功能的手机上面来搜索目标酒店。 用户在搜索目标酒店之前， 其他朋 友可以通过不同的方式告诉用户各自所在的位置， 比如说其他朋友可以通 过 GPS手机获取自己当前的位置信息然后发送给该用户， 同时也将要各自 采用的出行方式告诉该用户。 当该用户接收到其他朋友的位置信息之后， 可以将这些位置信息输入采用本发明实施例提供的兴趣点搜索方法的手机 里面， 或者车载 GPS里面， 然后根据不同的规则就可以找到符合用户需要 的酒店， 比如可以搜索出到达用户的当前位置和其他朋友各自的所在位置 的实际距离都比较近的酒店， 或者根据每个人出行方式的不同搜索出到达 用户的当前位置和其他朋友各自的所在位置所需要的时间大概相同的酒店 等等， 因而也可以为用户提供更加贴近实际需要的目标兴趣点。
本发明实施例主要应用于位置服务领域， 本发明实施例中的目标兴趣 点以酒店为例的， 所述目标兴趣点还可以是宾馆、 商场、 医院等等， 根据 用户的兴趣点需求的不同所述目标兴趣点也不同。 本发明实施例可以实现 针对多个位置确定兴趣点位置外， 还可以实现针对多个目的地规划合适的 路线。 例如， 出差时可以根据要去的几个地方确定一个合适的宾馆， 使从 宾馆去那几个地方都很近。 本发明实施例提供的两种兴趣点的搜索方法不 仅可以运用于手机、 车载 GPS设备， 也可以运用于其他任何形式的具有移 动位置服务的设备中。
通过以上的实施方式的描述， 所属领域的技术人员可以清楚地了解到 本发明可借助软件加必需的通用硬件的方式来实现， 当然也可以通过硬件， 但很多情况下前者是更佳的实施方式。 基于这样的理解， 本发明的技术方 案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出 来， 该计算机软件产品存储在可读取的存储介质中， 如计算机的软盘， 硬 盘或光盘等， 包括若干指令用以使得一台计算机设备（可以是个人计算机， 服务器， 或者网络设备等）执行本发明各个实施例所述的方法。
以上所述的具体实施方式， 对本发明的目的、 技术方案和有益效果进 行了进一步详细说明， 所应理解的是， 以上所述仅为本发明的具体实施方 式而已， 并不用于限定本发明的保护范围， 凡在本发明的精神和原则之内， 所做的任何修改、 等同替换、 改进等， 均应包含在本发明的保护范围之内。

Claims

权利要求
1、 一种兴趣点的检索方法， 其特征在于， 该方法包括：
获取候选兴趣点集合；
从所述候选兴趣点集合中查找出目标兴趣点， 所述目标兴趣点分别与 至少两个已知位置之间的位置关系满足预定规则一。
2、 根据权利要求 1所述的兴趣点的检索方法， 其特征在于， 所述获取 候选兴趣点集合为：
搜索在每个已知位置的预定距离范围内的候选兴趣点， 将所述候选兴 趣点组成候选兴趣点集合；
或者为： 在指定区域内、 排除了指定区域的区域内、 指定路段上或排 除了指定路段的区域内搜索候选兴趣点， 并将所述候选兴趣点组成候选兴 趣点集合；
或者为： 查找出目标位置点， 所述目标位置点分别与至少两个已知位 置之间的位置关系满足预定规则二， 所述预定规则二与所述预定规则一为 不同的预定规则； 在所述目标位置点的预定距离范围内搜索候选兴趣点， 将所述候选兴趣点组成候选兴趣点集合。
3、 根据权利要求 2所述的兴趣点的检索方法， 其特征在于， 所述预定 规则一或预定规则二为： 所述目标兴趣点分别与至少两个已知位置之间的 直线距离中任意两个直线距离的差值在预定范围内；
或者为： 所述目标兴趣点分别与至少两个已知位置之间的实际距离中 任意两个实际距离的差值在预定范围内；
或者为： 所述目标兴趣点分别与至少两个已知位置之间的导航时间中 任意两个导航时间的差值在预定范围内；
或者为： 所述目标兴趣点分别与至少两个已知位置之间的直线距离的 总和最小；
或者为： 所述目标兴趣点分别与至少两个已知位置之间的实际距离的 总和最小； 或者为： 所述目标兴趣点分别与至少两个已知位置之间的导航时间的 总和最小。
4、 一种兴趣点的检索终端， 其特征在于， 该终端包括：
获取单元， 用于获取候选兴趣点集合；
查找单元， 用于从所述候选兴趣点集合中查找出目标兴趣点， 所述目 标兴趣点分别与至少两个已知位置之间的位置关系满足预定规则一。
5、 根据权利要求 4所述的兴趣点的检索终端， 其特征在于， 所述获取 单元包括： 第一搜索模块， 用于搜索在的每个已知位置的预定距离范围内 的候选兴趣点， 并将所述候选兴趣点组成候选兴趣点集合。
6、 根据权利要求 4所述的兴趣点的检索终端， 其特征在于， 所述获取 单元包括：
第二搜索模块， 用于搜索指定区域内、 排除了指定区域的区域内、 指 定路段上或排除了指定路段的区域内的候选兴趣点， 并将所述候选兴趣点 组成候选兴趣点集合。
7、 根据权利要求 4所述的兴趣点的检索终端， 其特征在于， 所述获取 单元包括：
查找模块， 用于查找出目标位置点， 所述目标位置点分别与至少两个 已知位置之间的位置关系满足预定规则二， 所述预定规则二与所述预定规 则一为不同的预定规则；
第三搜索模块， 用于搜索在所述查找模块查找到的所述目标位置点的 预定距离范围内的候选兴趣点， 并将搜索到的所述候选兴趣点组成候选兴 趣点集合。
8、 一种兴趣点的检索方法， 其特征在于， 该方法包括：
查找出目标位置点， 所述目标位置点分别与至少两个已知位置之间的 位置关系满足预定规则；
在所述目标位置点预定距离范围内搜索出目标兴趣点。
9、 根据权利要求 8所述的兴趣点的检索方法， 其特征在于， 所述查找 出目标位置点包括：
在指定区域内、 排除了指定区域的区域内、 指定路段上或排除了指定 路段的区域内搜索候选位置点， 将所述候选位置点组成候选位置点集合； 从所述候选位置点集合中查找出目标位置点， 所述目标位置点分别与 至少两个已知位置之间的位置关系满足预定规则。
10、 根据权利要求 8或 9所述的兴趣点的检索方法， 其特征在于， 所 述预定规则为： 所述目标位置点分别与至少两个已知位置之间的直线距离 中任意两个直线距离的差值在预定范围内；
或者为： 所述目标位置点分别与至少两个已知位置之间的实际距离中 任意两个实际距离的差值在预定范围内；
或者为： 所述目标位置点分别与至少两个已知位置之间的导航时间中 任意两个导航时间的差值在预定范围内；
或者为： 所述目标位置点分别与至少两个已知位置之间的直线距离的 总和最小；
或者为： 所述目标位置点分别与至少两个已知位置之间的实际距离的 总和最小； 或者为： 所述目标位置点分别与至少两个已知位置之间的导航时间的 总和最小。
11、 一种兴趣点的检索终端， 其特征在于， 该终端包括：
查找单元， 用于查找出目标位置点， 所述目标位置点分别与至少两个 已知位置之间的位置关系满足预定规则；
搜索单元， 用于在所述目标位置点预定距离范围内搜索出目标兴趣点。
12、 根据权利要求 11所述的兴趣点的检索终端， 其特征在于， 所述查 找单元包括：
获取模块， 用于在指定区域内、 排除了指定区域的区域内、 指定路段 上或排除了指定路段的区域内搜索候选位置点， 将所述候选位置点组成候 选位置点集合； 查找模块， 用于从所述候选位置点集合中查找出目标位置点， 所述目 标位置点分别与至少两个已知位置之间的位置关系满足预定规则。
PCT/CN2010/079810 2009-12-17 2010-12-15 兴趣点的检索方法及终端 WO2011072605A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200910252506.0 2009-12-17
CN200910252506A CN101784005A (zh) 2009-12-17 2009-12-17 兴趣点的检索方法及终端

Publications (1)

Publication Number Publication Date
WO2011072605A1 true WO2011072605A1 (zh) 2011-06-23

Family

ID=42523779

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/079810 WO2011072605A1 (zh) 2009-12-17 2010-12-15 兴趣点的检索方法及终端

Country Status (3)

Country Link
US (1) US20110153203A1 (zh)
CN (1) CN101784005A (zh)
WO (1) WO2011072605A1 (zh)

Families Citing this family (30)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101784005A (zh) * 2009-12-17 2010-07-21 华为终端有限公司 兴趣点的检索方法及终端
CN102142003B (zh) * 2010-07-30 2013-04-24 华为软件技术有限公司 兴趣点信息提供方法及装置
US20120295639A1 (en) * 2011-05-18 2012-11-22 Microsoft Corporation Discovering nearby places based on automatic query
CA2842953A1 (en) * 2011-07-25 2013-01-31 Google, Inc. Hotel results interface
CN102929869A (zh) * 2011-08-02 2013-02-13 北京百度网讯科技有限公司 基于地理位置的检索方法、装置及系统
CN103037303A (zh) * 2011-09-30 2013-04-10 北京千橡网景科技发展有限公司 用于校正兴趣点poi位置的方法和设备
CN103167395B (zh) * 2011-12-08 2015-08-12 腾讯科技（深圳）有限公司 基于移动终端导航功能的照片定位方法和系统
CN103294708A (zh) * 2012-02-28 2013-09-11 北京四维图新科技股份有限公司 基于公交系统的路径规划方法及装置
US9933273B2 (en) * 2012-07-26 2018-04-03 Ford Global Technologies, Llc Method and apparatus for point of interest evaluation
CN103631813B (zh) * 2012-08-24 2017-03-01 富士通株式会社 场所搜索装置、场所搜索方法以及电子设备
CN103595866B (zh) * 2013-11-08 2015-09-23 深圳市国电科技通信有限公司 一种电动汽车充换电信息提供方法及系统
CN104021466B (zh) * 2014-06-19 2017-07-28 百度在线网络技术（北京）有限公司 多用户日程安排方法和装置
CN104239453B (zh) * 2014-09-02 2018-10-16 百度在线网络技术（北京）有限公司 数据处理方法及装置
CN105468631A (zh) * 2014-09-04 2016-04-06 阿里巴巴集团控股有限公司 兴趣点查询方法及装置
CN106294347A (zh) * 2015-05-13 2017-01-04 高德软件有限公司 一种住宿地点搜索方法及装置
CN106708837B (zh) * 2015-08-18 2020-05-08 高德软件有限公司 兴趣点搜索方法、装置
CN106649332B (zh) * 2015-10-29 2021-02-19 创新先进技术有限公司 一种在地图上搜索兴趣点的方法及装置
CN106682015B (zh) * 2015-11-09 2019-11-26 百度在线网络技术（北京）有限公司 一种兴趣点的推荐方法及装置
CN105528654A (zh) * 2015-12-11 2016-04-27 魅族科技（中国）有限公司 目标集散点选择方法、终端和服务器
CN107228678B (zh) * 2016-03-23 2020-05-08 高德信息技术有限公司 确定到预设poi的出行成本的方法及装置
CN107562747B (zh) * 2016-06-30 2021-04-09 上海博泰悦臻网络技术服务有限公司 信息显示方法及系统、电子设备、及数据库
WO2018018248A1 (zh) * 2016-07-24 2018-02-01 金蕾 目的地匹配酒店预定时的信息推送方法及订房系统
WO2018018247A1 (zh) * 2016-07-24 2018-02-01 金蕾 根据目的地预定酒店的方法及订房系统
CN106503072B (zh) * 2016-09-30 2019-09-20 百度在线网络技术（北京）有限公司 Poi的查询方法及装置
CN106649846B (zh) * 2016-12-30 2019-12-20 北京工业大学 基于多样性的地理空间兴趣点检索方法
CN109325185B (zh) * 2018-07-16 2020-01-03 北京三快在线科技有限公司 一种确定上车点的方法、装置、设备及存储介质
CN110502705A (zh) * 2019-07-16 2019-11-26 贝壳技术有限公司 一种基于智能终端的电子地图搜索的方法及装置
CN110986996B (zh) * 2019-11-29 2021-09-10 秒针信息技术有限公司 数据处理方法、装置、电子设备和存储介质
CN112308599A (zh) * 2020-08-31 2021-02-02 北京沃东天骏信息技术有限公司 兑换码发放方法、系统和装置
CN113779163A (zh) * 2020-11-05 2021-12-10 北京沃东天骏信息技术有限公司 地理位置信息的处理方法、装置、设备及存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020184063A1 (en) * 2001-06-01 2002-12-05 International Business Machines Dynamic resource scheduling to optimize location of meeting participants
CN1675953A (zh) * 2002-06-14 2005-09-28 美国电话及电报无线服务公司 无线网络的位置确定系统及相关方法
CN1675646A (zh) * 2002-08-20 2005-09-28 欧特克公司 利用空间－语义建模确定聚会地点
CN101784005A (zh) * 2009-12-17 2010-07-21 华为终端有限公司 兴趣点的检索方法及终端

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6479190B1 (en) * 2000-09-21 2002-11-12 Celgard Inc. Separator for battery having zinc electrode
US7203502B2 (en) * 2002-06-14 2007-04-10 Cingular Wireless Ii, Llc System for providing location-based services in a wireless network, such as locating individuals and coordinating meetings
WO2005064275A1 (ja) * 2003-12-26 2005-07-14 Matsushita Electric Industrial Co., Ltd. ナビゲーション装置

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20020184063A1 (en) * 2001-06-01 2002-12-05 International Business Machines Dynamic resource scheduling to optimize location of meeting participants
CN1675953A (zh) * 2002-06-14 2005-09-28 美国电话及电报无线服务公司 无线网络的位置确定系统及相关方法
CN1675646A (zh) * 2002-08-20 2005-09-28 欧特克公司 利用空间－语义建模确定聚会地点
CN101784005A (zh) * 2009-12-17 2010-07-21 华为终端有限公司 兴趣点的检索方法及终端

Also Published As

Publication number Publication date
CN101784005A (zh) 2010-07-21
US20110153203A1 (en) 2011-06-23

Similar Documents

Publication Publication Date Title
WO2011072605A1 (zh) 兴趣点的检索方法及终端
US9904286B2 (en) Method and apparatus for providing adaptive transitioning between operational modes of an autonomous vehicle
US9891058B2 (en) Method and apparatus for providing navigation guidance via proximate devices
US9488485B2 (en) Method and apparatus for route selection based on recorded and calculated routes
US8428869B2 (en) Context enabled address selection
US9008888B1 (en) Cost based navigation
US8924147B2 (en) Method for constructing geo-fences for a spatial recommendation and discovery system
EP3048422B1 (en) Method and apparatus for providing relevant point of interest on a multi-modal route
EP3965086A1 (en) Method and apparatus for providing parking availability detection based on vehicle trajectory information
EP2541484A1 (en) Geo-spatial recommendation and discovery system
US10760925B2 (en) Method and apparatus for generating a parking search route
KR100627808B1 (ko) 이동통신망에서 도보 구간 또는/및 대중 교통 수단 운행구간의 연계를 통한 지리 정보 제공 방법
US20200132482A1 (en) Method and apparatus for generating a parking search route within a geofence
EP3144635B1 (en) Method and apparatus for autonomous navigation speed at intersections
WO2014202434A1 (en) Method and apparatus for route determination based on one or more non-travel lanes
JP2013117378A (ja) ナビゲーションシステム
US20130226915A1 (en) Organization of search results based upon availability of respective providers comprised therein
US20100198505A1 (en) Method for Representing Linear Features in a Location Content Management System
JP2007520687A (ja) 地図検索サービス提供方法およびシステム
US11187545B2 (en) Method and apparatus for generating a pooled route to extend a service area of a shared vehicle
US9596204B2 (en) Determination of a navigational text candidate
US20220012656A1 (en) Method and apparatus for using pedestrian probe data for ridesharing services
KR20120092361A (ko) 개선된 경로 찾기 서비스 제공 방법 및 시스템
Herzog et al. Collaborative and Social Mobility Services
TW201226854A (en) Mapping or navigation apparatus and method of operation thereof

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: 10837042

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 10837042

Country of ref document: EP

Kind code of ref document: A1