Scenic spot pushing method and device
By obtaining the adjacent roads of candidate attractions in the taxi scene and matching the travel routes, determining the target attractions and pushing them, the problem of poor tourist attractions in the taxi scene in the existing technology has been solved, and the accuracy and user experience of tourist attractions have been improved.
Patent Information
- Application Number
- CN202510208265.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-02-24
- Publication Date
- 2025-06-13
AI Technical Summary
The existing technology is difficult to effectively push the scenic spot information in taxi scenarios, resulting in poor user experience, low accuracy of pushing scenic spots and inefficient user query.
By receiving the user's order request, a travel route is generated, and a collection of adjacent roads for candidate attractions is obtained in the unfamiliar city market scenario, matching the travel route with the adjacent road, determining the target attractions, and generating push information to send to the user terminal.
It realizes the automatic push of attractions for users in taxi scenarios, improving the accuracy of pushing attractions, user query efficiency and user experience.
Smart Images

Figure CN120147073A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of Internet technologies, and in particular, to a scenic spot pushing method and device. Background Art
[0002] With the development of the tourism industry and the improvement of people's living standards, traveling / business traveling has become a common way of traveling. Different from daily commuting or local shopping and entertainment, users during traveling are often not familiar with the destination environment. In this case, how to effectively obtain relevant information about the passing-by locations becomes the key to enhancing the travel experience.
[0003] To solve the above problems, there are several common ways to help users obtain the required information currently. First, users can query the information of nearby Points of Interest (POIs) by themselves through opening a map software and using the positioning function. Second, some map applications will make special markings on famous scenic spots in the city in the large-scale mode to help users quickly identify them. In addition, in the self-driving scenario, the navigation system can provide a scenic area broadcast function. When the vehicle passes by a specific scenic spot, the system will automatically play relevant introductions so that the driver can notice the important passing-by locations.
[0004] However, manually consulting nearby POIs is inefficient; for the way of making special markings on famous scenic spots in the city in the large-scale mode, the number of special renderings of famous scenic spots on the map is limited, and extended display will lead to information overload, affecting the user experience; while the location-based scenic area broadcast function is limited to the self-driving scenario and fails to cover the needs of taxi passengers. Summary of the Invention
[0005] In view of this, the purpose of the embodiments of the present invention is to provide a scenic spot pushing method and device, which can meet the need of automatically pushing passing-by scenic spots for users in the taxi-taking scenario, and improve the accuracy of pushing scenic spots, the user query efficiency and the user experience.
[0006] In a first aspect, the embodiments of the present invention provide a scenic spot pushing method, and the method includes:
[0007] Receiving an order request of a user, where the order request includes a departure place and a destination;
[0008] Generating a travel route according to the departure place and the destination;
[0009] In a strange city scenario, obtaining an adjacent road set corresponding to each candidate scenic spot, where the adjacent road set includes at least one adjacent road;
[0010] Matching the travel route with each adjacent road in the adjacent road set;
[0011] Determining the candidate scenic spot corresponding to the matched adjacent road as the target scenic spot;
[0012] Generate push information and send it to the user terminal, where the push information includes the travel route and the target scenic spot.
[0013] In some embodiments, the method further includes:
[0014] Obtain the user's historical orders;
[0015] Determine the user's resident city according to the historical orders.
[0016] In some embodiments, the determining the user's resident city according to the historical orders includes:
[0017] Obtain the total number of the user's historical orders;
[0018] In response to the total number of the historical orders being greater than or equal to a first predetermined value, determine the resident city according to the cities where each historical order is located;
[0019] In response to the total number of the historical orders being less than the first predetermined value, determine that the user has no resident city.
[0020] In some embodiments, the determining the resident city according to the cities where each historical order is located includes:
[0021] Obtain the ratio of the user's historical orders in each city to the total number;
[0022] In response to there being a city with a ratio greater than or equal to a second predetermined value, determine the corresponding city as the resident city;
[0023] In response to there being no city with a ratio greater than or equal to the second predetermined value, determine that the user has no resident city.
[0024] In some embodiments, in the scenario of a strange city, obtaining the set of adjacent roads corresponding to each candidate scenic spot includes:
[0025] In response to the user having a resident city and the city where the current order is located not being the resident city, determine the current scenario as a strange city scenario;
[0026] Determine each scenic spot in the strange city as a candidate scenic spot;
[0027] Obtain the set of adjacent roads corresponding to each candidate scenic spot.
[0028] In some embodiments, the method further includes:
[0029] Obtain the coordinate set of the outer contour surface of the scenic spot, where the coordinate set includes the coordinates of multiple position points of the outer contour surface;
[0030] Obtain multiple candidate roads according to the location of the scenic spot;
[0031] Calculate the distances between each candidate road and the outer contour surface;
[0032] Obtain adjacent roads from the candidate roads according to the distances;
[0033] In some embodiments, the calculating the distances between each candidate road and the outer contour surface includes:
[0034] Obtain a set of shape points of the candidate road, where the set of shape points includes the coordinates of each shape point;
[0035] Obtain the distance values between each shape point of the candidate road and each position point of the outer contour surface;
[0036] Determine the nearest distance value from each shape point to the outer contour surface;
[0037] Determine the average value of the nearest distance values of each shape point as the distance between the candidate road and the outer contour surface.
[0038] In some embodiments, the obtaining adjacent roads from the candidate roads according to the distances includes:
[0039] Sort each candidate road according to the distance between the candidate road and the outer contour surface;
[0040] Merge candidate roads with the same road name and the same direction;
[0041] Determine candidate roads with a distance less than or equal to a third predetermined value as the adjacent roads.
[0042] In some embodiments, the matching the travel route with each adjacent road in the set of adjacent roads includes:
[0043] In response to the adjacent road intersecting with the travel route and / or having a duplicate section, determine that the adjacent road matches the travel route.
[0044] In a second aspect, an embodiment of the present invention provides a scenic spot push method, and the method includes:
[0045] Send an order request to the server, where the order request includes a departure place and a destination;
[0046] Receive push information sent by the server, where the push information includes the travel route and the target scenic spot, and the target scenic spot is obtained by the server according to the matching of each adjacent road in the set of adjacent roads between the travel route and the candidate scenic spots;
[0047] Display the travel route and the target scenic spot.
[0048] In some embodiments, the method further includes:
[0049] In response to obtaining a trigger instruction from the user for a target scenic spot, highlighting the outer contour surface of the target scenic spot and displaying the scenic spot information of the target scenic spot.
[0050] In a third aspect, an embodiment of the present invention provides a scenic spot push device, the device includes:
[0051] A request receiving unit, configured to receive an order request from a user, the order request including a departure place and a destination;
[0052] A route generation unit, configured to generate a travel route according to the departure place and the destination;
[0053] An adjacent road obtaining unit, configured to obtain a set of adjacent roads corresponding to each candidate scenic spot in an unfamiliar city scenario, the set of adjacent roads including at least one adjacent road;
[0054] A matching unit, configured to match the travel route with each adjacent road in the set of adjacent roads;
[0055] A target scenic spot determination unit, configured to determine the candidate scenic spot corresponding to the matched adjacent road as the target scenic spot;
[0056] An information sending unit, configured to generate a push message and send it to a user terminal, the push message including the travel route and the target scenic spot.
[0057] In a fourth aspect, an embodiment of the present invention provides a scenic spot push device, the device includes:
[0058] A request sending unit, configured to send an order request to a server, the order request including a departure place and a destination;
[0059] An information receiving unit, configured to receive a push message sent by the server, the push message including the travel route and the target scenic spot, the target scenic spot being obtained by the server according to the matching of the travel route with each adjacent road in the set of adjacent roads of the candidate scenic spots;
[0060] A display unit, configured to display the travel route and the target scenic spot.
[0061] In a fifth aspect, an embodiment of the present invention provides an electronic device, including a memory and a processor, the memory being configured to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the methods described in the first aspect and the second aspect.
[0062] Sixth aspect, an embodiment of the present invention provides a computer program product, which includes a computer program. When the computer program runs on a computer, the computer executes the methods described in the first aspect and the second aspect above.
[0063] Seventh aspect, an embodiment of the present invention provides a computer-readable storage medium, on which computer program instructions are stored. When the computer program instructions are executed by a processor, the methods described in the first aspect and the second aspect are implemented.
[0064] The technical solution of the embodiment of the present invention receives a user's order request, generates a travel route according to the departure place and destination in the order request, in the scenario of an unfamiliar city, obtains the set of adjacent roads corresponding to each candidate scenic spot, matches the travel route with each adjacent road in the set of adjacent roads, determines the candidate scenic spot corresponding to the matched adjacent road as the target scenic spot, generates a push message including the travel route and the target scenic spot, and sends it to the user terminal. Thereby, it can meet the requirement of automatically pushing the scenic spots passed by for the user in the taxi-taking scenario, and improve the accuracy of pushing scenic spots, the user query efficiency, and the user experience. BRIEF DESCRIPTION OF THE DRAWINGS
[0065] Through the following description of the embodiments of the present invention with reference to the drawings, the above and other objects, features, and advantages of the present invention will become clearer. In the drawings:
[0066] Figure 1 is a schematic diagram of the information push system according to the embodiment of the present invention;
[0067] Figure 2 is a flowchart of determining the resident city according to the embodiment of the present invention;
[0068] Figure 3 is a flowchart of determining the city scenic spots according to the embodiment of the present invention;
[0069] Figure 4 is a flowchart of the information interaction method according to the embodiment of the present invention;
[0070] Figure 5 is a schematic diagram of the travel interface according to an embodiment of the present invention;
[0071] Figure 6 is a schematic diagram of the travel interface according to another embodiment of the present invention;
[0072] Figure 7 is a flowchart of the scenic spot push method of the server according to the embodiment of the present invention;
[0073] Figure 8 is a flowchart of the scenic spot push method of the user terminal according to the embodiment of the present invention;
[0074] Figure 9 It is a schematic diagram of the scenic spot push device of the server according to an embodiment of the present invention;
[0075] Figure 10 It is a schematic diagram of the scenic spot push device of the user terminal according to an embodiment of the present invention;
[0076] Figure 11 It is a schematic diagram of the electronic device according to an embodiment of the present invention. Detailed implementation manners
[0077] The following describes the present application based on embodiments, but the present application is not limited to these embodiments. In the following detailed description of the present application, some specific details are described in detail. Those skilled in the art can fully understand the present application without the description of these details. In order to avoid obscuring the essence of the present application, well-known methods, processes, procedures, elements, and circuits are not described in detail.
[0078] In addition, those of ordinary skill in the art should understand that the drawings provided herein are for illustrative purposes only, and the drawings are not necessarily drawn to scale.
[0079] Unless the context clearly requires otherwise, words such as "including" and "comprising" in the entire application document should be interpreted as having an inclusive meaning rather than an exclusive or exhaustive meaning; that is, it is the meaning of "including but not limited to".
[0080] In the description of the present application, it should be understood that terms such as "first" and "second" are only used for descriptive purposes and cannot be construed as indicating or implying relative importance. In addition, in the description of the present application, unless otherwise stated, the meaning of "a plurality" is two or more.
[0081] For the solutions described in this specification and embodiments, if they involve personal information processing, they will be processed on the premise of having a legal basis (such as obtaining the consent of the personal information subject, or being necessary for performing a contract, etc.), and will only be processed within the specified or agreed scope. If the user refuses to process personal information other than the necessary information required for the basic functions, it will not affect the user's use of the basic functions.
[0082] Figure 1 It is a schematic diagram of the information push system according to an embodiment of the present invention. As Figure 1 shown, the information push system according to an embodiment of the present invention includes a server 1, a network 2, a user terminal 3, and a driver terminal 4. Among them, the user terminal 3 and the driver terminal 4 can be communicatively connected to the server 1 through the network 2.
[0083] Server 1 is a ride-hailing platform. On the one hand, it can implement the basic functions of ride-hailing, such as order management, route planning and navigation, and order settlement. On the other hand, it can implement the push of scenic spots. For example, in an unfamiliar city scenario, it can obtain the scenic spots along the user's travel route and push them to the user.
[0084] Among them, the server 1 can be implemented by an independent server or a server cluster composed of multiple servers.
[0085] The network 2 is the infrastructure connecting the server 1, the user terminal 3, and the driver terminal 4, which ensures the efficient and secure transmission of data. Among them, the network 2 can be any type of wired or wireless network, or a combination of them. In some embodiments, the network 2 can include a wired network, a wireless network, an optical fiber network, a telecommunication network, an intranet, the Internet, a local area network (LAN), a wide area network (WAN), a wireless local area network (WLAN), a metropolitan area network (MAN), a wide area network (WAN), a public switched telephone network (PSTN), a Bluetooth network, a ZigBee network, or a near field communication (NFC) network, etc., or any combination thereof. In some embodiments, the network 2 can include one or more network access points. For example, the network 2 can include wired or wireless network access points, such as base stations and / or network switching nodes, and one or more components of the data processing system can be connected to the network through the access point to exchange data and / or information.
[0086] The user terminal 3 is a terminal device used by passengers, such as a mobile phone, a tablet computer, or other data processing terminals, etc. The user terminal 3 is used to provide an interface for the user to interact with the information push system.
[0087] The driver terminal 4 is a terminal device used by drivers, such as a mobile phone, a tablet computer, an in-vehicle terminal, or other data processing terminals, etc.
[0088] In this embodiment, when the user has a travel need, the travel information, such as the departure place and the destination, etc., is input through the human-computer interaction interface of the user terminal, and an order request is generated and sent to the server. The server generates a travel route based on the departure place and the destination, and determines whether the user's current city is an unfamiliar city. In an unfamiliar city scenario, scenic spots matching the travel information are obtained and pushed to the user.
[0089] Further, before the server performs scenic spot push, it needs to determine whether the user has a permanent city and needs to obtain the scenic spots in each city in advance.
[0090] Figure 2 It is a flowchart for determining the permanent city in an embodiment of the present invention. Figure 2 The method for determining the permanent city shown is executed by the server, and specifically includes the following steps:
[0091] Step S101: Obtain the user's historical orders.
[0092] In this embodiment, when it is necessary to determine whether a certain user has a permanent city, the user's historical orders are obtained. Among them, the user's historical orders can be all the user's historical orders, or the user's historical orders within a predetermined time period. For example, obtain the user's historical orders within the past 1 year. Among them, the historical orders are the orders that have been completed.
[0093] Step S102: Obtain the total number of the user's historical orders.
[0094] In this embodiment, the total number N of the user's historical orders is obtained through statistical analysis.
[0095] Step S103: The total number is greater than or equal to the first predetermined value.
[0096] In this embodiment, if the number of the user's historical orders is not large enough, it will affect the judgment of the permanent city. Therefore, it is judged whether the total number N of the user's historical orders is greater than or equal to the first predetermined value, where the first predetermined value is a pre-set value, such as 50, 80, 100, etc.
[0097] Step S104: Determine that the user does not have a permanent city.
[0098] In this embodiment, if the total number N of the user's historical orders is less than the first predetermined value, it indicates that the user's orders are few, and it is determined that the user does not have a permanent city.
[0099] Step S105: Obtain the ratio of the user's historical orders in each city to the total number.
[0100] In this embodiment, in response to the total number of the historical orders being greater than or equal to the first predetermined value, the permanent city is determined according to the city where each historical order is located. First, obtain the ratio of the user's historical orders in each city to the total number.
[0101] Specifically, calculate the historical order quantities of each city according to city classification. Suppose a user has been to M cities historically, then the obtained set is {city1, count1; city2, count2;... cityM, countM}. Among them, (cityi, counti) indicates that the historical order quantity of cityi is counti, where i = 1, 2,..., M. Among them, the ratio of the historical orders of cityi to the total quantity is counti / N, and N is the total quantity of the historical orders of this user.
[0102] Step S106: There is a city with a ratio greater than or equal to the second predetermined value.
[0103] In this embodiment, detect whether there is a city with a ratio greater than or equal to the second predetermined value, where the second predetermined value is a pre-set value and the second predetermined value is a value greater than 0 and less than 1. For example, the second predetermined value can be 0.4, 0.5, 0.6, etc.
[0104] In response to there being a city with a ratio greater than or equal to the second predetermined value, proceed to step S107.
[0105] In response to there being no city with a ratio greater than or equal to the second predetermined value, proceed to step S104 to determine that the user has no resident city.
[0106] Step S107: Determine the cities with a ratio greater than or equal to the second predetermined value as resident cities.
[0107] In this embodiment, in response to there being a city with a ratio greater than or equal to the second predetermined value, determine the corresponding city as a resident city.
[0108] It should be noted that if a user has multiple cities with a ratio greater than or equal to the second predetermined value, multiple cities can be determined as resident cities, or the city with the highest ratio can be determined as the resident city.
[0109] In the embodiment of the present invention, by obtaining the historical orders of the user, obtaining the total quantity of the historical orders of the user, in response to the total quantity of the historical orders being greater than or equal to the first predetermined value, determining the resident city according to the city where each historical order is located, in response to the total quantity of the historical orders being less than the first predetermined value, determining that the user has no resident city, obtaining the ratio of the historical orders of the user in each city to the total quantity, in response to there being a city with a ratio greater than or equal to the second predetermined value, determining the corresponding city as a resident city, and in response to there being no city with a ratio greater than or equal to the second predetermined value, determining that the user has no resident city. Thus, it is possible to accurately determine whether the user has a resident city, and further improve the accuracy of scenic spot push in the unfamiliar city scenario.
[0110] Figure 3 It is a flowchart for determining urban scenic spots in an embodiment of the present invention. Figure 3 The method for determining urban scenic spots shown is executed by a server, and specifically includes the following steps:
[0111] Step S201, obtain the coordinate set of the outer contour surface of the scenic spot.
[0112] In this embodiment, for each city, analysis is performed separately to obtain the scenic spots of each city. For a certain city, obtain the scenic spots of this city. These scenic spots can be famous POIs (Points of Interest), for example, famous scenic areas, famous bridges, famous water systems, etc. Among them, famous scenic areas can be scenic areas above 5A level, famous bridges can be bridges with bridge names in the local area, and famous water systems can be water systems above level 3. At the same time, collect the scenic spot information of each scenic spot, such as POI name, POI range, POI entrance and exit, POI description, etc. Among them, the POI name is the official name of this POI. The POI range is the coordinate points that make up the complete range of this POI. The POI entrance and exit is for scenic area types, and stores the complete information of its entrances and exits, including the entrance and exit names (such as the north gate, south gate), entrance and exit coordinates, etc. The POI description is to obtain the description and introduction about this POI. The graphic and text information of the POI description that can be publicly available after being integrated into structured data by a large model and manually reviewed can be obtained.
[0113] When processing a certain scenic spot, first obtain the coordinate set of the outer contour surface of this scenic spot. The coordinate set includes the coordinates of multiple position points on the outer contour surface. Among them, the coordinate set C of the outer contour surface can be denoted as {cp1, cp2,..., cpk}, where cpi represents the coordinate of the i-th position point. i = 1, 2,..., k. k is the total number of position points on the outer contour surface of the scenic spot.
[0114] Step S202, obtain multiple candidate roads according to the location of the scenic spot.
[0115] In this embodiment, multiple candidate roads corresponding to this scenic spot are obtained according to the location of the scenic spot.
[0116] Specifically, determine the city where it is located according to the POI coordinates, match the corresponding road location information of this city, screen out public vehicle roads (not internal roads in the area, not pedestrian roads), calculate the roads whose starting point and / or ending point is less than a predetermined distance from the POI coordinates as candidate roads, and generate a candidate road set R. R is denoted as {r1, r2,..., rm}. Among them, ri represents the i-th candidate road. i = 1, 2,..., m. m is the total number of candidate roads obtained for this scenic spot. Among them, the predetermined distance is a pre-set value, for example, 5 km, 8 km, etc.
[0117] It should be noted that the calculation of the distance between the starting point and / or the ending point of the road and the POI coordinates can be implemented in any way. For example, the POI coordinates are the coordinates of the center position of the POI. At this time, the distance between the starting point and / or the ending point of the road and the POI coordinates is: the distance between the starting point and / or the ending point of the road and the center position of the POI. Another example is that the POI coordinates are the coordinate set of the outer contour surface of the POI. At this time, the calculation method of the distance between the starting point and / or the ending point of the road and the POI coordinates is: calculate the distance between the starting point and / or the ending point of the road and each position point in the coordinate set, and take the minimum distance as the distance between the road and the POI.
[0118] Step S203, obtain the set of shape points of the candidate road.
[0119] In this embodiment, for each candidate road, determine the set of shape points rp of the candidate road. The set of shape points rp is denoted as {coor1, coor2,..., coorn}. Where coori represents the i-th shape point of the candidate road, and i = 1, 2,..., n. n is the number of obtained shape points.
[0120] Step S204, obtain the distance values between each shape point of the candidate road and each position point of the outer contour surface.
[0121] In this embodiment, obtain the first coordinates of each shape point of the candidate road, and obtain the second coordinates of each position point of the outer contour surface. Calculate the distance values between each shape point of each candidate road and each position point of the outer contour surface according to the first coordinates and the second coordinates.
[0122] In some embodiments, the first coordinates and the second coordinates are longitude lng and latitude lat. For the i-th shape point, the first coordinates are denoted as (lngi, lati), where i = 1, 2,..., n and n is the number of obtained shape points; for the j-th position point, the second coordinates are denoted as (lngj, latj), where j = 1, 2,..., k and k is the number of obtained position points. Then the distance between the i-th shape point and the j-th position point is:
[0123]
[0124] where L i,j represents the distance between the i-th shape point and the j-th position point.
[0125] Step S205, determine the distance value that is the closest to the outer contour surface for each shape point.
[0126] In this embodiment, for each shape point, the position point closest to the shape point is obtained as the closest position point, and the distance value between each shape point and its corresponding closest position point is calculated.
[0127] Step S206: Determine the average value of the closest distance values of each shape point as the distance between the candidate road and the outer contour surface.
[0128] In this embodiment, after obtaining the closest distance value of each shape point, the average value of the closest distance values of each shape point is determined as the distance between the candidate road and the outer contour surface.
[0129] Step S207: Sort each candidate road according to the distance between the candidate road and the outer contour surface.
[0130] In this embodiment, after obtaining the distance between each candidate road and the outer contour surface, according to the distance pair, for each candidate road in the candidate road set R, the candidate roads are sorted in ascending order from small to large according to the distance from the outer contour surface.
[0131] Step S208: Merge the candidate roads with the same road name and the same direction.
[0132] In this embodiment, the candidate roads with the same road name and the same direction in the candidate road set are merged.
[0133] In some embodiments, when merging, for multiple candidate roads with the same road name and the same direction, after merging the roads into a new road, the closest distance among the multiple candidate roads can be selected as the distance of the new road, or the average distance of the multiple candidate roads can be used as the distance of the new road. At the same time, the candidate roads are re-sorted according to the distance of the new road.
[0134] Step S209: Determine the candidate roads with a distance less than or equal to the third predetermined value as the adjacent roads.
[0135] In this embodiment, the third predetermined value is a pre-set value, such as 30 meters, 50 meters, 100 meters, etc.
[0136] In an embodiment of the present invention, by obtaining a coordinate set of the outer contour surface of a scenic spot, obtaining a plurality of candidate roads according to the location of the scenic spot, obtaining a set of shape points of the candidate roads, obtaining distance values between each shape point of the candidate roads and each position point of the outer contour surface, determining the closest distance value of each shape point to the outer contour surface, determining the average value of the closest distance values of each shape point as the distance between the candidate road and the outer contour surface, sorting each candidate road according to the distance between the candidate road and the outer contour surface, merging candidate roads with the same road name and the same direction, and determining candidate roads with a distance less than or equal to a third predetermined value as the adjacent roads. Thus, an adjacent road set of each scenic spot can be obtained, providing data support for subsequent scenic spot matching and improving the accuracy of scenic spot push.
[0137] Figure 4 It is a flowchart of the information interaction method according to an embodiment of the present invention. Figure 2 It shows the information interaction and data processing flow between the server and the user terminal, specifically including the following steps:
[0138] Step S301: Display a taxi-hailing interface.
[0139] In this embodiment, the user terminal displays a taxi-hailing interface, and the taxi-hailing interface is an interface provided for the user to input travel information, and the travel information includes information such as the departure place and the destination.
[0140] Step S302: Obtain travel information.
[0141] In this embodiment, the user terminal obtains travel information such as the departure place and the destination input by the user through the taxi-hailing interface.
[0142] Step S303: Send an order request.
[0143] In this embodiment, the user terminal sends an order request to the server, and the order request includes travel information, and the travel information includes information such as the departure place and the destination.
[0144] Step S304: Generate a travel route.
[0145] In this embodiment, the server generates a travel route according to the departure place and the destination. Specifically, the server formulates at least one travel route from the departure place to the destination according to a pre-configured path planning algorithm.
[0146] Step S305: Determine whether there is a resident city.
[0147] In this embodiment, after obtaining the travel route, the server determines whether the current user has a resident city.
[0148] Specifically, the server obtains the user's historical orders, obtains the total number of the user's historical orders, and in response to the total number of the historical orders being greater than or equal to a first predetermined value, determines the resident city according to the city where each historical order is located. In response to the total number of the historical orders being less than the first predetermined value, it is determined that the user has no resident city. The server obtains the ratio of the historical orders of the user in each city to the total number. In response to there being a city where the ratio is greater than or equal to a second predetermined value, the corresponding city is determined as the resident city. In response to there being no city where the ratio is greater than or equal to the second predetermined value, it is determined that the user has no resident city. At the same time, the server stores the resident city identification results of each user in the database. When a travel route is obtained, the server obtains the resident city identification result of the current user from the database according to the user identifier, and determines whether the current user has a resident city according to the failure result.
[0149] In response to the current user having no resident city, steps S306 - S307 are executed.
[0150] In response to the current user having a resident city, step S308 is executed.
[0151] Step S306: Send the travel route.
[0152] In this embodiment, in response to the current user having no resident city, it indicates that it is impossible to accurately determine whether the user is in an unfamiliar city scenario, and no scenic spots are pushed to the user. Therefore, it is only necessary to send the travel route to the user.
[0153] Step S307: Display the travel interface.
[0154] In this embodiment, after the user terminal receives the travel route sent by the server, it displays the travel interface and shows the travel route to the user through the travel interface.
[0155] Step S308: Determine whether the current city is an unfamiliar city.
[0156] In this embodiment, in response to the current user having a resident city, the server determines whether the current city is an unfamiliar city.
[0157] Specifically, in response to the current user having a resident city, the resident city of the user is obtained. At the same time, the server determines the current city where the user is located according to the user's travel information, and detects whether the current city where the user is located is the resident city.
[0158] If the current city is the resident city, then the current city is not an unfamiliar city, and steps S309 - S310 are entered.
[0159] If the current city is not the resident city, then the current city is an unfamiliar city, and step S311 is entered.
[0160] It should be noted that in the embodiments of the present invention, the example of first determining whether the user has a resident city and then determining whether the current city is an unfamiliar city is used for illustration. However, the embodiments of the present invention do not limit the order of these two determination steps. It is also possible to first determine whether the current city is an unfamiliar city. If it is an unfamiliar city, then determine whether the user has a resident city.
[0161] Step S309: Send the travel route.
[0162] In this embodiment, if the current city is not an unfamiliar city, it means it is not an unfamiliar city scenario, and no scenic spots are pushed to the user. Therefore, it is only necessary to send the travel route to the user.
[0163] Step S310: Display the travel interface.
[0164] In this embodiment, after the user terminal receives the travel route sent by the server, it displays the travel interface and shows the travel route to the user through the travel interface.
[0165] Step S311: Obtain candidate scenic spots.
[0166] In this embodiment, if the current city is an unfamiliar city, it means it is an unfamiliar city scenario, and the scenic spots in the current city where the user is located are obtained as candidate scenic spots.
[0167] Step S312: Obtain the adjacent road set.
[0168] In this embodiment, the server pre-obtains the coordinate set of the outer contour surface of the scenic spot, obtains multiple candidate roads according to the location of the scenic spot, obtains the set of shape points of the candidate roads, obtains the distance values between each shape point of the candidate road and each position point of the outer contour surface, determines the closest distance value of each shape point to the outer contour surface, determines the average value of the closest distance values of each shape point as the distance between the candidate road and the outer contour surface, sorts each candidate road according to the distance between the candidate road and the outer contour surface, merges the candidate roads with the same road name and the same direction, and determines the candidate roads with a distance less than or equal to the third predetermined value as the adjacent roads. At the same time, the obtained adjacent road sets corresponding to each scenic spot are stored in the database. After obtaining the candidate scenic spots, the adjacent road sets corresponding to each candidate scenic spot are obtained from the database, and the adjacent road set includes at least one adjacent road.
[0169] Step S313: Determine the target scenic spot.
[0170] In this embodiment, the server matches the travel route with each adjacent road in the adjacent road set and determines the candidate scenic spot corresponding to the matched adjacent road as the target scenic spot.
[0171] In some embodiments, the matching of the travel route with each adjacent road in the set of adjacent roads includes: in response to the adjacent road intersecting with the travel route and / or there being a duplicate section, determining that the adjacent road matches the travel route. That is, if the travel route intersects with an adjacent road and / or there is a duplicate section, the corresponding adjacent road is determined as the matching adjacent road, and the candidate scenic spots corresponding to the matching adjacent road are determined as the target scenic spots.
[0172] Step S314: Send a push message.
[0173] In this embodiment, the server generates a push message and sends it to the user terminal, and the push message includes the travel route and the target scenic spot.
[0174] Furthermore, the push message further includes the scenic spot information of the target scenic spot, and the scenic spot information is the relevant introduction of the target scenic spot, such as the POI name, POI range, POI entrance and exit, POI description, etc. Among them, the POI name is the official name of the POI. The POI range is the coordinate points that constitute the complete range of the POI. The POI entrance and exit is for scenic spot types and stores the complete information of its entrances and exits, including the entrance and exit names (such as the north gate, south gate), entrance and exit coordinates, etc. The POI description is to obtain the description and introduction of the POI, and the graphic and text information of the POI description that can be publicly available after being integrated with structured data by a large model and reviewed by humans can be obtained.
[0175] Step S315: Display a travel interface.
[0176] In this embodiment, the user terminal displays a travel interface according to the push message, and the travel interface includes information such as the travel route and the target scenic spot.
[0177] Figure 5 It is a schematic diagram of a travel interface according to an embodiment of the present invention. In Figure 5 the shown embodiment, the travel interface includes an electronic map area and a route selection area. Among them, the electronic map area is used to display the electronic map, the travel route, and the target scenic spot. In Figure 5 it, the target scenic spots include Scenic Spot A, Scenic Spot B, and Scenic Spot C, and the positions and names of each scenic spot are also shown.
[0178] The route selection area is used to display recommended routes. In Figure 5 it, three routes are shown, and the duration, kilometers, and advantages of each route are also shown for the user to compare and select a suitable route.
[0179] In some embodiments, in response to obtaining a trigger instruction from the user for the target scenic spot, the user terminal highlights the outer contour surface of the target scenic spot and displays the scenic spot information of the target scenic spot.
[0180] Specifically, Figure 6 is a schematic diagram of the travel interface of another embodiment of the present invention. In Figure 6 the illustrated embodiment, the travel interface includes an electronic map area and a scenic spot information display area.
[0181] Among them, when Figure 5 scenic spot A in
[0182] is clicked, the user terminal receives a trigger instruction from the user for scenic spot A, zooms in on the electronic map, and highlights scenic spot A. At the same time, the outer contour surface of scenic spot A is highlighted.
[0183] Furthermore, in the scenic spot information display area, the name of scenic spot A, the distance from the current location, and the location information of scenic spot A are displayed.
[0184] In some embodiments, the travel interface also displays recommended drop-off points for the selected scenic spots, such as the ticket office, South Gate, West Gate, etc. in the figure. The user can click on the recommended drop-off point to change the destination.
[0185] Figure 7 is a flowchart of the scenic spot push method of the server according to an embodiment of the present invention. As Figure 7 shown, the scenic spot push method according to an embodiment of the present invention includes the following steps:
[0186] Step S410: Receive a user's order request, where the order request includes a departure place and a destination.
[0187] Step S420: Generate a travel route according to the departure place and the destination.
[0188] Step S430: In a strange city scenario, obtain an adjacent road set corresponding to each candidate scenic spot, where the adjacent road set includes at least one adjacent road.
[0189] Step S440: Match the travel route with each adjacent road in the adjacent road set.
[0190] Step S450: Determine the candidate scenic spot corresponding to the matched adjacent road as the target scenic spot.
[0191] Step S460: Generate push information and send it to the user terminal. The push information includes the travel route and the target scenic spot.
[0192] In some embodiments, the method further includes:
[0193] Obtain the user's historical orders;
[0194] Determine the user's resident city according to the historical orders.
[0195] In some embodiments, the determining the user's resident city according to the historical orders includes:
[0196] Obtain the total number of the user's historical orders;
[0197] In response to the total number of the historical orders being greater than or equal to a first predetermined value, determine the resident city according to the cities where each historical order is located;
[0198] In response to the total number of the historical orders being less than the first predetermined value, determine that the user has no resident city.
[0199] In some embodiments, the determining the resident city according to the cities where each historical order is located includes:
[0200] Obtain the ratio of the user's historical orders in each city to the total number;
[0201] In response to there being a city where the ratio is greater than or equal to a second predetermined value, determine the corresponding city as the resident city;
[0202] In response to there being no city where the ratio is greater than or equal to the second predetermined value, determine that the user has no resident city.
[0203] In some embodiments, in the scenario of an unfamiliar city, obtaining the set of adjacent roads corresponding to each candidate scenic spot includes:
[0204] In response to the user having a resident city and the city where the current order is located not being the resident city, determine the current scenario as an unfamiliar city scenario;
[0205] Determine each scenic spot in the unfamiliar city as a candidate scenic spot;
[0206] Obtain the set of adjacent roads corresponding to each candidate scenic spot.
[0207] In some embodiments, the method further includes:
[0208] Obtain the coordinate set of the outer contour surface of the scenic spot, where the coordinate set includes the coordinates of multiple position points of the outer contour surface;
[0209] Obtain multiple candidate roads according to the location of the scenic spot;
[0210] Calculate the distances between each candidate road and the outer contour surface;
[0211] Obtain adjacent roads from the candidate roads according to the distances.
[0212] In some embodiments, the calculating the distances between each candidate road and the outer contour surface includes:
[0213] Obtain a set of shape points of the candidate road, where the set of shape points includes the coordinates of each shape point;
[0214] Obtain the distance values between each shape point of the candidate road and each position point of the outer contour surface;
[0215] Determine the minimum distance value between each shape point and the outer contour surface;
[0216] Determine the average value of the minimum distance values of each shape point as the distance between the candidate road and the outer contour surface.
[0217] In some embodiments, the obtaining adjacent roads from the candidate roads according to the distances includes:
[0218] Sort each candidate road according to the distance between the candidate road and the outer contour surface;
[0219] Merge candidate roads with the same road name and the same direction;
[0220] Determine candidate roads with a distance less than or equal to a third predetermined value as the adjacent roads.
[0221] In some embodiments, the matching the travel route with each adjacent road in the set of adjacent roads includes:
[0222] In response to the adjacent road intersecting with the travel route and / or having overlapping sections, determine that the adjacent road matches the travel route.
[0223] In an embodiment of the present invention, by receiving a user's order request, a travel route is generated according to the departure location and destination in the order request. In a strange city scenario, a set of adjacent roads corresponding to each candidate scenic spot is obtained, the travel route is matched with each adjacent road in the set of adjacent roads, the candidate scenic spot corresponding to the matched adjacent road is determined as the target scenic spot, and a push message including the travel route and the target scenic spot is generated and sent to the user terminal. Thereby, the demand for automatically pushing scenic spots passed by for the user in the taxi-taking scenario can be met, and the accuracy of pushing scenic spots, the user query efficiency, and the user experience can be improved.
[0224] Figure 8 It is a flowchart of a method for pushing scenic spots of a user terminal according to an embodiment of the present invention. AsFigure 8 As shown in the figure, the scenic spot push method according to an embodiment of the present invention includes the following steps:
[0225] Step S510: Send an order request to the server, where the order request includes a departure place and a destination.
[0226] Step S520: Receive the push information sent by the server, where the push information includes the travel route and the target scenic spot, and the target scenic spot is obtained by the server according to the matching of each adjacent road in the adjacent road set of the travel route and the candidate scenic spots.
[0227] Step S530: Display the travel route and the target scenic spot.
[0228] In some embodiments, the method further includes:
[0229] In response to obtaining a trigger instruction of the user for the target scenic spot, highlight the outer contour surface of the target scenic spot and display the scenic spot information of the target scenic spot.
[0230] In the embodiment of the present invention, by receiving the order request of the user, generating a travel route according to the departure place and the destination in the order request, in the scenario of an unfamiliar city, obtaining the adjacent road sets corresponding to each candidate scenic spot, matching the travel route with each adjacent road in the adjacent road set, determining the candidate scenic spot corresponding to the matched adjacent road as the target scenic spot, generating push information including the travel route and the target scenic spot and sending it to the user terminal. Thus, the requirement of automatically pushing the scenic spots passed by for the user in the taxi-taking scenario can be met, and the accuracy of pushing scenic spots, the user query efficiency and the user experience can be improved.
[0231] Figure 9 It is a schematic diagram of a scenic spot push device of a server according to an embodiment of the present invention. As Figure 9 shown, the scenic spot push device according to an embodiment of the present invention includes a request receiving unit 91, a route generating unit 92, an adjacent road obtaining unit 93, a matching unit 94, a target scenic spot determining unit 95 and an information sending unit 96. Among them, the request receiving unit 91 is used to receive the order request of the user, and the order request includes a departure place and a destination. The route generating unit 92 is used to generate a travel route according to the departure place and the destination. The adjacent road obtaining unit 93 is used to obtain the adjacent road sets corresponding to each candidate scenic spot in the scenario of an unfamiliar city, and the adjacent road set includes at least one adjacent road. The matching unit 94 is used to match the travel route with each adjacent road in the adjacent road set. The target scenic spot determining unit 95 is used to determine the candidate scenic spot corresponding to the matched adjacent road as the target scenic spot. The information sending unit 96 is used to generate push information and send it to the user terminal, and the push information includes the travel route and the target scenic spot.
[0232] In an embodiment of the present invention, by receiving a user's order request, a travel route is generated based on the departure place and the destination in the order request. In a strange city scenario, a set of adjacent roads corresponding to each candidate scenic spot is obtained, the travel route is matched with each adjacent road in the set of adjacent roads, and the candidate scenic spot corresponding to the matched adjacent road is determined as the target scenic spot. A push message including the travel route and the target scenic spot is generated and sent to the user terminal. Thereby, the requirement of automatically pushing the scenic spots passed by for the user in the taxi-taking scenario can be met, and the accuracy of the pushed scenic spots, the user query efficiency, and the user experience can be improved.
[0233] Figure 10 It is a schematic diagram of the scenic spot push device of the user terminal in an embodiment of the present invention. As Figure 10 shown, the scenic spot push device in an embodiment of the present invention includes a request sending unit 101, an information receiving unit 102, and a display unit 103. Among them, the request sending unit 101 is used to send an order request to the server, and the order request includes a departure place and a destination. The information receiving unit 102 is used to receive the push message sent by the server, and the push message includes the travel route and the target scenic spot, and the target scenic spot is obtained by the server according to the matching of the travel route with each adjacent road in the set of adjacent roads of the candidate scenic spots. The display unit 103 is used to display the travel route and the target scenic spot.
[0234] In an embodiment of the present invention, by receiving a user's order request, a travel route is generated based on the departure place and the destination in the order request. In a strange city scenario, a set of adjacent roads corresponding to each candidate scenic spot is obtained, the travel route is matched with each adjacent road in the set of adjacent roads, and the candidate scenic spot corresponding to the matched adjacent road is determined as the target scenic spot. A push message including the travel route and the target scenic spot is generated and sent to the user terminal. Thereby, the requirement of automatically pushing the scenic spots passed by for the user in the taxi-taking scenario can be met, and the accuracy of the pushed scenic spots, the user query efficiency, and the user experience can be improved.
[0235] Figure 11 It is a schematic diagram of the electronic device in an embodiment of the present invention. As Figure 11 shown, Figure 11The electronic device shown is a general-purpose data processing device, which includes a general computer hardware structure, and at least includes a processor 111 and a memory 112. The processor 111 and the memory 112 are connected by a bus 113. The memory 112 is adapted to store instructions or programs executable by the processor 111. The processor 111 can be an independent microprocessor or a set of one or more microprocessors. Thus, by executing the instructions stored in the memory 112, the processor 111 implements the method flow of the embodiment of the present invention as described above to process data and control other devices. The bus 113 connects the above-mentioned multiple components together and also connects the above-mentioned components to a display controller 114, a display device, and an input / output (I / O) device 115. The input / output (I / O) device 115 can be a mouse, a keyboard, a modem, a network interface, a touch input device, a somatosensory input device, a printer, and other devices well known in the art. Typically, the input / output device 115 is connected to the system through an input / output (I / O) controller 116.
[0236] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a device (equipment), or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can be implemented as a computer program product on one or more computer-readable storage media (including but not limited to disk memories, CD-ROMs, optical memories, etc.) containing computer-usable program codes.
[0237] The present application is described with reference to the flowcharts of methods, devices (equipment), and computer program products according to the embodiments of the present application. It should be understood that each process in the flowchart can be implemented by computer program instructions.
[0238] These computer program instructions can be stored in a computer-readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer-readable memory produce a manufactured article including an instruction device, and the instruction device implements the processes Figure 1 specified functions in one process or multiple processes.
[0239] These computer program instructions can also be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices produce a device for implementing the functions Figure 1 specified in one process or multiple processes.
[0240] Another embodiment of the present invention relates to a non-volatile storage medium for storing a computer-readable program, which is used for a computer to execute the above-mentioned partial or all method embodiments.
[0241] That is, those skilled in the art can understand that all or part of the steps in implementing the above-mentioned embodiment methods can be completed by specifying relevant hardware through a program. This program is stored in a storage medium and includes several instructions for causing a device (which can be a single-chip microcomputer, a chip, etc.) or a processor to execute all or part of the steps of the methods described in the embodiments of the present application. The foregoing storage medium includes: various media that can store program codes, such as USB flash drives, mobile hard disks, read-only memories (ROMs), random access memories (RAMs), magnetic disks, or optical discs.
[0242] The foregoing are only the preferred embodiments of the present application and are not used to limit the present application. For those skilled in the art, various modifications and changes can be made to the present application. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application shall be included within the protection scope of the present application.
Claims
1. A method for pushing scenic spots, characterized in that: The method comprises: Receiving an order request from a user, wherein the order request includes a departure place and a destination; generating a travel route according to the departure place and the destination; In an unfamiliar city scenario, obtaining an adjacent road set corresponding to each candidate scenic spot, wherein the adjacent road set includes at least one adjacent road; Matching the travel route with each adjacent road in the adjacent road set; Determine the candidate scenic spots corresponding to the matched adjacent roads as the target scenic spots; Generate push information and send it to the user terminal, wherein the push information includes the travel route and the target scenic spot.
2. The method according to claim 1, characterized in that The method further comprises: Get the user's historical orders; The user's permanent city is determined based on the historical orders.
3. The method according to claim 2, characterized in that Determining the user's permanent city based on the historical orders includes: Get the total number of historical orders of the user; In response to the total number of the historical orders being greater than or equal to a first predetermined value, determining the resident city according to the cities where the historical orders were placed; In response to the total number of the historical orders being less than a first predetermined value, it is determined that the user does not reside in a permanent city.
4. The method according to claim 3, characterized in that Determining the resident city according to the city where each historical order is located includes: Get the ratio of the user's historical orders in each city to the total number; In response to the existence of cities with a ratio greater than or equal to a second predetermined value, determining the corresponding city as a permanent city; In response to the absence of cities having a ratio greater than or equal to a second predetermined value, it is determined that the user does not reside in the city.
5. The method according to claim 4, characterized in that In the unfamiliar city scenario, obtaining the adjacent road set corresponding to each candidate scenic spot includes: In response to the user having a permanent city, and the city where the current order is located is not the permanent city, determining the current scene as an unfamiliar city scene; determining various attractions in the unfamiliar city as candidate attractions; Get the adjacent road set corresponding to each candidate scenic spot.
6. The method according to claim 1, characterized in that The method further comprises: Acquire a coordinate set of an outer contour surface of a scenic spot, wherein the coordinate set includes coordinates of a plurality of position points of the outer contour surface; Acquire multiple candidate roads according to the location of the scenic spot; Calculating the distance between each candidate road and the outer contour surface; Acquire adjacent roads from the candidate roads according to the distance.
7. The method according to claim 6, characterized in that The calculating the distance between each candidate road and the outer contour surface comprises: Acquire a shape point set of candidate roads, wherein the shape point set includes coordinates of each shape point; Obtaining distance values between each shape point of the candidate road and each position point of the outer contour surface; Determine the closest distance value between each shape point and the outer contour surface; The average value of the nearest distance values of the shape points is determined as the distance between the candidate road and the outer contour surface.
8. The method according to claim 7, characterized in that The acquiring of adjacent roads from the candidate roads according to the distance comprises: Sorting the candidate roads according to the distance between the candidate roads and the outer contour surface; Merge candidate roads with the same name and direction; The candidate roads whose distance is less than or equal to the third predetermined value are determined as the adjacent roads.
9. The method according to claim 1, characterized in that: The matching of the travel route with each adjacent road in the adjacent road set comprises: In response to the neighboring road intersecting with the travel route and / or having repeated road segments, it is determined that the neighboring road matches the travel route.
10. A method for pushing scenic spots, characterized in that: The method comprises: Sending an order request to a server, wherein the order request includes a departure place and a destination; Receiving push information sent by a server, the push information including a travel route and a target attraction, the target attraction being obtained by the server according to matching the travel route with each adjacent road in an adjacent road set of candidate attractions; The travel route and target attractions are displayed.
11. The method according to claim 10, characterized in that The method further comprises: In response to obtaining a trigger instruction of a target scenic spot from a user, an outer contour surface of the target scenic spot is highlighted, and scenic spot information of the target scenic spot is displayed.
12. A scenic spot push device, characterized in that: The device comprises: A request receiving unit, configured to receive an order request from a user, wherein the order request includes a departure place and a destination; A route generating unit, used for generating a travel route according to the departure place and the destination; An adjacent road acquisition unit, used to acquire an adjacent road set corresponding to each candidate scenic spot in an unfamiliar city scene, wherein the adjacent road set includes at least one adjacent road; A matching unit, configured to match the travel route with each adjacent road in the adjacent road set; A target scenic spot determining unit, used to determine the candidate scenic spots corresponding to the matched adjacent roads as the target scenic spots; The information sending unit is used to generate push information and send it to the user terminal, wherein the push information includes the travel route and the target scenic spot.
13. A scenic spot push device, characterized in that: The device comprises: A request sending unit, used to send an order request to a server, wherein the order request includes a departure place and a destination; An information receiving unit, configured to receive push information sent by a server, wherein the push information includes a travel route and a target scenic spot, wherein the target scenic spot is obtained by matching the travel route with each adjacent road in a set of adjacent roads of the candidate scenic spot; The display unit is used to display the travel route and target attractions.
14. An electronic device comprising a memory and a processor, characterized in that: The memory is used to store one or more computer program instructions, wherein the one or more computer program instructions are executed by the processor to implement the method according to any one of claims 1-11.
15. A computer program product, comprising a computer program, characterized in that: When the computer program is executed on a computer, the computer executes the method according to any one of claims 1 to 11.
16. A computer-readable storage medium storing computer program instructions, characterized in that: The computer program instructions implement the method according to any one of claims 1 to 11 when executed by a processor.