Method, apparatus and server for searching for points of interest along a route in a navigation map

Abstract

A method, device, and server for searching for points of interest (POIs) along a route in a navigation map provided by the present disclosure relate to navigation map search technology and include: obtaining the current planned route of the vehicle according to a search instruction sent by a map application, where the planned route includes multiple original roads; determining detour roads accessible from the original roads according to the topological relationship between roads in the navigation map, and selecting a detour road with a detour distance less than a preset threshold from the detour roads as the target detour road; obtaining a target POI that is the same as the POI to be searched in the search instruction from the target detour road and the POIs connected to the original roads, and feeding back the target POI to the map application. This solution finds all roads within the set detour distance threshold according to the topological relationship between roads, and then searches for POI results through the association relationship between POIs and roads. It ensures that the POI results are within the detour distance threshold and accessible, improving the search effect.

Description

Technical Field

[0001] The present disclosure relates to navigation map search technology, and more particularly to a method, device and server for searching points of interest along a route in a navigation map. Background Art

[0002] Using the navigation map to search for points of interest (POI) along the road, such as gas stations, service areas, public toilets, 4S stores, etc., provides users with better and more considerate search services, which has a positive effect on improving service experience. The general usage scenario is that after the user has planned the driving route, he needs to find some POIs along the way, such as when the car is running out of gas or needs car maintenance, and hopes to go to the corresponding POI with the lowest detour cost.

[0003] In the prior art, a POI search along a route is performed within a formed spatial range by means of spatial buffering, for example, a search is performed using a circumscribed rectangular range of a road shape as a search range.

[0004] However, the above-mentioned POI search method along the route based on spatial buffering does not take into account the accessibility of the vehicle's current position to the POI because it searches in the spatial range around the road. The searched POI may be very close in space and actually requires a long detour, or the actual vehicle is unreachable from the searched POI. Based on this, the POIs searched by the existing search method still have a long detour distance or are unreachable, resulting in a technical problem of relatively poor search results. Summary of the invention

[0005] The present disclosure provides a method, device and server for searching points of interest along a route in a navigation map, so as to improve the POI search effect in the prior art.

[0006] According to a first aspect of the present disclosure, a method for searching for points of interest along a route in a navigation map is provided, comprising:

[0007] Acquire a current planned route of the vehicle according to the acquired search instruction sent by the map application, wherein the planned route includes a plurality of original roads;

[0008] For each original road, determining detour roads accessible from the original road according to the topological relationship between the roads in the navigation map, and selecting a detour road with a detour distance less than a preset threshold from the detour roads as a target detour road;

[0009] From the target detour road and the points of interest attached to the original road, a target point of interest that is consistent with the point of interest to be searched in the search instruction is obtained, and the target point of interest is fed back to the map application.

[0010] According to a second aspect of the present disclosure, there is provided an apparatus for searching for points of interest along a route in a navigation map, including:

[0011] An acquisition unit, configured to acquire a current planned route of a vehicle according to a search instruction sent by an acquired map application, where the planned route includes a plurality of original roads;

[0012] A search unit, configured to, for each original road, determine a detour road accessible by the original road according to a topological relationship between roads in the navigation map, and select a detour road with a detour distance less than a preset threshold from the detour roads as a target detour road;

[0013] A determination unit, configured to acquire a target point of interest that is the same as the point of interest to be searched in the search instruction from the target detour road and the points of interest connected to the original road, and feed back the target point of interest to the map application.

[0014] According to a third aspect of the present disclosure, there is provided a server, including a memory and a processor; wherein,

[0015] The memory is configured to store a computer program;

[0016] The processor is configured to read the computer program stored in the memory and execute the method for searching for points of interest along a route in the navigation map as described in the first aspect according to the computer program in the memory.

[0017] According to a fourth aspect of the present disclosure, there is provided a computer-readable storage medium, in which computer-executable instructions are stored, and when the processor executes the computer-executable instructions, the method for searching for points of interest along a route in the navigation map as described in the first aspect is implemented.

[0018] According to a fifth aspect of the present disclosure, there is provided a computer program product, including a computer program, and when the computer program is executed by a processor, the method for searching for points of interest along a route in the navigation map as described in the first aspect is implemented.

[0019] The method, apparatus and server for searching for points of interest (POIs) along a route in a navigation map provided by the present disclosure include: obtaining the current planned route of the vehicle according to the search instruction sent by the map application, where the planned route includes multiple original roads; for each original road, determining the detour roads accessible from the original road according to the topological relationship between the roads in the navigation map, and selecting the detour roads with a detour distance less than a preset threshold from the detour roads as target detour roads; obtaining the target POIs that are the same as the POIs to be searched in the search instruction from the target detour roads and the POIs attached to the original roads, and feeding back the target POIs to the map application. In the method, apparatus and server for searching for POIs along a route in the navigation map provided by this solution, all roads within the set detour distance threshold can be found according to the topological relationship between the roads, and then the POI results can be searched through the association relationship between the POIs and the roads. The POI results searched using this solution are accessible POIs within the detour distance threshold, improving the search effect. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure or the prior art, the following will briefly introduce the drawings required for use in the description of the embodiments or the prior art. Obviously, the following drawings are only some embodiments of the present disclosure. For those skilled in the art, without creative efforts, other drawings can also be obtained based on these drawings.

[0021] Figure 1 It is a schematic flowchart of the method for searching for points of interest along a route in a navigation map shown in an exemplary embodiment of the present disclosure;

[0022] Figure 2 It is a schematic diagram of the detour distance shown in an exemplary embodiment of the present disclosure;

[0023] Figure 3 It is a schematic flowchart of the method for searching for points of interest along a route in a navigation map shown in another exemplary embodiment of the present disclosure;

[0024] Figure 4 It is a schematic diagram of forward pathfinding shown in an exemplary embodiment of the present disclosure;

[0025] Figure 5 It is a schematic diagram of reverse pathfinding shown in an exemplary embodiment of the present disclosure;

[0026] Figure 6 It is a schematic diagram of valid roads shown in an exemplary embodiment of the present disclosure;

[0027] Figure 7 It is a structural diagram of the apparatus for searching for points of interest along a route in a navigation map shown in an exemplary embodiment of the present disclosure;

[0028] Figure 8 The structural diagram of the server shown in an exemplary embodiment of the present disclosure. Detailed implementation manners

[0029] Using a navigation map to search for Points of Interest (POIs) distributed on both sides of the road along a route, such as gas stations, service areas, public toilets, 4S stores, etc., provides better and more considerate search services for users' travel and has a positive effect on improving the service experience. The general usage scenario is that when the user has planned a driving route and needs to find some POIs along the way, for example, when the car's fuel is running low or there is a need for car maintenance, and hopes to reach the corresponding POI with the least detour cost.

[0030] The current main methods for implementing POI search along a route include three types:

[0031] (1) Search within the circumscribed rectangle range of the road shape. The advantage of this method is that the implementation logic is simple and easy to implement. However, due to the irregular shape of the road, the spatial search range is too large, and a large number of POIs that do not belong to both sides of the road will also be searched.

[0032] (2) Peripheral search based on the thinning points of the road shape. Compared with the circumscribed rectangle range search, its search range is reduced. However, due to the thinning of the road shape points, it is inevitable that some POIs will be missed and not searched.

[0033] (3) Buffer on both sides with the road route as the benchmark, which is equivalent to the optimization of the first method. This method has a simple logic and can also search for POIs along the road without omission. Therefore, this method is also a relatively mainstream implementation method at present.

[0034] However, regardless of which of the above methods, their core idea is to perform POI search along the route within the formed spatial range through the method of spatial buffering. This method of POI search along the route based on spatial buffering, since it is a search within the spatial range around the road, does not consider the accessibility from the current position of the vehicle to the POI. The searched POIs may be very close in spatial distance, but actually require a relatively long detour, or there may be no access between the actual vehicle and the searched POI. Based on this, the POIs searched by the existing search methods still have problems such as long detour distance or inaccessibility, resulting in relatively poor search effects.

[0035] To solve the above technical problems, in the solution provided by the present disclosure, all roads within a set detour distance threshold can be found based on the topological relationship between roads, and POI results can be searched through the association relationship between POIs and roads. The POI results searched using this solution are accessible POIs within the detour distance threshold, improving the search effect.

[0036] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data for analysis, stored data, displayed data, etc.) involved in the present disclosure are all information and data authorized by the user or fully authorized by all parties. Moreover, the collection, use, and processing of relevant data need to comply with the relevant laws, regulations, and standards of relevant countries and regions, and corresponding operation entrances are provided for users to choose to authorize or refuse.

[0037] The following uses specific embodiments to elaborate in detail on the technical solution of the present disclosure and how the technical solution of the present disclosure solves the above technical problems. These several specific embodiments below can be combined with each other, and concepts or processes that are the same or similar may not be repeated in some embodiments. The embodiments of the present disclosure will be described below with reference to the accompanying drawings.

[0038] Figure 1 It is a schematic flowchart of a method for searching for points of interest along a route in a navigation map shown in an exemplary embodiment of the present disclosure.

[0039] As Figure 1 shown, the method for searching for points of interest along a route in the navigation map provided in this embodiment includes:

[0040] Step 101, according to the search instruction sent by the obtained map application, obtain the current planned route of the vehicle, where the planned route includes multiple original roads.

[0041] Among them, the execution subject of the method provided by the present disclosure can be a server.

[0042] The server can obtain the search instruction sent by the map application and, according to the search instruction, obtain the current planned route of the vehicle.

[0043] Among them, the map application can be set in the in-vehicle system of the vehicle or on the mobile phone side.

[0044] Among them, the planned route refers to the route pre-planned in the navigation map according to the user's needs. This navigation map can be, for example, Amap.

[0045] Among them, the planned route can include multiple original roads. The original road can be the smallest unit link of the road in the navigation map.

[0046] Step 102: For each original road, based on the topological relationship between roads in the navigation map, determine the detour roads accessible from the original road, and select the detour roads with a detour distance less than a preset threshold from the detour roads as the target detour roads.

[0047] Among them, the preset threshold is a value set in advance according to the actual situation.

[0048] Among them, after the vehicle travels along the planned route and detours a certain distance from the planned route and then returns to the planned route to travel, the distance of this detour from the planned route is called the detour distance from the original road. The road traveled during this detour distance can be called the detour road. As Figure 2 shown, 1, 2, 3, a, b, c respectively refer to Road 1, Road 2, Road 3, Road a, Road b, Road c. The direction of the arrow can indicate the driving direction of the vehicle. The planned route can include Road 1, Road 2, and Road 3. The detour roads can include Road a, Road b, and Road c. For example, there is a POI attached to Road b, Figure 3 and the position of P in it refers to the position of this POI.

[0049] Specifically, the detour roads accessible from the original road can be determined according to the topological relationship between roads in the navigation map. Then, according to the length of the detour roads in the navigation map, the detour distance between the detour roads and the original road can be determined. If the detour distance of the detour road is less than the preset threshold, then this detour road can be determined as the target detour road.

[0050] Step 103: Obtain the target points of interest that are the same as the points of interest to be searched in the search instruction from the target detour roads and the points of interest attached to the original road, and feedback the target points of interest to the map application.

[0051] Among them, the types of points of interest can be, for example, gas stations, service areas, public toilets, 4S stores, etc.

[0052] Specifically, if the point of interest to be searched in the search instruction is a gas station, then the target gas stations attached to the target detour roads and the target gas stations attached to the original road can be determined in the navigation map.

[0053] The target gas stations attached to the searched target detour roads and the target gas stations attached to the original road can be combined into a gas station list and fed back to the map application for the map application to display and for the user to select.

[0054] The method for searching for points of interest (POIs) along a route in a navigation map provided by the present disclosure includes: obtaining the current planned route of the vehicle according to the search instruction sent by the obtained map application, where the planned route includes multiple original roads; for each original road, determining the detour roads accessible from the original road according to the topological relationship between roads in the navigation map, and selecting, from the detour roads, the detour roads with a detour distance less than a preset threshold as target detour roads; obtaining, from the target detour roads and the POIs connected to the original roads, the target POIs that are the same as the POIs to be searched in the search instruction, and feeding back the target POIs to the map application. In the method, device, and server for searching for POIs along a route in the navigation map provided by this solution, all roads within the set detour distance threshold can be found according to the topological relationship between roads, and POI results can be searched through the association relationship between POIs and roads. The POI results searched using this solution are accessible POIs within the detour distance threshold range, improving the search effect.

[0055] Figure 3 It is a schematic flowchart of the method for searching for points of interest (POIs) along a route in a navigation map shown in another exemplary embodiment of the present disclosure.

[0056] As Figure 3 shown, the method for searching for points of interest (POIs) along a route in the navigation map provided in this embodiment includes:

[0057] Step 301, obtaining the current planned route of the vehicle according to the search instruction sent by the obtained map application, where the planned route includes multiple original roads.

[0058] Specifically, the principle and implementation manner of step 301 are similar to those of step 101, and will not be elaborated here.

[0059] Step 302, storing the original roads in a first set, and determining, according to the navigation map, the target exit roads with the roads in the first set as the entrance roads; and adding the target exit roads that meet the first preset condition to the first set.

[0060] Among them, the entrance road and the exit road are descriptions of the topological relationship between two roads. As Figure 2 shown, for example, along the driving direction of the vehicle, if road a can reach road b, then road a is called the entrance road of road b, and road b is called the exit road of road a.

[0061] Among them, the first preset condition is a condition set in advance according to the actual situation.

[0062] Specifically, all the original roads included in the planned route can be stored in the first set. Then, according to the navigation map, the target exit roads with the roads in the first set as the entrance roads can be determined, and the target exit roads that meet the first preset condition (for example, the first preset condition can be that the detour distance of the target exit road is less than a preset value) can be added to the first set; until all the roads in the first set have been traversed.

[0063] In an implementable manner, the following steps are repeatedly executed until all the roads in the first set have been traversed.

[0064] According to the navigation map, determine the target exit roads with the roads in the first set as the entrance roads.

[0065] As Figure 4 shown, 1, 2, 3, a, b, c, d, e respectively refer to Road 1, Road 2, Road 3, Road a, Road b, Road c, Road d, Road e. The direction of the arrow can represent the vehicle driving direction. The planned route can include Road 1, Road 2, and Road 3. The detour roads can include Road a, Road b, Road c, Road d, and Road e. Taking Road 1 as an example, the target exit roads with Road 1 as the entrance road include Road a and Road 2.

[0066] Then, the sum of the forward detour distance of the entrance road corresponding to the target exit road and the length of the target exit road is determined as the forward detour distance of the target exit road; wherein, the forward detour distance of the original road is 0.

[0067] Specifically, the forward detour distance of the original road can be set to 0.

[0068] Specifically, the sum of the forward detour distance of the entrance road corresponding to the target exit road and the length of the target exit road can be determined as the forward detour distance of the target exit road. As Figure 4 shown, since Road 2 is the original road, the forward detour distance of Road 2 is 0. Similarly, the forward detour distance of Road 1 is also 0. The forward detour distance of Road a is equal to the forward detour distance of Road 1 plus the length of Road a. Therefore, the forward detour distance of Road a is the length of Road a.

[0069] Next, if it is determined that the forward detour distance of the target exit road is less than the preset threshold, the target exit road is added to the first set.

[0070] Specifically, if it is determined that the forward detour distance of the target exit road is less than the preset threshold, the target exit road can be added to the first set.

[0071] For example, as Figure 4Among them, the forward detour distance of road a is the length of road a. If it is determined that the length of road a is less than the preset threshold, road a can be added to the first set.

[0072] For example, as Figure 4 shown, among them, the target exit roads with road a as the entrance road include road b and road d. Then the forward detour distance of road b is the length of road a plus the length of road b. If it is determined that the forward detour distance of road b is less than the preset threshold, road b can be added to the first set. The forward detour distance of road d is the length of road a plus the length of road d. If it is determined that the forward detour distance of road d is less than the preset threshold, road d can be added to the first set.

[0073] For example, as Figure 4 shown, among them, the target exit road with road d as the entrance road includes road e. Then the forward detour distance of road e is the length of road a plus the length of road d plus the length of road e. If it is determined that the forward detour distance of road e is greater than or equal to the preset threshold, road e is not added to the first set.

[0074] Specifically, according to the above calculation method, as Figure 4 shown, after traversing, the first set may include road 1, road 2, road 3, road a, road b, road c, road d.

[0075] Step 303, store the original roads in the second set, and determine the target entrance roads with the roads in the second set as the exit roads according to the navigation map; and add the target entrance roads that meet the second preset condition to the second set.

[0076] Among them, the entrance road and the exit road are descriptions of the topological relationship between two roads. As Figure 2 shown, for example, along the driving direction of the vehicle, road a can reach road b, then road a is called the entrance road of road b, and road b is called the exit road of road a.

[0077] Among them, the second preset condition is a condition set in advance according to the actual situation.

[0078] Specifically, all the original roads included in the planned route can be stored in the second set. Then, according to the navigation map, the target entrance roads with the roads in the second set as the exit roads can be determined, and the target entrance roads that meet the second preset condition (for example, the second preset condition can be that the detour distance of the target entrance road is less than the preset value) can be added to the second set; until the roads in the second set are traversed.

[0079] In an implementable manner, the following steps are repeatedly executed until the roads in the second set are traversed.

[0080] Determine the target entrance road with the road in the second set as the exit road according to the navigation map.

[0081] As Figure 5 shown, 1, 2, 3, a, b, c, d, e respectively refer to Road 1, Road 2, Road 3, Road a, Road b, Road c, Road d, Road e. The direction of the arrow can indicate the vehicle driving direction. The planned route can include Road 1, Road 2, and Road 3. The detour roads can include Road a, Road b, Road c, Road d, and Road e. Taking Road 3 as an example, the target entrance roads with Road 3 as the exit road include Road c, Road e, and Road 2.

[0082] Then, determine the reverse detour distance of the target entrance road as the sum of the reverse detour distance of the exit road corresponding to the target entrance road and the length of the target entrance road; wherein, the reverse detour distance of the original road is 0.

[0083] Specifically, the reverse detour distance of the original road can be set to 0.

[0084] Specifically, the reverse detour distance of the target entrance road can be determined as the sum of the reverse detour distance of the exit road corresponding to the target entrance road and the length of the target entrance road. As Figure 5 shown, since Road 3 is the original road, the reverse detour distance of Road 3 is 0. The reverse detour distance of Road c is equal to the reverse detour distance of Road 3 plus the length of Road c. Therefore, the reverse detour distance of Road c is the length of Road c.

[0085] Next, if it is determined that the reverse detour distance of the target entrance road is less than the preset threshold, add the target entrance road to the second set.

[0086] Specifically, if it is determined that the reverse detour distance of the target entrance road is less than the preset threshold, the target entrance road can be added to the second set.

[0087] For example, as Figure 5 shown, the reverse detour distance of Road c is the length of Road c. If it is determined that the length of Road c is less than the preset threshold, Road c can be added to the second set.

[0088] For example, as Figure 5 shown, the target entrance roads with Road c as the exit road include Road b. Then the reverse detour distance of Road b is the length of Road c plus the length of Road b. If it is determined that the reverse detour distance of Road b is less than the preset threshold, Road b can be added to the second set.

[0089] For example, as Figure 5Among them, the target entrance roads with Road 3 as the exit road include Road c, Road e, and Road 2. Then the reverse detour distance of Road e is the length of Road e. If it is determined that the reverse detour distance of Road e is less than the preset threshold, Road e can be added to the second set.

[0090] The target entrance roads with Road e as the exit road include Road d. Then the reverse detour distance of Road d is the length of Road e plus the length of Road d. If it is determined that the reverse detour distance of Road d is greater than or equal to the preset threshold, Road d is not added to the second set.

[0091] Specifically, according to the above calculation method, as Figure 5 Among them, after traversal, the second set may include Road 1, Road 2, Road 3, Road a, Road b, Road c, and Road e.

[0092] Step 304, determine the intersection of the first set and the second set as the target set; the target set includes the original road and the detour road; if it is determined that the detour road meets the third preset condition, the detour road is determined as the target detour road.

[0093] Among them, the third preset condition is a condition set in advance according to the actual situation.

[0094] Specifically, the intersection of the first set and the second set can be obtained and the intersection is determined as the target set. The target set includes the original road and the detour road. If it is determined that the detour road meets the third preset condition (for example, the third preset condition can be that the detour distance of the detour road is less than the preset value), the detour road can be determined as the target detour road.

[0095] In a realizable manner, determine the distance sum of the forward detour distance and the reverse detour distance of the detour road; and determine the difference between the distance sum and the length of the detour road as the total detour distance of the detour road.

[0096] Specifically, the forward detour distance and the reverse detour distance of the detour road in the target set can be determined first, and the distance sum of the forward detour distance and the reverse detour distance is determined. Then, the difference between the distance sum and the length of the detour road can be determined as the total detour distance of the detour road.

[0097] For example, as Figure 6As shown, 1, 2, 3, a, b, c, d, e refer to road 1, road 2, road 3, road a, road b, road c, road d, and road e, respectively. The direction of the arrow may indicate the direction of vehicle travel. The planned route may include road 1, road 2, and road 3. The detour road may include road a, road b, road c, road d, and road e. For example, the first set may include road 1, road 2, road 3, road a, road b, road c, and road d. The second set may include road 1, road 2, road 3, road a, road b, road c, and road e. Then, the target set may include road 1, road 2, road 3, road a, road b, and road c.

[0098] The total detour of road a is the length of road a plus the length of road b plus the length of road c. The total detour of road b is the length of road a plus the length of road b plus the length of road c. The total detour of road c is the length of road a plus the length of road b plus the length of road c.

[0099] Next, if it is determined that the total detour distance of the detour road is less than a preset threshold, the detour road is determined as a target detour road.

[0100] Specifically, if it is determined that the total detour distance of the detour roads in the target set is less than a preset threshold, the detour road may be determined as the target detour road.

[0101] For example, Figure 6 As shown in , if it is determined that the length of road a plus the length of road b plus the length of road c is less than a preset threshold, it can be determined that a, b, and c are all target detour roads.

[0102] Specifically, step 302 to step 304 are an implementable manner of step 102 .

[0103] Another possible implementation method of step 102 is, for example, to determine a detour route accessible from the original road based on the original road in the planned route and the topological relationship between the roads in the navigation map, the detour route including at least one detour road. If it is determined that the detour route satisfies the fourth preset condition, the detour road included in the detour route is determined as the target detour road.

[0104] The fourth preset condition may be, for example, that the total number of detour roads included in the detour route is less than a first preset value, and the total length of all detour roads included in the detour route is less than a second preset value. The first preset value may be, for example, 5 detour roads, and the second preset value may be, for example, 5 kilometers.

[0105] Specifically, the total road length of all detour roads included in the detour route to which the target detour road belongs may be determined as the total detour distance of the target detour road.

[0106] Step 305: Obtain a target point of interest that is the same as the point of interest to be searched in the search instruction from the points of interest attached to the target detour road and the original road; determine the total detour distance of the road corresponding to the target point of interest as the detour distance of the target point of interest.

[0107] Specifically, according to the point of interest to be searched in the search instruction, a target point of interest that is the same as the point of interest to be searched in the search instruction can be obtained from the points of interest attached to the target detour road and the original road.

[0108] Then, the total detour distance of the road corresponding to the target point of interest can be determined as the detour distance of the target point of interest. Among them, the total detour distance of the original road can be a preset value. For example, the total detour distance of the original road can be set to 0, then the detour distance of the target point of interest attached to the original road is 0.

[0109] Specifically, the solution provided in this embodiment can find a road with a total detour distance within a preset threshold through the two-way route finding result, and then search for the target point of interest that meets the requirements through the association relationship between the point of interest and the road.

[0110] Step 306: Sort the target points of interest according to the detour distance of the target points of interest, generate a list of points of interest, and feedback the list of points of interest to the map application.

[0111] Specifically, the searched target points of interest can be sorted according to the detour distance of the target points of interest to generate a list of points of interest. Then, the list of points of interest can be fed back to the map application for display and selection by the user.

[0112] Figure 7 It is a structural diagram of a device for searching for points of interest along a route in a navigation map shown in an exemplary embodiment of the present disclosure.

[0113] As Figure 7 shown, the device 700 for searching for points of interest along a route in the navigation map provided by the present disclosure includes:

[0114] An acquisition unit, configured to obtain the current planned route of the vehicle according to the search instruction sent by the acquired map application, where the planned route includes multiple original roads;

[0115] A search unit, configured to, for each original road, determine a detour road accessible from the original road according to the topological relationship between roads in the navigation map, and select a detour road with a detour distance less than a preset threshold from the detour roads as the target detour road;

[0116] A determination unit, configured to obtain a target point of interest that is consistent with the point of interest to be searched in the search instruction from the target detour road and the points of interest connected to the original road, and feed back the target point of interest to the map application.

[0117] A search unit 720, specifically configured to store the original road in a first set, and determine a target exit road with the road in the first set as the entrance road according to the navigation map; and add the target exit road that meets the first preset condition to the first set;

[0118] Store the original road in a second set, and determine a target entrance road with the road in the second set as the exit road according to the navigation map; and add the target entrance road that meets the second preset condition to the second set;

[0119] Determine the intersection of the first set and the second set as the target set; the target set includes the original road and the detour road; if it is determined that the detour road meets the third preset condition, then determine the detour road as the target detour road.

[0120] The search unit 720 is specifically configured to determine a target exit road with the road in the first set as the entrance road according to the navigation map;

[0121] Determine the sum of the forward detour distance of the entrance road corresponding to the target exit road and the length of the target exit road as the forward detour distance of the target exit road;

[0122] If it is determined that the forward detour distance of the target exit road is less than the preset threshold, then add the target exit road to the first set;

[0123] Continue to execute the step of determining a target exit road with the road in the first set as the entrance road according to the navigation map until all the roads in the first set are traversed.

[0124] The search unit 720 is specifically configured to determine a target entrance road with the road in the second set as the exit road according to the navigation map;

[0125] Determine the sum of the reverse detour distance of the exit road corresponding to the target entrance road and the length of the target entrance road as the reverse detour distance of the target entrance road;

[0126] If it is determined that the reverse detour distance of the target entrance road is less than the preset threshold, then add the target entrance road to the second set;

[0127] Continue to execute the step of determining a target exit road with the road in the second set as the entrance road according to the navigation map until all the roads in the second set are traversed.

[0128] The search unit 720 is specifically configured to determine the sum of the forward detour distance and the reverse detour distance of the detour road; and determine the difference between the sum of the distances and the length of the detour road as the total detour distance of the detour road.

[0129] If it is determined that the total detour distance of the detour road is less than the preset threshold, the detour road is determined as the target detour road.

[0130] The determination unit 730 is specifically configured to determine the total detour distance of the road corresponding to the target point of interest as the detour distance of the target point of interest;

[0131] Sort the target points of interest according to the detour distances of the target points of interest, and generate a list of points of interest.

[0132] Figure 8 This is a structural diagram of a server shown in an exemplary embodiment of the present disclosure.

[0133] As Figure 8 shown, the server provided in this embodiment includes:

[0134] A memory 801;

[0135] A processor 802; and

[0136] A computer program;

[0137] Wherein, the computer program is stored in the memory 801 and is configured to be executed by the processor 802 to implement any one of the above methods for searching for points of interest along a route in a navigation map.

[0138] This embodiment also provides a computer-readable storage medium, on which a computer program is stored, and the computer program is executed by a processor to implement any one of the above methods for searching for points of interest along a route in a navigation map.

[0139] This embodiment also provides a computer program product, including a computer program, and when the computer program is executed by a processor, it implements any one of the above methods for searching for points of interest along a route in a navigation map.

[0140] Those of ordinary skill in the art can understand that all or part of the steps of implementing the above method embodiments can be completed by hardware related to program instructions. The foregoing program can be stored in a computer-readable storage medium. When the program is executed, it executes the steps including the above method embodiments; and the foregoing storage medium includes: various media such as ROM, RAM, magnetic disk, or optical disk that can store program codes.

[0141] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, rather than to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those of ordinary skill in the art should understand that they can still modify the technical solutions described in the foregoing embodiments, or perform equivalent replacements on some or all of the technical features; and these modifications or replacements do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for searching for points of interest along a route in a navigation map, characterized in that, Including: Obtain the current planned route of the vehicle according to the search instruction sent by the obtained map application, where the planned route includes multiple original roads; For each original road, determine the detour roads accessible from the original road according to the topological relationship between roads in the navigation map, and select the detour roads with a detour distance less than a preset threshold from the detour roads as the target detour roads; Obtain the target point of interest that is the same as the point of interest to be searched in the search instruction from the target detour roads and the points of interest connected to the original road, and feed back the target point of interest to the map application.

2. The method according to claim 1, characterized in that, The step of, for each original road, determining the detour roads accessible from the original road according to the topological relationship between roads in the navigation map, and selecting the detour roads with a detour distance less than a preset threshold from the detour roads as the target detour roads includes: Store the original road in a first set, and according to the navigation map, determine the target exit roads with the roads in the first set as the entrance roads; and add the target exit roads that meet the first preset condition to the first set; Store the original road in a second set, and according to the navigation map, determine the target entrance roads with the roads in the second set as the exit roads; and add the target entrance roads that meet the second preset condition to the second set; Determine the intersection of the first set and the second set as the target set; the target set includes the original road and the detour roads; if it is determined that the detour road meets the third preset condition, then determine the detour road as the target detour road.

3. The method according to claim 2, wherein The step of, according to the navigation map, determining the target exit roads with the roads in the first set as the entrance roads; And adding the target exit roads that meet the first preset condition to the first set includes: According to the navigation map, determine the target exit roads with the roads in the first set as the entrance roads; Determine the sum of the forward detour distance of the entrance road corresponding to the target exit road and the length of the target exit road as the forward detour distance of the target exit road; If it is determined that the forward detour distance of the target exit road is less than the preset threshold, then add the target exit road to the first set; Continue to execute the step of, according to the navigation map, determining the target exit roads with the roads in the first set as the entrance roads until all the roads in the first set are traversed.

4. The method according to claim 2, wherein, The step of storing the original road in the second set, and according to the navigation map, determining the target entrance roads with the roads in the second set as the exit roads; And adding the target entrance roads that meet the second preset condition to the second set includes: According to the navigation map, determine the target entrance roads with the roads in the second set as the exit roads; Determine the sum of the reverse detour distance of the exit road corresponding to the target entrance road and the length of the target entrance road as the reverse detour distance of the target entrance road; If it is determined that the reverse detour distance of the target entrance road is less than the preset threshold, add the target entrance road to the second set; Continue to execute the step of determining the target exit road with the roads in the second set as the entrance roads according to the navigation map until all the roads in the second set have been traversed.

5. The method according to claim 2, wherein The "if it is determined that the detour road meets the third preset condition, then determine the detour road as the target detour road" includes: Determine the sum of the forward detour distance and the reverse detour distance of the detour road; and determine the difference between the sum of the distances and the length of the detour road as the total detour distance of the detour road; If it is determined that the total detour distance of the detour road is less than the preset threshold, then determine the detour road as the target detour road.

6. The method according to claim 5, characterized in that, The "feedback the target point of interest to the map application" includes: Determine the total detour distance of the road corresponding to the target point of interest as the detour distance of the target point of interest; Sort the target points of interest according to the detour distances of the target points of interest, generate a list of points of interest, and feedback the list of points of interest to the map application.

7. A device for searching for points of interest along a route in a navigation map, characterized in that, including: An acquisition unit, configured to acquire the current planned route of the vehicle according to the search instruction sent by the acquired map application, where the planned route includes a plurality of original roads; A search unit, configured to, for each original road, determine the detour roads accessible to the original road according to the topological relationship between the roads in the navigation map, and select the detour roads with a detour distance less than the preset threshold from the detour roads as the target detour roads; A determination unit, configured to acquire the target point of interest that is the same as the point of interest to be searched in the search instruction from the target detour roads and the points of interest connected to the original roads, and feedback the target point of interest to the map application.

8. A server, characterized in that, including a memory and a processor; wherein, The memory is used to store a computer program; The processor is configured to read the computer program stored in the memory and execute the method according to any one of claims 1-6 above according to the computer program in the memory.

9. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, and when the processor executes the computer-executable instructions, the method according to any one of claims 1-6 above is implemented.

10. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, the method according to any one of claims 1-6 above is implemented.

Images